A domain specific heuristic algorithm for broadcast scheduling problem in wireless multihop networks

Broadcast scheduling problem in wireless multihop network is to avoid interference while keeping the frame length to a minimum. In addition, the task is determination of a collision free broadcast schedule with the minimum length TDMA frame and the maximum slot utilization by efficient distribution of slots among stations. To solve the problem more effectively, a new domain specific heuristic algorithm called Memetic Algorithm (MA) is proposed in this paper. The results of computation demonstrate that it improves the search capability and the optimum conflict free transmission schedule is obtained with less number of time slots and generations, compared to other competitive algorithms.