Efficient energy management in ultra-dense wireless networks

The increase in demand for more network capacity has led to the evolution of wireless networks from being largely Heterogeneous (Het-Nets) to the now existing Ultra-dense (UDNs). In UDNs, small cells are densely deployed with the goal of shortening the physical distance between the base stations (BSs) and the UEs, so as to support more user equipment (UEs) at peak times while ensuring high data rates. Compared to Het-Nets, Ultra-dense networks (UDNs) have many advantages. These include, more network capacity, higher flexibility to routine configurations, and more suitability to achieve load-balancing, hence, fewer blind spots as well as lower call blocking probability. It should be noted that, in practice, due to the high density of deployed small cells in Ultra-Dense Networks, a number of issues, or rather concerns, come with this evolution from Het-Nets. Among these issues include problems with efficient radio resource management, user cell association, inter- and intra-cell interference management and, last but not least, efficient energy consumption. Some of these issues which impact the overall network efficiency are largely due to the use of obsolete algorithms, especially those whose resource allocation is based solely on received signal power (RSSP). In this paper, the focus is solely on the efficient energy management dilemma and how to optimally reduce the overall network energy consumption. Through an extensive literature review, a detailed report into the growing concern of efficient energy management in UDNs is provided in Chapter 2. The literature review report highlights the classification as well as the evolution of some of the Mobile Wireless Technologies and Mobile Wireless Networks in general. The literature review report provides reasons as to why the energy consumption issue has become a very serious concern in UltraDense networks as well as the various techniques and measures taken to mitigate this. It is shown that, due to the increasing Mobile Wireless Systems’ carbon footprint which carries serious negative environmental impact, and the general need to lower operating costs by the network operators, the management of energy consumption increases in priority. By using the architecture of a Fourth Generation Long Term Evolution (4G-LTE) UltraDense Network, the report further shows that more than 65% of the overall energy consumption is by the access network and base stations in particular. This phenomenon explains why most attention in energy efficiency management in UDNs is largely centred on reducing the energy consumption of the deployed base stations more than any other network components like the data servers or backhauling features used. Furthermore, the report also provides detailed information on the methods/techniques, their classification, implementation, as well as a critical analysis of the said implementations in literature. This study proposes a sub-optimal algorithm and Distributed Cell Resource Allocation with a Base Station On/Off scheme that aims at reducing the overall base station power consumption in UDNs, while ensuring that the overall Quality of Service (QoS) for each User Equipment (UE) as specified in its service class is met. The modeling of the system model used and hence formulation of the Network Energy Efficiency (NEE) optimization problem is done viii using stochastic geometry. The network model comprises both evolved Node B (eNB) type macro and small cells operating on different frequency bands as well as taking into account factors that impact NEE such as UE mobility, UE spatial distribution and small cells spatial distribution. The channel model takes into account signal interference from all base stations, path loss, fading, log normal shadowing, modulation and coding schemes used on each UE’s communication channels when computing throughout. The power consumption model used takes into account both static (site cooling, circuit power) and active (transmission or load based) base station power consumption. The formulation of the NEE optimization problem takes into consideration the user’s Quality-of-service (QoS), inter-cell interference, as well as each user’s spectral efficiency and coverage/success probability. The formulated NEE optimization problem is of type Nondeterministic Polynomial time (NP)-hard, due to the user-cell association. The proposed solution to the formulated optimization problem makes use of constraint relaxation to transform the NP-hard problem into a more solvable, convex and linear optimization one. This, combined with Lagrangian dual decomposition, is used to create a distributed solution. After cellassociation and resource allocation phases, the proposed solution in order to further reduce power consumption performs Cell On/Off. Then, by using the computer simulation tools/environments, the “Distributed Resource Allocation with Cell On/Off” scheme’s performance, in comparison to four other resource allocation schemes, is analysed and evaluated given a number of different network scenarios. Finally, the statistical and mathematical results generated through the simulations indicate that the proposed scheme is the closest in NEE performance to the Exhaustive Search algorithm, and hence superior to the other sub-optimal algorithms it is compared to

Journal of Telecommunications and Information Technology, 2003, nr 4

kwartalni

Resource Management in Green Wireless Communication Networks

