Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy

364 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.

Data Capacity Improvement of Wireless Sensor Networks Using Non-Uniform Sensor Distribution (2006, background): “For more detailed background of these concepts, readers may refer to [23].”
Asymptotically optimal geometric mobile ad-hoc routing (2002, background): “Overviews of geometric routing algorithms are given in [9, 18, 20].”
A survey on routing algorithms for wireless Ad-Hoc and mesh networks (2012, neutral): “For example, the surveys in [38,45] discuss the scalable and power-efficient issues in the Geographical routing algorithm; [38,45] give some examples of single-path greedy packet forwarding, power-aware routing, and planar graph routing as a recovery strategy.”
Mobile ad hoc networking: imperatives and challenges (2003, background): “More details on these protocols can be found in [110,111,262,274].”
Worst-Case optimal and average-case efficient geometric ad-hoc routing (2003, background): “Routing is the foremost problem for mobile ad-hoc networks, thus it is not surprising that the research community has produced dozens of algorithmic proposals for routing [5, 11, 19, 21].”
BLR: beacon-less routing algorithm for mobile ad hoc networks (2004, background): “(Overviews can be found in [ 20 ], [21].) A further advantage is that position-based routing naturally supports geocasting ([22], [23], [24]).”