Research On Routing Protocol In Wireless Mesh Networks

Wireless Mesh Network extended the communication distance and was built quickly. Data communication was reliable and efficient. It can be used in oil and gas exploration, emergency communication, UAV communication and other communication scenarios, so it attracted the attention of more and more domestic and foreign scholars. However, due to the instability of radio channel, the mobility of wireless nodes and other reasons, variable network topology made traditional wired network routing algorithm no longer suitable for wireless network. Self-healing routing algorithms and opportunistic routing algorithms for radio channel characteristics need to be studied further.Currently, reactive routing algorithms frequently had problems such as serious flooding and excessive delay; Proactive routing algorithms frequently had problems such as single node overloading problem and poor invulnerability; Traditional self-healing routing algorithms frequently had problems such as single self-healing strategie and could not guarantee the quality of communication path after healing. To solve the above problems, this paper presented Dynamic Hybrid Backup Routing Protocol, DHBRP. Because the root mastered full advantage of the network topology information, it calculated the optimal and alternative paths; Since the introduction of the root node dynamic selection mechanism, root node dynamically changed based on network topology and single node survivability problem of poor was overcome and root node load balancing benefited. Since the self-healing mechanism based on the optimal path was extended, self-healing success rate improved with less expense; Because of the adaptive multi-path computing strategy, alternative route calculation methods were switched according to the specific circumstances of the network topology and utilization efficiency of radio resources improved.Currently, because of node failure, fixed routing algorithms frequently had problems such as too much delay overhead and increased packet loss rate; Opportunistic routing algorithm frequently had problems such as too much routing overhead since the nodes need to have the entire network topology information. Routing metric calculation based on iteration excessived. Delay overhead was too large because of the complexity of coordination mechanisms. To solve the above problems, this paper presented Combined Fixed Route Opportunistic Routing Protocol, CFRORP. It showed the formula and distributed update mechanism of expand air time link metric. It Calculated and updated routing metric when routing established and data transferred. Computation reduced and large routing overhead since each node need to know the entire network topology was avoided; It introduced the reliability of data packet transfer mechanism and completely overcame the problem of data packets transmitted repeatedly; It used fixed routing or opportunistic routing forwarding mechanism according to the link quality and reduced delay overhead.Finally, using NS-3 simulation platform, by comparing with classic self-healing routing algorithm and classic opportunistic routing algorithm, this paper verified that algorithm DHBRP improved performance in packet delivery ratio, delay, routing overhead areas and algorithm CFRORP improved performance in packet delivery ratio, routing overhead areas.