Reliable transfer on wireless sensor networks

Many applications in wireless sensor networks, including structure monitoring, require collecting all data without loss from the nodes. End-to-end retransmission, which is used in the Internet for reliable transport, becomes very inefficient in wireless sensor networks, since wireless communication, and constrained resources pose new challenges. We look at factors affecting reliability, and search for efficient combinations of the possible options. Information redundancy like retransmission, and erasure codes, can be used. Route fix, which tries alternative next hop after some failures, also reduces packet loss. We implemented and evaluated these options on a real test bed of Berkeley Mica2Dot motes. Our experimental results show that each option overcomes different kinds of failures. Link-level retransmission is efficient but limited in achieving reliability. Erasure code enables very high reliability by tolerating packet losses. Route fix responds to link failures quickly. Previous work had found it difficult to increase reliability past a certain threshold. We show that the right combination of primitives can yield more than 99% reliability with low overhead, providing a viable alternative to end-to-end retransmission over multiple hops.

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

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

[3]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

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

[5]  Young-Jin Kim,et al.  Practical and robust geographic routing in wireless networks , 2004, SenSys '04.

[6]  Luigi Rizzo,et al.  Effective erasure codes for reliable computer communication protocols , 1997, CCRV.

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

[8]  P. Maymounkov Online codes , 2002 .

[9]  M. Maróti,et al.  Title: the Directed Flood Routing Framework Author: Miklos Maroti Directed Flood-routing Framework , 2004 .

[10]  G. Tolle,et al.  Deluge : Data Dissemination for Network Reprogramming at Scale , 2022 .

[11]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[12]  David E. Culler,et al.  Beacon vector routing: Scalable point-to-point in wireless sensornets , 2004 .

[13]  Marek Karpinski,et al.  An XOR-based erasure-resilient coding scheme , 1995 .

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

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

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

[17]  John Heidemann,et al.  RMST: reliable data transport in sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

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

[19]  Chieh-Yih Wan,et al.  PSFQ: a reliable transport protocol for wireless sensor networks , 2002, WSNA '02.