Research On Joint Routing And Channel Assignment For Multicast In Wireless Mesh Networks

Research on Joint Routing and Channel Assignment for multicast in Wireless Mesh NetworksWireless Mesh Networks(WMN)is a key wireless access mode,it can extend the coverage of wireless access network and increase the flexibility and effectiveness of the wireless access network.Because WMN has many advantages,such as high reliability,self-organization,self-healing and so on,it has been widely studied by the academic circles.Multi-Radio Multi-Channel is an important means to improve the performance of WMN network.,configuring multiple wireless interfaces at the same node increases the overall network capacity.However,the use of MRMC technology for the network has brought the problem of increased wireless interference.WMN routing technology improves the network capacity by selecting the appropriate path for packets.Channel assignment technology reduces the interference between nodes by assigning appropriate channels to the network interface.Enhance network capacity.Therefore,the research of routing and channel assignment technology in WMN is important to solve the interference problem and improve the network performance.Routing in multicast communication usually builds a gateway node for the root node of the tree structure,the routing problem is transformed into the problem of constructing a multicast tree for multicast communication network;channel assignment needs to fully consider the use of wireless broadcast advantage to improve multicast throughput.This paper focuses on the multicast routing and channel assignment in WMN.In order to optimal multicast routing and channel assignment,while reducing the complexity of solution,a sequential binary integer programming(SBIP)is proposed.Channel assignment and routing are considered as two independent sub problems.In order to improve the utilization of the channel spectrum,SBIP also uses partially overlapping channels.In this paper,the computational complexity of SBIP is analyzed theoretically.The results show that SBIP can effectively reduce the computational complexity of the optimization process.NS-3 simulation software is used to verify the performance of SBIP.The simulation results show that SBIP can get the best results of routing and channel assignment,and SBIP can be used as the benchmark of other methods.Although SBIP can complicate optimal routing and channel allocation solutions with less computational complexity,but due to its inability to obtain results in polynomial time,it cannot be applied to the actual network.Therefore,this paper proposes a heuristicalgorithm called Min-Collision Load and Channel Assignment(MCLRC).MCLRC algorithm can get the result of routing and channel assignment in polynomial time.MCLRC routing process can reduce the waste of interfaces;the channel assignment process of MCLRC is designed to minimize the collicion interference in the network,the assignment results can improve the overall network multicast throughput.NS-3 simulation results show that the performance of MCLRC is close to the optimal solution obtained by SBIP,and is better than MCM algorithm and M4 algorithm.