A holistic approach to multihop routing in sensor networks

The dynamic and lossy nature of wireless communication poses major challenges to reliable, self-organizing multihop networks. Non-ideal link characteristics are especially problematic with the primitive, low-power radio transceivers found in sensor networks and raise new issues that routing protocols must address. We redefine the basic notion of wireless connectivity in terms of probabilistic links, and demonstrate that link statistics can be captured dynamically through an efficient yet adaptive link estimator. This probabilistic notion of connectivity changes the usual concept of a neighbor and introduces new problems with neighborhood management: the neighbor table on a sensor node is of fixed size and cannot always be used to gather link statistics about all neighbors, yet the process of selecting the most competitive neighbors requires a comparison with the link statistics of those neighbors that are not in the table. Together, link estimation and neighborhood management build a probabilistic connectivity graph which can be exploited by a routing algorithm to increase reliability. Together, these three processes constitute our holistic approach to routing. We study and evaluate link estimation, neighborhood table management, and reliable routing protocol techniques, focusing on the many-to-one, periodic data collection workload commonly found in sensor network applications today. Our final system uses a variant of an exponentially weighted moving average estimator, frequency based table management, and minimum transmission cost-based routing. Our analysis ranges from large-scale, high-level simulations to in-depth empirical experiments and emphasizes the intricate interactions between the routing topology and the underlying connectivity graph, which underscores the need for a whole-system approach to the problem of routing in wireless sensor networks.

[1]  David E. Culler,et al.  Mica: A Wireless Platform for Deeply Embedded Networks , 2002, IEEE Micro.

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

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

[4]  Jitendra Padhye,et al.  Comparison of routing metrics for static multi-hop wireless networks , 2004, SIGCOMM 2004.

[5]  J. A. Stevens.  Spatial reuse through dynamic power and routing control in common-channel random-access packet radio networks , 1988 .

[6]  Ramesh Govindan,et al.  Networking support for query processing in sensor networks , 2004, CACM.

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

[8]  Hari Balakrishnan,et al.  Explicit Loss Notification and Wireless Web Performance , 2006 .

[9]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

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

[11]  David E. Culler,et al.  A transmission control scheme for media access in sensor networks , 2001, MobiCom '01.

[12]  Anish Arora,et al.  The mote connectivity protocol , 2003, Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712).

[13]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[14]  Vinayak S. Naik,et al.  A line in the sand: a wireless sensor network for target detection, classification, and tracking , 2004, Comput. Networks.

[15]  Robert Tappan Morris,et al.  Performance of multihop wireless networks: shortest path is not enough , 2003, CCRV.

[16]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[17]  R. Caceres,et al.  Loss-based inference of multicast network topology , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[18]  David E. Culler,et al.  System architecture for wireless sensor networks , 2003 .

[19]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[20]  Charles L. Hedrick,et al.  Routing Information Protocol , 1988, RFC.

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

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

[23]  Jaein Jeong,et al.  Forward Error Correction in Sensor Networks , 2003 .

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

[25]  Songwu Lu,et al.  GRAdient Broadcast: A Robust Data Delivery Protocol for Large Scale Sensor Networks , 2005, Wirel. Networks.

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

[27]  David E. Culler,et al.  The nesC language: A holistic approach to networked embedded systems , 2003, PLDI.

[28]  J. J. Garcia-Luna-Aceves,et al.  EIGRP--A Fast Routing Protocol based on Distance Vectors , 1994 .

[29]  Leandros Tassiulas,et al.  Energy conserving routing 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]  Deborah Estrin,et al.  Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks , 2002 .

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

[32]  S. Bruhn,et al.  Concepts and solutions for link adaptation and inband signaling for the GSM AMR speech coding standard , 1999, 1999 IEEE 49th Vehicular Technology Conference (Cat. No.99CH36363).

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

[34]  Sang Hyuk Son,et al.  USENIX Association Proceedings of MobiSys 2003 : The First International Conference on Mobile Systems , Applications , and Services , 2003 .

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

[36]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[37]  David E. Culler,et al.  The Emergence of Networking Abstractions and Techniques in TinyOS , 2004, NSDI.

[38]  Deborah Estrin,et al.  SCALE: A Tool for Connectivity Assessment in Lossy Environments , 2003 .

[39]  Yossi Matias,et al.  New sampling-based summary statistics for improving approximate query answers , 1998, SIGMOD '98.

[40]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[41]  Erik D. Demaine,et al.  Frequency Estimation of Internet Packet Streams with Limited Space , 2002, ESA.

[42]  리우 젠,et al.  Maximum lifetime routing in wireless ad hoc networks , 2002 .

[43]  Johannes Gehrke,et al.  Query Processing in Sensor Networks , 2003, CIDR.

[44]  Brian D. Noble,et al.  Mobile network estimation , 2001, MobiCom '01.

[45]  S. T. Buckland,et al.  An Introduction to the Bootstrap. , 1994 .

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

[47]  Eytan Modiano,et al.  An adaptive algorithm for optimizing the packet size used in wireless ARQ protocols , 1999, Wirel. Networks.

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

[49]  Deborah Estrin,et al.  Habitat monitoring: application driver for wireless communications technology , 2001, CCRV.

[50]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[51]  Rajeev Motwani,et al.  Approximate Frequency Counts over Data Streams , 2012, VLDB.

[52]  Mark D. Yarvis,et al.  Real-world experiences with an interactive ad hoc sensor network , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[53]  R. Katz,et al.  A trace-based approach for modeling wireless channel behavior , 1996, Proceedings Winter Simulation Conference.

[54]  David E. Culler,et al.  The dynamic behavior of a data dissemination protocol for network programming at scale , 2004, SenSys '04.

[55]  H. B. Russell,et al.  Adaptive forwarding and routing in frequency-hop spread-spectrum packet radio networks with partial-band jamming , 1989, IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'.

[56]  N. Shacham,et al.  A distributed protocol for reducing neighborhood size in radio networks , 1988, IEEE International Conference on Communications, - Spanning the Universe..

[57]  Piotr Indyk,et al.  Maintaining Stream Statistics over Sliding Windows , 2002, SIAM J. Comput..

[58]  Charles L. Hedrick Rutgers.  An introduction to igrp , 1991 .

[59]  Vinny Cahill,et al.  Understanding link quality in 802.11 mobile ad hoc networks , 2004, IEEE Internet Computing.

[60]  George Varghese,et al.  New directions in traffic measurement and accounting , 2002, CCRV.

[61]  David E. Culler,et al.  System architecture directions for networked sensors , 2000, SIGP.

[62]  Deborah Estrin,et al.  Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table , 2003, Mob. Networks Appl..

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

[64]  Kishor S. Trivedi,et al.  A COMPARISON OF APPROXIMATE INTERVAL ESTIMATORS FOR THE BERNOULLI PARAMETER , 1993 .

[65]  J. Jubin,et al.  The DARPA packet radio network protocols , 1987, Proceedings of the IEEE.