On Multihop Broadcast over Adaptively Duty-Cycled Wireless Sensor Networks

Lai, Shouwen; Ravindran, Binoy

doi:10.1007/978-3-642-13651-1_12

Cited by 33 publications

(21 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In recent years, a number of works that focus on energy-efficient broadcast scheduling problem in low-duty-cycle WSNs have been proposed [3][4][5][6][7][8][9][10][11][12][13]. Hong et al [4] studied the Minimum-Transmission Broadcast problem in uncoordinated duty-cycled networks and proved its NP-hardness.…”

Section: Related Workmentioning

confidence: 99%

Towards energy-fairness for broadcast scheduling with minimum delay in low-duty-cycle sensor networks

Zhu

Dai

et al. 2016

Computer Communications

View full text Add to dashboard Cite

a b s t r a c tBroadcast scheduling for low-duty-cycle wireless sensor networks (WSNs) has been extensively studied recently. However, existing solutions mainly focused on optimizing delay and (or) total energy consumption without considering load distribution among nodes. Due to limited energy supply for sensor nodes, heavily loaded sensors often run out of energy quickly, reducing the lifetime of the whole network. In this paper, we target at minimizing the maximum transmission load of a broadcast schedule for low-duty-cycle WSNs, subject to the constraint that each node should have the minimum end-to-end delay under the broadcast schedule. We prove that it is NP-hard to find the optimal schedule. Then, we devise a Load-Balanced Parents Assignment Algorithm (LBPA-A) that achieves λ-approximation ratio, where λ denotes the maximum number of neighbors that are scheduled to wake up at the same time and is typically a small number in low-dutycycle WSNs. Further, we introduce how to solve this problem in a distributed manner. Our simulation results reveal that compared with the traditional solutions, our proposed LBPA-A and distributed solution both exhibit much better average performance in terms of energy-fairness, total energy consumption and delivery ratio.

show abstract

Section: Related Workmentioning

confidence: 99%

Towards energy-fairness for broadcast scheduling with minimum delay in low-duty-cycle sensor networks

Zhu

Dai

et al. 2016

Computer Communications

View full text Add to dashboard Cite

show abstract

“…In [16], a delay-driven opportunistic flooding method is designed for low-duty-cycle wireless sensor networks with unreliable links. Multihop broadcast protocols for duty-cycled wireless sensor networks are proposed in [27][28]. In addition, several dutycycle-aware broadcast algorithms are proposed in [17,29].…”

Section: Related Workmentioning

confidence: 99%

Minimum-Time Aggregation Scheduling in Duty-Cycled Wireless Sensor Networks

2011

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

Aggregation is an important and commonplace operation in wireless sensor networks. Due to wireless interferences, aggregation in wireless sensor networks often suffers from packet collisions. In order to solve the collision problem, aggregation scheduling is extensively researched in recent years. In many sensor network applications such as real-time monitoring, aggregation time is the most concerned performance. This paper considers the minimum-time aggregation scheduling problem in duty-cycled wireless sensor networks for the first time. We show that this problem is NP-hard and present an approximation algorithm based on connected dominating set. The theoretical analysis shows that the proposed algorithm is a nearly-constant approximation. Simulation shows that the scheduling algorithm has a good performance.

show abstract

“…ADB [16] optimizes the broadcast for asynchronous duty-cycle WSNs through transmission task delegation, so as to avoid transmissions over poor links. Lai et al [30] present hybridcast, an asynchronous and multihop broadcasting protocol, which reduces redundant transmission via delivery deferring and online forwarder selection. Wang et al [15] extend the dynamic switch-based unicasting design in [13], [31] to the flooding scenario, then transform the duty-cycle-aware broadcast problem into a shortest path problem.…”

Section: Related Workmentioning

confidence: 99%

Dynamic switching-based reliable flooding in low-duty-cycle wireless sensor networks

Cheng

Gü

et al. 2013

2013 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-Reliable flooding in wireless sensor networks (WSNs) is desirable for a broad range of applications and network operations, and has been extensively investigated. However, relatively little work has been done for reliable flooding in lowduty-cycle WSNs with unreliable wireless links. It is a challenging problem to efficiently ensure 100% flooding coverage considering the combined effects of low-duty-cycle operation and unreliable wireless transmission. In this work, we propose a novel dynamic switching-based reliable flooding (DSRF) framework, which is designed as an enhancement layer to provide efficient and reliable delivery for a variety of existing flooding tree structures in lowduty-cycle WSNs. The key novelty of DSRF lies in the dynamic switching decision making when encountering a transmission failure, where a flooding tree structure is dynamically adjusted based on the packet reception results for energy saving and delay reduction. DSRF is distinctive from existing works in that it explores both poor links and good links on demand. Through comprehensive performance comparisons, we demonstrate that, compared with the flooding protocol without DSRF enhancement, DSRF effectively reduces the flooding delay and the total number of packet transmission by 12% ∼ 25% and 10% ∼ 15%, respectively. Remarkably, the achieved performance is close to the theoretical lower bound.

show abstract

On Multihop Broadcast over Adaptively Duty-Cycled Wireless Sensor Networks

Cited by 33 publications

References 22 publications

Towards energy-fairness for broadcast scheduling with minimum delay in low-duty-cycle sensor networks

Towards energy-fairness for broadcast scheduling with minimum delay in low-duty-cycle sensor networks

Minimum-Time Aggregation Scheduling in Duty-Cycled Wireless Sensor Networks

Dynamic switching-based reliable flooding in low-duty-cycle wireless sensor networks

Contact Info

Product

Resources

About