Mobility and resource management for 5G heterogeneous networks

The conventional topology of current cellular networks is a star structure, where central control points usually serve as base stations (BSs). This provides the advantage of simplicity while still providing quality of service (QoS). For next-generation networks, however, this topology is disadvantageous and difficult to use due to the insufficient availability of network access. The hybrid topology radio network will thus naturally be the future mobile access network that can help to overcome current and future challenges efficiently. Therefore, relay technology can play an important role in a hybrid cellular network topology. Today, with the recent long-term evolution-advanced (LTE-A) standards, the 3rd Generation Partnership Project (3GPP) supports a single-hop relay technology in which the radio access link between the BS and users is relayed by only one relay station (RS). With the help of multi-hop relay, however, the radio link between the BS and users can be extended to more than two hops to improve the coverage and network capacity. Multiple hops to transmit data to and from the corresponding BS results in the reduction of path loss. However, using a multi-hop relay system requires more radio resources to transmit data through different hops. More interference is also created due to a greater number of simultaneous transmissions in the network. New mobility and resource management schemes are thus important for achieving a high QoS while increasing the whole network capacity. In the first part, the problem of relay selection and radio resource allocation is studied, and choosing how the bandwidth should be shared between direct, backhaul, and access links in multi-hop relay networks is discussed. In such a network, resource allocation plays a critical role because it manages channel access in both time and frequency domains and determines how resources are allocated for different links. The proposed solution includes a nonlinear programming technique and a heuristic method. First, the problem formulation of resource allocation and relay selection is presented to provide an integrated framework for multi-hop relay networks. Second, an analytical solution to the problem is presented using a nonlinear programming technique. Finally, an iterative two-stage algorithm is presented to address the joint resource allocation and relay selection problem in multi-hop relay networks Under backhaul and capacity limitation constraints. In particular, the first stage proposed a fast approximation analytical solution for a resource allocation algorithm that takes into account the trade-off between the optimality and the complexity of the multi-hop relay architecture; the second stage presented a heuristic relay selection strategy that considers the RS load and helps to keep the relay from being overloaded is proposed. In the second part, the mobility problem in downlink multi-hop relay networks is addressed. In addition to the resource allocation issue, the relay selection problem is studied from a network layer perspective. Therefore, this part includes the issue of radio path selection. As an alternative to the heuristic algorithm developed in the previous part, the presented work describes the development and evaluation of a relay-selection scheme based on a Markov decision process (MDP) that considers the RS load and the existing radio-link path to improve handoff performance. First, the problem formulation of resource allocation and relay selection is presented. Second, an MDP mathematical model is developed to solve the relay selection problem in a decentralized way and to make the selection process simple. This relay selection scheme has the objective of maintaining the throughput and ensuring seamless mobility and service continuity to all mobile terminals while reducing the handoff frequency and improving handoff performance. In the third part, the admission and power control problem of a general heterogeneous network (HetNet) consisting of several small cells (SCs) is solved. Compared to the first two parts of this work, the system is expanded from a multi-hop RS to a general SC context. This part therefore focuses only on the access link problem, assuming the capacity of the SC backhaul links are large enough not to be bottlenecks. This part mainly deals with the problem of how to maximize the number of admitted users in an overloaded system while minimizing the transmit power given a certain QoS level. First, the problem is formulated to address concerns about QoS requirements in a better way. Second, a Voronoi-based user association scheme for maximizing the number of admitted users in the system under QoS and capacity limitation constraints is proposed to find near-optimal solutions. Finally, a twostage algorithm is presented to address the joint admission and power control problem in a downlink heterogeneous SC network. In particular, the first stage proposes a dynamic call admission control policy that considers the SC load and call-level QoS while also helping to keep the system from being overloaded. The second stage presents an adaptive power allocation strategy that considers both user distribution and the density of SCs in HetNets. Finally, the proposed solutions are evaluated using extensive numerical simulations, and the numerical results are presented to provide a comparison with related works found in the literature

Heterogeneous Wireless Networks: Traffic Offloading, Resource Allocation and Coverage Analysis

