Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey

This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical-layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers without relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical-layer message authentication is also introduced briefly. The survey concludes with observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials, 201

Security for 5G Mobile Wireless Networks

The advanced features of 5G mobile wireless network systems yield new security requirements and challenges. This paper presents a comprehensive survey on security of 5G wireless network systems compared to the traditional cellular networks. The paper starts with a review on 5G wireless networks particularities as well as on the new requirements and motivations of 5G wireless security. The potential attacks and security services with the consideration of new service requirements and new use cases in 5G wireless networks are then summarized. The recent development and the existing schemes for the 5G wireless security are presented based on the corresponding security services including authentication, availability, data confidentiality, key management and privacy. The paper further discusses the new security features involving different technologies applied to 5G such as heterogeneous networks, device-to-device communications, massive multiple-input multiple-output, software defined networks and Internet of Things. Motivated by these security research and development activities, we propose a new 5G wireless security architecture, based on which the analysis of identity management and flexible authentication is provided. As a case study, we explore a handover procedure as well as a signaling load scheme to show the advantage of the proposed security architecture. The challenges and future directions of 5G wireless security are finally summarized

Network coding-aided MAC protocols for cooperative wireless networks

The introduction of third generation (3G) technologies has caused a vast proliferation of wireless devices and networks, generating an increasing demand for high level Quality of Service (QoS). The wide spread of mobile applications has further reinforced the user need for communication, motivating at the same time the concepts of user cooperation and data dissemination. However, this trend towards continuous exchange of information and ubiquitous connectivity is inherently restricted by the energy-greedy functionalities of high-end devices. These limitations, along with the pressure exerted on the Information and Communications Technology (ICT) industry towards energy awareness, have induced the design of novel energy efficient schemes and algorithms. In this context, the Medium Access Control (MAC) layer plays a key role, since it is mainly responsible for the channel access regulation, the transmission scheduling and the resource allocation, thus constituting an appropriate point to effectively address energy efficiency issues that arise due to the users overcrowding. This dissertation provides a contribution to the design, analysis and evaluation of novel MAC protocols for cooperative wireless networks. In our attempt to design energy efficient MAC schemes, we were extensively assisted by the introduction of new techniques, such as Network Coding (NC), that intrinsically bring considerable gains in system performance. The main thesis contributions are divided into two parts. The first part presents NCCARQ, a novel NC-aided Cooperative Automatic Repeat reQuest (ARQ) MAC protocol for wireless networks. NCCARQ introduces a new access paradigm for cooperative ARQ schemes, exploiting NC benefits in bidirectional communication among wireless users. The NCCARQ performance in terms of QoS and energy efficiency is assessed by means of analytical probabilistic models and extensive computer-based simulations, revealing the significant gains we can achieve compared to standardized MAC solutions. In addition, the impact of realistic wireless channel conditions on the MAC protocol operation further motivated us to study the NCCARQ performance in wireless links affected by correlated shadowing, showing that the channel correlation may adversely affect the distributed cooperation benefits. The second part of the thesis is dedicated to the investigation of MAC issues in wireless data dissemination scenarios. In particular, the existence of multiple source nodes in such scenarios generates conflicting situations, considering the selfish behavior of the wireless devices that want to maximize their battery lifetime. Bearing in mind the energy efficiency importance, we propose game theoretic medium access strategies, applying energy-based utility functions which inherently imply energy awareness. In addition, Random Linear NC (RLNC) techniques are adopted to eliminate the need of exchanging excessive control packets, while Analog NC (ANC) is employed to efface the impact of collisions throughout the communication. During the elaboration of this thesis, two general key conclusions have been extracted. First, there is a fundamental requirement for implementation of new MAC protocols in order to effectively deal with state-of-the-art techniques (e.g., NC), recently introduced to enhance both the performance and the energy efficiency of the network. Second, we highlight the importance of designing novel energy efficient MAC protocols, taking into account that traditional approaches - designed mainly to assist the collision avoidance in wireless networks - tend to be obsolete.La presente tesis doctoral contribuye al diseño, análisis y evaluación de nuevos protocolos MAC cooperativos para redes inalámbricas. La introducción de nuevas técnicas, tales como la codificación de red (NC), que intrínsecamente llevan un considerable aumento en el rendimiento del sistema, nos ayudó ampliamente durante el diseño de protocolos MAC energéticamente eficientes. Las principales contribuciones de esta tesis se dividen en dos partes. La primera parte presenta el NCCARQ, un protocolo cooperativo de retransmisión automática (ARQ), asistido por NC para redes inalámbricas. La segunda parte de la tesis se centra en el diseño de protocolos de capa MAC en escenarios inalámbricos de difusión de datos. Teniendo en cuenta la importancia de la eficiencia energética, se proponen técnicas de acceso al medio basadas en teoría de juegos dónde las funciones objetivo están motivadas por el consumo energético. Las soluciones propuestas son evaluadas por medio de modelos analíticos y simulaciones por ordenador

