Towards broadcast redundancy minimization in duty‐cycled wireless sensor networks

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

doi:10.1002/dac.3108

Cited by 6 publications

(6 citation statements)

References 46 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%

“…We vary the duty cycle of the network, via the number of time slots τ in a working period. The duty cycles used in our simulation are 50, 33.33, 25, 20, 12.5, 10, 6.67, 5, 3.33, 2, 1.25, and 1%, corresponding to τ = 2, 3,4,5,8,10,15,20,30,50,80, and 100, respectively. Here, an active time slot of each node is randomly and independently determined between time slots 0 and τ − 1 [27].…”

Section: Simulation Evaluationmentioning

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 2 more Smart Citations

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: Simulation Evaluationmentioning

confidence: 99%

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

show abstract

“…However, the above-mentioned algorithms fail to capture the intermittently connected characteristic of duty-cycled networks. Several issues for broadcasting in duty-cycled networks have been explored, such as minimum latency [19][20][21][22][23][24][25][26][28][29][30], minimum number of transmissions [31][32][33][34], and energy-saving [35,36]. The MLBSDC problem rises as one of the most crucial problem for broadcasting in duty-cycled networks.…”

Section: Related Workmentioning

confidence: 99%

Critical‐Path Aware Scheduling for Latency Efficient Broadcast in Duty‐Cycled Wireless Sensor Networks

Duc

et al. 2018

Wireless Communications and Mobile Computing

Self Cite

View full text Add to dashboard Cite

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 transmissions to ensure that there is no collision in a network. Such collision-preventions result in extra delays for a broadcast and may increase overall latency if the delays occur along critical paths of the network. To facilitate the broadcast latency minimization, we propose a novel approach, critical-path aware scheduling (CAS), which schedules transmissions with a preference of nodes in critical paths of a duty-cycled WSN. This paper presents two schemes employing CAS which produce collision-free and collision-tolerant broadcast schedules, respectively. The collision-free CAS scheme guarantees an approximation ratio of (Δ-1)T in terms of latency, where Δ denotes the maximum node degree in a network. By allowing collision at noncritical nodes, the collision-tolerant CAS scheme reduces up to 10.2 percent broadcast latency compared with the collision-free ones while requiring additional transmissions for the noncritical nodes experiencing collisions. Simulation results show that broadcast latencies of the two proposed schemes are significantly shorter than those of the existing methods.

show abstract

“…Deterministic broadcast scheme includes tree-based scheme, [28][29][30][31] connected dominating set (CDS), and neighbor elimination-based scheme. [32][33][34][35][36][37][38][39][40][41] Tree-based schemes construct a routing tree on which broadcast messages are forwarded.…”

Section: Introductionmentioning

confidence: 99%

A neighbor knowledge and velocity-based broadcast scheme for wireless ad hoc networks

Dong

2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

A neighbor knowledge-based broadcast scheme is proposed to reduce the latency for wireless ad hoc networks, yet keeping the overhead at a reasonably low level and fulfilling the reliability. In the scheme, few Hello messages are interchanged to collect one-hop neighbor information. The collected information is used to calculate the neighbor density, the ratio, and the number of one-hop uncovered neighbors, upon which the rebroadcast probability and delay are adjusted adaptively. The way that the rebroadcast probability and delay are defined in neighbor knowledge-based broadcast scheme reduces the transmission overhead and restrains the traffic aggregation effectively. Next, a velocity-based data distribution mechanism is proposed and extended to neighbor knowledge-based broadcast scheme to further reduce the latency, forming neighbor knowledge and velocity-based broadcast scheme. It is stipulated that few highervelocity nodes are employed with bigger probability to rebroadcast the incoming message. The performance of the schemes is evaluated by the simulation under diverse network configurations. The results show that they outperform the existing broadcast schemes in overhead and especially in average end-to-end delay. Compared with flooding, they reduce the overhead by 88.4% and the average end-to-end delay by 88.9% at most. KeywordsWireless ad hoc networks, rebroadcast probability, rebroadcast delay, normalized broadcast overhead, average end-toend delay, packet delivery ratio Date

show abstract

Towards broadcast redundancy minimization in duty‐cycled wireless sensor networks

Cited by 6 publications

References 46 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

Critical‐Path Aware Scheduling for Latency Efficient Broadcast in Duty‐Cycled Wireless Sensor Networks

A neighbor knowledge and velocity-based broadcast scheme for wireless ad hoc networks

Contact Info

Product

Resources

About