Date(s) - 01/03/2018
4:00 pm - 5:30 pm
Clustering improves the communication performance of Ad Hoc networks in terms of scalability compared to the centralized and flat hierarchy. However, clustered topology introduces some limitations for link scheduling. In this paper, multi-channel link scheduling is presented with a definition of optimization problem and possible conflicts are introduced with distinct slot assignment scenarios. Efficient intra-cluster and inter-cluster link scheduling mechanisms are introduced as well. Link scheduling optimization is solved as integer linear programming and the implementation results are discussed and analyzed. The results show that run time of the optimization function drastically increases by the parameter size growth and a heuristic is required for a scalable link scheduling solution.