Survey on Position-Based Routing 1

In this paper we review position-based routing for wireless ad hoc and for wired networks. This form of routing assumes that nodes are aware of i) their own position; ii) the position of their neighbors (obtained through the exchange of beacon messages); and iii) the position of the node that is the intended destination of the packet.

[1]  Roger Wattenhofer,et al.  Asymptotically optimal geometric mobile ad-hoc routing , 2002, DIALM '02.

[2]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[3]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[4]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[5]  Jie Wu,et al.  A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..

[6]  Jörg Liebeherr,et al.  Application-layer multicasting with Delaunay triangulation overlays , 2002, IEEE J. Sel. Areas Commun..

[7]  Young-Jin Kim,et al.  Geographic routing made practical , 2005, NSDI.

[8]  Andreas Haeberlen,et al.  Practical robust localization over large-scale 802.11 wireless networks , 2004, MobiCom '04.

[9]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[10]  David Eppstein,et al.  Spanning Trees and Spanners , 2000, Handbook of Computational Geometry.

[11]  Rahul Jain,et al.  Geographical routing using partial information for wireless ad hoc networks , 2001, IEEE Wirel. Commun..

[12]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[13]  R. Bellman.  Dynamic programming. , 1957, Science.

[14]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[15]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[16]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[17]  Xiang-Yang Li,et al.  Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks , 2003, DIALM-POMC '03.

[18]  Roger Wattenhofer,et al.  Geometric Routing Without Geometry , 2005, SIROCCO.

[19]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  Gruia Calinescu.  Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks , 2003, ADHOC-NOW.

[21]  L.J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2001, IEEE Journal on Selected Areas in Communications.

[22]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[23]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[24]  David P. Dobkin,et al.  Delaunay graphs are almost as good as complete graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[25]  Anand Sivasubramaniam,et al.  Efficient Peer-to-Peer Information Sharing over Mobile Ad Hoc Networks , 2004 .

[26]  Hsu Wen-Jing,et al.  Localized Delaunay Triangulation for Topological Construction and Routing on MANETs , 2002 .

[27]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[28]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[29]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[30]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[31]  Prosenjit Bose,et al.  Competitive Online Routing in Geometric Graphs , 2004, SIROCCO.

[32]  Deborah Estrin,et al.  SCALE: A tool for Simple Connectivity Assessment in Lossy Environments , 2003 .

[33]  Ivan Stojmenovic,et al.  Position-based routing in ad hoc networks , 2002, IEEE Commun. Mag..

[34]  B. R. Badrinath,et al.  VOR base stations for indoor 802.11 positioning , 2004, MobiCom '04.

[35]  Jörg Kaiser,et al.  CHR: a distributed hash table for wireless ad hoc networks , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

[36]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[37]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[38]  Pierre Fraigniaud,et al.  A Space Lower Bound for Routing in Trees , 2002, STACS.

[39]  Jan van Leeuwen,et al.  Compact Routing Methods: A Survey , 1994, SIROCCO.

[40]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[41]  Lali Barrière,et al.  Robust position-based routing in wireless ad hoc networks with irregular transmission ranges , 2003, Wirel. Commun. Mob. Comput..

[42]  Anis Laouiti,et al.  Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks , 2000 .

[43]  Indranil Gupta,et al.  Scalable fault-tolerant aggregation in large process groups , 2001, 2001 International Conference on Dependable Systems and Networks.

[44]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[45]  Gregory G. Finn,et al.  Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report. , 1987 .

[46]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[47]  Ion I. Mandoiu,et al.  Selecting Forwarding Neighbors in Wireless Ad Hoc Networks , 2001, DIALM '01.

[48]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

[49]  Adam Greenhalgh,et al.  Hybrid routing: A pragmatic approach to mitigating position uncertainty in geo-routing , 2005 .

[50]  Deborah Estrin,et al.  Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks , 2002 .

[51]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[52]  V. Padmanabhan,et al.  An investigation of geographic mapping techniques for internet hosts , 2001, SIGCOMM '01.