Critical-Path Aware Scheduling for Latency Efficient Broadcast in Duty-Cycled Wireless Sensor Networks
Minimum latency scheduling has arisen as one of the most crucial problems for broadcasting in duty-cycled Wireless Sensor Networks (WSNs). Typical solutions for the broadcast scheduling iteratively search for nodes able to transmit a message simultaneously. Other nodes are prevented from transmissio...
Main Authors: | Duc-Tai Le, Giyeol Im, Thang Le Duc, Vyacheslav V. Zalyubovskiy, Dongsoo S. Kim, Hyunseung Choo |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2018-01-01
|
Series: | Wireless Communications and Mobile Computing |
Online Access: | http://dx.doi.org/10.1155/2018/5017319 |
Similar Items
-
Delay-sensitive flooding based on expected path quality in low duty-cycled wireless sensor networks
by: Dung Tien Nguyen, et al.
Published: (2016-08-01) -
Delay-aware tree construction and scheduling for data aggregation in duty-cycled wireless sensor networks
by: Duc Tai Le, et al.
Published: (2018-05-01) -
Delay-Aware Reverse Approach for Data Aggregation Scheduling in Wireless Sensor Networks
by: Dung T. Nguyen, et al.
Published: (2019-10-01) -
LNDIR: A lightweight non-increasing delivery-latency interval-based routing for duty-cycled sensor networks
by: Muhammad K Shahzad, et al.
Published: (2018-04-01) -
On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks
by: Xianlong Jiao, et al.
Published: (2015-08-01)