Advanced Technologies for Device-to-device Communications Underlaying Cellular Networks

The past few years have seen a major change in cellular networks, as explosive growth in data demands requires more and more network capacity and backhaul capability. New wireless technologies have been proposed to tackle these challenges. One of the emerging technologies is device-to-device (D2D) communications. It enables two cellular user equip- ment (UEs) in proximity to communicate with each other directly reusing cellular radio resources. In this case, D2D is able to of oad data traf c from central base stations (BSs) and signi cantly improve the spectrum ef ciency of a cellular network, and thus is one of the key technologies for the next generation cellular systems. Radio resource management (RRM) for D2D communications and how to effectively exploit the potential bene ts of D2D are two paramount challenges to D2D communications underlaying cellular networks. In this thesis, we focus on four problems related to these two challenges. In Chapter 2, we utilise the mixed integer non-linear programming (MINLP) to model and solve the RRM optimisation problems for D2D communications. Firstly we consider the RRM optimisation problem for D2D communications underlaying the single carrier frequency division multiple access (SC-FDMA) system and devise a heuristic sub- optimal solution to it. Then we propose an optimised RRM mechanism for multi-hop D2D communications with network coding (NC). NC has been proven as an ef cient technique to improve the throughput of ad-hoc networks and thus we apply it to multi-hop D2D communications. We devise an optimal solution to the RRM optimisation problem for multi-hop D2D communications with NC. In Chapter 3, we investigate how the location of the D2D transmitter in a cell may affect the RRM mechanism and the performance of D2D communications. We propose two optimised location-based RRM mechanisms for D2D, which maximise the throughput and the energy ef ciency of D2D, respectively. We show that, by considering the location information of the D2D transmitter, the MINLP problem of RRM for D2D communications can be transformed into a convex optimisation problem, which can be ef ciently solved by the method of Lagrangian multipliers. In Chapter 4, we propose a D2D-based P2P le sharing system, which is called Iunius. The Iunius system features: 1) a wireless P2P protocol based on Bittorrent protocol in the application layer; 2) a simple centralised routing mechanism for multi-hop D2D communications; 3) an interference cancellation technique for conventional cellular (CC) uplink communications; and 4) a radio resource management scheme to mitigate the interference between CC and D2D communications that share the cellular uplink radio resources while maximising the throughput of D2D communications. We show that with the properly designed application layer protocol and the optimised RRM for D2D communications, Iunius can signi cantly improve the quality of experience (QoE) of users and of oad local traf c from the base station. In Chapter 5, we combine LTE-unlicensed with D2D communications. We utilise LTE-unlicensed to enable the operation of D2D in unlicensed bands. We show that not only can this improve the throughput of D2D communications, but also allow D2D to work in the cell central area, which normally regarded as a “forbidden area” for D2D in existing works. We achieve these results mainly through numerical optimisation and simulations. We utilise a wide range of numerical optimisation theories in our works. Instead of utilising the general numerical optimisation algorithms to solve the optimisation problems, we modify them to be suitable for the speci c problems, thereby reducing the computational complexity. Finally, we evaluate our proposed algorithms and systems through sophisticated numer- ical simulations. We have developed a complete system-level simulation framework for D2D communications and we open-source it in Github: https://github.com/mathwuyue/py- wireless-sys-sim

