LABS: Latency aware broadcast scheduling in uncoordinated Duty-Cycled Wireless Sensor Networks

Le, Duc-Tai; Duc, Thang Le; Zalyubovskiy, Vyacheslav V.; Kim, Dongsoo S.; Choo, Hyunseung

doi:10.1016/j.jpdc.2014.07.011

Cited by 19 publications

(22 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the periodic sleeping of every node in duty-cycled WSNs, minimizing delay is one of the most important issues in such networks [15][16][17][18][19][20][21][22]. In order to reduce the latency of a data aggregation in duty-cycled WSNs, several approaches have been proposed.…”

Section: Related Workmentioning

confidence: 99%

“…In a duty-cycled WSN, every sensor node periodically alternates between active and sleeping states. In addition to a reduction of energy consumption, the periodic sleeping of sensor nodes yields a notable increase in communication delay compared with that of always-active networks [15][16][17][18][19][20][21][22]. This is because a sensor node has to wait until its receiver wakes up before transmitting a packet.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Delay-aware tree construction and scheduling for data aggregation in duty-cycled wireless sensor networks

Lee

Choo

2018

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

Data aggregation is one of the most essential operations in wireless sensor networks (WSNs), in which data from all sensor nodes is collected at a sink node. A lot of studies have been conducted to assure collision-free data delivery to the sink node, with the goal of minimizing aggregation delay. The minimum delay data aggregation problem gets more complex when recent WSNs have adopted the duty cycle scheme to conserve energy and to extend the network lifetimes. The reason is that the duty cycle yields a notable increase of communication delay, beside a reduction of energy consumption, due to the periodic sleeping periods of sensor nodes. In this paper, we propose a novel data aggregation scheme that minimizes the data aggregation delay in duty-cycled WSNs. The proposed scheme takes the sleeping delay between sensor nodes into account to construct a connected dominating set (CDS) tree in the first phase. The CDS tree is used as a virtual backbone for efficient data aggregation scheduling in the second phase. The scheduling assigns the fastest available transmission time for every sensor node to deliver all data collision-free to the sink. The simulation results show that our proposed scheme reduces data aggregation delay by up to 72% compared to previous work. Thanks to data aggregation delay reduction, every sensor node has to work shorter and the network lifetime is prolonged.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Delay-aware tree construction and scheduling for data aggregation in duty-cycled wireless sensor networks

Lee

Choo

2018

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

show abstract

“…The approximation ratio of VIA is Δ| T | (Δ denotes the maximum out degree of nodes in a network). Another work for the MLBSDC problem achieves a lower broadcast latency compared with one‐to‐all broadcast algorithm. The improvement is attained thanks to a scheduling method for increasing the number of concurrent transmissions within a working period.…”

Section: Related Workmentioning

confidence: 99%

Towards broadcast redundancy minimization in duty‐cycled wireless sensor networks

Duc

Zalyubovskiy

et al. 2016

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary Broadcast is an essential operation in wireless sensor networks. Because of the necessity of energy conservation, minimizing the number of transmissions is always a challenging issue in broadcasting scheme design. This paper studies the minimum‐transmission broadcast problem in duty‐cycled wireless sensor networks where each sensor operates under active/dormant cycles. To address the problem, our proposed scheme, Broadcast Redundancy Minimization Scheduling (BRMS), finds a set of forwarding nodes, which minimizes the number of broadcast transmissions. Then, it constructs a forest of sub‐trees based on the relationship between each forwarding node and its corresponding receivers. A broadcast tree is constructed ultimately by connecting all sub‐trees with a minimum number of connectors. Theoretical analysis shows that BRMS obtains a lower approximation ratio as well as time complexity compared with existing schemes. A set of extensive simulations is conducted to evaluate the performance of BRMS. The results reveal that BRMS outperforms others and its solution is close to the lower bound of the problem in terms of the total number of transmissions. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

“…The proposed scheme schedules a broadcast with a preference of nodes along the critical paths of a network to minimize the broadcast latency. It worth noting that a node can receive a message only in its active time slot, thus the minimum latency between a sender  and its receiver , later on called latency cost, can be determined by their active time slots [4], as follows:…”

Section: Proposed Schemementioning

confidence: 99%

“…The proposed scheduling scheme is evaluated by the simulation configured similar to the one in [3,4]. All sensor nodes are deployed in a square area of 200m × 200m.…”

Section: Performance Evaluationmentioning

confidence: 99%

Critical-path aware broadcast scheduling in duty-cycled Wireless Sensor Networks

Choo

et al. 2015

2015 International Conference on Information Networking (ICOIN)

Self Cite

View full text Add to dashboard Cite

Message broadcasting is an essential and widely-used operation in multi-hop Wireless Sensor Networks (WSNs). Minimum latency broadcast scheduling (MLBS) aims to achieve a schedule to broadcast messages with a minimum latency. In duty-cycle networks, a node alternates between active and sleep states, which causes decrease in energy consumption at the cost of increased broadcast latency. An existing scheme mathematically remodels the MLBS problem for duty-cycled WSNs and proposes a vector integration algorithm to solve the problem. In this paper, we propose a broadcast scheduling scheme by first finding critical-paths in a duty-cycled WSN. By scheduling transmissions with a preference of nodes in the critical-path, the proposed scheme reduces the broadcast latency as shown in the simulation results.

show abstract

LABS: Latency aware broadcast scheduling in uncoordinated Duty-Cycled Wireless Sensor Networks

Cited by 19 publications

References 24 publications

Delay-aware tree construction and scheduling for data aggregation in duty-cycled wireless sensor networks

Delay-aware tree construction and scheduling for data aggregation in duty-cycled wireless sensor networks

Towards broadcast redundancy minimization in duty‐cycled wireless sensor networks

Critical-path aware broadcast scheduling in duty-cycled Wireless Sensor Networks

Contact Info

Product

Resources

About