The Effect of Link Churn on Wireless Routing

In this paper, we examine the spatiotemporal dynamics of wireless links and evaluate their effect on routing. We ran several experiments using a testbed consisting of 57 MicaZ motes, and collected data on link behavior over one entire day. We use this data to observe the overall network connectivity over time and space. We are able to examine in detail the choice of neighbors and routes using several linkselection mechanisms, both statically and over time. We are able to verify the hairy-edge hypothesis, which states that the most important links for routing are the most difficult to predict. In order to do so, we develop precise definitions of important and unpredictable links. We also find it possible to remove these intermediate links from consideration and still have a very rich set of links to route over, while suffering from fewer difficult-to-predict links. Also, we explore the tradeoff between statically defining routes as opposed to a dynamic protocol. We find that while it is not possible to remove all temporal variations from the network, their impact can be significantly reduced through the use of local redundancy. Finally, we present a survey of how several existing routing protocols fit into the framework developed in the body of the paper.

[1]  Gyula Simon,et al.  Sensor network-based countersniper system , 2004, SenSys '04.

[2]  Deborah Estrin,et al.  Temporal Properties of Low Power Wireless Links: Modeling and Implications on Multi-Hop Routing , 2005 .

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

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

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

[6]  David E. Culler,et al.  A unifying link abstraction for wireless sensor networks , 2005, SenSys '05.

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

[8]  Sukun Kim,et al.  Health Monitoring of Civil Infrastructures Using Wireless Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[9]  David E. Culler,et al.  Procrastination Might Lead to a Longer and More Useful Life , 2007, HotNets.

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

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

[12]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[13]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[14]  Srinivasan Seshan,et al.  Synopsis diffusion for robust aggregation in sensor networks , 2004, SenSys '04.

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

[16]  Marco Zuniga,et al.  An analysis of unreliability and asymmetry in low-power wireless links , 2007, TOSN.

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

[18]  Prasun Sinha,et al.  Learn on the Fly: Data-Driven Link Estimation and Routing in Sensor Network Backbones , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[19]  Matt Welsh,et al.  Fidelity and yield in a volcano monitoring sensor network , 2006, OSDI '06.

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

[21]  Gang Zhou,et al.  Models and solutions for radio irregularity in wireless sensor networks , 2006, TOSN.

[22]  Robert Tappan Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM '04.

[23]  Seungjoon Lee,et al.  Efficient geographic routing in multihop wireless networks , 2005, MobiHoc '05.

[24]  Ramesh Govindan,et al.  Understanding packet delivery performance in dense wireless sensor networks , 2003, SenSys '03.

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

[26]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

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

[28]  Deborah Estrin,et al.  ASCENT : Adaptive Self-Configuring sEnsor Networks Topologies . , 2002 .

[29]  Philip Levis,et al.  Understanding the causes of packet delivery success and failure in dense wireless sensor networks , 2006, SenSys '06.

[30]  Philip Levis,et al.  Collection tree protocol , 2009, SenSys '09.