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