Duty-Cycle-Aware Minimum Latency Broadcast Scheduling in Clustered Multi-hop Wireless Networks

: 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 work 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 problems to be NPhard. 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. Here we investigate the broadcast scheduling in clustered Multihop wireless network and identified the scheduling time. As compared to existing works, in clustered scenario the scheduling time get reduced especially in clustered ATAM algorithm