Unlike 2G systems where the radius of macro base station (MBS) could reach several kilometers, the cell radius of LTE-Advanced and next generation wireless networks (NGWNs) such as 5G networks would be random and up to a few hundred meters in order to overcome the radio signal propagation impairments. Heterogeneous wireless networks (HetNets) are becoming an integral part of the NGWNs especially 5G networks, where small cell base stations (SBSs), wireless-fidelity (WiFi) access points (APs), cellular BSs and device-to-device (D2D) enabled links coexist together. HetNets represent novel approaches for the mobile data offloading, resource allocation and coverage probability problems that help to optimize the network traffic. However, heterogeneity and interworking among different radio access technologies bring new challenges such as bandwidth resource allocation, user/cell association, traffic offloading based on the user activity and coverage probability in HetNets. This dissertation attempts to address three key research areas: traffic offloading, bandwidth resource allocation and coverage probability problems in HetNets. In the first part of this dissertation, we derive the mathematical framework to calculate the required active user population factor (AUPF) of small cells based on the probabilistic traffic models. The number of total mobile users and number of active mobile users have different probabilistic distributions such as different combinations of Binomial and Poisson distributions. Furthermore, AUPF is utilized to investigate the downlink BS and backhaul power consumption of HetNets. In the second part, we investigate two different traffic offloading (TO) schemes (a) Path loss (PL) and (b) Signal-to-Interference ratio (SIR) based strategies. In this context, a comparative study on two techniques to offload the traffic from macrocell to small cell is studied. Additionally, the AUPF, small cell access scheme and traffic type are included into a PL based TO strategy to minimize the congested macrocell traffic. In the third part, the joint user assignment and bandwidth resource allocation problem is formulated as a mixed integer non-linear programming (MINLP). Due to its intractability and computational complexity, the MINLP problem is transformed into a convex optimization problem via a binary variable relaxation approach. Based on the mathematical analysis of the problem, a heuristic algorithm for joint user assignment and bandwidth allocation is presented. The proposed solution achieves a near optimal user assignment and bandwidth allocation at reduced computational complexity. Lastly, we investigate the transition between traditional hexagonal BS deployment to random BS placement in HetNets. Independent Poisson Point Processes (PPPs) are used to model the random locations of BSs. Lloyds algorithm is investigated for analyzing the coverage probability in a network which functions as a bridge between random and structural BS deployments. The link distance distribution is obtained by using the Expectation-Maximization (EM) algorithm which is further utilized for calculating the coverage probability

Lightweight ECC Based Multifactor Authentication Protocol (LEMAP) for Device to Device Cellular Network

Device to Device (D2D) communication is a type of technology where two devices can communicate directly with each other without the need to contact Base Station or any central infrastructure. With emerging of Long Term Evaluation (LTE) and Fifth Generation (5G) technology, D2D has gained a lot of attention for communication between closely located mobile devices for offering high speed, energy efficiency, throughput, less delay, and efficient spectrum usage. D2D has changed recent wireless networks with new trends as D2D can play a vital role in sharing resources by load off the network in local areas by direct communication between devices and useful in natural disasters where BS is destroyed. D2D has revolutionized the direct communication as it is a basis for 5G network. D2D allows miniature devices like cell phone, tablets and radio devices to work as Non-Transparent Relays (NTR) where they can provide services as well as forward traffic, request services by direct communication without the need of Base Station (BS) or central network infrastructure. Multi-hop D2D can be used for peer-to-peer communication or even access to cellular networks. This concept of multihop D2D communication has introduced a number of issues and challenges that were not prevalent in traditional current cellular communication. One of the major issues in D2D is security that is required in D2D communication to transmit information securely over non secure channel. The major challenge when considering security is that current established security techniques cannot be modified as security-requiring devices are miniature with restricted processing and storage or are constrained by power and bandwidth issues. Another issue is that how devices can get secure mutual authentication for secure communication. To tackle these issues, a lightweight multifactor authentication scheme that allows multihop secure communication over open channel is designed called as Lightweight ECC based Multifactor Authentication Protocol (LEMAP) in multihop D2D communication. Formal analysis of scheme is performed using well known BAN Logic method which is used to check correctness of protocol. The formal analysis of LEMAP proves that it can mitigate replay attack, Man-in-the-Middle (MITM) attack, Rogue device attack, Denial of Service (DoS) attack, timestamp exploitation attack, impersonation attack and masquerading attack. LEMAP also achieves security requirements confidentiality, integrity, privacy, non-repudiation, secure mutual authentication and anonymity. The communication cost and computational overhead of benchmark protocols and the proposed scheme LEMAP are also calculated. The results show that LEMAP is 6%-28% percent stronger than the selected benchmark algorithms such as 2PAKEP, Chaotic based authentication and TwoFactor authentication protocol. Additionally, LEMAP provides additional security by using trust validation, double hashing, and reduced authentication overhead. Discrete logarithm analysis shows that LEMAP is more secure compared to current security algorithms or current security algos are used as attacks against LEMAP. LEMAP is a lightweight and flexible scheme which can be used in 5G as well as multihop D2D communication to provide secure communication environment. Keywords: D2D security, multihop D2D security, multi factor, light-weight security, EC

