On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks
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 multip...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi - SAGE Publishing
2015-08-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2015/913451 |
| _version_ | 1797706302508498944 |
|---|---|
| author | Xianlong Jiao Weidong Xiao Bin Ge Yuli Chen |
| author_facet | Xianlong Jiao Weidong Xiao Bin Ge Yuli Chen |
| author_sort | Xianlong Jiao |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-12T05:49:14Z |
| format | Article |
| id | doaj.art-1c2dccf9b26b47d8976490a3e6c2f22e |
| institution | Directory Open Access Journal |
| issn | 1550-1477 |
| language | English |
| last_indexed | 2024-03-12T05:49:14Z |
| publishDate | 2015-08-01 |
| publisher | Hindawi - SAGE Publishing |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj.art-1c2dccf9b26b47d8976490a3e6c2f22e2023-09-03T05:18:01ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772015-08-011110.1155/2015/913451913451On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor NetworksXianlong Jiao0Weidong Xiao1Bin Ge2Yuli Chen3 College of Information System and Management, National University of Defense and Technology, Changsha 410073, China College of Information System and Management, National University of Defense and Technology, Changsha 410073, China College of Information System and Management, National University of Defense and Technology, Changsha 410073, China Chongqing Guanyinqiao Elementary School, Chongqing 400020, ChinaBroadcast 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.https://doi.org/10.1155/2015/913451 |
| spellingShingle | Xianlong Jiao Weidong Xiao Bin Ge Yuli Chen On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks International Journal of Distributed Sensor Networks |
| title | On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks |
| title_full | On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks |
| title_fullStr | On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks |
| title_full_unstemmed | On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks |
| title_short | On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks |
| title_sort | on minimum latency broadcast in multichannel duty cycled wireless sensor networks |
| url | https://doi.org/10.1155/2015/913451 |
| work_keys_str_mv | AT xianlongjiao onminimumlatencybroadcastinmultichanneldutycycledwirelesssensornetworks AT weidongxiao onminimumlatencybroadcastinmultichanneldutycycledwirelesssensornetworks AT binge onminimumlatencybroadcastinmultichanneldutycycledwirelesssensornetworks AT yulichen onminimumlatencybroadcastinmultichanneldutycycledwirelesssensornetworks |