Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks

A simple random walk (SRW) has been considered as an effective forwarding method for many applications in wireless sensor networks (WSNs) due to its desirable properties. However, a critical downside of SRW - slow diffusion or exploration over the space, typically leads to longer packet delay and undermines its own benefits. Such slow-mixing problem becomes even worse under random duty cycling adopted for energy conservation. In this paper, we study how to overcome this problem without any sacrifice or tradeoff, and propose a simple modification of random duty cycling, named Smart Sleep, which achieves more power-saving as well as faster packet diffusion (or smaller delay) while retaining the benefits of SRW. We also introduce a class of p-backtracking random walks and establish its properties to analytically explain the fast packet diffusion induced by Smart Sleep. We further obtain a necessary condition to achieve an optimal performance under our Smart Sleep, and finally demonstrate remarkable performance improvement via independent simulation results over various network topologies.

[1]  Fang Chen,et al.  Lifting Markov chains to speed up mixing , 1999, STOC '99.

[2]  Sanjay Shakkottai,et al.  Asymptotics of query strategies over a sensor network , 2004, IEEE INFOCOM 2004.

[3]  Chen Avin,et al.  Efficient and robust query processing in dynamic environments using random walk techniques , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[4]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[5]  Wade Trappe,et al.  Enhancing Source-Location Privacy in Sensor Network Routing , 2005, ICDCS.

[6]  Bhaskar Krishnamachari,et al.  The power of choice in random walks: an empirical study , 2006, MSWiM '06.

[7]  E. Coyle,et al.  Stochastic Properties of Mobility Models in Mobile Ad Hoc Networks , 2006 .

[8]  Anne-Marie Kermarrec,et al.  Peer counting and sampling in overlay networks: random walk methods , 2006, PODC '06.

[9]  Wen J. Li,et al.  Accelerating Distributed Consensus Via Lifting Markov Chains , 2007, 2007 IEEE International Symposium on Information Theory.

[10]  N. Alon,et al.  Non-backtracking random walks mix faster , 2006, math/0610550.

[11]  Baochun Li,et al.  Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[12]  Gwillerm Froc,et al.  Random walk based routing protocol for wireless sensor networks , 2007, Valuetools 2007.

[13]  Gwillerm Froc,et al.  Random walk based routing protocol for wireless sensor networks , 2007, ValueTools '07.

[14]  Do Young Eun,et al.  Toward stochastic anatomy of inter-meeting time distribution under general mobility models , 2008, MobiHoc '08.

[15]  Prithwish Basu,et al.  Opportunistic forwarding in wireless networks with duty cycling , 2008, CHANTS '08.

[16]  Julinda Stefa,et al.  Routing in Outer Space: Fair Traffic Load in Multihop Wireless Networks , 2009, IEEE Transactions on Computers.

[17]  Prithwish Basu,et al.  Exact Analysis of Latency of Stateless Opportunistic Forwarding , 2009, IEEE INFOCOM 2009.

[18]  Do Young Eun,et al.  Superdiffusive Behavior of Mobile Nodes and Its Impact on Routing Protocol Performance , 2010, IEEE Transactions on Mobile Computing.