Research And Design Of The Secure Routing Protocol For Wireless Mesh Networks

Wireless mesh network which has the properties of self-organizing, self-configuring, self-healing is a broadband accessed network with a large capacity, high-speed, wide coverage area. This network has been applied in many fields. However the security issue of wireless mesh network has been key plagued to widely application, of which the security of the routing protocol is particularly focused on.In this paper, the design criteria of the secure routing protocols which were very suitable for the wireless networks was proposed that possesses the smaller calculation and storage and the higher robustness and efficiency though analysis the disadvantages of current secure routing protocols. On this basis, the reputation model and the ant colony model are respectively researched and the improved models of these to use in wireless mesh networks suitable are proposed. At the same time, a secure routing protocol for wireless mesh network is designed. The specific design is as follows:Using the trust event table of the nodes defined, the current trust value of the nodes is given; utilizing the fast convergence of the markov algorithm, the reputation value of the nodes is given quickly. Distinguish between the good nodes and the bad ones is though the setting threshold.With the improved model of the ant colony, the optimal fast security routing are found. Of which the Drop rate, and Jam rate, and Stability Hop count are main parameters to calculate the probability of the route selected. The highest probability ensures the best secure route. This model can effectively improve the security and robustness of the routing protocol.Finally, combining the two models which were present below, the overall process design scheme of the security routing protocols for wireless mesh network is given that include two main portions as the security routing search and routing maintenance. When the network topology occur a significant change, this protocol can maintain the route in time and search the route quickly as the route break though the feed backing routing information between the front-back nodes. By the performance simulation and the analysis of the safety, it is showed that the higher safety performance and the robustness the smaller calculation storage.