Geometric Routing in Wireless Sensor Networks

This chapter surveys routing algorithms for wireless sensor networks that use geometric ideas and abstractions. Wireless sensor networks have a unique geometric character as the sensor nodes are embedded in, and designed to monitor, the physical space. Thus the geometric embedding of the network can be exploited for scalable and efficient routing algorithm design. This chapter starts with geographical routing that use nodes’ geographical locations to guide the choice of the next hop node on the routing path. The scalability of geographical routing motivates more work on the design of virtual coordinates with which greedy routing algorithms are developed and applied to route messages in the network. The last section is concerned about data-centric routing, in which a query is routed to reach the sensor node holding data of interest. Thus the challenge is to discover the “source node” that possess the data as well as route the message there.

[1]  Sándor P. Fekete,et al.  Deterministic boundary recognition and topology extraction for large sensor networks , 2005, SODA '06.

[2]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

[4]  Mirela Ben-Chen,et al.  Distributed computation of virtual coordinates , 2007, SCG '07.

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

[6]  Anthony Man-Cho So,et al.  Theory of semidefinite programming for Sensor Network Localization , 2005, SODA '05.

[7]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[8]  Stefan Funke,et al.  Network sketching or: "How Much Geometry Hides in Connectivity?--Part II" , 2007, SODA '07.

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

[10]  Deborah Estrin,et al.  Data-centric storage in sensornets , 2003, CCRV.

[11]  David C. Moore,et al.  Robust distributed network localization with noisy range measurements , 2004, SenSys '04.

[12]  L. El Ghaoui,et al.  Convex position estimation in wireless sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  James Newsome,et al.  GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information , 2003, SenSys '03.

[14]  R. Govindan,et al.  On the effect of localization errors on geographic face routing in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[15]  Stephen G. Kobourov,et al.  Force-Directed Approaches to Sensor Localization , 2006, ALENEX.

[16]  Robert Krauthgamer,et al.  Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[17]  Stefano Chessa,et al.  GPS free coordinate assignment and routing in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[18]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

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

[20]  B. R. Badrinath,et al.  Error characteristics of ad hoc positioning systems (aps) , 2004, MobiHoc '04.

[21]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[22]  A. Nasipuri,et al.  Experimental Evaluation of an Angle Based Indoor Localization System , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[23]  P. F. Tsuchiya.  The landmark hierarchy: a new hierarchy for routing in very large networks , 1988, SIGCOMM.

[24]  Deborah Estrin,et al.  Rumor routing algorthim for sensor networks , 2002, WSNA '02.

[25]  Mikkel Thorup,et al.  Approximate distance oracles , 2001, JACM.

[26]  B. Hofmann-Wellenhof,et al.  Global Positioning System , 1992 .

[27]  Jie Gao,et al.  Localization and routing in sensor networks by local angle information , 2005, MobiHoc '05.

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

[29]  Wade Trappe,et al.  Robust statistical methods for securing wireless localization in sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[30]  Piotr Indyk,et al.  Low-Dimensional Embedding with Extra Information , 2004, SCG '04.

[31]  John Krumm,et al.  Accuracy characterization for metropolitan-scale Wi-Fi localization , 2005, MobiSys '05.

[32]  Mikkel Thorup,et al.  Compact routing schemes , 2001, SPAA '01.

[33]  Roger Wattenhofer,et al.  MLS: an efficient location service for mobile ad hoc networks , 2006, MobiHoc '06.

[34]  Christos H. Papadimitriou,et al.  On a conjecture related to geometric routing , 2004, Theor. Comput. Sci..

[35]  Stefan Funke,et al.  Topological hole detection in wireless sensor networks and its applications , 2005, DIALM-POMC '05.

[36]  Jie Gao,et al.  MAP: Medial axis based geometric routing in sensor networks , 2007, Wirel. Networks.

[37]  Ying Zhang,et al.  Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks , 2004, SenSys '04.

[38]  Leonidas J. Guibas,et al.  Locating and bypassing routing holes in sensor networks , 2004, IEEE INFOCOM 2004.

[39]  Roger Wattenhofer,et al.  Unit disk graph approximation , 2004, DIALM-POMC '04.

[40]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) using AOA , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[41]  David G. Kirkpatrick,et al.  Unit disk graph recognition is NP-hard , 1998, Comput. Geom..

[42]  Stefan Funke,et al.  Hole detection or: "how much geometry hides in connectivity?" , 2006, SCG '06.

[43]  Michael T. Goodrich,et al.  Succinct Greedy Geometric Routing in R^2 , 2008, ArXiv.

[44]  David E. Culler,et al.  Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.

[45]  Stefan Funke,et al.  Distance-Sensitive Routing and Information Brokerage in Sensor Networks , 2005 .

[46]  Brian D. O. Anderson,et al.  Localization in sparse networks using sweeps , 2006, MobiCom '06.

[47]  Frank Thomson Leighton,et al.  Some Results on Greedy Embeddings in Metric Spaces , 2008, FOCS.

[48]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .

[49]  Srdjan Capkun,et al.  Self-organization in mobile ad hoc networks: the approach of Terminodes , 2001, IEEE Commun. Mag..

