Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks

By Ivan Stojmenovic, Xu Lin. IEEE Trans. Parallel Distributed Syst., 2001

467 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Efficient geographic routing in multihop wireless networks (2005, methodology): “Most geographic routing protocols use one-hop information, but generalization to two-hop neighborhood is also possible [10].”
Position-based routing in ad hoc networks (2002, methodology): “The DIR method, and any other method that includes forwarding the message to a neighbor with closest direction (e.g., DREAM and LAR), are not loop-free (see [11] for counterexample and references).”
A survey on routing algorithms for wireless Ad-Hoc and mesh networks (2012, unknown): “However, GEDIR faces some challenging issues, especially when a node cannot be reached by any other node in the network.”
Mobile ad hoc networking: imperatives and challenges (2003, methodology): “In addition, it uses rules to avoid loops and to exit from local optima [246].”
Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey (2013, methodology): “A packet is forwarded to the base station using greedy forwarding whenever possible [104].”