Design and Implementation of TDMA Scheduling Based on BRKGA

Abstract

Messages in wireless Ad hoc networks may require intermediate multi-hop forwarding from the source to the target node. To find an optimum contend-free time slots scheduling solution in Ad hoc, a TDMA (Time Division Multiple Access) scheduling scheme based on BRKGA (Biased Random-key GA) is proposed. The algorithm divides the population of generation k into elite group and rest group. The elite solutions are copied directly to the next generation. One parent from the elite group and another parent from the rest population are randomly selected to crossover a new solution. The worst P_m solutions of the population of generation k are replaced by the mutants. The simulation results demonstrate that the TDMA based on BRKGA exhibits better performance in terms of lower frame length and higher channel utilization.