Research On Jointing Channel Assignment And Routing Algorithm In Wireless Mesh Network

Wireless Mesh Networks(WMN)is a key technology to solve the "last mile" because of its simple installation,good stability and high bandwidth,has received widespread attention.In the reaearch on wireless mesh network,optimizing channel allocation and routing to improve network performance is an important research content In the existing research,the simple channel allocation or routing optimization does not take into account the impact of channel and routing,can not make full use of network resources.Jointing channel allocation and routing optimization can improve the utilization of network resources,has important meanings to enhance network performance.At present,many joint optimization algorithms have adopted the method of constructing the joint optimization network model and expressing the model as a linear programming problem,but the linear programming problem is NP-hard problem,so these algorithms use heuristic algorithm to solve problem,but the existing heuristic algorithms do not consider the influence of the channel and the route and has large amount of computation.Based on the problem of unbalanced transmission link in wireless Mesh networks,a mixed integer linear programming problem is used to represent the optimal model of joint channel allocation,routing metric and network interface assignment in this paper.A ILSG(Iterated Local Search with Greedy algorithm)heuristic algorithm is proposed which can quickly converge.The ILSG can solve the mixed integer linear programming problem.The ILSG algorithm generates an initial network channel allocation program using a greedy algorithm that complies with the network optimization model constraints,network connectivity,and load balancing.The allocation program is expressed as an available initial value,and the initial value is substituted into the local iterative search method(ILS)to obtain the planning problem solution and accordingly dete rmine the network resource allocation program.The simulation results show that the ILSG algorithm can get the optimal model allocation program at a faster convergence rate,and improve the network performance on the basis of ensuring the fairness of the network.The hop count is one of the most basic metrics of the route,and reducing the average number of hops in the network can reduce the resource utilization of the network.At present,the heuristic algorithms used in the planning problem that represent the joint optimization model do not consider other factors that can affect the network performance in the network when the network resource allocation result is determined after the solution of the planning problem is completed.In this paper,the ILSG-H(Iterated Local Search with Greedy Algorithm-Hop Counts)is put forward.After the ILSG algorithm iterativly solves the solution of the programming problem,the initial solution of the obtained decision variable is calculated,and the corresponding node and the transport stream are calculated The minimum number of hops of the current node to the corresponding destination node is obtained,and the weighted sum of the initial solution and the reciprocal of the corresponding minimum hops is taken as the parameter of the network channel and the route allocation scheme to obtain the optimal allocation result of the final channel and route.The simulation results show that the ILSG-H algorithm can make good use of the network resources to improve the network performance.In this paper,we use Matlab and NS-3 to compare the performance of the algorithm,simulate the algorithm on Matlab,compare the performance of the algorithm and get the network resource allocation scheme.Design multi-channel multi-channel wireless mesh network platform on NS-3 simulation platform for network performance comparison.The simulation results show that the proposed algorithm can obtain the joint scheme of channel and route in WMN network with reasonable calculation,and make reasonable use of network resources to improve the average throughput in the network and reduce the average end-to-end delay and the average packet loss rate.