Resource Allocation in Underlay and Overlay Spectrum Sharing

As the wireless communication technologies evolve and the demand of wireless services increases, spectrum scarcity becomes a bottleneck that limits the introduction of new technologies and services. Spectrum sharing between primary and secondary users has been brought up to improve spectrum efficiency. In underlay spectrum sharing, the secondary user transmits simultaneously with the primary user, under the constraint that the interference induced at the primary receiver is below a certain threshold, or a certain primary rate requirement has to be satisfied. Specifically, in this thesis, the coexistence of a multiple-input single-output (MISO) primary link and a MISO/multiple-input multiple-output (MIMO) secondary link is studied. The primary transmitter employs maximum ratio transmission (MRT), and single-user decoding is deployed at the primary receiver. Three scenarios are investigated, in terms of the interference from the primary transmitter to the secondary receiver, namely, weak interference, strong interference and very strong interference, or equivalently three ranges of primary rate requirement. Rate splitting and successive decoding are deployed at the secondary transmitter and receiver, respectively, when it is feasible, and otherwise single-user decoding is deployed at the secondary receiver. For each scenario, optimal beamforming/precoding and power allocation at the secondary transmitter is derived, to maximize the achievable secondary rate while satisfying the primary rate requirement and the secondary power constraint. Numerical results show that rate splitting at the secondary transmitter and successive decoding at the secondary receiver does significantly increase the achievable secondary rate if feasible, compared with single-user decoding at the secondary receiver. In overlay spectrum sharing, different from underlay spectrum sharing, the secondary transmitter can utilize the knowledge of the primary message, which is acquired non-causally (i.e., known in advance before transmission) or causally (i.e., acquired in the first phase of a two-phase transmission), to help transmit the primary message besides its own message. Specifically, the coexistence of a MISO primary link and a MISO/MIMO secondary link is studied. When the secondary transmitter has non-causal knowledge of the primary message, dirty-paper coding (DPC) can be deployed at the secondary transmitter to precancel the interference (when decoding the secondary message at the secondary receiver), due to the transmission of the primary message from both transmitters. Alternatively, due to the high implementation complexity of DPC, linear precoding can be deployed at the secondary transmitter. In both cases, the primary transmitter employs MRT, and single-user decoding is deployed at the primary receiver; optimal beamforming/precoding and power allocation at the secondary transmitter is obtained, to maximize the achievable secondary rate while satisfying the primary rate requirement and the secondary power constraint. Numerical results show that with non-causal knowledge of the primary message and the deployment of DPC at the secondary transmitter, overlay spectrum sharing can achieve a significantly higher secondary rate than underlay spectrum sharing, while rate loss occurs with the deployment of linear precoding instead of DPC at the secondary transmitter. When the secondary transmitter does not have non-causal knowledge of the primary message, and still wants to help with the primary transmission in return for the access to the spectrum, it can relay the primary message in an amplify-and-forward (AF) or a decode-and-forward (DF) way in a two-phase transmission, while transmitting its own message. The primary link adapts its transmission strategy and cooperates with the secondary link to fulfill its rate requirement. To maximize the achievable secondary rate while satisfying the primary rate requirement and the primary and secondary power constraints, in the case of AF cooperative spectrum sharing, optimal relaying matrix and beamforming vector at the secondary transmitter is obtained; in the case of DF cooperative spectrum sharing, a set of parameters are optimized, including time duration of the two phases, primary transmission strategies in the two phases and secondary transmission strategy in the second phase. Numerical results show that with the cooperation from the secondary link, the primary link can avoid outage effectively, especially when the number of antennas at the secondary transceiver is large, while the secondary link can achieve a significant rate. Power is another precious resource besides spectrum. Instead of spectrum efficiency, energy-efficient spectrum sharing focuses on the energy efficiency (EE) optimization of the secondary transmission. The EE of the secondary transmission is defined as the ratio of the achievable secondary rate and the secondary power consumption, which includes both the transmit power and the circuit power at the secondary transmitter. For simplicity, the circuit power is modeled as a constant. Specifically, the EE of a MIMO secondary link in underlay spectrum sharing is studied. Three transmission strategies are introduced based on the primary rate requirement and the channel conditions. Rate splitting and successive decoding are deployed at the secondary transmitter and receiver, respectively, when it is feasible, and otherwise single-user decoding is deployed at the secondary receiver. For each case, optimal transmit covariance matrices at the secondary transmitter are obtained, to maximize the EE of the secondary transmission while satisfying the primary rate requirement and the secondary power constraint. Based on this, an energy-efficient resource allocation algorithm is proposed. Numerical results show that MIMO underlay spectrum sharing with EE optimization can achieve a significantly higher EE compared with MIMO underlay spectrum sharing with rate optimization, at certain SNRs and with certain circuit power, at the cost of the achievable secondary rate, while saving the transmit power. With rate splitting at the secondary transmitter and successive decoding at the secondary receiver if feasible, a significantly higher EE can be achieved compared with the case when only single-user decoding is deployed at the secondary receiver. Moreover, the EE of a MIMO secondary link in overlay spectrum sharing is studied, where the secondary transmitter has non-causal knowledge of the primary message and employs DPC to obtain an interference-free secondary link. Energy-efficient precoding and power allocation is obtained to maximize the EE of the secondary transmission while satisfying the primary rate requirement and the secondary power constraint. Numerical results show that MIMO overlay spectrum sharing with EE optimization can achieve a significantly higher EE compared with MIMO overlay spectrum sharing with rate optimization, at certain SNRs and with certain circuit power, at the cost of the achievable secondary rate, while saving the transmit power. MIMO overlay spectrum sharing with EE optimization can achieve a higher EE compared with MIMO underlay spectrum sharing with EE optimization.Aufgrund der rasanten Entwicklung im Bereich der drahtlosen Kommunikation und der ständig steigenden Nachfrage nach mobilen Anwendungen ist die Knappheit von Frequenzbändern ein entscheidender Engpass, der die Einführung neuer Funktechnologien behindert. Die gemeinsame Benutzung von Frequenzen (Spektrum-Sharing) durch primäre und sekundäre Nutzer ist eine Möglichkeit, die Effizienz bei der Verwendung des Spektrums zu verbessern. Bei der Methode des Underlay-Spektrum-Sharing sendet der sekundäre Nutzer zeitgleich mit dem primären Nutzer unter der Einschränkung, dass für den primären Nutzer die erzeugte Interferenz unterhalb eines Schwellwertes liegt oder gewisse Anforderungen an die Datenrate erfüllt werden. In diesem Zusammenhang wird in der Arbeit insbesondere die Koexistenz von Mehrantennensystemen untersucht. Dabei wird für die primäre Funkverbindung der Fall mit mehreren Sendeantennen und einer Empfangsantenne (MISO) angenommen. Für die sekundäre Funkverbindung werden mehrere Sendeantennen und sowohl eine als auch mehrere Empfangsantennen (MISO/MIMO) betrachtet. Der primäre Sender verwendet Maximum-Ratio-Transmission (MRT) und der primäre Empfänger Einzelnutzerdecodierung. Für den sekundären Nutzer werden außerdem am Sender eine Datenratenaufteilung (rate splitting) und am Empfänger entweder eine sukzessive Decodierung – sofern sinnvoll – oder andernfalls eine Einzelnutzerdecodierung verwendet. Im Unterschied zur Methode des Underlay-Spektrum-Sharing kann der sekundäre Nutzer beim Verfahren des Overlay-Spektrum-Sharing die Kenntnis über die Nachrichten des primären Nutzers einsetzen, um die Übertragung sowohl der eigenen als auch der primären Nachrichten zu unterstützen. Das Wissen über die Nachrichten erhält er entweder nicht-kausal, d.h. vor der Übertragung, oder kausal, d.h. während der ersten Phase einer zweistufigen Übertragung. In der Arbeit wird speziell die Koexistenz von primären MISO-Funkverbindungen und sekundären MISO/MIMO-Funkverbindungen untersucht. Bei nicht-kausaler Kenntnis über die primären Nachrichten kann der sekundäre Sender beispielsweise das Verfahren der Dirty-Paper-Codierung (DPC) verwenden, welches es ermöglicht, die Interferenz durch die primären Nachrichten bei der Decodierung der sekundären Nachrichten am sekundären Empfänger aufzuheben. Da die Implementierung der DPC mit einer hohen Komplexität verbunden ist, kommt als Alternative auch eine lineare Vorcodierung zum Einsatz. In beiden Fällen verwendet der primäre Transmitter MRT und der primäre Empfänger Einzelnutzerdecodierung. Besitzt der sekundäre Nutzer keine nicht-kausale Kenntnis über die primären Nachrichten, so kann er als Gegenleistung für die Mitbenutzung des Spektrums dennoch die Übertragung der primären Nachrichten unterstützen. Hierfür leitet er die primären Nachrichten mit Hilfe der Amplify-And-Forward-Methode oder der Decode-And-Forward-Methode in einer zweitstufigen Übertragung weiter, währenddessen er seine eigenen Nachrichten sendet. Der primäre Nutzer passt seine Sendestrategie entsprechend an und kooperiert mit dem sekundären Nutzer, um die Anforderungen an die Datenrate zu erfüllen. Nicht nur das Spektrum sondern auch die Sendeleistung ist eine wichtige Ressource. Daher wird zusätzlich zur Effizienz bei der Verwendung des Spektrums auch die Energieeffizienz (EE) einer sekundären MIMO-Funkverbindung für das Underlay-Spektrum-Sharing-Verfahren analysiert. Wie zuvor wird für den sekundären Nutzer am Sender eine Datenratenaufteilung (rate splitting) und am Empfänger entweder eine sukzessive Decodierung oder eine Einzelnutzerdecodierung betrachtet. Weiterhin wird die EE einer sekundären MIMO-Funkverbindung für das Overlay-Spektrum-Sharing-Verfahren untersucht. Dabei nutzt der sekundäre Nutzer die nicht-kausale Kenntnis über die primären Nachrichten aus, um mittels DPC eine interferenzfreie sekundäre Funkverbindung zu erhalten

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

