# ODL Centralized Control of Power Communication Network Based on Bio-Inspired Algorithms and SDN

Authors: Congcong Min
Journal: Mathematical Problems in Engineering
 (2022)

---

## Abstract

An ODL centralized control strategy is designed to study the problem of heavy load in the power communication network, in which the machine learning method is introduced. SDN technology is used to establish SDN cluster control structure, and different algorithms, such as genetic algorithm, are utilized to optimize resource scheduling. The results show that the improved algorithm obtains the shortest link path through 28 iterations. At the same time, AHP is used to switch the network spectrum. Moreover, the application effect of the control strategy is simulated and analyzed, and its effect on network communication application is verified.


---

## Body

## 1. Related Work

Technologies such as cloud computing and big data continue to develop but, at the same time, begin to penetrate into traditional industries. Among them, the construction and management of power grid began to adopt intelligent new technology, and the construction of smart power grid has become an inevitable trend. However, with the growth of the power communication network business, the network load increases gradually. In addition, the problems of resource waste and low compatibility in the traditional electric power communication system affect the quality of electric power service. Therefore, people propose to introduce SDN into network deployment. Software-defined networking (SDN) is also gaining popularity in power systems [1]. It is a new software-defined network model, which separates control and data forwarding functions, so as to realize centralized operation and maintenance control of power communication network resources. At the same time, its programmable advantage can achieve a wide range of power communication business expansion. Standard southbound interface and virtual network layer can promote the close integration of new power equipment and control network. In a word, it liberates a lot of manpower, avoids many configuration failures, and is easy to deploy uniformly and quickly, so as to make up for the defects of traditional communication network single decentralized control, which has been successfully applied in some data centers and cloud computing networks [2, 3]. Therefore, the centralized management and control architecture of distribution communication network based on SDN is designed, and the realization scheme of various control functions is studied, so as to provide a theoretical basis and demonstration reference for the construction of a new generation of power communication network, in which resources are uniformly controlled, network and data are coscheduled, and business needs are rapidly answered. At present, there are many researches on SDN deployment. For example, in April 2014, Beijing Telecom completed the commercial deployment of SDN in cooperation with Huawei, successfully applied SDN technology to IDC (Internet data center) network, and released a series of new IDC businesses based on SDN [4, 5]. In 2017, the ZENIC SDON innovation scheme of ZTE applied SDN technology to the WDM/OTN network, which can provide BoD, PoD, and OoD services on demand and support rapid deployment of multilevel services including L3/L2/L1/L0.At the same time, aiming at the optimization problem of the power network, some scholars have proposed a large number of artificial intelligence algorithms. For example, Liu applied the genetic algorithm to network QoS optimization and obtained the scheduling sequence with the shortest task span and average task calculation time, which greatly improved the performance of the network [6]; Wang et al. put forward the bandwidth and capacity optimization method of elastic optical networks (eon) based on mixed-integer linear programming model [7]. The results show that this method can not only improve the overall network capacity but also minimize the number of allocated time slots and service request blocking rate; Rongheng Lin and others proposed a bat SDN network scheduling method, which transforms the resource reservation problem into a multiknapsack problem [8]; Liang et al. used ant colony algorithm to schedule network resources. Experiments show that this method can effectively reduce the time of network resource scheduling [9]; Lalitha Devi et al. and Yi et al. proposed a joint beam and power scheduling scheme and solved the scheduling scheme by Bayesian algorithm [10, 11]; Praveena and Vijayarajan proposed that the energy consumption of mobile cloud network through the neural network is the lowest [12]. The results show that through optimization, the power consumption is reduced by 53.68%; Faroqal Tam and others introduced the deep reinforcement learning method to schedule the resources of a 5 g MAC layer wireless network [13]. The results show that this method has a positive impact on network resource scheduling. Aiming at the resource control problem in the SDN network, this study proposes a centralized control scheme based on ODL, so as to better promote the scheduling and effective utilization of SDN network resources. The innovation of this research is that combined with the ODL centralized control method, two methods are proposed for optimization, and a variety of machine learning algorithms are introduced for optimization, so as to greatly improve the efficiency of ODL centralized control and provide a reference for the multialgorithm application of ODL control.


## 2. The ODL Centralized Control Framework in This Paper

ODL is generally divided into the controller, network application layer, and north-south interface, and each part has different functions. The southbound protocol layer is a module that provides support for different protocols of the device, such as LISP. The northbound interface layer provides a standard set of Rest interfaces to external applications while supporting the cluster working mode. The ODL is the core of SDN control. Among them, the controller supports link management, bandwidth control, application development, and other functions, which is essentially a platform with a high open degree. The network application layer can be used to obtain network information, so as to achieve effective control of network behavior, which has high flexibility. For the north-south interface, the southbound interface is related to format conversion and data transmission, which supports different types of protocols. And northbound interface adopts RESTful protocol to expand interactive interfaces [14–17]. The specific structure is shown in Figure 1.Figure 1
Overall architecture of ODL.In order to realize the virtualization expansion of the network, the open switch software is introduced in this design, which is convenient to control virtual machines and traffic effectively.


