Incentivizing Signal and Energy Cooperation in Wireless Networks

Abstract-We consider a two-hop wireless network where the source(s) in the network have the ability to wirelessly power the relay(s) who also have their own data to send to the destination. Considering the fact that each node in the network aims to maximize its own metric, we adopt a game theoretic approach that foresees offering relaying of the sources' data in exchange for energy provided to the relays, and simultaneously offering energy to the relays in exchange for their relaying services. We first study a Stackelberg competition with the single relay node as the leader, and investigate the impact of having multiple source nodes in the system. We next study the reciprocal Stackelberg game with the single source as the leader, and investigate the inter-relay competition with multiple relays. We find that in the Stackelberg games, the leader can improve its individual utility by influencing the follower's decision accordingly, even more so when there are multiple followers. We next formulate a noncooperative game between the source and the relay and show the existence of a unique Nash equilibrium by an appropriate pricing mechanism. The equilibrium maximizes the total utility of the network and allows the destination to choose how much data to receive from each node

Stochastic Optimization of Energy Harvesting Wireless Communication Networks

Energy harvesting from environmental energy sources (e.g., sunlight) or from man-made sources (e.g., RF energy) has been a game-changing paradigm, which enabled the possibility of making the devices in the Internet of Things or wireless sensor networks operate autonomously and with high performance for years or even decades without human intervention. However, an energy harvesting system must be correctly designed to achieve such a goal and therefore the energy management problem has arisen and become a critical aspect to consider in modern wireless networks. In particular, in addition to the hardware (e.g., in terms of circuitry design) and application point of views (e.g., sensor deployment), also the communication protocol perspective must be explicitly taken into account; indeed, the use of the wireless communication interface may play a dominant role in the energy consumption of the devices, and thus must be correctly designed and optimized. This analysis represents the focus of this thesis. Energy harvesting for wireless system has been a very active research topic in the past decade. However, there are still many aspects that have been neglected or not completely analyzed in the literature so far. Our goal is to address and solve some of these new problems using a common stochastic optimization setup based on dynamic programming. In particular, we formulate both the centralized and decentralized optimization problems in an energy harvesting network with multiple devices, and discuss the interrelations between these two schemes; we study the combination of environmental energy harvesting and wireless energy transfer to improve the transmission rate of the network and achieve a balanced situation; we investigate the long-term optimization problem in wireless powered communication networks, in which the receiver supplies wireless energy to the terminal nodes; we deal with the energy storage inefficiencies of the energy harvesting devices, and show that traditional policies may be strongly suboptimal in this context; finally, we investigate how it is possible to increase secrecy in a wireless link where a third malicious party eavesdrops the information transmitted by an energy harvesting node

Energy Harvesting Communication Networks with System Costs