From its introduction to its quindecennial, network coding has built a strong reputation for enhancing packet recovery and achieving maximum information flow in both wired and wireless networks. Traditional studies focused on optimizing the throughput of the system by proposing elaborate schemes able to reach the network capacity. With the shift toward distributed computing on mobile devices, performance and complexity become both critical factors that affect the efficiency of a coding strategy. Instantly decodable network coding presents itself as a new paradigm in network coding that trades off these two aspects. This paper review instantly decodable network coding schemes by identifying, categorizing, and evaluating various algorithms proposed in the literature. The first part of the manuscript investigates the conventional centralized systems, in which all decisions are carried out by a central unit, e.g., a base-station. In particular, two successful approaches known as the strict and generalized instantly decodable network are compared in terms of reliability, performance, complexity, and packet selection methodology. The second part considers the use of instantly decodable codes in a device-to-device communication network, in which devices speed up the recovery of the missing packets by exchanging network coded packets. Although the performance improvements are directly proportional to the computational complexity increases, numerous successful schemes from both the performance and complexity viewpoints are identified

A Mixed-Integer Programming Approach for Jammer Placement Problems for Flow-Jamming Attacks on Wireless Communication Networks

In this dissertation, we study an important problem of security in wireless networks. We study different attacks and defense strategies in general and more specifically jamming attacks. We begin the dissertation by providing a tutorial introducing the operations research community to the various types of attacks and defense strategies in wireless networks. In this tutorial, we give examples of mathematical programming models to model jamming attacks and defense against jamming attacks in wireless networks. Later we provide a comprehensive taxonomic classification of the various types of jamming attacks and defense against jamming attacks. The classification scheme will provide a one stop location for future researchers on various jamming attack and defense strategies studied in literature. This classification scheme also highlights the areas of research in jamming attack and defense against jamming attacks which have received less attention and could be a good area of focus for future research. In the next chapter, we provide a bi-level mathematical programming model to study jamming attack and defense strategy. We solve this using a game-theoretic approach and also study the impact of power level, location of jamming device, and the number of transmission channels available to transmit data on the attack and defense against jamming attacks. We show that by increasing the number of jamming devices the throughput of the network drops by at least 7%. Finally we study a special type of jamming attack, flow-jamming attack. We provide a mathematical programming model to solve the location of jamming devices to increase the impact of flow-jamming attacks on wireless networks. We provide a Benders decomposition algorithm along with some acceleration techniques to solve large problem instances in reasonable amount of time. We draw some insights about the impact of power, location and size of the network on the impact of flow-jamming attacks in wireless networks