## 3. Research on Bandwidth Resource Allocation Combining Genetic and Ant Colony Algorithm

Combined with the background of the ODL overall control framework in Figure1, this study mainly studies and analyzes from the perspective of spectrum resource allocation and spectrum switching [18–20].


### 3.1. Power Distribution Communication Service Spectrum Arrangement Based on Genetic Algorithm

With the continuous development of the power distribution business, various types of services have also begun to appear, showing a general trend of diversified development, which further optimizes the network of Figure2 and strengthens the scheduling of spectrum resources of SDN networks. There are also certain differences in communication nodes for the management of various business facilities, which put forward different requirements for the communication link spectrum. In this kind of business, communication spectrum needs to be allocated, which is studied deeply. Comparing different algorithms, and after analysis, a genetic algorithm is used in this study. The user ids are 1, 2, 3, ..., N, and the L matrix is utilized to select the user’s free spectrum, and then, all are matched one by one with users. It is known that users 1 and 2 are matched with spectrum B and C, respectively, which are represented as 1B and 2C in turn. According to this matching method, chromosome 1B,2C,…NA can be obtained. If the evolution rate needs to be compared, 10010,20011,…,N0001 can be obtained in binary form.Figure 2
Basic process of the algorithm.Chromosomes that meet the requirements can be obtained by random matching of spectrum resources. Then, the corresponding chromosomes are obtained on the basis of the reasonable grouping of genes. For reasonable settings of algorithm parameters, the population size is set to 50.The basic process of crossing is as follows: the first is to set the crossing probabilityPc = 0.6. If the probability is lower than this value, the crossing operation is performed. The crossover points need to be set arbitrarily at first, and the value range is [1, n], and then, the chromosome segments are crossed. Moreover, the remaining fragments are stored in arrays x [] and y []. Comparing the fragments after crossing, if there are different elements, replacement is performed. The specific mutation is as follows: the value of any generated integer rand key is 1, 2, and 3, which corresponds to the insertion, inversion, and swap operations, respectively.When using a genetic algorithm, appropriate parameters need to be set. Here, the minimum value of evolution rate and the corresponding continuous algebra are represented asGenemin-imprion-rane and Genedie, respectively, and the maximum and minimum values of iteration are Genemax and Genemin, respectively. In the iteration process, if the conditions are met, the iteration ends, which includes the continuous Genedie generation of iteration or the number of iterations reaching Genemax. The resolution improvement rate is lower than Genemin-imprion-rane.


### 3.2. Power Distribution Communication Service Spectrum Selection Based on Ant Colony Algorithm

(1)
Ant colony algorithm (ACO) is introduced in spectrum allocation of power communication network, which is helpful to improve the reliability and efficiency of spectrum allocation [21–23]. In the study of spectrum allocation, a bipartite graph G=V,U,Eis adopted, where V, U, and E represent the user, the authorized user, and the connection edge, respectively. Furthermore, there is E=eiji=1,2,…,n;j=1,2,…,, and edge eij connected represents that i is matched to the authorized user i.Tij represents the trace of this edge. If i and j are not connected, Tij=0 can be obtained.(i)
Update pheromone. The specific update formula is as follows:(1)τijt=1−pφτijt+Δij'τijt=τijtmax,τijt>tijtmaxτijt=tijtmin,τijt<τijtmin,where Tijtmax and Tijtmin represent the maximum and minimum pheromone values of eij in turn. The former value is infinite, and the latter is set to 60. ρ represents the volatilizing rate of pheromone. Δτij' refers to the increased value in trace on eij, and its formula is as follows:(2)Δrij'=Q∗bij,there is an edge between cognitive user i and authorized userjΔrij'=0,there is no edge between cognitive user i and authorized userj,where bij and Q represent the benefit and adjustment coefficient, respectively.(2)
Use authorize user nodes to select policies. The formula for selecting nodej is as follows:(3)j=RWpjx,q≤q0j=argmaxpjx,other,where Pjx and q0 represent transition probability and threshold parameters, respectively, and the latter is set to 0.9. Q stands for a random number, and its value ranges from 0 to 1.(4)Pjk=rijtαbijβ∑wjτijtabijβ,where i represents the nodes that ants can access and and is not a node in the tabu table.(3)
Set algorithm parameters, whereQ = 10, ρ=0.2 and α=β=1, respectively.(4)
Set the number of ants, namely the number of user nodesn.(5)
The ending condition of the ant colony algorithm is as follows: the first iteration number reachesAntmax; b iterates continuous Antdot, and the improvement rate of the child optimization solution is always less than Antmax−imprion−rane.


