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

Abstract

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.

Delay-constrained flooding in extremely low-duty-cycle sensor networks

“…For such NP-hard problem, both approximate and distributed heuristics have been developed. Jiao et al 7 devise a schedule algorithm in order to achieve minimum latency broadcasting without signal interference in multi-channel, duty-cycle sensor networks. All these solutions are based on the working reschedule of sensors, which may not be practical in the real-time applications.…”

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

“…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.…”

“…The MLBSDC problem rises as one of the most crucial problem for broadcasting in duty-cycled networks. Many research efforts have been made in literature to tackle the problem under different network settings, such as single channel [19-22, 26, 29], multichannel [24,28], and unreliable links [23,25,30]. Table 1 summarizes the characteristics of the broadcasting algorithms in duty-cycled WSNs.…”

“…The MLBS problem in duty-cycled WSNs gets more complex and has been proved as a NP-hard problem [19]. [19] No No No Yes Vector-Iteration Algorithm [20] No No No Yes One-To-All Broadcast [21] No No No Yes Latency-Aware Broadcast Scheduling [22] No No No Yes Opportunistic flooding [23] No Yes No Yes NAB [24] Yes No No Yes Delay-Driven-Tree-based opportunistic flooding [25] No Yes No Yes Load-Balanced Parents Assignment Algorithm [26] No No No No MultiChannel Broadcast [28] Yes No No Yes Degree-based Collision Tolerant Scheduling [29] No No No Yes Minimum-Delay Energy-efficient flooding Tree [30] No Yes No Yes…”

“…Throughout the literature, the MLBS in duty-cycle (MLB-SDC) problem has been richly explored [19][20][21][22][23][24][25][26][27][28][29][30]. The existing solutions typically aim to find a subset of nodes that can simultaneously transmit a message at a time slot so that the number of collision-free receptions in the time slot is maximized.…”