Using hierarchical location names for scalable routing and rendezvous in wireless sensor networks

Until practical ad-hoc localization systems are developed, early deployments of wireless sensor networks will manually configure location information in network nodes in order to assign spatial context to sensor readings. In this paper, we argue that such deployments will use hierarchical location names (for example, a node in a habitat monitoring network might be said to be node number N in cluster C of region R), rather than positions in a two- or three-dimensional coordinate system. We show that these hierarchical location names can be used to design a scalable routing system called HLR. HLR provides a variety of primitives including unicast, scoped anycast and broadcast, as well as various forms of scalable rendezvous. These primitives can be used to implement most data-centric routing and storage schemes proposed in the literature; these schemes currently need precise position information and geographic routing in order to scale well. We evaluate HLR using simulations as well as an implementation on the Mica-2 motes.

[1]  David E. Culler,et al.  Taming the underlying challenges of reliable multihop routing in sensor networks , 2003, SenSys '03.

[2]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[4]  Samuel Madden,et al.  TAG: a Tiny Aggregation Tree for ad-hoc sensor networks , 2002, OSDI 2002.

[5]  Deborah Estrin,et al.  Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks , 2002 .

[6]  Deborah Estrin,et al.  Scalable Coordination for Wireless Sensor Networks: Self-Configuring Localization Systems , 2001 .

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

[8]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2005, Wirel. Networks.

[9]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[10]  John Anderson,et al.  An analysis of a large scale habitat monitoring application , 2004, SenSys '04.

[11]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[12]  Ram Ramanathan,et al.  Hierarchically‐organized, multihop mobile wireless networks for quality‐of‐service support , 1998, Mob. Networks Appl..

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

[14]  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 .

[15]  Young-Jin Kim,et al.  Multi-dimensional range queries in sensor networks , 2003, SenSys '03.

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

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

[18]  Koen Langendoen,et al.  Distributed localization in wireless sensor networks: a quantitative compariso , 2003, Comput. Networks.

[19]  Wei Hong,et al.  The design of an acquisitional query processor for sensor networks , 2003, SIGMOD '03.

[20]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[21]  David E. Culler,et al.  Versatile low power media access for wireless sensor networks , 2004, SenSys '04.

[22]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[23]  Scott Shenker,et al.  Internet indirection infrastructure , 2002, SIGCOMM 2002.

[24]  Mario Gerla,et al.  Mobility Management for Hierarchical Wireless Networks , 2001, Mob. Networks Appl..

[25]  Zygmunt J. Haas,et al.  The zone routing protocol (zrp) for ad hoc networks" intemet draft , 2002 .

[26]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

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

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

[29]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

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

[31]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[32]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[33]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

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