A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks
The broadcast scheduling problem (BSP) in packet radio networks is a well-known NP-complete combinatorial optimization problem.The broadcast scheduling avoids packet collisions by allowing only one node transmission in each collision domain of a time division multiple access (TDMA) network.It also improves the transmission utilization by assigning