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

Download

12625987.pdf

Date

2021-4-7

Author

Eksert, Mustafa Levet

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

264
views

369
downloads

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.

Subject Keywords

Collision, Disjoint time slot, Hy-brid TDMA MAC, Contention-free TDMA MAC, Centralized MAC, Distributed MAC

URI

https://hdl.handle.net/11511/89661

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Performance analysis of a power aware routing protocol for ad hoc networks Yazıcı, Mehmet Akif; Bilgen, Semih; Department of Electrical and Electronics Engineering (2006) In this thesis, performance of the Contribution Reward Routing Protocol with Shapley Value (CAP-SV), a power-aware routing protocol for ad hoc networking is analyzed. Literature study on ad hoc network routing and ower-awareness is given. The overhead induced by the extra packets of the redirection mechanism of CAP-SV is formulized and the factors affecting this overhead are discussed. Then, the power consumption of CAP-SV is analytically analized using a linear power consumption model. It is shown that CAP...
A simulation study of scheduling algorithms for packet switching networks Babur, Özgür; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2003) A scheduling algorithm has the primary role in implementing the quality of service guaranteed to each flow by managing buffer space and selecting which packet to send next with a fair share of network. In this thesis, some scheduling algorithms for packet switching networks are studied. For evaluating their delay, jitter and throughput performances, a discrete event simulator has been developed. It has been seen that fair scheduling provides, fair allocation of bandwidth, lower delay for sources using less ...
Mobility and power aware data interest based data replication for mobile ad hoc networks Arslan, Seçil; Bozyiğit, Müslim; Department of Computer Engineering (2007) One of the challenging issues for mobile ad hoc network (MANET) applications is data replication. Unreliable wireless communication, mobility of network participators and limited resource capacities of mobile devices make conventional replication techniques useless for MANETs. Frequent network divisions and unexpected disconnections should be handled. In this thesis work, a novel mobility and power aware, data interest based data replication strategy is presented. Main objective is to improve data accessibi...
Optimization of time-cost-resource trade-off problems in project scheduling using meta-heuristic algorithms Bettemir, Önder Halis; Sönmez, Rifat; Department of Civil Engineering (2009) In this thesis, meta-heuristic algorithms are developed to obtain optimum or near optimum solutions for the time-cost-resource trade-off and resource leveling problems in project scheduling. Time cost trade-off, resource leveling, single-mode resource constrained project scheduling, multi-mode resource constrained project scheduling and resource constrained time cost trade-off problems are analyzed. Genetic algorithm simulated annealing, quantum simulated annealing, memetic algorithm, variable neighborhood ...
BB-graph: a new subgraph isomorphism algorithm for querying big graph databases Asiler, Merve; Yazıcı, Adnan; Department of Computer Engineering (2016) With the emergence of the big data concept, the big graph database model has become very popular since it provides very flexible and quick querying for the cases that require costly join operations in RDBMs. However, it is a big challenge to find all exact matches of a query graph in a big database graph, which is known as the subgraph isomorphism problem. Although many related studies exist in literature, there is not a perfect algorithm that works for all types of queries efficiently since it is an NP-har...

Citation Formats

M. L. Eksert, “Intra- and Inter-Cluster Link Scheduling in Ad Hoc Networks,” Ph.D. - Doctoral Program, Middle East Technical University, 2021.