Swarm-Organized Topographic Mapping

Topographieerhaltende Abbildungen versuchen, hochdimensionale oder komplexe Datenbestände auf einen niederdimensionalen Ausgaberaum abzubilden, wobei die Topographie der Daten hinreichend gut wiedergegeben werden soll. Die Qualität solcher Abbildung hängt gewöhnlich vom eingesetzten Nachbarschaftskonzept des konstruierenden Algorithmus ab. Die Schwarm-Organisierte Projektion ermöglicht eine Lösung dieses Parametrisierungsproblems durch die Verwendung von Techniken der Schwarmintelligenz. Die praktische Verwendbarkeit dieser Methodik wurde durch zwei Anwendungen auf dem Feld der Molekularbiologie sowie der Finanzanalytik demonstriert

Reliable and Secure Drone-assisted MillimeterWave Communications

The next generation of mobile networks and wireless communication, including the fifth-generation (5G) and beyond, will provide a high data rate as one of its fundamental requirements. Providing high data rates can be accomplished through communication over high-frequency bands such as the Millimeter-Wave(mmWave) one. However, mmWave communication experiences short-range communication, which impacts the overall network connectivity. Improving network connectivity can be accomplished through deploying Unmanned Ariel Vehicles(UAVs), commonly known as drones, which serve as aerial small-cell base stations. Moreover, drone deployment is of special interest in recovering network connectivity in the aftermath of disasters. Despite the potential advantages, drone-assisted networks can be more vulnerable to security attacks, given their limited capabilities. This security vulnerability is especially true in the aftermath of a disaster where security measures could be at their lowest. This thesis focuses on drone-assisted mmWave communication networks with their potential to provide reliable communication in terms of higher network connectivity measures, higher total network data rate, and lower end-to-end delay. Equally important, this thesis focuses on proposing and developing security measures needed for drone-assisted networks’ secure operation. More specifically, we aim to employ a swarm of drones to have more connection, reliability, and secure communication over the mmWave band. Finally, we target both the cellular 5Gnetwork and Ad hoc IEEE802.11ad/ay in typical network deployments as well as in post-disaster circumstances

A Stochastic Geometry approach towards Green Communications in 5G

In this dissertation, we investigate two main research directions towards net- work efficiency and green communications in heterogeneous cellular networks (HetNets) as a promising network structure for the fifth generation of mobile systems. In order to analyze the networks, we use a powerful mathematical tool, named stochastic geometry. In our research, first we study the performance of MIMO technology in single-tier and two-tier HetNets. In this work, we apply a more realistic network model in which the correlation between tiers is taken into account. Comparing the obtained results with the commonly used model shows performance enhancement and greater efficiencies in cellular networks. As the second part of our research, we apply two Cell Zooming (CZ) techniques to HetNets. With focus on green communications, we present a K−tier HetNet in which BSs are only powered by energy har- vesting. Despite the uncertain nature of energy arrivals, combining two CZ techniques, namely telescopic and ON/OFF scenarios, enables us to achieve higher network performance in terms of the coverage and blocking probabilities while reducing the total power consumption and increasing the energy and spectral efficiencies

A Novel Location Free Link Prediction in Multiplex Social Networks