### 3.3. Bandwidth Resource Optimization Strategy Based on Ant Colony Algorithm and Genetic Algorithm

A genetic algorithm is mainly used to get the best spectrum allocation combination, which is used as the initial pheromone matrixTi,j and applied to the ant colony algorithm. In this way, the problem of insufficient initial pheromone is solved, and the efficiency of bandwidth allocation is improved. The specific algorithm is shown in Figure 3.Figure 3
Node allocation algorithm combining genetic and ant colony algorithm.The optimization process based on a genetic algorithm (GA) is as follows:(1)
Determine the end conditions of GA first(2)
Then, set the initial value of the ant colony algorithm trace, which is shown as follows:(5)Tijt0=T0+ΔTij,where T0 represents the pheromone, which is set to 60; ΔTij represents the obtained pheromone increment.(3)
Obtain pheromone increment: sort the results of the solution and get the results according to the fitness where the first 10% is represented asS10%; ΔTij starts at 0, and if some solution in S10% passes through eij, then ΔTij plus 20.The maximum point of the function can be obtained by a genetic algorithm, which is helpful to improve the network performance.The objective function satisfies the principle of optimal network average benefit, and the specific form is as follows:(6)Umsrm=1N∑i=1Nrn=1N∑i=1N∑i=1Nan,m•bn,m,where a and b represent allocation matrix and benefit matrix, respectively; an,m represents whether m frequency band is allocated to n users; bmn represents the distributed network benefit. X represents spectrum allocation, and each x keeps corresponding to a set of matrix a and b. Spectrum and the number of users are set to 64 and 16, respectively.


## 3.1. Power Distribution Communication Service Spectrum Arrangement Based on Genetic Algorithm

With the continuous development of the power distribution business, various types of services have also begun to appear, showing a general trend of diversified development, which further optimizes the network of Figure2 and strengthens the scheduling of spectrum resources of SDN networks. There are also certain differences in communication nodes for the management of various business facilities, which put forward different requirements for the communication link spectrum. In this kind of business, communication spectrum needs to be allocated, which is studied deeply. Comparing different algorithms, and after analysis, a genetic algorithm is used in this study. The user ids are 1, 2, 3, ..., N, and the L matrix is utilized to select the user’s free spectrum, and then, all are matched one by one with users. It is known that users 1 and 2 are matched with spectrum B and C, respectively, which are represented as 1B and 2C in turn. According to this matching method, chromosome 1B,2C,…NA can be obtained. If the evolution rate needs to be compared, 10010,20011,…,N0001 can be obtained in binary form.Figure 2
Basic process of the algorithm.Chromosomes that meet the requirements can be obtained by random matching of spectrum resources. Then, the corresponding chromosomes are obtained on the basis of the reasonable grouping of genes. For reasonable settings of algorithm parameters, the population size is set to 50.The basic process of crossing is as follows: the first is to set the crossing probabilityPc = 0.6. If the probability is lower than this value, the crossing operation is performed. The crossover points need to be set arbitrarily at first, and the value range is [1, n], and then, the chromosome segments are crossed. Moreover, the remaining fragments are stored in arrays x [] and y []. Comparing the fragments after crossing, if there are different elements, replacement is performed. The specific mutation is as follows: the value of any generated integer rand key is 1, 2, and 3, which corresponds to the insertion, inversion, and swap operations, respectively.When using a genetic algorithm, appropriate parameters need to be set. Here, the minimum value of evolution rate and the corresponding continuous algebra are represented asGenemin-imprion-rane and Genedie, respectively, and the maximum and minimum values of iteration are Genemax and Genemin, respectively. In the iteration process, if the conditions are met, the iteration ends, which includes the continuous Genedie generation of iteration or the number of iterations reaching Genemax. The resolution improvement rate is lower than Genemin-imprion-rane.


## 3.2. Power Distribution Communication Service Spectrum Selection Based on Ant Colony Algorithm