This dissertation focuses on characterizing optimal energy management policies for energy harvesting communication networks with system costs. The system costs that we consider are the cost of circuitry to be on (processing cost) at the transmitters, cost of decoding at the receivers, cost of moving to harvest more energy in mobile energy harvesting nodes, and the cost of collecting measurements (sampling cost) from physical phenomena. We first consider receiver decoding costs in networks where receivers, in addition to transmitters, rely on energy harvested from nature to communicate. Energy harvested at the receivers is used to decode their intended messages, and is modeled as a convex increasing function of the incoming rate. With the goal of maximizing throughput by a given deadline, we study single-user and multi-user settings, and show that decoding costs at the receivers can be represented as generalized data arrivals at the transmitters. This introduces a further coupling between the transmitters and receivers of the network and allows us to characterize optimal policies by moving all constraints to the transmitter side. Next, we study the decoding cost effect on energy harvesting cooperative multiple access channels, where users employ data cooperation to increase their achievable rates. Data cooperation requires each user to decode the other user's data before forwarding it to the destination, which uses up some of the harvested energy. With the presence of decoding costs, we show that data cooperation may not be always helpful; if the decoding costs are relatively high, then sending directly to the receiver without data cooperation between the users achieves higher throughput. When cooperation is helpful, we determine the optimum allocation of available energy between decoding cooperative partner's data and forwarding it to the destination. We then study the impact of adding processing costs, on top of decoding costs, in energy harvesting two-way channels. Processing costs are the amounts of energy spent for circuitry operation, and are incurred whenever a user is communicating. We show that due to processing costs, transmission may become bursty, where users communicate through only a portion of the time. We develop an optimal scheme that maximizes the sum throughput by a given deadline under both decoding and processing costs. Next, we focus on online policies. We consider a single-user energy harvesting channel where the transmitter is equipped with a finite-sized battery, and the goal is to maximize the long term average utility, for general concave increasing utility functions. We show that fixed fraction policies are near optimal; they achieve a long term average utility that lies within constant multiplicative and additive gaps from the optimal solution for all battery sizes and all independent and identically distributed energy arrival patterns. We then consider a specific scenario of a utility function that measures the distortion of Gaussian samples communicated over a Gaussian channel. We formulate two problems: one with, and the other without sampling costs, and design near optimal fixed fraction policies for the two problems. Then, we consider another aspect of costs in energy harvesting single-user channels, that is, the energy spent in physical movement in search of better energy harvesting locations. Since movement has a cost, there exists a tradeoff between staying at the same location and moving to a new one. Staying at the same location allows the transmitter to use all its available energy in transmission, while moving to a new one may let the transmitter harvest higher amounts of energy and achieve higher rates at the expense of a cost incurred through the relocation process. We characterize this tradeoff optimally under both offline and online settings. Next, we consider different performance metrics, other than throughput, in energy harvesting communication networks. First, we study the issue of delay in single-user and broadcast energy harvesting channels. We define the delay per data unit as the time elapsed from the unit's arrival at the transmitter to its departure. With a pre-specified amount of data to be delivered, we characterize delay minimal energy management policies. We show that the structure of the optimal policy is different from throughput-optimal policies; to minimize the average delay, earlier arriving data units are transmitted using higher powers than later arriving ones, and the transmit power may reach zero, leading to communication gaps, in between energy or data arrival instances. Finally, we conclude this dissertation by considering the metric of the age of information in energy harvesting two-hop networks, where a transmitter is communicating with a receiver through a relay. Different from delay, the age of information is defined as the time elapsed since the latest data unit has reached the destination. We show that age minimal policies are such that the transmitter sends message updates to the relay just in time as the relay is ready to forward them to the receiver

Localization Of Sensors In Presence Of Fading And Mobility

The objective of this dissertation is to estimate the location of a sensor through analysis of signal strengths of messages received from a collection of mobile anchors. In particular, a sensor node determines its location from distance measurements to mobile anchors of known locations. We take into account the uncertainty and fluctuation of the RSS as a result of fading and take into account the decay of the RSS which is proportional to the transmitter-receiver distance power raised to the PLE. The objective is to characterize the channel in order to derive accurate distance estimates from RSS measurements and then utilize the distance estimates in locating the sensors. To characterize the channel, two techniques are presented for the mobile anchors to periodically estimate the channel\u27s PLE and fading parameter. Both techniques estimate the PLE by solving an equation via successive approximations. The formula in the first is stated directly from MLE analysis whereas in the second is derived from a simple probability analysis. Then two distance estimates are proposed, one based on a derived formula and the other based on the MLE analysis. Then a location technique is proposed where two anchors are sufficient to uniquely locate a sensor. That is, the sensor narrows down its possible locations to two when collects RSS measurements transmitted by a mobile anchor, then uniquely determines its location when given a distance to the second anchor. Analysis shows the PLE has no effect on the accuracy of the channel characterization, the normalized error in the distance estimation is invariant to the estimated distance, and accurate location estimates can be achieved from a moderate sample of RSS measurements

Energy Harvesting Communication Networks: Online Policies, Temperature Considerations, and Age of Information