In recent decades, the emergence of social networks has enabled internet service providers (e.g., Facebook, Twitter and Uber) to achieve great commercial success. Link prediction is recognized as a common practice to build the topology of social networks and keep them evolving. Conventionally, link prediction methods are dependent of location information of users, which suffers from information leakage from time to time. To deal with this problem, companies of smart devices (e.g., Apple Inc.) keeps tightening their privacy policy, impeding internet service providers from acquiring location information. Therefore, it is of great importance to design location free link prediction methods, while the accuracy still preserves. In this study, a novel location free link prediction method is proposed for complex social networks. Experiments on real datasets show that the precision of our location free link prediction method increases by 10 percent

Energy aware network optimization with aerial base stations

To meet the fast-growing and highly diversified traffic demand, it is envisioned that unmanned aerial vehicles (UAVs), also known as drones, will become an indispensable part in the future communication system. Since UAVs are flexible, cost-effective, fast to deploy and have a better communication condition compared to terrestrial communication system, the use of drones is promising in a wide range of wireless networking applications. By moving closer to the targets, UAVs can act as data collectors to prolong the lifetime of wireless sensor networks (WSNs) or be used as energy transmitters to transfer more energy in wireless power transfer (WPT) scenarios. In particular, UAV based aerial base stations (BSs) have the ability to provide rapid and reliable wireless services wherever and whenever there is an excessive data demand and has become increasingly appealing to network service providers. In this thesis, we focus on UAVs serving as BSs to provide wireless services to ground users from the sky. Firstly, we consider the power-efficient deployment of multiple static aerial BSs, with the aim of covering a maximum number of ground users while avoiding inter-cell interference (ICI). The proposed techniques achieve an up to 30% higher coverage probability than the benchmark circle packing theory (CPT) when users are not distributed uniformly. In addition, the proposed iterative algorithm also greatly improves the power-efficiency by up to 15%. Secondly, by fully exploiting the mobility of UAVs, we study the trajectory and UAV-user scheduling and association of moving aerial BSs. The bottom line aim of UAV application, where an aerial BS is dispatched to satisfy the data demand of a maximum number of ground users with a given energy budget is considered. It is found that the moving aerial BS tends to move close to the targeted ground users to reduce path loss and enjoy a good communication condition. Simulation results show both energy and coverage performance gains for the proposed schemes compared to the benchmark technique

Multiuser MIMO techniques with feedback