(1)
Ant colony algorithm (ACO) is introduced in spectrum allocation of power communication network, which is helpful to improve the reliability and efficiency of spectrum allocation [21–23]. In the study of spectrum allocation, a bipartite graph G=V,U,Eis adopted, where V, U, and E represent the user, the authorized user, and the connection edge, respectively. Furthermore, there is E=eiji=1,2,…,n;j=1,2,…,, and edge eij connected represents that i is matched to the authorized user i.Tij represents the trace of this edge. If i and j are not connected, Tij=0 can be obtained.(i)
Update pheromone. The specific update formula is as follows:(1)τijt=1−pφτijt+Δij'τijt=τijtmax,τijt>tijtmaxτijt=tijtmin,τijt<τijtmin,where Tijtmax and Tijtmin represent the maximum and minimum pheromone values of eij in turn. The former value is infinite, and the latter is set to 60. ρ represents the volatilizing rate of pheromone. Δτij' refers to the increased value in trace on eij, and its formula is as follows:(2)Δrij'=Q∗bij,there is an edge between cognitive user i and authorized userjΔrij'=0,there is no edge between cognitive user i and authorized userj,where bij and Q represent the benefit and adjustment coefficient, respectively.(2)
Use authorize user nodes to select policies. The formula for selecting nodej is as follows:(3)j=RWpjx,q≤q0j=argmaxpjx,other,where Pjx and q0 represent transition probability and threshold parameters, respectively, and the latter is set to 0.9. Q stands for a random number, and its value ranges from 0 to 1.(4)Pjk=rijtαbijβ∑wjτijtabijβ,where i represents the nodes that ants can access and and is not a node in the tabu table.(3)
Set algorithm parameters, whereQ = 10, ρ=0.2 and α=β=1, respectively.(4)
Set the number of ants, namely the number of user nodesn.(5)
The ending condition of the ant colony algorithm is as follows: the first iteration number reachesAntmax; b iterates continuous Antdot, and the improvement rate of the child optimization solution is always less than Antmax−imprion−rane.


## 3.3. Bandwidth Resource Optimization Strategy Based on Ant Colony Algorithm and Genetic Algorithm

A genetic algorithm is mainly used to get the best spectrum allocation combination, which is used as the initial pheromone matrixTi,j and applied to the ant colony algorithm. In this way, the problem of insufficient initial pheromone is solved, and the efficiency of bandwidth allocation is improved. The specific algorithm is shown in Figure 3.Figure 3
Node allocation algorithm combining genetic and ant colony algorithm.The optimization process based on a genetic algorithm (GA) is as follows:(1)
Determine the end conditions of GA first(2)
Then, set the initial value of the ant colony algorithm trace, which is shown as follows:(5)Tijt0=T0+ΔTij,where T0 represents the pheromone, which is set to 60; ΔTij represents the obtained pheromone increment.(3)
Obtain pheromone increment: sort the results of the solution and get the results according to the fitness where the first 10% is represented asS10%; ΔTij starts at 0, and if some solution in S10% passes through eij, then ΔTij plus 20.The maximum point of the function can be obtained by a genetic algorithm, which is helpful to improve the network performance.The objective function satisfies the principle of optimal network average benefit, and the specific form is as follows:(6)Umsrm=1N∑i=1Nrn=1N∑i=1N∑i=1Nan,m•bn,m,where a and b represent allocation matrix and benefit matrix, respectively; an,m represents whether m frequency band is allocated to n users; bmn represents the distributed network benefit. X represents spectrum allocation, and each x keeps corresponding to a set of matrix a and b. Spectrum and the number of users are set to 64 and 16, respectively.


## 4. Power Service Switching of SDN Multidomain Network

### 4.1. Switching Strategy of Multidomain Network

Multidomain network switching can rearrange different services. In practice, multiple types of distribution communication network services are involved, in which service quality must be guaranteed based on appropriate policies. When switching target domains, it is necessary to reallocate network resources. In this case, a resource allocation strategy is designed to allocate resources based on service quality requirements, which is shown as follows:(1)
If the business does not put forward high requirements for service quality, it only needs to allocate certain free resources in the target domain.(2)
If the service quality requirements are high, the service can be divided into two types of switching, namely low-to-high-capacity domain and high-to-low-capacity domain. For the former, a high-capacity network has more resources, which can improve the service quality. Therefore, the service requirements can be met as long as appropriate resources are configured. For the latter, more emphasis should be given to quality requirements, and appropriate resources should be allocated.The switching problem of the multidomain network is studied to improve the rationality of resource allocation and meet the basic requirements of service quality. The controller needs to be used in network topology management. The basic control process is as follows:(1)
Determine the original domain and target domain reasonably first, and obtain the control command(2)
Then, locate the services involved, and obtain information such as the status of subdomains(3)
Reallocate business resources in combination with resource usage information(4)
After the completion of the allocation, build the switched link, then migrate the switched services, and record the relevant information in the database


### 4.2. Switching Algorithm between Domains Based on Analytic Hierarchy Process

