The World Academy of Research in Science and Engineering (WARSE)
Broadcast is an essential and widely-used operation in multi-hop wireless networks. Minimum Latency Broadcast Scheduling (MLBS) aims to provide a collision-free scheduling for broadcast in multi hop network. Previous paper mostly assumes that nodes are always active and thus are not suitable for duty-cycle-aware scenarios. Here investigate the Duty-Cycle-Aware Minimum Latency Broadcast Scheduling (DCA-MLBS) problem in clustered multi-hop wireless networks. Prove both the one-to-all and the all-to-all DCA-MLBS problem. The approximation algorithms called OTA for the (One-To-All) DCA-MLBS problem and ATA for (All-To-All) DCA-MLBS problem under the unit-size message model respectively are used for scheduling.