Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks

Abstract

ÐIn a localized routing algorithm, each node makes forwarding decisions solely based on the position of itself, its neighbors, and its destination. In distance, progress, and direction-based approaches (reported in the literature), when node A wants to send or forward message m to destination node D, it forwards m to its neighbor C which is closest to D (has best progress toward D, whose direction is closest to the direction of D, respectively) among all neighbors of A. The same procedure is repeated until D, if possible, is eventually reached. The algorithms are referred to as GEDIR, MFR, and DIR when a common failure criterion is introduced: The algorithm stops if the best choice for the current node is the node from which the message came. We propose 2-hop GEDIR, DIR, and MFR methods in which node A selects the best candidate node C among its 1-hop and 2-hop neighbors according to the corresponding criterion and forwards m to its best 1-hop neighbor among joint neighbors of A and C. We then propose flooding GEDIR and MFR and hybrid single-path/flooding GEDIR and MFR methods which are the first localized algorithms (other than full flooding) to guarantee the message delivery (in a collision-free environment). We show that the directional routing methods are not loopfree, while the GEDIR and MFR-based methods are inherently loop free. The simulation experiments, with static random graphs, show that GEDIR and MFR have similar success rates, which is low for low degree graphs and high for high degree ones. When successful, their hop counts are near the performance of the shortest path algorithm. Hybrid single-path/flooding GEDIR and MFR methods have low communication overheads. The results are also confirmed by experiments with moving nodes and MAC layer.

An exploration of geographic routing with k-hop based searching in wireless sensor networks

“…However, it is promising that multi-hop information can lead to better performance in many aspects including routing, message broadcasting and channel access scheduling [7], [13]- [15]. Details of several distributed information exchange schemes and efficient algorithms in computing 2-hop neighborhood information for wireless ad hoc and sensor networks can be found in [16]- [18].…”

“…As we know, in geographic routing, a selection of forwarding candidate only by the preference of shortest distance to destination can simply fall into a routing deadlock [13]. In other words, the packet may be passed between two nodes at the dead end.…”

Location error resilient geographical routing for vehicular ad‐hoc networks

“…In this section, the detail of the modifications of Geographic Distance Routing (GEDIR) [27] as LER-GR is presented.…”

“…Normalized routing load (NRL) refers to the total number of routing packets transmitted by a routing protocol for successful delivery of a data packet. It can be calculated as expressed by (27).…”

Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks

“…Although the complexity and the overhead of the algorithm is rather medium, it does not choose optimal paths. Flooding based techniques [20], [9] are using broadcast to forward the message, once a packet is stuck. Although the complexity is low, the overhead is high.…”