The development of wireless technologies has been stimulated by the ever increasing network capacity and the diversity of users' quality of service (QoS) requirements. It is widely anticipated that next-generation wireless networks should be capable of integrating wireless networks with various network architectures and wireless access technologies to provide diverse high-quality ubiquitous wireless accesses for users. However, the existing wireless network architecture may not be able to satisfy explosive wireless access request. Moreover, with the increasing awareness of environmental protection, significant growth of energy consumption caused by the massive traffic demand consequently raises the carbon emission footprint. The emerging of green energy technologies, e.g., solar panel and wind turbine, has provided a promising methodology to sustain operations and management of next-generation wireless networks by powering wireless network devices with eco-friendly green energy. In this thesis, we propose a sustainable wireless network solution as the prototype of next-generation wireless networks to fulfill various QoS requirements of users with harvested energy from natural environments. The sustainable wireless solution aims at establishing multi-tier heterogeneous green wireless communication networks to integrate different wireless services and utilizing green energy supplies to sustain the network operations and management. The solution consists of three steps, 1) establishing conventional green wireless networks, 2) building multi-tier green wireless networks, and 3) allocating and balancing network resources. In the first step, we focus on cost-effectively establishing single-tier green wireless networks to satisfy users' basic QoS requirements by designing efficient network planning algorithm. We formulate the minimum green macro cell BS deployment problem as an optimization problem, which aims at placing the minimum number of BSs to fulfill the basic QoS requirements by harvested energy. A preference level is defined as the guidance for efficient algorithm design to solve the minimum green macro cell BSs deployment problem. After that, we propose a heuristic algorithm, called two-phase constrained green BS placement (TCGBP) algorithm, based on Voronoi diagram. The TCGBP algorithm jointly considers the rate adaptation and power allocation to solve the formulated optimization problem. The performance is verified by extensive simulations, which demonstrate that the TCGBP algorithm can achieve the optimal solution with significantly reduced time complexity. In the second step, we aim at efficiently constructing multi-tier green heterogeneous networks to fulfill high-end QoS requirements of users by placing green small cell BSs. We formulate the green small cell BS deployment and sub-carrier allocation problem as a mixed-integer non-linear programming (MINLP) problem, which targets at deploying the minimum number of green small cell BSs as relay nodes to further improve network capacities and provide high-quality QoS wireless services with harvested energy under the cost constraint. We propose the sub-carrier and traffic over rate (STR) metric to evaluate the contribution of deployed green small cell BSs in both energy and throughput aspects. Based on the metric, two algorithms are designed, namely joint relay node placement and sub-carrier allocation with top-down/bottom-up (RNP-SA-t/b) algorithms. Extensive simulations demonstrate that the proposed algorithms provide simple yet efficient solutions and offer important guidelines on network planning and resource management in two-tier heterogeneous green wireless networks. In the last step, we intend to allocate limited network resources to guarantee the balance of charging and discharging processes. Different from network planning based on statistical historical data, the design of resource allocation algorithm generally concerns relatively short-term resources management, and thus it is essential to accurately estimate the instantaneous energy charging and discharging rates of green wireless network devices. Specifically, we investigate the energy trading issues in green wireless networks, and try to maximize the profits of all cells by determining the optimal price and quantity in each energy trading transaction. Finally, we apply a two-stage leader-follower Stackelberg game to formulate the energy trading problem. By using back induction to obtain the optimal price and quantity of traded energy, we propose an optimal algorithm, called optimal profits energy trading (OPET) algorithm. Our analysis and simulation results demonstrate the optimality performance of OPET algorithm. We believe that our research results in this dissertation can provide insightful guidance in the design of next-generation wireless communication networks with green energy. The algorithms developed in the dissertation offer practical and efficient solutions to build and optimize multi-tier heterogeneous green wireless communication networks

Towards 6G Through SDN and NFV-Based Solutions for Terrestrial and Non-Terrestrial Networks

As societal needs continue to evolve, there has been a marked rise in a wide variety of emerging use cases that cannot be served adequately by existing networks. For example, increasing industrial automation has not only resulted in a massive rise in the number of connected devices, but has also brought forth the need for remote monitoring and reconnaissance at scale, often in remote locations characterized by a lack of connectivity options. Going beyond 5G, which has largely focused on enhancing the quality-of-experience for end devices, the next generation of wireless communications is expected to be centered around the idea of "wireless ubiquity". The concept of wireless ubiquity mandates that the quality of connectivity is not only determined by classical metrics such as throughput, reliability, and latency, but also by the level of coverage offered by the network. In other words, the upcoming sixth generation of wireless communications should be characterized by networks that exhibit high throughput and reliability with low latency, while also providing robust connectivity to a multitude of devices spread across the surface of the Earth, without any geographical constraints. The objective of this PhD thesis is to design novel architectural solutions for the upcoming sixth generation of cellular and space communications systems with a view to enabling wireless ubiquity with software-defined networking and network function virtualization at its core. Towards this goal, this thesis introduces a novel end-to-end system architecture for cellular communications characterized by innovations such as the AirHYPE wireless hypervisor. Furthermore, within the cellular systems domain, solutions for radio access network design with software-defined mobility management, and containerized core network design optimization have also been presented. On the other hand, within the space systems domain, this thesis introduces the concept of the Internet of Space Things (IoST). IoST is a novel cyber-physical system centered on nanosatellites and is capable of delivering ubiquitous connectivity for a wide variety of use cases, ranging from monitoring and reconnaissance to in-space backhauling. In this direction, contributions relating to constellation design, routing, and automatic network slicing form a key aspect of this thesis.Ph.D

Self-organizing Network Optimization via Placement of Additional Nodes

