Genetic algorithm for broadcast scheduling in packet radio networks

Packet radio (PR) networks are to provide data communication among a set of nodes distributed over a region. A time division multiple access (TDMA) protocol is adopted for conflict free communication. The goal is to find a conflict free transmission schedule for different nodes at different time slots of a fixed length time cycle, called the TDMA cycle. The optimization criterion is primarily to minimize the TDMA cycle length, and then to maximize the number of transmissions. First a classical genetic algorithm is used to solve this NP-complete problem, but showed poor performance for bigger networks. Then the authors proposed some special crossover operators suitable for this kind of problem. This modified operator could deliver very good quality results even for big networks and in few generations. A study on the dependence of the result on population size etc. is carried out. The results are empirically compared with other approaches, a greedy-heuristic algorithm and mean field annealing