Unmanned Aerial Vehicles (UAVs) for Integrated Access and Backhaul (IAB) Communications in Wireless Cellular Networks

An integrated access and backhaul (IAB) network architecture can enable flexible and fast deployment of next-generation cellular networks. However, mutual interference between access and backhaul links, small inter-site distance and spatial dynamics of user distribution pose major challenges in the practical deployment of IAB networks. To tackle these problems, we leverage the flying capabilities of unmanned aerial vehicles (UAVs) as hovering IAB-nodes and propose an interference management algorithm to maximize the overall sum rate of the IAB network. In particular, we jointly optimize the user and base station associations, the downlink power allocations for access and backhaul transmissions, and the spatial configurations of UAVs. We consider two spatial configuration modes of UAVs: distributed UAVs and drone antenna array (DAA), and show how they are intertwined with the spatial distribution of ground users. Our numerical results show that the proposed algorithm achieves an average of 2.9× and 6.7× gains in the received downlink signal-to-interference-plus-noise ratio (SINR) and overall network sum rate, respectively. Finally, the numerical results reveal that UAVs cannot only be used for coverage improvement but also for capacity boosting in IAB cellular networks

Efficient radio resource management for the fifth generation slice networks

It is predicted that the IMT-2020 (5G network) will meet increasing user demands and, hence, it is therefore, expected to be as flexible as possible. The relevant standardisation bodies and academia have accepted the critical role of network slicing in the implementation of the 5G network. The network slicing paradigm allows the physical infrastructure and resources of the mobile network to be “sliced” into logical networks, which are operated by different entities, and then engineered to address the specific requirements of different verticals, business models, and individual subscribers. Network slicing offers propitious solutions to the flexibility requirements of the 5G network. The attributes and characteristics of network slicing support the multi-tenancy paradigm, which is predicted to drastically reduce the operational expenditure (OPEX) and capital expenditure (CAPEX) of mobile network operators. Furthermore, network slices enable mobile virtual network operators to compete with one another using the same physical networks but customising their slices and network operation according to their market segment's characteristics and requirements. However, owing to scarce radio resources, the dynamic characteristics of the wireless links, and its capacity, implementing network slicing at the base stations and the access network xix becomes an uphill task. Moreover, an unplanned 5G slice network deployment results in technical challenges such as unfairness in radio resource allocation, poor quality of service provisioning, network profit maximisation challenges, and rises in energy consumption in a bid to meet QoS specifications. Therefore, there is a need to develop efficient radio resource management algorithms that address the above mentioned technical challenges. The core aim of this research is to develop and evaluate efficient radio resource management algorithms and schemes that will be implemented in 5G slice networks to guarantee the QoS of users in terms of throughput and latency while ensuring that 5G slice networks are energy efficient and economically profitable. This thesis mainly addresses key challenges relating to efficient radio resource management. First, a particle swarm-intelligent profit-aware resource allocation scheme for a 5G slice network is proposed to prioritise the profitability of the network while at the same time ensuring that the QoS requirements of slice users are not compromised. It is observed that the proposed new radio swarm-intelligent profit-aware resource allocation (NR-SiRARE) scheme outperforms the LTE-OFDMA swarm-intelligent profit-aware resource (LO-SiRARE) scheme. However, the network profit for the NR-SiRARE is greatly affected by significant degradation of the path loss associated with millimetre waves. Second, this thesis examines the resource allocation challenge in a multi-tenant multi-slice multi-tier heterogeneous network. To maximise the total utility of a multi-tenant multislice multi-tier heterogeneous network, a latency-aware dynamic resource allocation problem is formulated as an optimisation problem. Via the hierarchical decomposition method for heterogeneous networks, the formulated optimisation problem is transformed to reduce the computational complexities of the proposed solutions. Furthermore, a genetic algorithmbased latency-aware resource allocation scheme is proposed to solve the maximum utility problem by considering related constraints. It is observed that GI-LARE scheme outperforms the static slicing (SS) and an optimal resource allocation (ORA) schemes. Moreover, the GI-LARE appears to be near optimal when compared with an exact solution based on spatial branch and bound. Third, this thesis addresses a distributed resource allocation problem in a multi-slice multitier multi-domain network with different players. A three-level hierarchical business model comprising InPs, MVNOs, and service providers (SP) is examined. The radio resource allocation problem is formulated as a maximum utility optimisation problem. A multi-tier multi-domain slice user matching game and a distributed backtracking multi-player multidomain games schemes are proposed to solve the maximum utility optimisation problem. The distributed backtracking scheme is based on the Fisher Market and Auction theory principles. The proposed multi-tier multi-domain scheme outperforms the GI-LARE and the SS schemes. This is attributed to the availability of resources from other InPs and MVNOs; and the flexibility associated with a multi-domain network. Lastly, an energy-efficient resource allocation problem for 5G slice networks in a highly dense heterogeneous environment is investigated. A mathematical formulation of energy-efficient resource allocation in 5G slice networks is developed as a mixed-integer linear fractional optimisation problem (MILFP). The method adopts hierarchical decomposition techniques to reduce complexities. Furthermore, the slice user association, QoS for different slice use cases, an adapted water filling algorithm, and stochastic geometry tools are employed to xxi model the global energy efficiency (GEE) of the 5G slice network. Besides, neither stochastic geometry nor a three-level hierarchical business model schemes have been employed to model the global energy efficiency of the 5G slice network in the literature, making it the first time such method will be applied to 5G slice network. With rigorous numerical simulations based on Monte-Carlo numerical simulation technique, the performance of the proposed algorithms and schemes was evaluated to show their adaptability, efficiency and robustness for a 5G slice network