At present, there are many scholars have studied the switching algorithm between domains, and a variety of algorithms are proposed. Algorithms have different characteristics and can achieve different effects. In this paper, the switching algorithm of a multidomain network is studied, and the analytic hierarchy process (AHP) is introduced. This method analyzes many factors that affect things at multiple levels, and the relative importance of things is determined based on the comparison between the two. According to the process of AHP hierarchy analysis, a multiobjective decision algorithm is constructed, and the adopted decision indicators include packet loss rate, delay, and bandwidth. The basic process of the algorithm is shown in Figure2 [24–28].


## 4.1. Switching Strategy of Multidomain Network

Multidomain network switching can rearrange different services. In practice, multiple types of distribution communication network services are involved, in which service quality must be guaranteed based on appropriate policies. When switching target domains, it is necessary to reallocate network resources. In this case, a resource allocation strategy is designed to allocate resources based on service quality requirements, which is shown as follows:(1)
If the business does not put forward high requirements for service quality, it only needs to allocate certain free resources in the target domain.(2)
If the service quality requirements are high, the service can be divided into two types of switching, namely low-to-high-capacity domain and high-to-low-capacity domain. For the former, a high-capacity network has more resources, which can improve the service quality. Therefore, the service requirements can be met as long as appropriate resources are configured. For the latter, more emphasis should be given to quality requirements, and appropriate resources should be allocated.The switching problem of the multidomain network is studied to improve the rationality of resource allocation and meet the basic requirements of service quality. The controller needs to be used in network topology management. The basic control process is as follows:(1)
Determine the original domain and target domain reasonably first, and obtain the control command(2)
Then, locate the services involved, and obtain information such as the status of subdomains(3)
Reallocate business resources in combination with resource usage information(4)
After the completion of the allocation, build the switched link, then migrate the switched services, and record the relevant information in the database


## 4.2. Switching Algorithm between Domains Based on Analytic Hierarchy Process

At present, there are many scholars have studied the switching algorithm between domains, and a variety of algorithms are proposed. Algorithms have different characteristics and can achieve different effects. In this paper, the switching algorithm of a multidomain network is studied, and the analytic hierarchy process (AHP) is introduced. This method analyzes many factors that affect things at multiple levels, and the relative importance of things is determined based on the comparison between the two. According to the process of AHP hierarchy analysis, a multiobjective decision algorithm is constructed, and the adopted decision indicators include packet loss rate, delay, and bandwidth. The basic process of the algorithm is shown in Figure2 [24–28].


## 5. Analysis of Simulation Results

### 5.1. Simulation Results of Bandwidth Resource Optimization

It is necessary to set the parameters of the genetic algorithm reasonably, in which the probability of mutation and crossover is 0.03 and 0.70, respectively; the number of iterations and population size are 40 and 50, respectively. After the parameter setting is completed, the MATLAB tool is used to simulate the designed algorithm, and the data and models refer to Li Ling. The results obtained after several iterations are shown in Figure4.Figure 4
Relationship between iterations and frequency spectrum benefit of power distribution network.It can be seen from Figure 7 that the average network benefit shows an upward trend with the increase of the number of evolution.In the above process, matrixa actually belongs to a distribution mode, that is, m spectrum fragments can be allocated to n users. The ant colony algorithm can solve two problems: the first is to arrange the spectrum, especially when new fragments are obtained; the second is to arrange the continuous spectrum.Given thatT(i, j) represents the pheromone distribution matrix, and its initial value is the connection relation of a and b. The new spectrum number is K, which is extended to m + k dimensions, and then, the bandwidths are divided into multiple subsets. Here, the new set is expressed as S, and based on the ant colony algorithm, each subset is processed, and thus, the corresponding spectrum connection mode can be obtained. The ant colony algorithm is used for simulation, and the specific parameter settings are shown in the following Table 1.Table 1
Ant colony algorithm model parameters.
Number of antConstant coefficientMaximum iterationsPheromone importance factorɑHeuristic function importance factorβPheromone volatile factorρ301750140.1After setting each parameter, the simulation can be carried out, and the final results are shown in Figure5.Figure 5
Optimal loop diagram in the power distribution network.According to the information in above Figure5, the optimal path obtained by simulation is expressed. The optimal convergence results in the power distribution network are shown in Figure 6.Figure 6
Convergence curve of the optimal solution in the power distribution network.Based on the above results, it can be seen that the ant colony algorithm can not only obtain the optimal loop route but also has fewer iterations and higher convergence. When the number of iterations reaches 28 times, the minimum value is obtained. Therefore, the application of this method can meet the requirements of node allocation and is suitable for power grid communication resource allocation.


### 5.2. Simulation Results of Interdomain Handoff

