Geographical-position-based routing method in wireless mesh network

Abstract

The invention takes characteristics of a wireless mesh network as a clue, combines a forwarding strategy of opportunistic routing, and provides a routing method in application programming (IAP) which is applicable to the wireless mesh network by improving a greedy perimeter stateless routing (GPSR) routing protocol. The IAP is functionally divided into two parts: 1) in a greedy mode, a data acquisition module and a data acquisition interface are arranged on an IEEE 802.11 multi-access computer (MAC) layer, the state information of a local node interface and link information between neighboring nodes are acquired on the MAC layer, the processed data is fed back to a routing layer in a call-back mode, and finally, comprehensive routing metrics are formed, so that packet node forwarding selection in the greedy mode is closer to actual conditions of the network; and 2) when the packet meets a routing hole in the wireless mesh network, a novel competition-based opportunistic routing hole detouring strategy is provided; moreover, on a hole edge, the neighboring nodes compete forwarding opportunity according to the mastered topology and link information to reduce the possibilities of increasing routing hops brought by blind detouring and generating network congestion.

Description

technical field [0001] The invention belongs to the field of wireless communication networks, and in particular relates to a method for improving a routing protocol based on geographic location in a wireless mesh network (Wireless MeshNetwork). Background technique [0002] The design of routing protocols for wireless mesh networks has always been full of challenges, because there is no routing protocol that can fully adapt to the dynamic characteristics of wireless network environments. In recent years, the design of routing protocols after adding location-aware attributes to nodes in wireless multi-hop networks has become a research hotspot. Routing based on geographic location provides an opportunity to improve the performance of existing wireless multi-hop networks. The GPSR (Greedy Perimeter Stateless Routing) protocol is the most representative of such protocols. GPSR uses the greedy forwarding method to select the next-hop node only by using the topology information l...

AI Technical Summary

Problems solved by technology

[0006] The existing hole processing methods have relatively big disadvantages: First, the blindness of forwarding, regardless of the actual situation of the network, blindly adopts the right-hand rule or the left-right rule to forward packets, which increases the routing path length of the packet, and cannot guarantee The transmission of data packets is more likely to fall into an infinite loop; the second is that the routing overhead is too large. In the process of traversing the edge, if it has not been able to get out of the local optimum, a large number of calculations need to be used in the definition of the boundary of the surface and the selection of the forwarding direction. Sometimes it is necessary to use local flooding to find routes; third, it is difficult to restore routes, and only limited path information is recorded in the packets. When it is found that the hole bypass fails, it is often difficult to return to the starting node for retransmission of data packets, resulting in packet loss

Images