This dissertation focuses on characterizing energy management policies for energy harvesting communication networks in the presence of stochastic energy arrivals and temperature constraints. When the energy arrivals are stochastic and are known only causally at the transmitter, we study two performance metrics: throughput and age of information (AoI). When the energy harvesting system performance is affected by the change of the temperature, we consider the throughput metric. When the energy arrivals are stochastic, we study the throughput maximization problem for several network settings. We first consider an energy harvesting broadcast channel where a transmitter serves data to two receivers on the downlink. The battery at the transmitter in which the harvested energy is stored is of finite size. We focus on online transmission schemes where the transmitter knows the energy arrivals only causally as they happen. We consider the case of general independent and identically distributed (i.i.d.) energy arrivals, and propose a near-optimal strategy coined fractional power constant cut-off (FPCC) policy. We show that the FPCC policy is near-optimal in that it yields rates that are within a constant gap from the optimal rate region, for all system parameters. Next, we study online transmission policies for a two-user multiple access channel where both users harvest energy from nature. The energy harvests are i.i.d. over time, but can be arbitrarily correlated between the two users. The transmitters are equipped with arbitrary but finite-sized batteries. We propose a distributed fractional power (DFP) policy, which users implement distributedly with no knowledge of the other user's energy arrival or battery state. We show that the proposed DFP is near-optimal as in the broadcast channel case. Then, we consider online power scheduling for energy harvesting channels in which the users incur processing cost per unit time that they are on. The presence of processing costs forces the users to operate in a bursty mode. We consider the single-user and two-way channels. For the single-user case, we consider the case of the general i.i.d.~energy arrivals. We propose a near-optimal online policy for this case. We then extend our analysis to the case of two-way energy harvesting channels with processing costs; in this case, the users incur processing costs for being on for transmitting or receiving data. Our proposed policy is distributed, which users can apply independently with no need for cooperation or coordination between them. Next, we consider a single-user channel in which the transmitter is equipped with finite-sized data and energy buffers. The transmitter receives energy and data packets randomly and intermittently over time and stores them in the finite-sized buffers. The arrival amounts are known only causally as they happen. We focus on the special case when the energy and data arrivals are fully-correlated. We propose a structured policy and bound its performance by a multiplicative gap from the optimal. We then show that this policy \emph{is optimal} when the energy arrivals dominate the data arrivals, and is \emph{near-optimal} when the data arrivals dominate the energy arrivals. Then, we consider another performance metric which captures the freshness of data, i.e., AoI. For this metric, we first consider an energy harvesting transmitter sending status updates to a receiver over an erasure channel. The energy arrivals and the channel erasures are i.i.d. and Bernoulli distributed in each slot. In order to combat the effects of the erasures in the channel and the uncertainty in the energy arrivals, we use channel coding to encode the status update symbols. We consider two types of channel coding: maximum distance separable (MDS) codes and rateless erasure codes. For each of these models, we study two achievable schemes: best-effort and save-and-transmit. We analyze the average AoI under each of these policies. We show that rateless coding with save-and-transmit outperforms all other schemes. Next, we consider a scenario where the transmitter harvests i.i.d. Bernoulli energy arrivals and status updates carry information about an independent message. The transmitter encodes this message into the timings of the status updates. The receiver needs to extract this encoded information, as well as update the status of the observed phenomenon. The timings of the status updates, therefore, determine both the AoI and the message rate (rate). We study the trade-off between the achievable message rate and the achievable average AoI. We propose several achievable schemes and compare their rate-AoI performances. Then, with the motivation to understand the effects of temperature sensitivity on wireless data transmission performance for energy harvesting communication networks, we study several temperature models. We assume non-causal knowledge of the energy arrivals. First, we consider throughput maximization in a single-user energy harvesting communication system under continuous time energy and temperature constraints. We model three main temperature related physical defects in wireless sensors mathematically, and investigate their impact on throughput maximization. Specifically, we consider temperature dependent energy leakage, effects of processing circuit power on temperature, and temperature increases due to the energy harvesting process itself. In each case, we determine the optimum power schedule. Next, different from the previous work, we consider a discrete time system where transmission power is kept constant in each slot. We consider two models that capture different effects of temperature. In the first model, the temperature is constrained to be below a critical temperature at all time instants; we coin this model as explicit temperature constrained model. We investigate throughput optimal power allocation for multiple energy arrivals under general, as well as temperature and energy limited regimes. In the second model, we consider the effect of the temperature on the channel quality via its influence on additive noise power; we coin this model as implicit temperature constrained model. In this model, the change in the variance of the additive noise due to previous transmissions is non-negligible. In particular, transmitted signals contribute as interference for all subsequent slots and thus affect the signal to interference plus noise ratio (SINR). In this case, we investigate throughput optimal power allocation under general, as well as low and high SINR regimes. Finally, we consider the case in which implicit and explicit temperature constraints are simultaneously active. Finally, we extend the discrete time explicit temperature constraint model to a multi-user setting. We consider a two-user energy harvesting multiple access channel where the temperatures of the nodes are affected by the electromagnetic waves due to data transmission. We study the optimal power allocations when the temperatures of the nodes are subject to peak temperature constraints, where each node has a different peak temperature requirement and the nodes have different temperature parameters. We study the optimal power allocation in this case and derive sufficient conditions under which the rate region collapses to a single pentagon

