Research On Channel Allocation And Routing Algorithm For Mesh Network Based On Connectivity

The emergence of wireless Mesh network(Wireless Mesh Network,WMN)makes further improvement on traditional WLAN technology like what the blind area coverage is not enough,the access ability is not strong,the safety performance is high enough,the shortcomings of transmission speed is not fast enough,and has obvious advantage in solving the wireless broadband "the last kilometer" problem,and becomes the hot topics in the study of wireless communication technology.However,the problems existing in the WMN also gradually exposed,as the increase of the hop count of WMN,the delay begins to increase,the throughput starts to reduce,and the QoS is difficult to guarantee.In numerous of solutions to solve these problems,channel allocation and routing algorithm based on multiple-channel and multiple-interface technology are hotspots of current research.Multiple-channel and multiple-interface technology can solve the channel interference existing in the traditional WMN single-channel and single-interface which the channel interference is serious and the transmission rate is not high.However the algorithm brings the diversity and complexity of the promotion,if the algorithm design is not reasonable,which will not take full advantages of the WMN multiple-channel and multiple-interface technology.Therefore,on the basis of previous studies and on the basis of guaranteeing connectivity in order to improve the utilization rate and transmission rate of wireless channel in WMN,the original algorithm is improved:(1)On the basis of the original BFS channel allocation algorithm,a dynamic fixed channel allocation algorithm DFCA(Dynamic fixed channel allocation algorithm)is proposed.In this algorithm,each node is equipped with a neighbor-table and a channel-use-table to guarantee the connectivity,meanwhile,each node is equipped for a fixed channel which receives data,and a spare channel for data transmission,to make best of the WMN multi-channel multi interface technology advantage,reduce the link between interference,improve the transmission efficiency;at the same time the neighbor-table is improved,which includes the effective time,for the conditions of new nodes and old nodes,in order to solve the WMN problem with node mobility.(2)On the basis of the original ILA routing algorithm,a load aware routing algorithm LARA(Load awareness routing algorithm)is proposed.The algorithm is combined with the DFCA algorithm,in order to optimize the routing in WMN,solves the problem of ILA algorithm in the iterative calculation of interference by correcting the interference of the object from the node to improve the link.At the same time,it makes full use of the neighbor-table and the channel-use-table information in the channel allocation,which solves the common problems such as routing,path error and path failure.(3)Finally,the above two algorithms are simulated on the NS-3 simulation software,and the algorithm proposed in this paper is compared with the previous algorithms,which verifies the correctness and effectiveness of the algorithm.