Fast Group Communication Scheduling in Duty-Cycled Multihop Wireless Sensor Networks

Xu, Xiaoli; Cao, Jiannong; Wan, Peng‐Jun

doi:10.1007/978-3-642-31869-6_17

Cited by 18 publications

(9 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The broadcast problem in duty-cycled scenarios has been studied in [19][20][21][22][23][24][25]. The MLB problem in duty-cycled scenarios is investigated in [19,20,24,25].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks

Jiao

Xiao

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Broadcast has critical significance for wide application of wireless sensor networks (WSNs). Minimum-latency broadcast (MLB) studies how to devise a broadcast schedule, which can achieve minimum broadcast latency with no signal interference. In multichannel duty-cycled WSNs, nodes can exploit multiple channels to communicate and periodically fall asleep after working for some time. Nevertheless, most solutions to the MLB problem either focus on nonsleeping scenarios or only exploit one single channel. Therefore, we investigate the MLB problem in multichannel duty-cycled WSNs in this paper and call this problem as MLBCD problem. We prove that MLBCD problem is NP-hard. We propose a new concept of active interference graph (AIG). Based on AIG, we present one novel approximation broadcast algorithm called NAB to solve the MLBCD problem. We prove that our proposed NAB algorithm achieves provable performance guarantee. The results of our extensive evaluations show that NAB algorithm can significantly improve the broadcast latency.

show abstract

“…The broadcast problem in duty-cycled scenarios has been studied in [19][20][21][22][23][24][25]. The MLB problem in duty-cycled scenarios is investigated in [19,20,24,25].…”

Section: Related Workmentioning

confidence: 99%

“…The MLB problem in duty-cycled scenarios is investigated in [19,20,24,25]. Hong et al [19] propose ELAC-SC algorithm, which achieves a ratio of ( 2 ), and the constant before 2 is 4| |.…”

Section: Related Workmentioning

confidence: 99%

On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks

Jiao

Xiao

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…To this end, only a handful of papers [21][22][23] have tried to address the MLBS problem in duty-cycled wireless networks, and even worse, all of these works only study the problem under the RTS/CTS model. Hong et al [21] prove that the MLBS problem in duty-cycled wireless networks is NP-hard and proposed two approximation algorithms with an approximation ratio of O(( 2 + 1)T) and 24T +1 respectively, where is the maximum degree.…”

Section: Related Workmentioning

confidence: 99%

“…Also, they showed that the total number of transmissions scheduled by OTAB is at most 15 times larger than the minimum number of transmissions. Recently, Xu et al [23] extended the pipelined broadcast scheme in [8] to consider duty-cycled WSNs. Their broadcast algorithm produces a latency of at most TR + TO(log 2 R), where the omitted constant in TO(log 2 R) also exceeds 150.…”

Section: Related Workmentioning

confidence: 99%

A distributed broadcast algorithm for duty-cycled networks with physical interference model

Zhao

Chin

2015

J Wireless Com Network

View full text Add to dashboard Cite

Broadcast is a fundamental operation in multi-hop wireless networks. Given a source node with a message to broadcast, the objective is to propagate the message to all nodes in an interference-free manner while incurring minimum latency. This problem, called Minimum-Latency Broadcast Scheduling (MLBS), has been studied extensively in wireless networks whereby nodes remain on all times and has been shown to be NP-hard. However, only a few studies have addressed this problem in the context of duty-cycled wireless networks, which unfortunately, remains NP-hard. In these networks, nodes do not wake up simultaneously, and hence, not all neighbors of a transmitting node will receive a broadcast message at the same time, meaning multiple transmissions may be necessary. Moreover, most of these studies addressed the MLBS problem over the idealistic protocol interference model. Henceforth, this paper considers MLBS for duty-cycled wireless networks under the physical interference model and presents an approximation algorithm called hexagon-based broadcast algorithm (HBA), which has a constant ratio in terms of broadcast latency and transmission times. We have evaluated HBA in different network configurations, and the results show that the latencies achieved by our algorithm are much lower than existing schemes. In particular, HBA manages to half the broadcast latency achieved by the state-of-the-art tree-based algorithm.

show abstract

“…Duan et al [22] provide a generalized algorithm for the MLBSDC problem with an approximation ratio of T. They transform the MLBSDC problem into the conventional maximum independent set problem and try to find a maximum set of non-interfering senders in each time slot. Recently, Xu et al [23] extended the pipelined broadcast scheme in [16] to consider duty cycled WSNs. Their broadcast algorithm produces a latency of at most TH + TO(log 2 H), where the omitted constant in TO(log 2 H) also exceeds 150; in contrast, our solution has 108 as a constant in TO(log 2 H).…”

Section: Related Workmentioning

confidence: 99%

Approximation algorithm for data broadcasting in duty cycled multi-hop wireless networks

Zhao

Chin

2013

J Wireless Com Network

View full text Add to dashboard Cite

Broadcast is a fundamental operation in wireless networks. To this end, many past studies have studied the NP-hard, broadcast problem for always-on multi-hop networks. However, in wireless sensor networks, nodes are powered by batteries, meaning, they have finite energy. Consequently, nodes are required to have a low duty cycle, whereby they switch between active and sleep state periodically. This means that a transmission from a node may not reach all of its neighbors simultaneously. Consequently, any developed broadcast protocols must consider collisions and the wakeup times of neighboring nodes. Henceforth, this paper studies the minimum latency broadcast scheduling problem in duty cycled multi-hop wireless networks (MLBSDC), which remains NP hard. The MLBSDC problem aims to find a collision-free schedule that minimizes the time in which the last node receives a broadcast message. We propose a novel algorithm called CFBS that allows nodes in different layers of the broadcast tree to transmit simultaneously. We prove that CFBS produces a latency of at most (T + 1)H + T O(log 2 H). Here, T denotes the number of time slots in a scheduling period, and H is the optimal broadcast latency obtained from the shortest path tree algorithm assuming no collision. We also show that the total number of transmissions is at most 4(T + 2) times larger than the optimal value. The results from extensive simulation show that CFBS has a better performance than OTAB, the best broadcast scheduling algorithm to date. In particular, the broadcast latency achieved by CFBS is up to 3 20 that of OTAB.

show abstract

Fast Group Communication Scheduling in Duty-Cycled Multihop Wireless Sensor Networks

Cited by 18 publications

References 21 publications

On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks

On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks

A distributed broadcast algorithm for duty-cycled networks with physical interference model

Approximation algorithm for data broadcasting in duty cycled multi-hop wireless networks

Contact Info

Product

Resources

About