A case for hierarchical routing in low-power wireless embedded networks

Hierarchical routing has often been mentioned as an appealing point-to-point routing technique for wireless sensor networks (sensornets). While there is a volume of analytical and high-level simulation results demonstrating its merits, there has been little work evaluating it in actual sensornet settings. This article bridges the gap between theory and practice. Having analyzed a number of proposed hierarchical routing protocols, we have developed a framework that captures the common characteristics of the protocols and identifies design points at which the protocols differ. We use a sensornet implementation of the framework in TOSSIM and on a 60-node testbed to study various trade-offs that hierarchical routing introduces, as well as to compare the performance of hierarchical routing with the performance of other routing techniques, namely shortest-path routing, compact routing, and beacon vector routing. The results show that hierarchical routing is a compelling routing technique also in practice. In particular, despite only logarithmic routing state, it can offer small routing stretch: an average of ∼ 1.25 and a 99th percentile of 2. It can also be robust, minimizing the maintenance traffic or the latency of reacting to changes in the network. Moreover, the trade-offs offered by hierarchical routing are attractive for many sensornet applications when compared to the other routing techniques. For example, in terms of routing state, hierarchical routing can offer scalability at least an order of magnitude better than compact routing, and at the same time, in terms of routing stretch, its performance is within 10--15% of that of compact routing; in addition, this performance can further be tuned to a particular application. Finally, we also identify a number of practical issues and limitations of which we believe sensornet developers adopting hierarchical routing should be aware.

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

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

[3]  David E. Culler,et al.  IP is dead, long live IP for wireless sensor networks , 2008, SenSys '08.

[4]  G. Sicuranza,et al.  The landmark hierarchy: A new hierarchy for routing in very large networks , 1988 .

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

[6]  Konrad Iwanicki,et al.  Hierarchical Routing in Low-Power Wireless Networks , 2010 .

[7]  Konrad Iwanicki.  KonTest : A Wireless Sensor Network Testbed at Vrije Universiteit Amsterdam , 2008 .

[8]  Konrad Iwanicki,et al.  Experimentally studying the sensornet point-to-point routing techniques spectrum , 2010, 2010 Seventh International Conference on Networked Sensing Systems (INSS).

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

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

[11]  Konrad Iwanicki,et al.  On hierarchical routing in wireless sensor networks , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[12]  Arthur Brady,et al.  On compact routing for the internet , 2007, CCRV.

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

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

[15]  David E. Culler,et al.  Mobility Changes Everything in Low-Power Wireless Sensornets , 2009, HotOS.

[16]  Shu Du,et al.  Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking , 2005 .

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

[18]  Robert Tappan Morris,et al.  Geographic Routing Without Planarization , 2006, NSDI.

[19]  Jie Gao,et al.  Greedy routing with guaranteed delivery using Ricci flows , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[20]  Deborah Estrin,et al.  Centralized Routing for Resource-Constrained Wireless Sensor Networks (SYS 5) , 2006 .

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

[22]  Konrad Iwanicki,et al.  Multi-hop Cluster Hierarchy Maintenance in Wireless Sensor Networks: A Case for Gossip-Based Protocols , 2009, EWSN.

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

[24]  Hannes Frey,et al.  Dynamic Source Routing versus Greedy Routing in a Testbed Sensor Network Deployment , 2009, EWSN.

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

[26]  Philip Levis,et al.  The β-factor: measuring wireless link burstiness , 2008, SenSys '08.

[27]  David Thaler,et al.  Distributed top-down hierarchy construction , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

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

[29]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[30]  Robert Tappan Morris,et al.  Greedy Virtual Coordinates for Geographic Routing , 2007, 2007 IEEE International Conference on Network Protocols.

[31]  Jacob Hagouel,et al.  Issues in routing for large and dynamic networks , 1983 .

[32]  Satish Kumar,et al.  Scalable object-tracking through unattended techniques (SCOUT) , 2000, Proceedings 2000 International Conference on Network Protocols.

[33]  Edward J. Coyle,et al.  An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

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

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

[37]  Philip Levis,et al.  Four-Bit Wireless Link Estimation , 2007, HotNets.