Duty-Cycle-Aware Minimum-Energy Multicasting in Wireless Sensor Networks

In duty-cycled wireless sensor networks, the nodes switch between active and dormant states, and each node may determine its active/dormant schedule independently. This complicates the Minimum-Energy Multicasting (MEM) problem, which was primarily studied in always-active wireless ad hoc networks. In this paper, we study the duty-cycle-aware MEM problem in wireless sensor networks both for one-to-many multicasting and for all-to-all multicasting. In the case of one-to-many multicasting, we present a formalization of the Minimum-Energy Multicast Tree Construction and Scheduling (MEMTCS) problem. We prove that the MEMTCS problem is NP-hard, and it is unlikely to have an approximation algorithm with a performance ratio of (1 - 0(1)) ln Δ, where Δ is the maximum node degree in a network. We propose a polynomial-time approximation algorithm for the MEMTCS problem with a performance ratio of O (H(Δ + 1)), where H(·) is the harmonic number. In the case of all-to-all multicasting, we prove that the Minimum-Energy Multicast Backbone Construction and Scheduling (MEMBCS) problem is also NP-hard and present an approximation algorithm for it, which has the same approximation ratio as that of the proposed algorithm for the MEMTCS problem. We also provide a distributed implementation of our algorithms, as well as a simple but efficient collision-free scheduling scheme to avoid packet loss. Finally, we perform extensive simulations, and the results demonstrate that our algorithms significantly outperform other known algorithms in terms of the total transmission energy cost, without sacrificing much of the delay performance.

[1]  Avi Wigderson,et al.  Improving the performance guarantee for approximate graph coloring , 1983, JACM.

[2]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[3]  Rajiv Gandhi,et al.  Minimizing broadcast latency and redundancy in ad hoc networks , 2003, MobiHoc '03.

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[5]  Weifa Liang,et al.  Approximate minimum-energy multicasting in wireless ad hoc networks , 2006, IEEE Transactions on Mobile Computing.

[6]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[7]  Chak-Kuen Wong,et al.  A faster approximation algorithm for the Steiner problem in graphs , 1986, Acta Informatica.

[8]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[9]  Weifa Liang,et al.  Minimum-energy all-to-all multicasting in wireless ad hoc networks , 2009, IEEE Transactions on Wireless Communications.

[10]  Jun Luo,et al.  Joint Sink Mobility and Routing to Maximize the Lifetime of Wireless Sensor Networks: The Case of Constrained Mobility , 2010, IEEE/ACM Transactions on Networking.

[11]  Rajiv Gandhi,et al.  Distributed algorithms for connected domination in wireless networks , 2007, J. Parallel Distributed Comput..

[12]  Xiaohua Jia,et al.  Energy efficient multicast routing in ad hoc wireless networks with discrete levels of transmission power , 2005, ICCCAS 2005.

[13]  Patrick Th. Eugster,et al.  Probabilistic reliable multicast in ad hoc networks , 2004, Ad Hoc Networks.

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[15]  Giorgio Ausiello,et al.  Structure Preserving Reductions among Convex Optimization Problems , 1980, J. Comput. Syst. Sci..

[16]  Gang Zhou,et al.  Achieving Long-Term Surveillance in VigilNet , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  Jiannong Cao,et al.  Minimum-Transmission Broadcast in Uncoordinated Duty-Cycled Wireless Ad Hoc Networks , 2010, IEEE Transactions on Vehicular Technology.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Xiaohua Jia,et al.  Dynamic Multiresolution Data Dissemination in Wireless Sensor Networks , 2009, IEEE Transactions on Mobile Computing.

[20]  Bilel Derbel,et al.  Distributed Node Coloring in the SINR Model , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[21]  Anujan Varma,et al.  Distributed algorithms for multicast path setup in data networks , 1996, TNET.

[22]  Parinya Chalermsook,et al.  Simple Distributed Algorithms for Approximating Minimum Steiner Trees , 2005, COCOON.

[23]  Antonio F. Gómez-Skarmeta,et al.  Approximating optimal multicast trees in wireless multihop networks , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[24]  Tian He,et al.  Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links , 2007, SenSys '07.

[25]  Yang Liu,et al.  Minimum-energy connected coverage in wireless sensor networks with omni-directional and directional features , 2012, MobiHoc '12.

[26]  Mario Di Francesco,et al.  Energy conservation in wireless sensor networks: A survey , 2009, Ad Hoc Networks.

[27]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[28]  Shaojie Tang,et al.  Canopy closure estimates with GreenOrbs: sustainable sensing in the forest , 2009, SenSys '09.

[29]  Patrick Th. Eugster,et al.  Route driven gossip: probabilistic reliable multicast in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[30]  Bo Jiang,et al.  Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links , 2014, IEEE Trans. Computers.

[31]  Hui Song,et al.  Routing in intermittently connected sensor networks , 2008, 2008 IEEE International Conference on Network Protocols.

[32]  Prasant Mohapatra,et al.  Power conservation and quality of surveillance in target tracking sensor networks , 2004, MobiCom '04.

[33]  Yong Yang,et al.  oCast: Optimal multicast routing protocol for wireless sensor networks , 2009, 2009 17th IEEE International Conference on Network Protocols.

[34]  Zygmunt J. Haas,et al.  Virtual backbone generation and maintenance in ad hoc network mobility management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[35]  Rashid Bin Muhammad.  Distributed Steiner Tree Algorithm and its Application in Ad Hoc Wireless Networks. , 2006 .

[36]  Feng Wang,et al.  Duty-Cycle-Aware Broadcast in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[37]  Peng-Jun Wan,et al.  Minimum-power multicast routing in static ad hoc wireless networks , 2004, IEEE/ACM Transactions on Networking.

[38]  Shudong Jin,et al.  Prediction or Not? An Energy-Efficient Framework for Clustering-Based Data Collection in Wireless Sensor Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[39]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[40]  George Havas,et al.  Distributed Algorithms for Depth-First Search , 1996, Inf. Process. Lett..

[41]  Athanasios V. Vasilakos,et al.  Compressed data aggregation for energy efficient wireless sensor networks , 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[42]  Yunhao Liu,et al.  Multiple task scheduling for low-duty-cycled wireless sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[43]  Deborah Estrin,et al.  A wireless sensor network For structural monitoring , 2004, SenSys '04.

[44]  Sudipto Guha,et al.  Approximation algorithms for directed Steiner problems , 1999, SODA '98.

[45]  Mani B. Srivastava,et al.  Topology management for sensor networks: exploiting latency and density , 2002, MobiHoc '02.

[46]  Ivan Stojmenovic,et al.  Cost-Efficient Multicast Routing in Ad Hoc and Sensor Networks , 2007, Handbook of Approximation Algorithms and Metaheuristics.