Broadcast scheduling in packet radio networks using mixed tabu-greedy algorithm - Electronics Letters

Introduction: The broadcast scheduling problem (BSP) is to find a collision-free scheduling of transmissions of all the stations in a minimum number of time slots. The final arrangement of the station transmissions into their allocated time slots is called a frame. Consider a packet radio network (PRN) represented by a graph G1⁄4 (V, E), where V is the set of nodes and E the set of edges. An N M binary matrix S is used to express the frame, where N1⁄4 jVj is the number of stations in the network and M is the number of time slots in the frame (i.e. the frame length). Element Sjk is one if station j is allowed to transmit in time slot k and zero, otherwise. The compatibility matrix F is defined by