Tasarsız ağlarda öbek içi ve öbekler arası bağlantı çizelgeleme

While clustering improves the scalability of ad hoc networks in comparison to flat topologies, it introduces additional challenges for resource scheduling when contention-free medium access is employed. This thesis addresses intra- and inter-cluster link scheduling problem in multi-channel ad hoc networks. A clustered network model as well as a novel inter-cluster link scheduling mechanism over Control and User Plane Separation structure is proposed. A resource distribution method that provides an effective and efficient solution is presented for preventing inter-cluster interference. A link scheduling strategy responsive to instant communication demands and available resources as a non-linear optimization problem, which is then reduced to linear form, is formulated. Link scheduling optimization is solved as integer linear programming and the implementation results are discussed and analyzed. The simulation results of the optimizer show that the run time cost of the optimization function drastically increases by the parameter size growth. An iterative hıstory-based solution to decrease the running time is proposed. The adaptation of the iterative history-based approach to the original optimization process makes the solution feasible and ensures near-optimal satisfaction and efficiency.