MATLAB tool is used to simulate the designed algorithm to realize the selection of multidomain network. In addition, bandwidth, packet loss rate, delay, and network hop are utilized to evaluate the performance of network.


#### 5.2.1. Power Distribution Video Surveillance Service

In the operation process of a power communication system, there are many kinds of monitoring services, which generally have relatively low requirements for packet loss rate and pay more attention to delay and bandwidth.In this process, the eig function is mainly used to calculate the eigenvalueλmaxC and eigenvector 1` r of C. The calculated CR is lower than 0.1, and thus, the consistency test is passed. On this basis, the combination of the single factor and weight coefficient of business 1 is further obtained. The comparison matrix is shown in Table 2.Table 2
Comparison matrix of power distribution video surveillance service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay11/355Bandwidth3198Packet loss rate1/51/913Hop1/51/81/31(7)Wr=w1,w2,w3,w4=0.0483,0.0935,0.3775,0.4807Wp=w1,w2,w3,w4w1,w2,w3,w4=0.2500,0.7500,0.2500,0.20000.7500,0.2500,0.7500,0.8000.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 1 ists=0.2823,0.7177;fBusiness1=maxts=0.7177.According to the above information, 0.2823 and 0.7177, respectively, represent the utility values of service 1 in access domains 1 and 2. Therefore, domain 2 is the optimal switching network for this service.


#### 5.2.2. Electricity Information Collection Service

This service has high requirements for bandwidth and delay, and the corresponding comparison matrix is shown in Table3:Table 3
Comparison matrix of electricity information collection service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay121/25Bandwidth1/2122Packet loss rate31/212Hop1/51/31/21The combinations of single factor and weight coefficient for business 1 are as follows:(8)Wr=w1,w2,w3,w4=0.2736,0.3359,0.2986,0.0919Wp=w1,w2,w3,w4w1,w2,w3,w4=0.8333,0.8000,0.3333,0.25000.1667,0.2000,0.6667,0.7500.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 2 ists=0.6068,0.3932;fBusiness2=maxts=0.6068.According to the above information, 0.6068 and 0.3932, respectively, represent the utility values of business 2 in the optimal access domain 1 and 2. It can be clearly seen that the optimal switching network for this business is domain 1.


#### 5.2.3. Distributed Generation Access Service

The comparison matrix for this service is shown in Table4.Table 4
Comparison matrix of distributed generation access service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay11/523Bandwidth5124Packet loss rate1/21/212Hop1/31/41/21The combinations of single factor and vector weight coefficient are further obtained as follows:(9)Wr=w1,w2,w3,w4=0.2573,0.5458,0.1305,0.0664Wp=w1,w2,w3,w4w1,w2,w3,w4=0.8633,0.8000,0.2500,0.33330.1367,0.2000,0.7500,0.6667.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 3 ists=0.7167,0.2833;fBusiness3=maxts=0.7167.According to the above information, 0.7167 and 0.2833, respectively, represent the utility values of business 3 in the best access domain 1 and 2. It is obvious that domain 1 should be selected for this business.


#### 5.2.4. Power Distribution Automation Service

The comparison matrix for this service is shown in Table5.Table 5
Comparison matrix of power distribution automation service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay11/31/31/2Bandwidth311/22Packet loss rate3214Hop21/21/41The combinations of single factor and weight coefficient are shown as follows:(10)Wr=w1,w2,w3,w4=0.1038,0.1765,0.4642,0.2555Wp=w1,w2,w3,w4w1,w2,w3,w4=0.1377,0.7500,0.5000,0.33330.8623,0.2500,0.5000,0.6667.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 4 ists=0.4756,0.5244;fBusiness4=maxts=0.5244.According to the above information, 0.4756 and 0.5244, respectively, represent the utility values of business 4 in the best access domain 1 and 2. It is obvious that domain 2 should be selected for this business.


## 5.1. Simulation Results of Bandwidth Resource Optimization

It is necessary to set the parameters of the genetic algorithm reasonably, in which the probability of mutation and crossover is 0.03 and 0.70, respectively; the number of iterations and population size are 40 and 50, respectively. After the parameter setting is completed, the MATLAB tool is used to simulate the designed algorithm, and the data and models refer to Li Ling. The results obtained after several iterations are shown in Figure4.Figure 4
Relationship between iterations and frequency spectrum benefit of power distribution network.It can be seen from Figure 7 that the average network benefit shows an upward trend with the increase of the number of evolution.In the above process, matrixa actually belongs to a distribution mode, that is, m spectrum fragments can be allocated to n users. The ant colony algorithm can solve two problems: the first is to arrange the spectrum, especially when new fragments are obtained; the second is to arrange the continuous spectrum.Given thatT(i, j) represents the pheromone distribution matrix, and its initial value is the connection relation of a and b. The new spectrum number is K, which is extended to m + k dimensions, and then, the bandwidths are divided into multiple subsets. Here, the new set is expressed as S, and based on the ant colony algorithm, each subset is processed, and thus, the corresponding spectrum connection mode can be obtained. The ant colony algorithm is used for simulation, and the specific parameter settings are shown in the following Table 1.Table 1
Ant colony algorithm model parameters.
Number of antConstant coefficientMaximum iterationsPheromone importance factorɑHeuristic function importance factorβPheromone volatile factorρ301750140.1After setting each parameter, the simulation can be carried out, and the final results are shown in Figure5.Figure 5
Optimal loop diagram in the power distribution network.According to the information in above Figure5, the optimal path obtained by simulation is expressed. The optimal convergence results in the power distribution network are shown in Figure 6.Figure 6
Convergence curve of the optimal solution in the power distribution network.Based on the above results, it can be seen that the ant colony algorithm can not only obtain the optimal loop route but also has fewer iterations and higher convergence. When the number of iterations reaches 28 times, the minimum value is obtained. Therefore, the application of this method can meet the requirements of node allocation and is suitable for power grid communication resource allocation.


## 5.2. Simulation Results of Interdomain Handoff

MATLAB tool is used to simulate the designed algorithm to realize the selection of multidomain network. In addition, bandwidth, packet loss rate, delay, and network hop are utilized to evaluate the performance of network.


### 5.2.1. Power Distribution Video Surveillance Service

In the operation process of a power communication system, there are many kinds of monitoring services, which generally have relatively low requirements for packet loss rate and pay more attention to delay and bandwidth.In this process, the eig function is mainly used to calculate the eigenvalueλmaxC and eigenvector 1` r of C. The calculated CR is lower than 0.1, and thus, the consistency test is passed. On this basis, the combination of the single factor and weight coefficient of business 1 is further obtained. The comparison matrix is shown in Table 2.Table 2
Comparison matrix of power distribution video surveillance service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay11/355Bandwidth3198Packet loss rate1/51/913Hop1/51/81/31(7)Wr=w1,w2,w3,w4=0.0483,0.0935,0.3775,0.4807Wp=w1,w2,w3,w4w1,w2,w3,w4=0.2500,0.7500,0.2500,0.20000.7500,0.2500,0.7500,0.8000.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 1 ists=0.2823,0.7177;fBusiness1=maxts=0.7177.According to the above information, 0.2823 and 0.7177, respectively, represent the utility values of service 1 in access domains 1 and 2. Therefore, domain 2 is the optimal switching network for this service.