Recent Advances in Cellular D2D Communications

Device-to-device (D2D) communications have attracted a great deal of attention from researchers in recent years. It is a promising technique for offloading local traffic from cellular base stations by allowing local devices, in physical proximity, to communicate directly with each other. Furthermore, through relaying, D2D is also a promising approach to enhancing service coverage at cell edges or in black spots. However, there are many challenges to realizing the full benefits of D2D. For one, minimizing the interference between legacy cellular and D2D users operating in underlay mode is still an active research issue. With the 5th generation (5G) communication systems expected to be the main data carrier for the Internet-of-Things (IoT) paradigm, the potential role of D2D and its scalability to support massive IoT devices and their machine-centric (as opposed to human-centric) communications need to be investigated. New challenges have also arisen from new enabling technologies for D2D communications, such as non-orthogonal multiple access (NOMA) and blockchain technologies, which call for new solutions to be proposed. This edited book presents a collection of ten chapters, including one review and nine original research works on addressing many of the aforementioned challenges and beyond

Enable Reliable and Secure Data Transmission in Resource-Constrained Emerging Networks

The increasing deployment of wireless devices has connected humans and objects all around the world, benefiting our daily life and the entire society in many aspects. Achieving those connectivity motivates the emergence of different types of paradigms, such as cellular networks, large-scale Internet of Things (IoT), cognitive networks, etc. Among these networks, enabling reliable and secure data transmission requires various resources including spectrum, energy, and computational capability. However, these resources are usually limited in many scenarios, especially when the number of devices is considerably large, bringing catastrophic consequences to data transmission. For example, given the fact that most of IoT devices have limited computational abilities and inadequate security protocols, data transmission is vulnerable to various attacks such as eavesdropping and replay attacks, for which traditional security approaches are unable to address. On the other hand, in the cellular network, the ever-increasing data traffic has exacerbated the depletion of spectrum along with the energy consumption. As a result, mobile users experience significant congestion and delays when they request data from the cellular service provider, especially in many crowded areas. In this dissertation, we target on reliable and secure data transmission in resource-constrained emerging networks. The first two works investigate new security challenges in the current heterogeneous IoT environment, and then provide certain countermeasures for reliable data communication. To be specific, we identify a new physical-layer attack, the signal emulation attack, in the heterogeneous environment, such as smart home IoT. To defend against the attack, we propose two defense strategies with the help of a commonly found wireless device. In addition, to enable secure data transmission in large-scale IoT network, e.g., the industrial IoT, we apply the amply-and-forward cooperative communication to increase the secrecy capacity by incentivizing relay IoT devices. Besides security concerns in IoT network, we seek data traffic alleviation approaches to achieve reliable and energy-efficient data transmission for a group of users in the cellular network. The concept of mobile participation is introduced to assist data offloading from the base station to users in the group by leveraging the mobility of users and the social features among a group of users. Following with that, we deploy device-to-device data offloading within the group to achieve the energy efficiency at the user side while adapting to their increasing traffic demands. In the end, we consider a perpendicular topic - dynamic spectrum access (DSA) - to alleviate the spectrum scarcity issue in cognitive radio network, where the spectrum resource is limited to users. Specifically, we focus on the security concerns and further propose two physical-layer schemes to prevent spectrum misuse in DSA in both additive white Gaussian noise and fading environments