[50]  Ivan Stojmenovic,et al.  Power-Aware Localized Routing in Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[51]  James Aspnes,et al.  On the Computational Complexity of Sensor Network Localization , 2004, ALGOSENSORS.

[52]  Sándor P. Fekete,et al.  Neighborhood-Based Topology Recognition in Sensor Networks , 2004, ALGOSENSORS.

[53]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[54]  Paramvir Bahl,et al.  RADAR: an in-building RF-based user location and tracking system , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[55]  Yinyu Ye,et al.  Semidefinite programming for ad hoc wireless sensor network localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[56]  Leonidas J. Guibas,et al.  Landmark-Based Information Storage and Retrieval in Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[58]  Raghavan Dhandapani,et al.  Greedy Drawings of Triangulations , 2008, SODA '08.

[59]  Jie Gao,et al.  Boundary recognition in sensor networks by topological methods , 2006, MobiCom '06.

[60]  Kostas E. Bekris,et al.  Robotics-Based Location Sensing Using Wireless Ethernet , 2002, MobiCom '02.

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

[62]  Young-Jin Kim,et al.  Lazy cross-link removal for geographic routing , 2006, SenSys '06.

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

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

[65]  Deborah Estrin,et al.  DIFS: a distributed index for features in sensor networks , 2003, Ad Hoc Networks.

[66]  László Lovász,et al.  Rubber bands, convex embeddings and graph connectivity , 1988, Comb..

[67]  David E. Culler,et al.  The effects of ranging noise on multihop localization: an empirical study , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[68]  Luca Grilli,et al.  An Algorithm to Construct Greedy Drawings of Triangulations , 2010, J. Graph Algorithms Appl..

[69]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[70]  Jie Gao,et al.  Double Rulings for Information Brokerage in Sensor Networks , 2006, IEEE/ACM Transactions on Networking.

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

[72]  Baruch Awerbuch,et al.  Concurrent online tracking of mobile users , 1991, SIGCOMM 1991.

[73]  Haiyun Luo,et al.  A two-tier data dissemination model for large-scale wireless sensor networks , 2002, MobiCom '02.

[74]  Leonidas J. Guibas,et al.  Deformable spanners and applications. , 2006, Computational geometry : theory and applications.

[75]  Young-Jin Kim,et al.  On the pitfalls of geographic face routing , 2005, DIALM-POMC '05.

[76]  Craig Gotsman,et al.  Distributed Graph Layout for Sensor Networks , 2004, Graph Drawing.

[77]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[78]  Abubakr Muhammad,et al.  Coverage and hole-detection in sensor networks via homology , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[79]  Gang Zhou,et al.  Impact of radio irregularity on wireless sensor networks , 2004, MobiSys '04.

[80]  Moustafa Youssef,et al.  WLAN location determination via clustering and probability distributions , 2003, Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003)..

[81]  Leonidas J. Guibas,et al.  Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[82]  Lili Qiu,et al.  S4: Small State and Small Stretch Routing Protocol for Large Wireless Sensor Networks , 2007, NSDI.

[83]  Stefan Funke,et al.  Guaranteed-Delivery Geographic Routing Under Uncertain Node Locations , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

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

[86]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 2001, Wirel. Networks.

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

[88]  Antony Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM 2006.

[89]  Ping Luo,et al.  Face Tracing Based Geographic Routing in Nonplanar Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[90]  Leonidas J. Guibas,et al.  Distance-Sensitive Information Brokerage in Sensor Networks , 2006, DCOSS.

[91]  Ying Zhang,et al.  Localization from mere connectivity , 2003, MobiHoc '03.

[92]  Michael Kaufmann,et al.  A New Approach for Boundary Recognition in Geometric Sensor Networks , 2005, CCCG.

[93]  Andy Hopper,et al.  The Anatomy of a Context-Aware Application , 1999, Wirel. Networks.

[94]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

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

[96]  H. Coxeter,et al.  Introduction to Geometry. , 1961 .

[97]  Andy Hopper,et al.  The active badge location system , 1992, TOIS.

[98]  P. Groenen,et al.  Modern Multidimensional Scaling: Theory and Applications , 1999 .

[99]  Colin L. Mallows,et al.  A system for LEASE: location estimation assisted by stationary emitters for indoor RF wireless networks , 2004, IEEE INFOCOM 2004.

[100]  Bruce M. Maggs,et al.  On hierarchical routing in doubling metrics , 2005, SODA '05.

[101]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[102]  Mani B. Srivastava,et al.  The n-Hop Multilateration Primitive for Node Localization Problems , 2003, Mob. Networks Appl..

[103]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[104]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[105]  Xingxing Yu,et al.  4-Connected Projective-Planar Graphs Are Hamiltonian , 1994, J. Comb. Theory, Ser. B.

[106]  Leonidas J. Guibas,et al.  Locating and Bypassing Holes in Sensor Networks , 2006, Mob. Networks Appl..

[107]  G. Ziegler.  Lectures on Polytopes , 1994 .

[108]  K. Whitehouse,et al.  A robustness analysis of multi-hop ranging-based localization approximations , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

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

[110]  Leonidas J. Guibas,et al.  GLIDER: gradient landmark-based distributed routing for sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[111]  Danny Dolev,et al.  LLS: a locality aware location service for mobile ad hoc networks , 2004, DIALM-POMC '04.