### 5.2.2. Electricity Information Collection Service

This service has high requirements for bandwidth and delay, and the corresponding comparison matrix is shown in Table3:Table 3
Comparison matrix of electricity information collection service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay121/25Bandwidth1/2122Packet loss rate31/212Hop1/51/31/21The combinations of single factor and weight coefficient for business 1 are as follows:(8)Wr=w1,w2,w3,w4=0.2736,0.3359,0.2986,0.0919Wp=w1,w2,w3,w4w1,w2,w3,w4=0.8333,0.8000,0.3333,0.25000.1667,0.2000,0.6667,0.7500.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 2 ists=0.6068,0.3932;fBusiness2=maxts=0.6068.According to the above information, 0.6068 and 0.3932, respectively, represent the utility values of business 2 in the optimal access domain 1 and 2. It can be clearly seen that the optimal switching network for this business is domain 1.


### 5.2.3. Distributed Generation Access Service

The comparison matrix for this service is shown in Table4.Table 4
Comparison matrix of distributed generation access service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay11/523Bandwidth5124Packet loss rate1/21/212Hop1/31/41/21The combinations of single factor and vector weight coefficient are further obtained as follows:(9)Wr=w1,w2,w3,w4=0.2573,0.5458,0.1305,0.0664Wp=w1,w2,w3,w4w1,w2,w3,w4=0.8633,0.8000,0.2500,0.33330.1367,0.2000,0.7500,0.6667.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 3 ists=0.7167,0.2833;fBusiness3=maxts=0.7167.According to the above information, 0.7167 and 0.2833, respectively, represent the utility values of business 3 in the best access domain 1 and 2. It is obvious that domain 1 should be selected for this business.


### 5.2.4. Power Distribution Automation Service

