Minimum-Latency Broadcast Schedule in Duty-Cycled Multihop Wireless Networks Subject to Physical Interference

2014 ◽  
Author(s):  
Lixin Wang ◽  
Brandon Banks ◽  
Kyle Yang
Keyword(s):  
Wireless Networks ◽  
Multihop Wireless Networks ◽  
Multihop Wireless ◽  
Physical Interference ◽  
Minimum Latency ◽  
Broadcast Schedule

scholarly journals Link scheduling for throughput maximization in multihop wireless networks under physical interference

2016 ◽  
Vol 23 (8) ◽  
pp. 2415-2430 ◽  
Author(s):  
Yaqin Zhou ◽  
Xiang-Yang Li ◽  
Min Liu ◽  
Zhongcheng Li ◽  
Xiaohua Xu
Keyword(s):  
Wireless Networks ◽  
Multihop Wireless Networks ◽  
Throughput Maximization ◽  
Link Scheduling ◽  
Multihop Wireless ◽  
Physical Interference

Minimum Latency Broadcast Scheduling in Duty-Cycled Multihop Wireless Networks

2012 ◽  
Vol 23 (1) ◽  
pp. 110-117 ◽  
Author(s):  
Xianlong Jiao ◽  
Wei Lou ◽  
Junchao Ma ◽  
Jiannong Cao ◽  
Xiaodong Wang ◽  
...  
Keyword(s):  
Wireless Networks ◽  
Multihop Wireless Networks ◽  
Broadcast Scheduling ◽  
Multihop Wireless ◽  
Minimum Latency

scholarly journals Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-14 ◽  
Author(s):  
Quan Chen ◽  
Tao Wang ◽  
Lianglun Cheng ◽  
Yongchao Tao ◽  
Hong Gao
Keyword(s):  
Wireless Networks ◽  
Approximation Algorithm ◽  
Scheduling Algorithm ◽  
Multihop Wireless Networks ◽  
Covering Problem ◽  
Active Time ◽  
Multihop Wireless ◽  
Working Cycle ◽  
Minimum Number ◽  
Broadcast Schedule

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.

Sign in / Sign up

Export Citation Format

Share Document