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

Algorithm 3

Approximate Minimum-Transmission Broadcasting.

Input: The duty-cycled network and the source node ;

Output: The broadcast schedule ;

(1) Constructing the auxiliary graph as in Section 4.1 by integrating nodes’ active time slot into the network;

(2) Exploiting Algorithm 2 for the MSNC problem to obtain a minimum number of schedule nodes, i.e., , to cover all the

primary nodes in the auxiliary graph ;

(3) Calculating a set of subtrees as in Section 4.3 with the scheduled nodes in to connect all the primary nodes in ;

(4) Merging all the subtrees into a pseudo broadcast tree which contains the scheduling information of all nodes, i.e., ;

(5) Transforming the pseudo broadcast tree to a broadcast schedule, i.e., ;

(6) return The broadcast schedule ;