Approximate Minimum-Transmission Broadcasting in Duty-Cycled WSNs

Chen, Quan; Le, Tianbai; Cheng, Lianglun; Cai, Zhipeng; Gao, Hong

doi:10.1007/978-3-319-94268-1_4

Cited by 1 publication

(4 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The correctness of AMTB is proved in Theorem 11, where the proof can be found in the conference version [23]. Theorem 11.…”

Section: Performance Analysis Of Amtb Algorithmmentioning

confidence: 98%

“…Theorem 12 gives the lower bound of MTBDCA problem. The approximation ratio of AMTB is proved in Theorem 13 and the proof of this theorem is available in the conference version [23]. Proof.…”

Section: Performance Analysis Of Amtb Algorithmmentioning

confidence: 99%

“…We thank T. Le and Z. Cai for useful contributions in the conference version [23]. This work is partly supported by the…”

Section: Acknowledgmentsmentioning

confidence: 99%

“…Compared to the conference version [23], this paper not only investigates the all-to-all MTBDCA problem and provide a (ln(Δ + 1) + Δ)-approximation algorithm for it but also provides more details on the theoretical analysis, such as the proof of the NP-hardness of the Minimum Schedule Node Covering problem and the correctness of the broadcast tree construction algorithm, which are important for the completeness of the proposed methods. Additionally, the new experiments are also conducted to show some new findings of the proposed methods.…”

Section: Wireless Communications and Mobile Computingmentioning

confidence: 99%

See 3 more Smart Citations

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

Chen

Wang

Cheng

et al. 2019

Wireless Communications and Mobile Computing

Self Cite

View full text Add to dashboard Cite

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 (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.

show abstract

“…The correctness of AMTB is proved in Theorem 11, where the proof can be found in the conference version [23]. Theorem 11.…”

Section: Performance Analysis Of Amtb Algorithmmentioning

confidence: 98%

Section: Performance Analysis Of Amtb Algorithmmentioning

confidence: 99%

“…We thank T. Le and Z. Cai for useful contributions in the conference version [23]. This work is partly supported by the…”

Section: Acknowledgmentsmentioning

confidence: 99%

Section: Wireless Communications and Mobile Computingmentioning

confidence: 99%

See 2 more Smart Citations