Distributed probabilistic routing for sensor network lifetime optimization

Abstract A probabilistic and distributed routing approach for multi-hop sensor network lifetime optimization is presented in this paper. In particular, each sensor self-adjusts their routing probabilities locally to their forwarders based on its neighborhood knowledge, while aiming at optimizing the overall network lifetime (defined as the elapsed time before the first node runs out of energy). The theoretical feasibility and a practical routing algorithm are presented. Specifically, a sufficient distributed condition regarding the neighborhood state for distributed probabilistic routing to achieve the optimal network lifetime is presented theoretically. Based on it, a distributed adaptive probabilistic routing (DAPR) algorithm, which considered both the transmission scheduling and the routing probability evolvement is developed. We prove quantitatively that DAPR could lead the routing probabilities of the distributed sensors to converge to an optimal state which optimizes the network lifetime. Further, when network dynamics happen, such as topology changes, DAPR can adjust the routing probabilities quickly to converge to a new state for optimizing the remained network lifetime. We presented the convergence speed of DAPR. Extensive simulations verified its convergence and near-optimal properties. The results also showed its quick adaptation to both the network topology and data rate dynamics.

[1]  Bernd Girod,et al.  A Distributed Algorithm for Congestion-Minimized Multi-Path Routing Over Ad-Hoc Networks , 2005, 2005 IEEE International Conference on Multimedia and Expo.

[2]  José D. P. Rolim,et al.  Optimal data gathering paths and energy-balance mechanisms in wireless networks , 2010, Ad Hoc Networks.

[3]  Richard Han,et al.  A node-centric load balancing algorithm for wireless sensor networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[4]  Madhav V. Marathe,et al.  Parametric probabilistic sensor network routing , 2003, WSNA '03.

[5]  Alessandro Giua,et al.  Load balancing over heterogeneous networks with gossip-based algorithms , 2009, 2009 American Control Conference.

[6]  Ru-Sheng Liu,et al.  Load Balance Based on Path Energy and Self-maintenance Routing Protocol in Wireless Sensor Networks , 2009, APNOMS.

[7]  Euhanna Ghadimi,et al.  Opportunistic Routing in Low Duty-Cycle Wireless Sensor Networks , 2014, ACM Trans. Sens. Networks.

[8]  Weifa Liang,et al.  Online Data Gathering for Maximizing Network Lifetime in Sensor Networks , 2007, IEEE Transactions on Mobile Computing.

[9]  Klara Nahrstedt,et al.  A utility-based distributed maximum lifetime routing algorithm for wireless networks , 2005, IEEE Transactions on Vehicular Technology.

[10]  K. Selçuk Candan,et al.  Power-aware single- and multipath geographic routing in sensor networks , 2007, Ad Hoc Networks.

[11]  Hui Wang,et al.  Network lifetime optimization in wireless sensor networks , 2010, IEEE Journal on Selected Areas in Communications.

[12]  Miodrag Potkonjak,et al.  Localized Probabilistic Routing for Data Gathering in Wireless Ad Hoc Networks , 2009, 2009 Seventh Annual Communication Networks and Services Research Conference.

[13]  Hyunseung Choo,et al.  Design and analysis of a multi-candidate selection scheme for greedy routing in wireless sensor networks , 2011, J. Netw. Comput. Appl..

[14]  Huang Lee,et al.  Near-lifetime-optimal data collection in wireless sensor networks via spatio-temporal load balancing , 2010, TOSN.

[15]  Li Quan Wang,et al.  Atomics Simulation of Cutting Velocity Dependency in AFM-Based Nanomachining Process , 2011 .

[16]  José D. P. Rolim,et al.  Energy optimal data propagation in wireless sensor networks , 2005, J. Parallel Distributed Comput..

[17]  Christos G. Cassandras,et al.  On maximum lifetime routing in Wireless Sensor Networks , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[18]  Sotiris E. Nikoletseas,et al.  Energy balanced data propagation in wireless sensor networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[19]  Limin Sun,et al.  Probability Based Dynamic Load-Balancing Tree Algorithm for Wireless Sensor Networks , 2005, ICCNMC.

[20]  Yuguang Fang,et al.  Multiconstrained QoS multipath routing in wireless sensor networks , 2008, Wirel. Networks.

[21]  Mohammad Hossein Yaghmaee,et al.  Energy aware multi-path and multi-SPEED routing protocol in wireless sensor networks , 2009, 2009 14th International CSI Computer Conference.

[22]  Li Yu,et al.  Distributed Lifetime Optimized Routing Algorithm for Wireless Sensor Networks , 2010 .

[23]  Divyakant Agrawal,et al.  Power aware routing for sensor databases , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[24]  Azzedine Boukerche,et al.  Close-to-optimal energy balanced data propagation via limited, local network density information , 2011, MSWiM '11.

[25]  Ritesh Madan,et al.  Distributed algorithms for maximum lifetime routing in wireless sensor networks , 2004, IEEE Transactions on Wireless Communications.

[26]  Choong Seon Hong,et al.  Load and Energy Balanced Geographic Routing for Sensor Networks , 2008, 2008 10th International Conference on Advanced Communication Technology.

[27]  Zhen Liu,et al.  Maximum lifetime routing in wireless ad-hoc networks , 2004, IEEE INFOCOM 2004.

[28]  Oleg A. Prokopyev,et al.  Maximizing the Lifetime of Query-Based Wireless Sensor Networks , 2014, ACM Trans. Sens. Networks.

[29]  José D. P. Rolim,et al.  An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks , 2006, DCOSS.

[30]  Falko Dressler,et al.  On the lifetime of wireless sensor networks , 2009, TOSN.