Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
User association and routing in UAV-supported HetNets
Download
Berke-Tezergil-Master_Thesis.pdf
Date
2022-1-24
Author
Tezergil, Berke
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
295
views
198
downloads
Cite This
With the introduction of millimeter waves in 5G, using wireless backhaul has become feasible with higher performance comparable to that of fiber cables. Using unmanned aerial vehicles as small cells enabled many use-cases by reducing the average link length and increasing the line-of-sight probability. In this work, a heterogeneous network with users, flying small cells on unmanned aerial vehicles, and macro base stations are considered. We introduce two main problems: establishing backhaul routes for small cells to maximize data capacity for users, and associating every user with a base station. The problem is named as the UAV-UAR problem. Initially, a mixed-integer linear programming formulation is given, which is optimal, but requires considerable time to find a solution. Using this formulation, a flow network definition is given for the heterogeneous network, and used to formulate relabel-to-front algorithm-based heuristics. While these heuristic methods do not guarantee optimality, they are significantly faster than the exact solution. The first developed heuristic, Relabel-to-Front-Eliminate, eliminates all edges that users allocate capacity except one. The second heuristic, Relabel-to-Front-Heuristic, uses a heuristic preflow initialization to associate users before execution. The final heuristic, Relabel-to-Front-Iterative, uses the second method, but iteratively changes user association until the result no longer improves. Monte Carlo Simulation results show that relabel-to-front-based heuristics have comparable, and usually the same throughput performance to that of linear programming optimization, but with a sliver of the execution time, outperforming by 20 to 1000 times depending on other parameters.
Subject Keywords
5G and beyond mobile networks
,
Heterogeneous networks
,
User association
,
Routing
,
mmWave
,
Flow networks
URI
https://hdl.handle.net/11511/96083
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Communication Coverage in Wireless Passive Sensor Networks
Bereketli, Alper; Akan, Ozgur B. (2009-02-01)
System lifetime of wireless sensor networks (WSN) is inversely proportional to the energy consumed by critically energy-constrained sensor nodes during RF transmission. In that regard, modulated backscattering (MB) is a promising design choice, in which sensor nodes send their data just by switching their antenna impedance and reflecting the incident signal coming from an RF source. Hence, wireless passive sensor networks (WPSN) designed to operate using MB do not have the lifetime constraints of convention...
Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies
Vazifehdan, Javad; Prasad, R. Venkatesha; Onur, Ertan; Niemegeers, Ignas (Elsevier BV, 2011-10-27)
Although many energy-aware routing schemes have been proposed for wireless ad hoc networks, they are not optimized for networks with heterogeneous power supplies, where nodes may run on battery or be connected to the mains (grid network). In this paper, we propose several energy-aware routing algorithms for such ad hoc networks. The proposed algorithms feature directing the traffic load dynamically towards mains-powered devices keeping the hop count of selected routes minimal. We unify these algorithms into...
Wireless Backhaul in 5G and Beyond: Issues, Challenges and Opportunities
Tezergil, Berke; Onur, Ertan (2022-1-01)
IEEEWith the introduction of new technologies such as Unmanned Aerial Vehicle (UAV), High Altitude Platform Station (HAPS), Millimeter Wave (mmWave) frequencies, Massive Multiple-Input Multiple-Output (mMIMO), and beamforming, wireless backhaul is expected to be an integral part of the 5G networks. While this concept is nothing new, it was shortcoming in terms of performance compared to the fiber backhauling. However, with these new technologies, fiber is no longer the foremost technology for backhauling. W...
AI for dynamic packet size optimization of batteryless IoT nodes: a case study for wireless body area sensor networks
Tabrizi, Hamed Osouli; Al-Turjman, Fadi (Springer Science and Business Media LLC, 2020-10-01)
Packet size optimization, with the purpose of minimizing the wireless packet transmission energy consumption, is crucial for the energy efficiency of the Internet of Things nodes. Meanwhile, energy scavenging from ambient energy sources has gained a significant attraction to avoid battery issues as the number of nodes increasingly grows. Packet size optimization algorithms have so far been proposed for battery-powered networks that have limited total energy with continuous power availability to prolong thei...
Improving performance of network intrusion detection systems through concurrent mechanisms
Atakan, Mustafa; Şener, Cevat; Department of Computer Engineering (2003)
As the bandwidth of present networks gets larger than the past, the demand of Network Intrusion Detection Systems (NIDS) that function in real time becomes the major requirement for high-speed networks. If these systems are not fast enough to process all network traffic passing, some malicious security violations may take role using this drawback. In order to make that kind of applications schedulable, some concurrency mechanism is introduced to the general flowchart of their algorithm. The principal aim is...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
B. Tezergil, “User association and routing in UAV-supported HetNets,” M.S. - Master of Science, Middle East Technical University, 2022.