A Mixed-Integer Programming Approach for Jammer Placement Problems for Flow-Jamming Attacks on Wireless Communication Networks

In this dissertation, we study an important problem of security in wireless networks. We study different attacks and defense strategies in general and more specifically jamming attacks. We begin the dissertation by providing a tutorial introducing the operations research community to the various types of attacks and defense strategies in wireless networks. In this tutorial, we give examples of mathematical programming models to model jamming attacks and defense against jamming attacks in wireless networks. Later we provide a comprehensive taxonomic classification of the various types of jamming attacks and defense against jamming attacks. The classification scheme will provide a one stop location for future researchers on various jamming attack and defense strategies studied in literature. This classification scheme also highlights the areas of research in jamming attack and defense against jamming attacks which have received less attention and could be a good area of focus for future research. In the next chapter, we provide a bi-level mathematical programming model to study jamming attack and defense strategy. We solve this using a game-theoretic approach and also study the impact of power level, location of jamming device, and the number of transmission channels available to transmit data on the attack and defense against jamming attacks. We show that by increasing the number of jamming devices the throughput of the network drops by at least 7%. Finally we study a special type of jamming attack, flow-jamming attack. We provide a mathematical programming model to solve the location of jamming devices to increase the impact of flow-jamming attacks on wireless networks. We provide a Benders decomposition algorithm along with some acceleration techniques to solve large problem instances in reasonable amount of time. We draw some insights about the impact of power, location and size of the network on the impact of flow-jamming attacks in wireless networks