Kooperative Antennenanlagen haben vor kurzem einen heißen Forschungsthema geworden, da Sie deutlich höhere spektrale Effizienz als herkömmliche zelluläre Systeme versprechen. Der Gewinn wird durch die Eliminierung von Inter-Zelle Störungen (ICI) durch Koordinierung der-Antenne Übertragungen erworben. Vor kurzem, verteilte Organisation Methoden vorgeschlagen. Eine der größten Herausforderungen für das Dezentrale kooperative Antennensystem ist Kanalschätzung für den Downlink Kanal besonders wenn FDD verwendet wird. Alle zugehörigen Basisstationen im genossenschaftlichen Bereich müssen die vollständige Kanal Informationen zu Wissen, die entsprechenden precoding Gewicht Matrix zu berechnen. Diese Information ist von mobilen Stationen übertragen werden Stationen mit Uplink Ressourcen zu stützen. Wird als mehrere Basisstationen und mehreren mobilen Stationen in kooperativen Antennensysteme und jede Basisstation und Mobilstation beteiligt sind, können mit mehreren Antennen ausgestattet sein, die Anzahl der Kanal Parameter wieder gefüttert werden erwartet, groß zu sein. In dieser Arbeit wird ein effizientes Feedback Techniken der downlink Kanal Informationen sind für die Multi-user Multiple Input Multiple Output Fall vorgeschlagen, der insbesondere auf verteilte kooperative Antennensysteme zielt. Zuerst wird ein Unterraum-basiertes Kanalquantisierungsverfahren vorgeschlagen, das ein vorbestimmtes Codebuch verwendet. Ein iterativer Codebuchentwurfsalgorithmus wird vorgeschlagen, der zu einem lokalen optimalen Codebuch konvergiert. Darüber hinaus werden Feedback-Overhead-Reduktionsverfahren entwickelt, die die zeitliche Korrelation des Kanals ausnutzen. Es wird gezeigt, dass das vorgeschlagene adaptive Codebuchverfahren in Verbindung mit einem Datenkomprimierungsschema eine Leistung nahe an dem perfekten Kanalfall erzielt, was viel weniger Rückkopplungsoverhead im Vergleich zu anderen Techniken erfordert. Das auf dem Unterraum basierende Kanalquantisierungsverfahren wird erweitert, indem mehrere Antennen auf der Senderseite und/oder auf der Empfängerseite eingeführt werden, und die Leistung eines Vorcodierungs- (/Decodierungs-) Schemas mit regulierter Blockdiagonalisierung (RBD) wurde untersucht. Es wird ein kosteneffizientes Decodierungsmatrixquantisierungsverfahren vorgeschlagen, dass eine komplexe Berechnung an der Mobilstation vermeiden kann, während es nur eine leichte Verschlechterung zeigt. Die Arbeit wird abgeschlossen, indem die vorgeschlagenen Feedback-Methoden hinsichtlich ihrer Leistung, ihres erforderlichen Feedback-Overheads und ihrer Rechenkomplexität verglichen werden.Cooperative antenna systems have recently become a hot research topic, as they promise significantly higher spectral efficiency than conventional cellular systems. The gain is acquired by eliminating inter-cell interference (ICI) through coordination of the base antenna transmissions. Recently, distributed organization methods have been suggested. One of the main challenges of the distributed cooperative antenna system is channel estimation for the downlink channel especially when FDD is used. All of the associated base stations in the cooperative area need to know the full channel state information to calculate the corresponding precoding weight matrix. This information has to be transferred from mobile stations to base stations by using uplink resources. As several base stations and several mobile stations are involved in cooperative antenna systems and each base station and mobile station may be equipped with multiple antennas, the number of channel state parameters to be fed back is expected to be big. In this thesis, efficient feedback techniques of the downlink channel state information are proposed for the multi-user multiple-input multiple-output case, targeting distributed cooperative antenna systems in particular. First, a subspace based channel quantization method is proposed which employs a predefined codebook. An iterative codebook design algorithm is proposed which converges to a local optimum codebook. Furthermore, feedback overhead reduction methods are devised exploiting temporal correlation of the channel. It is shown that the proposed adaptive codebook method in conjunction with a data compression scheme achieves a performance close to the perfect channel case, requiring much less feedback overhead compared with other techniques. The subspace based channel quantization method is extended by introducing multiple antennas at the transmitter side and/or at the receiver side and the performance of a regularized block diagonalization (RBD) precoding(/decoding) scheme has been investigated as well as a zero-forcing (ZF) precoding scheme. A cost-efficient decoding matrix quantization method is proposed which can avoid a complex computation at the mobile station while showing only a slight degradation. The thesis is concluded by comparing the proposed feedback methods in terms of their performance, their required feedback overhead, and their computational complexity. The techniques that are developed in this thesis can be useful and applicable for 5G, which is envisioned to support the high granularity/resolution codebook and its efficient deployment schemes. Keywords: MU-MIMO, COOPA, limited feedback, CSI, CQ, feedback overhead reduction, Givens rotatio

Security and Privacy for Modern Wireless Communication Systems

The aim of this reprint focuses on the latest protocol research, software/hardware development and implementation, and system architecture design in addressing emerging security and privacy issues for modern wireless communication networks. Relevant topics include, but are not limited to, the following: deep-learning-based security and privacy design; covert communications; information-theoretical foundations for advanced security and privacy techniques; lightweight cryptography for power constrained networks; physical layer key generation; prototypes and testbeds for security and privacy solutions; encryption and decryption algorithm for low-latency constrained networks; security protocols for modern wireless communication networks; network intrusion detection; physical layer design with security consideration; anonymity in data transmission; vulnerabilities in security and privacy in modern wireless communication networks; challenges of security and privacy in node–edge–cloud computation; security and privacy design for low-power wide-area IoT networks; security and privacy design for vehicle networks; security and privacy design for underwater communications networks