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...

Full description

Bibliographic Details
Main Authors: Chih-Chiang Lin, Pi-Chung Wang
Format: Article
Language:English
Published: SpringerOpen 2010-01-01
Series:EURASIP Journal on Wireless Communications and Networking
Online Access:http://dx.doi.org/10.1155/2010/578370

Similar Items