Resource allocation in future green wireless networks : applications and challenges

Over the past few years, green radio communication has been an emerging topic since the footprint from the Information and Communication Technologies (ICT) is predicted to increase 7.3% annually and then exceed 14% of the global footprint by 2040. Moreover, the explosive progress of ICT, e.g., the fifth generation (5G) networks, has resulted in expectations of achieving 10-fold longer device battery lifetime, and 1000-fold higher global mobile data traffic over the fourth generation (4G) networks. Therefore, the demands for increasing the data rate and the lifetime while reducing the footprint in the next-generation wireless networks call for more efficient utilization of energy and other resources. To overcome this challenge, the concepts of small-cell, energy harvesting, and wireless information and power transfer networks can be evaluated as promising solutions for re-greening the world. In this dissertation, the technical contributions in terms of saving economical cost, protecting the environment, and guaranteeing human health are provided. More specifically, novel communication scenarios are proposed to minimize energy consumption and hence save economic costs. Further, energy harvesting (EH) techniques are applied to exploit available green resources in order to reduce carbon footprint and then protect the environment. In locations where implemented user devices might not harvest energy directly from natural resources, base stations could harvest-and-store green energy and then use such energy to power the devices wirelessly. However, wireless power transfer (WPT) techniques should be used in a wise manner to avoid electromagnetic pollution and then guarantee human health. To achieve all these aspects simultaneously, this thesis proposes promising schemes to optimally manage and allocate resources in future networks. Given this direction, in the first part, Chapter 2 mainly studies a transmission power minimization scheme for a two-tier heterogeneous network (HetNet) over frequency selective fading channels. In addition, the HetNet backhaul connection is unable to support a sufficient throughput for signaling an information exchange between two tiers. A novel idea is introduced in which the time reversal (TR) beamforming technique is used at a femtocell while zero-forcing-based beamforming is deployed at a macrocell. Thus, a downlink power minimizationscheme is proposed, and optimal closed-form solutions are provided. In the second part, Chapters 3, 4, and 5 concentrate on EH and wireless information and power transfer (WIPT) using RF signals. More specifically, Chapter 3 presents an overview of the recent progress in green radio communications and discusses potential technologies for some emerging topics on the platforms of EH and WPT. Chapter 4 develops a new integrated information and energy receiver architecture based on the direct use of alternating current (AC) for computation. It is shown that the proposed approach enhances not only the computational ability but also the energy efficiency over the conventional one. Furthermore, Chapter 5 proposes a novel resource allocation scheme in simultaneous wireless information and power transfer (SWIPT) networks where three crucial issues: power-efficient improvement, user-fairness guarantee, and non-ideal channel reciprocity effect mitigation, are jointly addressed. Hence, novel methods to derive optimal and suboptimal solutions are provided. In the third part, Chapters 6, 7, and 8 focus on simultaneous lightwave information and power transfer (SLIPT) for indoor applications, as a complementary technology to RF SWIPT. In this research, Chapter 6 investigates a hybrid RF/visible light communication (VLC) ultrasmall cell network where optical transmitters deliver information and power using the visible light, whereas an RF access point works as a complementary power transfer system. Thus, a novel resource allocation scheme exploiting RF and visible light for power transfer is devised. Chapter 7 proposes the use of lightwave power transfer to enable future sustainable Federated Learning (FL)-based wireless networks. FL is a new data privacy protection technique for training shared machine learning models in a distributed approach. However, the involvement of energy-constrained mobile devices in the construction of the shared learning models may significantly reduce their lifetime. The proposed approach can support the FL-based wireless network to overcome the issue of limited energy at mobile devices. Chapter 8 introduces a novel framework for collaborative RF and lightwave power transfer for wireless communication networks. The constraints on the transmission power set by safety regulations result in significant challenges to enhance the power transfer performance. Thus, the study of technologies complementary to conventional RF SWIPT is essential. To cope with this isue, this chapter proposes a novel collaborative RF and lightwave power transfer technology for next-generation wireless networks

