Title :
Centralized broadcast scheduling in packet radio networks via genetic-fix algorithms
Author :
Ngo, Chiu Y. ; Li, Victor O K
Author_Institution :
Samsung Inf. Syst. America, San Jose, CA, USA
Abstract :
An important, yet difficult, problem in the design of a packet radio network is the determination of a conflict-free broadcast schedule at a minimum cycle length. We first formulate the problem via a within-two-hop connectivity matrix and then, by assuming a known cycle length, determine a conflict-free scheduling pattern using a centralized approach that exploits the structure of the problem via a modified genetic algorithm. This algorithm, called genetic-fix, generates and manipulates individuals with fixed size (i.e., in binary representation, the number of ones is fixed) and therefore, can reduce the search space substantially. We also propose a method to find a reasonable cycle length and shorten it gradually to obtain a near-optimal one. Simulations on three benchmark problems showed that our approach could achieve 100% convergence to solutions with optimal cycle length within reasonable time.
Keywords :
broadcast channels; genetic algorithms; matrix algebra; packet radio networks; scheduling; broadcast channels; centralized broadcast scheduling; conflict-free scheduling pattern; genetic-fix algorithms; modified genetic algorithm; packet radio networks; within-two-hop connectivity matrix; Communications Society; Genetic algorithms; Information systems; Intelligent networks; Interference; Packet radio networks; Processor scheduling; Radio broadcasting; Scheduling algorithm; Time division multiplexing;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.2003.816950