Intra- and Inter-Cluster Link Scheduling in Ad Hoc Networks

Eksert, Mustafa Levet
While clustering improves the scalability of ad hoc networks in comparison to flattopologies, it introduces additional challenges for resource scheduling when contention-free medium access is employed. This thesis addresses intra- and inter-cluster linkscheduling problem in multi-channel ad hoc networks. A clustered network model aswell as a novel inter-cluster link scheduling mechanism over Control and User PlaneSeparation structure are proposed. A resource distribution method that provides aneffective and efficient solution is presented for preventing inter-cluster interference. Alink scheduling strategy responsive to instant communication demands and availableresources as a non-linear optimization problem, which is then reduced to linear form,is formulated. Link scheduling optimization is solved as integer linear programmingand the implementation results are discussed and analyzed. The simulation resultsof the optimizer show that the run time cost of the optimization function drasticallyincreases by the parameter size growth. An iterative hıstory-based solution to de-crease the running time is proposed. The adaptation of the iterative history-basedapproach to the original optimization process makes the solution feasible and ensuresnear-optimal satisfaction and efficiency.
Citation Formats
M. L. Eksert, “Intra- and Inter-Cluster Link Scheduling in Ad Hoc Networks,” Ph.D. - Doctoral Program, Middle East Technical University, 2021.