Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless Networks
Broadcasting is a fundamental function for disseminating messages in multihop wireless networks. Minimum-Transmission Broadcasting (MTB) problem aims to find a broadcast schedule with minimum number of transmissions. Previous works on MTB in duty-cycled networks exploit a rigid assumption that nodes...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2019-01-01
|
Series: | Wireless Communications and Mobile Computing |
Online Access: | http://dx.doi.org/10.1155/2019/5064109 |
id |
doaj-d6773ba008c84ae8ab47c43a28fc6ff8 |
---|---|
record_format |
Article |
spelling |
doaj-d6773ba008c84ae8ab47c43a28fc6ff82020-11-25T00:30:17ZengHindawi-WileyWireless Communications and Mobile Computing1530-86691530-86772019-01-01201910.1155/2019/50641095064109Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless NetworksQuan Chen0Tao Wang1Lianglun Cheng2Yongchao Tao3Hong Gao4School of Computers, Guangdong University of Technology, Guangzhou, ChinaSchool of Computers, Guangdong University of Technology, Guangzhou, ChinaSchool of Computers, Guangdong University of Technology, Guangzhou, ChinaShenzhen Academy of Aerospace Technology, ChinaSchool of Computer Science and Technology, Harbin Institute of Technology, ChinaBroadcasting is a fundamental function for disseminating messages in multihop wireless networks. Minimum-Transmission Broadcasting (MTB) problem aims to find a broadcast schedule with minimum number of transmissions. Previous works on MTB in duty-cycled networks exploit a rigid assumption that nodes have only active time slot per working cycle. In this paper, we investigated the MTB problem in duty-cycled networks where nodes are allowed arbitrary active time slots per working cycle (MTBDCA problem). Firstly, it is proved to be NP-hard and o(lnΔ)-inapproximable, where Δ is the maximum degree in the network. Secondly, an auxiliary graph is proposed to integrate nodes’ active time slots into the network and a novel covering problem is proposed to exploit nodes’ multiple active time slots for scheduling. Then, a ln(Δ+1)-approximation algorithm is proposed for MTBDCA and a (ln(Δ+1)+Δ)-approximation algorithm is proposed for all-to-all MTBDCA. Finally, extensive experimental results demonstrate the efficiency of the proposed algorithm.http://dx.doi.org/10.1155/2019/5064109 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Quan Chen Tao Wang Lianglun Cheng Yongchao Tao Hong Gao |
spellingShingle |
Quan Chen Tao Wang Lianglun Cheng Yongchao Tao Hong Gao Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless Networks Wireless Communications and Mobile Computing |
author_facet |
Quan Chen Tao Wang Lianglun Cheng Yongchao Tao Hong Gao |
author_sort |
Quan Chen |
title |
Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless Networks |
title_short |
Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless Networks |
title_full |
Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless Networks |
title_fullStr |
Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless Networks |
title_full_unstemmed |
Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless Networks |
title_sort |
energy-efficient broadcast scheduling algorithm in duty-cycled multihop wireless networks |
publisher |
Hindawi-Wiley |
series |
Wireless Communications and Mobile Computing |
issn |
1530-8669 1530-8677 |
publishDate |
2019-01-01 |
description |
Broadcasting is a fundamental function for disseminating messages in multihop wireless networks. Minimum-Transmission Broadcasting (MTB) problem aims to find a broadcast schedule with minimum number of transmissions. Previous works on MTB in duty-cycled networks exploit a rigid assumption that nodes have only active time slot per working cycle. In this paper, we investigated the MTB problem in duty-cycled networks where nodes are allowed arbitrary active time slots per working cycle (MTBDCA problem). Firstly, it is proved to be NP-hard and o(lnΔ)-inapproximable, where Δ is the maximum degree in the network. Secondly, an auxiliary graph is proposed to integrate nodes’ active time slots into the network and a novel covering problem is proposed to exploit nodes’ multiple active time slots for scheduling. Then, a ln(Δ+1)-approximation algorithm is proposed for MTBDCA and a (ln(Δ+1)+Δ)-approximation algorithm is proposed for all-to-all MTBDCA. Finally, extensive experimental results demonstrate the efficiency of the proposed algorithm. |
url |
http://dx.doi.org/10.1155/2019/5064109 |
work_keys_str_mv |
AT quanchen energyefficientbroadcastschedulingalgorithmindutycycledmultihopwirelessnetworks AT taowang energyefficientbroadcastschedulingalgorithmindutycycledmultihopwirelessnetworks AT liangluncheng energyefficientbroadcastschedulingalgorithmindutycycledmultihopwirelessnetworks AT yongchaotao energyefficientbroadcastschedulingalgorithmindutycycledmultihopwirelessnetworks AT honggao energyefficientbroadcastschedulingalgorithmindutycycledmultihopwirelessnetworks |
_version_ |
1725327658267443200 |