Constant Approximations for Beaconing Scheduling in Wireless Networks With Duty-Cycled Scenarios

Abstract

Minimum-latency beaconing scheduling (MLBS) has been well studied when all the nodes are always awake. However, it is well-known that the networking nodes often switch between the active state and the sleep state to save energy. None of the known algorithms for MLBS are suitable for duty-cycled multihop wireless networks. In this paper, we study MLBS in duty-cycled multihop wireless networks (MLBSDC). Under the protocol interference model, we first present two constant-approx. algorithms for MLBSDC with the approx. bounds independent of $\vert T\vert $ , the length of a scheduling period. Then, we develop an efficient algorithm for MLBSDC under the physical interference model. To the best of our knowledge, this is the first paper that develops constant-approx. algorithms for any communication scheduling with the approx. bounds independent of $\vert T\vert $ when the duty-cycled scenarios are taken into consideration.