Fair relay selection in wireless rural networks using game theory

Access to Internet is the key to facilitate the economic growth and development of the rural communities and to bridge the digital-divide between the urban and rural population. The traditional broadband access technologies are not always suitable for the rural areas due to their difficult topography and sparsely populated communities. Specialized relay stations can be deployed to extend the coverage of a wireless rural network but they come with an inherited increase in the infrastructural cost. An alternative is to utilize the in-range users as relays to enhance the coverage range of the wireless rural network. In this thesis, the in-range ordinary users termed as primary users (PUs) are used to act as relays for the out-of-range users called the secondary users (SUs). Two relay selection solutions, the Fair Battery Power Consumption (FBPC) algorithm and the Credit based Fair Relay Selection (CF-RS) protocol have been proposed with the aim of providing fair chance to every PU to assist the SUs, thus resulting in fair utilization of battery power of all relays along with the coverage extension. The FBPC algorithm uses the concept of proportional fairness as the relay selection criterion. However, if only proportionally fair consumption of battery power is taken as the relay selection parameter, the FBPC algorithm may result in selecting relays with poor channel conditions. The rural network may also consist of selfish PUs which need to be incentivized to use their resources for the SUs. The CF-RS protocol is developed which takes into account both the achievable data rate and consumption of battery power for selection of a relay. The CF-RS protocol is formulated using Stackelberg game which employs a credit-based incentive mechanism to motivate the self-interested PUs to help the SUs by providing instantaneous as well as long term benefit to the PUs. A basic network model consisting of PUs and SUs has been simulated and the performance of the FBPC algorithm and the CF-RS protocol have been evaluated in terms of data rate and utility achievable at the SUs, dissipation of battery power of the PUs and Jain’s fairness index to determine fairness in utilization of battery power. The results obtained show that the FBPC algorithm achieves approximately 100% fairness for utilization of battery power of relays but compromises the data rate attainable by the SUs. Thus the FBPC algorithm shall be viewed as a trade-off between the fair battery power dissipation of relays and the data rate achievable by the SUs. Whereas, the CF-RS protocol provides 55% better utility and longer service time to the SUs without harming the attainable data rate and achieves 80% fairness. When the CF-RS protocol is used for relay selection, it is advantageous even for the self-interested users to participate in the relaying process to earn some benefit to utilize it when needed to buy assistance from other users