The comparison matrix for this service is shown in Table5.Table 5
Comparison matrix of power distribution automation service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay11/31/31/2Bandwidth311/22Packet loss rate3214Hop21/21/41The combinations of single factor and weight coefficient are shown as follows:(10)Wr=w1,w2,w3,w4=0.1038,0.1765,0.4642,0.2555Wp=w1,w2,w3,w4w1,w2,w3,w4=0.1377,0.7500,0.5000,0.33330.8623,0.2500,0.5000,0.6667.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 4 ists=0.4756,0.5244;fBusiness4=maxts=0.5244.According to the above information, 0.4756 and 0.5244, respectively, represent the utility values of business 4 in the best access domain 1 and 2. It is obvious that domain 2 should be selected for this business.


## 5.2.1. Power Distribution Video Surveillance Service

In the operation process of a power communication system, there are many kinds of monitoring services, which generally have relatively low requirements for packet loss rate and pay more attention to delay and bandwidth.In this process, the eig function is mainly used to calculate the eigenvalueλmaxC and eigenvector 1` r of C. The calculated CR is lower than 0.1, and thus, the consistency test is passed. On this basis, the combination of the single factor and weight coefficient of business 1 is further obtained. The comparison matrix is shown in Table 2.Table 2
Comparison matrix of power distribution video surveillance service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay11/355Bandwidth3198Packet loss rate1/51/913Hop1/51/81/31(7)Wr=w1,w2,w3,w4=0.0483,0.0935,0.3775,0.4807Wp=w1,w2,w3,w4w1,w2,w3,w4=0.2500,0.7500,0.2500,0.20000.7500,0.2500,0.7500,0.8000.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 1 ists=0.2823,0.7177;fBusiness1=maxts=0.7177.According to the above information, 0.2823 and 0.7177, respectively, represent the utility values of service 1 in access domains 1 and 2. Therefore, domain 2 is the optimal switching network for this service.


## 5.2.2. Electricity Information Collection Service

This service has high requirements for bandwidth and delay, and the corresponding comparison matrix is shown in Table3:Table 3
Comparison matrix of electricity information collection service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay121/25Bandwidth1/2122Packet loss rate31/212Hop1/51/31/21The combinations of single factor and weight coefficient for business 1 are as follows:(8)Wr=w1,w2,w3,w4=0.2736,0.3359,0.2986,0.0919Wp=w1,w2,w3,w4w1,w2,w3,w4=0.8333,0.8000,0.3333,0.25000.1667,0.2000,0.6667,0.7500.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 2 ists=0.6068,0.3932;fBusiness2=maxts=0.6068.According to the above information, 0.6068 and 0.3932, respectively, represent the utility values of business 2 in the optimal access domain 1 and 2. It can be clearly seen that the optimal switching network for this business is domain 1.


## 5.2.3. Distributed Generation Access Service

The comparison matrix for this service is shown in Table4.Table 4
Comparison matrix of distributed generation access service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay11/523Bandwidth5124Packet loss rate1/21/212Hop1/31/41/21The combinations of single factor and vector weight coefficient are further obtained as follows:(9)Wr=w1,w2,w3,w4=0.2573,0.5458,0.1305,0.0664Wp=w1,w2,w3,w4w1,w2,w3,w4=0.8633,0.8000,0.2500,0.33330.1367,0.2000,0.7500,0.6667.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 3 ists=0.7167,0.2833;fBusiness3=maxts=0.7167.According to the above information, 0.7167 and 0.2833, respectively, represent the utility values of business 3 in the best access domain 1 and 2. It is obvious that domain 1 should be selected for this business.


## 5.2.4. Power Distribution Automation Service

The comparison matrix for this service is shown in Table5.Table 5
Comparison matrix of power distribution automation service.
Comparative indicatorsDelayBandwidthPacket loss rateHopDelay11/31/31/2Bandwidth311/22Packet loss rate3214Hop21/21/41The combinations of single factor and weight coefficient are shown as follows:(10)Wr=w1,w2,w3,w4=0.1038,0.1765,0.4642,0.2555Wp=w1,w2,w3,w4w1,w2,w3,w4=0.1377,0.7500,0.5000,0.33330.8623,0.2500,0.5000,0.6667.The total hierarchical distribution coefficient is obtained based on the decision coefficient, and the utility comparison diagram of business 4 ists=0.4756,0.5244;fBusiness4=maxts=0.5244.According to the above information, 0.4756 and 0.5244, respectively, represent the utility values of business 4 in the best access domain 1 and 2. It is obvious that domain 2 should be selected for this business.


## 6. Conclusion

To sum up, it can be seen that the performance of the SDN network is improved to a certain extent by introducing the spectrum scheduling of the improved genetic algorithm and switching method of AHP. After parameters are optimized, the optimal spectrum resource optimization path of the SDN network can be obtained. Moreover, the switching of AHP shows that domain 2 is the best access domain, so as to better improve the performance of the whole network.



---

*Source: 9925620-2022-06-30.xml*