Energy-Efficient Algorithm for Multicasting in Duty-Cycled Sensor Networks

Multicasting is a fundamental network service for one-to-many communications in wireless sensor networks. However, when the sensor nodes work in an asynchronous duty-cycled way, the sender may need to transmit the same message several times to one group of its neighboring nodes, which complicates the minimum energy multicasting problem. Thus, in this paper, we study the problem of minimum energy multicasting with adjusted power (the MEMAP problem) in the duty-cycled sensor networks, and we prove it to be NP-hard. To solve such a problem, the concept of an auxiliary graph is proposed to integrate the scheduling problem of the transmitting power and transmitting time slot and the constructing problem of the minimum multicast tree in MEMAP, and a greedy algorithm is proposed to construct such a graph. Based on the proposed auxiliary graph, an approximate scheduling and constructing algorithm with an approximation ratio of 4lnK is proposed, where K is the number of destination nodes. Finally, the theoretical analysis and experimental results verify the efficiency of the proposed algorithm in terms of the energy cost and transmission redundancy.

[1]  Feng Wang,et al.  On Reliable Broadcast in Low Duty-Cycle Wireless Sensor Networks , 2012, IEEE Transactions on Mobile Computing.

[2]  Rekha Jain,et al.  Wireless Sensor Network -A Survey , 2013 .

[3]  Athanasios V. Vasilakos,et al.  A Biology-Based Algorithm to Minimal Exposure Problem of Wireless Sensor Networks , 2014, IEEE Transactions on Network and Service Management.

[4]  Hong Gao,et al.  Approximate Scheduling and Constructing Algorithms for Minimum-Energy Multicasting in Duty-Cycled Sensor Networks , 2015, 2015 International Conference on Identification, Information, and Knowledge in the Internet of Things (IIKI).

[5]  Randy Goebel,et al.  Size-constrained tree partitioning: Approximating the multicast k-tree routing problem , 2011, Theor. Comput. Sci..

[6]  Athanasios V. Vasilakos,et al.  Reliable Multicast with Pipelined Network Coding Using Opportunistic Feeding and Routing , 2014, IEEE Transactions on Parallel and Distributed Systems.

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

[8]  Tian He,et al.  Dynamic Switching-Based Data Forwarding for Low-Duty-Cycle Wireless Sensor Networks , 2011, IEEE Transactions on Mobile Computing.

[9]  Jing Gao,et al.  Composite event coverage in wireless sensor networks with heterogeneous sensors , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[10]  Zhi-Zhong Chen,et al.  A 3.4713-approximation algorithm for the capacitated multicast tree routing problem , 2009, Theor. Comput. Sci..

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

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

[13]  Athanasios V. Vasilakos,et al.  EDAL: An Energy-Efficient, Delay-Aware, and Lifetime-Balancing Data Collection Protocol for Wireless Sensor Networks , 2013, 2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems.

[14]  Tian He,et al.  Dynamic switching-based reliable flooding in low-duty-cycle wireless sensor networks , 2013, 2013 Proceedings IEEE INFOCOM.

[15]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

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

[17]  Athanasios V. Vasilakos,et al.  Directional routing and scheduling for green vehicular delay tolerant networks , 2012, Wireless Networks.

[18]  Athanasios V. Vasilakos,et al.  CDC: Compressive Data Collection for Wireless Sensor Networks , 2015, IEEE Transactions on Parallel and Distributed Systems.

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

[20]  Jinhui Xu,et al.  Spatiotemporal Delay Control for Low-Duty-Cycle Sensor Networks , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[21]  Peter Martini,et al.  A Cooperative Nearest Neighbours Topology Control Algorithm for Wireless Ad Hoc Networks , 2005, Telecommun. Syst..

[22]  H. S. Wolff,et al.  iRun: Horizontal and Vertical Shape of a Region-Based Graph Compression , 2022, Sensors.

[23]  Yang Liu,et al.  Duty-Cycle-Aware Minimum-Energy Multicasting in Wireless Sensor Networks , 2010, IEEE/ACM Transactions on Networking.

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

[25]  Athanasios V. Vasilakos,et al.  Physarum Optimization: A Biology-Inspired Algorithm for the Steiner Tree Problem in Networks , 2015, IEEE Transactions on Computers.

[26]  Athanasios V. Vasilakos,et al.  Algorithm design for data communications in duty-cycled wireless sensor networks: A survey , 2013, IEEE Communications Magazine.

[27]  Binoy Ravindran,et al.  On Multihop Broadcast over Adaptively Duty-Cycled Wireless Sensor Networks , 2010, DCOSS.

[28]  Gang Zhou,et al.  VigilNet: An integrated sensor network system for energy-efficient surveillance , 2006, TOSN.

[29]  Athanasios V. Vasilakos,et al.  Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs , 2011, Math. Comput. Model..

[30]  Zhipeng Cai,et al.  Approximate aggregation for tracking quantiles and range countings in wireless sensor networks , 2015, Theor. Comput. Sci..

[31]  Zhipeng Cai,et al.  Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks , 2014, COCOA.

[32]  Lei Yu,et al.  Energy-efficient cooperative broadcast in fading wireless networks , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[33]  Mingyan Liu,et al.  Randomly Duty-cycled Wireless Sensor Networks: Dynamics of Coverage , 2006, IEEE Transactions on Wireless Communications.

[34]  Jianzhong Li,et al.  Capacity of wireless networks with multiple types of multicast sessions , 2014, MobiHoc '14.

[35]  Guohui Lin,et al.  Improved Approximation Algorithms for the Capacitated Multicast Routing Problem , 2005, COCOON.

[36]  Bhaskar Krishnamachari,et al.  Delay constrained minimum energy broadcast in cooperative wireless networks , 2011, 2011 Proceedings IEEE INFOCOM.

[37]  Athanasios V. Vasilakos,et al.  Approximating Congestion + Dilation in Networks via "Quality of Routing" Games , 2012, IEEE Trans. Computers.

[38]  Anthony Ephremides,et al.  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).

[39]  Jianzhong Li,et al.  Drawing dominant dataset from big sensory data in wireless sensor networks , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[40]  V. ANNAPOORANI,et al.  SPATIAL REUSABILITY-AWARE ROUTING IN MULTI-HOP WIRELESS NETWORKS , 2016 .

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

[42]  Jean-Pierre Hubaux,et al.  Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues , 2002, MobiCom '02.