Aerial base station placement in temporary-event scenarios

Die Anforderungen an den Netzdatenverkehr sind in den letzten Jahren dramatisch gestiegen, was ein großes Interesse an der Entwicklung neuartiger Lösungen zur Erhöhung der Netzkapazität in Mobilfunknetzen erzeugt hat. Besonderes Augenmerk wurde auf das Problem der Kapazitätsverbesserung bei temporären Veranstaltungen gelegt, bei denen das Umfeld im Wesentlichen dynamisch ist. Um der Dynamik der sich verändernden Umgebung gerecht zu werden und die Bodeninfrastruktur durch zusätzliche Kapazität zu unterstützen, wurde der Einsatz von Luftbasisstationen vorgeschlagen. Die Luftbasisstationen können in der Nähe des Nutzers platziert werden und aufgrund der im Vergleich zur Bodeninfrastruktur höheren Lage die Vorteile der Sichtlinienkommunikation nutzen. Dies reduziert den Pfadverlust und ermöglicht eine höhere Kanalkapazität. Das Optimierungsproblem der Maximierung der Netzkapazität durch die richtige Platzierung von Luftbasisstationen bildet einen Schwerpunkt der Arbeit. Es ist notwendig, das Optimierungsproblem rechtzeitig zu lösen, um auf Veränderungen in der dynamischen Funkumgebung zu reagieren. Die optimale Platzierung von Luftbasisstationen stellt jedoch ein NP-schweres Problem dar, wodurch die Lösung nicht trivial ist. Daher besteht ein Bedarf an schnellen und skalierbaren Optimierungsalgorithmen. Als Erstes wird ein neuartiger Hybrid-Algorithmus (Projected Clustering) vorgeschlagen, der mehrere Lösungen auf der Grundlage der schnellen entfernungsbasierten Kapazitätsapproximierung berechnet und sie auf dem genauen SINR-basierten Kapazitätsmodell bewertet. Dabei werden suboptimale Lösungen vermieden. Als Zweites wird ein neuartiges verteiltes, selbstorganisiertes Framework (AIDA) vorgeschlagen, welches nur lokales Wissen verwendet, den Netzwerkmehraufwand verringert und die Anforderungen an die Kommunikation zwischen Luftbasisstationen lockert. Bei der Formulierung des Platzierungsproblems konnte festgestellt werden, dass Unsicherheiten in Bezug auf die Modellierung der Luft-Bodensignalausbreitung bestehen. Da dieser Aspekt im Rahmen der Analyse eine wichtige Rolle spielt, erfolgte eine Validierung moderner Luft-Bodensignalausbreitungsmodelle, indem reale Messungen gesammelt und das genaueste Modell für die Simulationen ausgewählt wurden.As the traffic demands have grown dramatically in recent years, so has the interest in developing novel solutions that increase the network capacity in cellular networks. The problem of capacity improvement is even more complex when applied to a dynamic environment during a disaster or temporary event. The use of aerial base stations has received much attention in the last ten years as the solution to cope with the dynamics of the changing environment and to supplement the ground infrastructure with extra capacity. Due to higher elevations and possibility to place aerial base stations in close proximity to the user, path loss is significantly smaller in comparison to the ground infrastructure, which in turn enables high data capacity. We are studying the optimization problem of maximizing network capacity by proper placement of aerial base stations. To handle the changes in the dynamic radio environment, it is necessary to promptly solve the optimization problem. However, we show that the optimal placement of aerial base stations is the NP-hard problem and its solution is non-trivial, and thus, there is a need for fast and scalable optimization algorithms. This dissertation investigates how to solve the placement problem efficiently and to support the dynamics of temporary events. First, we propose a novel hybrid algorithm (Projected Clustering), which calculates multiple solutions based on the fast distance-based capacity approximation and evaluates them on the accurate SINR-based capacity model, avoiding sub-optimal solutions. Second, we propose a novel distributed, self-organized framework (AIDA), which conducts a decision-making process using only local knowledge, decreasing the network overhead and relaxing the requirements for communication between aerial base stations. During the formulation of the placement problem, we found that there is still considerable uncertainty with regard to air-to-ground propagation modeling. Since this aspect plays an important role in our analysis, we validated state-of-the-art air-to-ground propagation models by collecting real measurements and chose the most accurate model for the simulations

Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

A survey of swarm intelligence for dynamic optimization: algorithms and applications

Swarm intelligence (SI) algorithms, including ant colony optimization, particle swarm optimization, bee-inspired algorithms, bacterial foraging optimization, firefly algorithms, fish swarm optimization and many more, have been proven to be good methods to address difficult optimization problems under stationary environments. Most SI algorithms have been developed to address stationary optimization problems and hence, they can converge on the (near-) optimum solution efficiently. However, many real-world problems have a dynamic environment that changes over time. For such dynamic optimization problems (DOPs), it is difficult for a conventional SI algorithm to track the changing optimum once the algorithm has converged on a solution. In the last two decades, there has been a growing interest of addressing DOPs using SI algorithms due to their adaptation capabilities. This paper presents a broad review on SI dynamic optimization (SIDO) focused on several classes of problems, such as discrete, continuous, constrained, multi-objective and classification problems, and real-world applications. In addition, this paper focuses on the enhancement strategies integrated in SI algorithms to address dynamic changes, the performance measurements and benchmark generators used in SIDO. Finally, some considerations about future directions in the subject are given