Broadcast scheduling in packet radio networks using mixed tabu-greedy algorithm

A two-step algorithm to solve the broadcast scheduling problem is presented. The first step employs finding a solution that has a transmission time slot for each station, while the second step attempts to maximise the throughput. Numerical examples that demonstrate the algorithm outperforms existing ones in terms of channel utilisation and packet delay are presented.