Das Hauptforschungsgebiet des Graduiertenkollegs "International Graduate School on Mobile Communication" (GS Mobicom) der Technischen Universität Ilmenau ist die Kommunikation in Katastrophenszenarien. Wegen eines Desasters oder einer Katastrophe können die terrestrischen Elementen der Infrastruktur eines Kommunikationsnetzwerks beschädigt oder komplett zerstört werden. Dennoch spielen verfügbare Kommunikationsnetze eine sehr wichtige Rolle während der Rettungsmaßnahmen, besonders für die Koordinierung der Rettungstruppen und für die Kommunikation zwischen ihren Mitgliedern. Ein solcher Service kann durch ein mobiles Ad-Hoc-Netzwerk (MANET) zur Verfügung gestellt werden. Ein typisches Problem der MANETs ist Netzwerkpartitionierung, welche zur Isolation von verschiedenen Knotengruppen führt. Eine mögliche Lösung dieses Problems ist die Positionierung von zusätzlichen Knoten, welche die Verbindung zwischen den isolierten Partitionen wiederherstellen können. Hauptziele dieser Arbeit sind die Recherche und die Entwicklung von Algorithmen und Methoden zur Positionierung der zusätzlichen Knoten. Der Fokus der Recherche liegt auf Untersuchung der verteilten Algorithmen zur Bestimmung der Positionen für die zusätzlichen Knoten. Die verteilten Algorithmen benutzen nur die Information, welche in einer lokalen Umgebung eines Knotens verfügbar ist, und dadurch entsteht ein selbstorganisierendes System. Jedoch wird das gesamte Netzwerk hier vor allem innerhalb eines ganz speziellen Szenarios - Katastrophenszenario - betrachtet. In einer solchen Situation kann die Information über die Topologie des zu reparierenden Netzwerks im Voraus erfasst werden und soll, natürlich, für die Wiederherstellung mitbenutzt werden. Dank der eventuell verfügbaren zusätzlichen Information können die Positionen für die zusätzlichen Knoten genauer ermittelt werden. Die Arbeit umfasst eine Beschreibung, Implementierungsdetails und eine Evaluierung eines selbstorganisierendes Systems, welche die Netzwerkwiederherstellung in beiden Szenarien ermöglicht.The main research area of the International Graduate School on Mobile Communication (GS Mobicom) at Ilmenau University of Technology is communication in disaster scenarios. Due to a disaster or an accident, the network infrastructure can be damaged or even completely destroyed. However, available communication networks play a vital role during the rescue activities especially for the coordination of the rescue teams and for the communication between their members. Such a communication service can be provided by a Mobile Ad-Hoc Network (MANET). One of the typical problems of a MANET is network partitioning, when separate groups of nodes become isolated from each other. One possible solution for this problem is the placement of additional nodes in order to reconstruct the communication links between isolated network partitions. The primary goal of this work is the research and development of algorithms and methods for the placement of additional nodes. The focus of this research lies on the investigation of distributed algorithms for the placement of additional nodes, which use only the information from the nodes’ local environment and thus form a self-organizing system. However, during the usage specifics of the system in a disaster scenario, global information about the topology of the network to be recovered can be known or collected in advance. In this case, it is of course reasonable to use this information in order to calculate the placement positions more precisely. The work provides the description, the implementation details and the evaluation of a self-organizing system which is able to recover from network partitioning in both situations

Heterogeneous Wireless Networks: An Analysis of Network and Service Level Diversity

Future wireless systems will be a collection of symbiotic and hierarchical networks that address different aspects of communication needs. This architectural heterogeneity constitutes a network level diversity, where wireless domains can benefit from each other's spare resources in terms of bandwidth and energy. The dissertation investigates the network diversity through particularly interesting scenarios that involve capacity-limited multi-hop ad hoc networks and high-bandwidth wired or wireless infrastructures. Heterogeneity and infrastructures not only exist at the level of networking technologies and architectures, but also at the level of available services in each network domain. Efficient discovery of services across the domains and allocation of service points to individual users are beneficial for facilitating the actual communication, supplying survivable services, and better utilizing the network resources. These concepts together define the service level diversity, which is the second topic studied in our dissertation. In this dissertation, we first focus on a large-scale hybrid network, where a relatively resource abundant infrastructure network overlays a multi-hop wireless network. Using a random geometric random graph model and defining appropriate connectivity constraints, we derive the overall transport capacity of this hybrid network. In the sequel, we dwell upon hybrid networks with arbitrary size and topology. We develop a Quality of Service (QoS) based framework to utilize the joint resources of the ad hoc and infrastructure tier with minimal power exposure on other symbiotic networks that operate over the same radio frequency bands. The framework requires a cross-layer approach to adequately satisfy the system objectives and individual user demands. Since the problem is proven to be intractable, we explore sub-optimal but efficient algorithms to solve it by relying on derived performance bounds. In the last part of the dissertation, we shift our attention from network level diversity to service level diversity. After investigating possible resource discovery mechanisms in conjunction with their applicability to multi-hop wireless environments, we present our own solution, namely Distributed Service Discovery Protocol (DSDP). DSDP enables a highly scalable, survivable, and fast resource discovery under a very dynamic network topology. It also provides the necessary architectural and signaling mechanisms to effectively implement resource allocation techniques