Exploring energy-latency trade-off for broadcast in duty-cycled Wireless Sensor Networks

Broadcast plays an important role and is widely used in Wireless Sensor Networks (WSNs). Several problems of the broadcast have been intensively addressed in the literature, such as minimizing energy consumption and minimizing broadcast latency. The existing broadcast schedules show that there is a trade off between the energy consumption and the broadcast latency. Finding a broadcast schedule minimizing both the aspects is impossible. The broadcast schedule which minimizes the energy suffers from the high delay time and vice versa. To facilitate seeking a balance between the energy and the latency, the paper proposes a novel concept of criticality which is a combination of lengths of shortest paths and node degree information. The proposed broadcast scheduling scheme enables flexible control toward the quality of a broadcast.

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

[2]  Shouling Ji,et al.  Generalized broadcast scheduling in duty-cycle multi-hop wireless networks , 2011, 30th IEEE International Performance Computing and Communications Conference.

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

[4]  WangXiaodong,et al.  Minimum Latency Broadcast Scheduling in Duty-Cycled Multihop Wireless Networks , 2012 .

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

[6]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[7]  Hyunseung Choo,et al.  Critical-path aware broadcast scheduling in duty-cycled Wireless Sensor Networks , 2015, 2015 International Conference on Information Networking (ICOIN).

[8]  Xiaodong Wang,et al.  Minimum Latency Broadcast Scheduling in Duty-Cycled Multihop Wireless Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[9]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..