In recent years, energy harvesting has taken a considerable attention in wireless communication research. Nonetheless, the stochastic nature of renewable energy sources has become one of the research problems, and energy storage has been proposed as a solution to deal with it. Initially, researchers regarded a perfect battery model without energy losses during storage because of its simplicity and compatibility in wireless communication analysis. However, a battery model that reflects practical concerns should include energy losses. In this paper, we consider an energy harvesting wireless communication model with a battery that has energy losses during charging and discharging. We consider energy underflows (i.e., the energy level falls below a certain threshold in a battery) as the energy management concern, and characterize the energy underflow probability and provide a simple exponential formulation by employing the large deviation principle and queueing theory. Specifically, we benefit from the similarity between the battery and data buffer models. We further coin the available space decay rate at a battery as a parameter to indicate the energy consumption performance. We further outline an approach to set the energy demand policy to meet the energy management requirements that rule the energy underflow probability as a constraint. We finally substantiate our analytical findings with numerical demonstrations, and compare the transmission performance levels of a transmission system with a battery that has energy losses and a transmission system that consumes the energy as soon as it is harvested.
In energy harvesting (EH) network, the energy storage devices (i.e., batteries) are usually not perfect. In this paper, we consider a practical battery model with finite battery capacity, energy (dis-)charging loss, and energy dissipation. Taking into account such battery imperfections, we rely on the Lyapunov optimization technique to develop a stochastic online control scheme that aims to maximize the utility of data rates for EH multi-hop wireless networks. It is established that the proposed algorithm can provide a feasible and efficient data admission, power allocation, routing and schedu…
In wireless distributed storage systems, storage nodes are connected by wireless channels, which are broadcast in nature. This paper exploits this unique feature to design an efficient repair mechanism, called broadcast repair, for wireless distributed storage systems with multiple-node failures. Since wireless channels are typically bandwidth limited, we advocate a new measure on repair performance called repair-transmission bandwidth, which measures the average number of packets transmitted by helper nodes per failed node. The fundamental tradeoff between storage amount and repair-transmissi…
In wireless cloud storage systems, the recovery failure probability depends on not only wireless channel conditions but also storage size of each distributed storage node. For an efficient utilization of limited storage capacity and the performance characterization of allocation strategies, we asymptotically analyze the recovery failure probability of a wireless cloud storage system with a sum storage capacity constraint for both high SNR regime and low SNR regime. Then, we find the optimal storage allocation strategy across distributed storage nodes in terms of the asymptotic recovery failure…
Hardware imperfections can significantly reduce the performance of full-duplex wireless systems by introducing non-idealities and random effects that make it challenging to fully suppress self-interference. Previous research has mostly focused on analyzing the impact of hardware imperfections on full-duplex systems, based on simulations and theoretical models. In this paper, we follow a measurement-based approach to experimentally identify and isolate these hardware imperfections leading to residual self-interference in full-duplex nodes. Our measurements show the important role of images aris…
In wireless distributed storage systems, storage nodes are connected by wireless channels, which are broadcast in nature. This paper exploits this unique feature to design an efficient repair mechanism, called broadcast repair, for wireless distributed storage systems in the presence of multiple-node failures. Due to the broadcast nature of wireless transmission, we advocate a new measure on repair performance called repair-transmission bandwidth. In contrast to repair bandwidth, which measures the average number of packets downloaded by a newcomer to replace a failed node, repair-transmission…
Distributed storage systems (DSSs) have gained a lot of interest recently, thanks to their robustness and scalability compared to single-device storage. Majority of the related research has exclusively concerned the network layer. At the same time, the number of users of, e.g., peer-to-peer (p2p) and device-to-device (d2d) networks as well as proximity based services is growing rapidly, and the mobility of users is considered more and more important. This motivates, in contrast to the existing literature, the study of the physical layer functionality of wireless distributed storage systems. In…
We address the use of maximum distance separable (MDS) codes for distributed storage (DS) to enable efficient content delivery in wireless networks. Content is stored in a number of the mobile devices and can be retrieved from them using device-to-device communication or, alternatively, from the base station (BS). We derive an analytical expression for the download delay in the hypothesis that the reliability state of the network is periodically restored. Our analysis shows that MDS-coded DS can dramatically reduce the download time with respect to the reference scenario where content is alway…
This paper focuses on delivering quantified results for the evaluation of the aggregated impact of stochastic antenna misalignment, multipath fading and hardware imperfections on the terahertz (THz) wireless fiber extenders. In this line, we present the appropriate signal model that accommodates the different technical and environmental parameters. In particular, it takes into consideration the antenna gains, the central frequency, the transmission range, the environmental conditions, i.e. temperature, humidity and pressure, the spatial jitter between the transmitter and receiver antennas, whi…
We investigate the fundamental information theoretic limits of cache-aided wireless networks, in which edge nodes (or transmitters) are endowed with caches that can store popular content, such as multimedia files. This architecture aims to localize popular multimedia content by proactively pushing it closer to the edge of the wireless network, thereby alleviating backhaul load. An information theoretic model of such networks is presented, that includes the introduction of a new metric, namely normalized delivery time (NDT), which captures the worst case time to deliver any requested content to…
A distributed data collection algorithm to accurately store and forward information obtained by wireless sensor networks is proposed. The proposed algorithm does not depend on the sensor network topology, routing tables, or geographic locations of sensor nodes, but rather makes use of uniformly distributed storage nodes. Analytical and simulation results for this algorithm show that, with high probability, the data disseminated by the sensor nodes can be precisely collected by querying any small set of storage nodes.
In this paper, we analyze the performance of a reconfigurable intelligent surface (RIS)-assisted unmanned aerial vehicle (UAV) wireless system that is affected by mixture-gamma small-scale fading, stochastic disorientation, and misalignment, as well as transceivers hardware imperfections. First, we statistically characterize the end-to-end channel for both cases, i.e., in the absence as well as in the presence of disorientation and misalignment, by extracting closed-form formulas for the probability density function (PDF) and the cumulative distribution function (CDF). Building on the aforemen…
In this work, a MIMO broadcast channel under the energy harvesting (EH) constraint and the peak power constraint is investigated. The transmitter is equipped with a hybrid energy storage system consisting of a perfect super capacitor (SC) and an inefficient battery, where both elements have limited energy storage capacities. In addition, the effect of data processing circuit power consumption is also addressed. To be specific, two extreme cases are studied here, where the first assumes ideal/zero circuit power consumption and the second considers a positive constant circuit power consumption w…
Energy harvesting (EH) in wireless communications has become the focus of recent transmission technology studies. Herein, energy storage modeling is one of the crucial design benchmarks that must be treated carefully. Understanding the energy storage dynamics and the throughput levels is essential especially for communication systems in which the performance depends solely on harvested energy. While energy outages should be avoided, energy overflows should also be prevented in order to utilize all harvested energy. Hence, a simple, yet comprehensive, analytical model that can represent the cha…
In this paper, we consider delay-optimal power control for an energy harvesting wireless system with finite energy storage. The wireless system is powered solely by a renewable energy source with bursty data arrivals, and is characterized by a data queue and an energy queue. We consider a delay-optimal power control problem and formulate an infinite horizon average cost Markov Decision Process (MDP). To deal with the curse of dimensionality, we introduce a virtual continuous time system and derive closed-form approximate priority functions for the discrete time MDP at various operating regimes…
Distributed storage systems and associated storage codes can efficiently store a large amount of data while ensuring that data is retrievable in case of node failure. The study of such systems, particularly the design of storage codes over finite fields, assumes that the physical channel through which the nodes communicate is error-free. This is not always the case, for example, in a wireless storage system. We study the probability that a subpacket is repaired incorrectly during node repair in a distributed storage system, in which the nodes communicate over an AWGN or Rayleigh fading channel…
Caching contents at the network edge is an efficient mean for offloading traffic, reducing latency and improving users' quality-of-experience. In this letter, we focus on aspects of storage-bandwidth tradeoffs in which small cell base stations are distributed according to a homogeneous Poisson point process and cache contents according to a given content popularity distribution, subject to storage constraints. We provide a closed-form expression of the cache-miss probability, defined as the probability of not satisfying users' requests over a given coverage area, as a function of signal-to-int…
We consider the use of distributed storage (DS) to reduce the communication cost of content delivery in wireless networks. Content is stored (cached) in a number of mobile devices using an erasure correcting code. Users retrieve content from other devices using device-to-device communication or from the base station (BS), at the expense of higher communication cost. We address the repair problem when a device storing data leaves the cell. We introduce a repair scheduling where repair is performed periodically and derive analytical expressions for the overall communication cost of content downl…
We consider distributed storage (DS) for a wireless network where mobile devices arrive and depart according to a Poisson random process. Content is stored in a number of mobile devices, using an erasure correcting code. When requesting a piece of content, a user retrieves the content from the mobile devices using device-to-device communication or, if not possible, from the base station (BS), at the expense of a higher communication cost. We consider the repair problem when a device that stores data leaves the network. In particular, we introduce a repair scheduling where repair is performed (…
In a wireless storage system, having to communicate over a fading channel makes repair transmissions prone to physical layer errors. The first approach to combat fading is to utilize the existing optimal space-time codes. However, it was recently pointed out that such codes are in general too complex to decode when the number of helper nodes is bigger than the number of antennas at the newcomer or data collector. In this paper, a novel protocol for wireless storage transmissions based on algebraic space-time codes is presented in order to improve the system reliability while enabling feasible …
Repair of multiple partially failed cache nodes is studied in a distributed wireless content caching system, where $r$ out of a total of $n$ cache nodes lose part of their cached data. Broadcast repair of failed cache contents at the network edge is studied; that is, the surviving cache nodes transmit broadcast messages to the failed ones, which are then used, together with the surviving data in their local cache memories, to recover the lost content. The trade-off between the storage capacity and the repair bandwidth is derived. It is shown that utilizing the broadcast nature of the wireless …
We consider a distributed storage problem in a large-scale wireless sensor network with $n$ nodes among which $k$ acquire (sense) independent data. The goal is to disseminate the acquired information throughout the network so that each of the $n$ sensors stores one possibly coded packet and the original $k$ data packets can be recovered later in a computationally simple way from any $(1+ε)k$ of nodes for some small $ε>0$. We propose two Raptor codes based distributed storage algorithms for solving this problem. In the first algorithm, all the sensors have the knowledge of $n$ and $k$. In the s…
This paper studies the decentralized coded caching for a Fog Radio Access Network (F-RAN), whereby two edge-nodes (ENs) connected to a cloud server via fronthaul links with limited capacity are serving the requests of $K_r$ users. We consider all ENs and users are equipped with caches. A decentralized content placement is proposed to independently store contents at each network node during the off-peak hours. After that, we design a coded delivery scheme in order to deliver the user demands during the peak-hours under the objective of minimizing the normalized delivery time (NDT), which refers…
A network coding-based scheme is proposed to improve the energy efficiency of distributed storage systems in WSNs (wireless sensor networks), which mainly focuses on two problems: firstly, consideration is given to effective distributed storage technology in WSNs; secondly, we address how to repair the data in failed storage nodes with less resource. For the first problem, we propose a method to obtain a sparse generator matrix to construct network codes, and this sparse generator matrix is proven to be the sparsest. Benefiting from the sparse generator matrix, the energy consumption required …
This paper studies the fundamental tradeoff between storage and latency in a general wireless interference network with caches equipped at all transmitters and receivers. The tradeoff is characterized by an information-theoretic metric, \emph{normalized delivery time} (NDT), which is the worst-case delivery time of the actual traffic load at a transmission rate specified by degrees of freedom (DoF) of a given channel. We obtain both an achievable upper bound and a theoretical lower bound of the minimum NDT for any number of transmitters, any number of receivers, and any feasible cache size tup…
Physical layer security is an emerging technique to improve the wireless communication security, which is widely regarded as a complement to cryptographic technologies. To design physical layer security techniques under practical scenarios, the uncertainty and imperfections in the channel knowledge need to be taken into consideration. This paper provides a survey of recent research and development in physical layer security considering the imperfect channel state information (CSI) at communication nodes. We first present an overview of the main information-theoretic measures of the secrecy per…
Energy Harvesting allows the devices in a Wireless Sensor Network to recharge their batteries through environmental energy sources. While in the literature the main focus is on devices with ideal batteries, in reality several inefficiencies have to be considered to correctly design the operating regimes of an Energy Harvesting Device (EHD). In this work we describe how the throughput optimization problem changes under \emph{real battery} constraints in an EHD. In particular, we consider imperfect knowledge of the state of charge of the battery and storage inefficiencies, \emph{i.e.}, part of t…
This paper deals with the problem of relay selection in wireless powered cooperative networks, where spatially random relays are equipped with energy storage devices e.g., batteries. In contrast to conventional techniques and in order to reduce complexity, the relay nodes can either harvest energy from the source signal (in case of uncharged battery) or attempt to decode and forward it (in case of charged battery). Several relay selection schemes that correspond to different state information requirements and implementation complexities are proposed. The charging/discharging behavior of the ba…
We consider a distributed storage system with $n$ nodes, where a user can recover the stored file from any $k$ nodes, and study the problem of repairing $r$ partially failed nodes. We consider \textit{broadcast repair}, that is, $d$ surviving nodes transmit broadcast messages on an error-free wireless channel to the $r$ nodes being repaired, which are then used, together with the surviving data in the local memories of the failed nodes, to recover the lost content. First, we derive the trade-off between the storage capacity and the repair bandwidth for partial repair of multiple failed nodes, …
We consider large-scale wireless sensor networks with $n$ nodes, out of which k are in possession, (e.g., have sensed or collected in some other way) k information packets. In the scenarios in which network nodes are vulnerable because of, for example, limited energy or a hostile environment, it is desirable to disseminate the acquired information throughout the network so that each of the n nodes stores one (possibly coded) packet so that the original k source packets can be recovered, locally and in a computationally simple way from any k(1 + ε) nodes for some small ε> 0. We develop decentra…
Cloud computing facilitates the access of applications and data from any location by a distributed storage system. Erasure codes offer better data replication technique with reduced storage costs for more reliability. This paper considers the erasure-coded data center with multiple servers in a wireless network where each is equipped with a base-station. The cause of latency in the file retrieval process is mainly due to queuing delays at each server. This work puts forth a stochastic optimization framework for obtaining the optimal scheduling policy that maximizes users' quality of service (Q…
In this paper, we consider an energy harvesting (EH) node which harvests energy from a radio frequency (RF) signal broadcasted by an access point (AP) in the downlink (DL). The node stores the harvested energy in an energy buffer and uses the stored energy to transmit data to the AP in the uplink (UL). We consider a simple transmission policy, which accounts for the fact that in practice the EH node may not have knowledge of the EH profile nor of the UL channel state information. In particular, in each time slot, the EH node transmits with either a constant desired power or a lower power if no…
Caching is an effective technique to improve user perceived experience for content delivery in wireless networks. Wireless caching differs from traditional web caching in that it can exploit the broadcast nature of wireless medium and hence opportunistically change the network topologies. This paper studies a cache-aided MIMO interference network with 3 transmitters each equipped with M antennas and 3 receivers each with N antennas. With caching at both the transmitter and receiver sides, the network is changed to hybrid forms of MIMO broadcast channel, MIMO X channel, and MIMO multicast chann…
In this paper, we consider an energy harvesting (EH) node which harvests energy from a radio frequency (RF) signal broadcasted by an access point (AP) in the downlink (DL). The node stores the harvested energy in an energy buffer and uses the stored energy to transmit data to the AP in the uplink (UL). We consider a simple transmission policy, which accounts for the fact that, in practice, the EH node may not have knowledge of the EH profile nor of the UL channel state information. In particular, in each time slot, the EH node transmits with either a constant desired power or remains silent if…
End-to-End Deep Learning in Wireless Communication Systems: A Tutorial Review
University of Arkansas at Little Rock（阿肯色大学小石城分校）；University of California, Santa Cruz（加州大学圣克鲁兹分校）；African Leadership Academy（非洲领导力学院）；Cornell University（康奈尔大学）；University of Southampton（南安普顿大学）；École de technologie supérieure (ETS), Université du Québec（魁北克理工大学）
There have been emerging lots of applications for distributed storage systems e.g., those in wireless sensor networks or cloud storage. Since storage nodes in wireless sensor networks have limited battery, it is valuable to find a repair scheme with optimal transmission costs (e.g., energy). The optimal-cost repair has been recently investigated in a centralized way. However a centralized control mechanism may not be available or is very expensive. For the scenarios, it is interesting to study optimal-cost repair in a decentralized setup. We formulate the optimal-cost repair as convex optimiza…
This paper develops a new cooperative jamming protocol, termed accumulate-and-jam (AnJ), to improve physical layer security in wireless communications. Specifically, a full-duplex (FD) friendly jammer is deployed to secure the direct communication between source and destination in the presence of a passive eavesdropper. We consider the friendly jammer as an energy-constrained node without embedded power supply but with an energy harvesting unit and rechargeable energy storage; it can thus harvest energy from the radio frequency (RF) signals transmitted by the source, accumulate the energy in i…
Simultaneous wireless information and power transfer (SWIPT) has recently gathered much research interest from both academia and industry as a key enabler of energy harvesting Internet-of-things (IoT) networks. Due to a number of growing use cases of such networks, it is important to study their performance limits from the perspective of physical layer security (PLS). With this intent, this work aims to provide a novel analysis of the ergodic secrecy capacity of a SWIPT system is provided for Rician and Nakagami-m faded communication links. For a realistic evaluation of the system, the imperfe…
Bit-interleaved coded modulation (BICM) has attracted considerable attention from the research community in the past three decades, because it can achieve desirable error performance with relatively low implementation complexity for a large number of communication and storage systems. By exploiting the iterative demapping and decoding (ID), the BICM is able to approach capacity limits of coded modulation over various channels. In recent years, protograph low-density parity-check (PLDPC) codes and their spatially-coupled (SC) variants have emerged to be a pragmatic forward-error-correction (FEC…
In this paper, we analytically study the regime in which practical full-duplex systems can achieve larger rates than an equivalent half-duplex systems. The key challenge in practical full-duplex systems is uncancelled self-interference signal, which is caused by a combination of hardware and implementation imperfections. Thus, we first present a signal model which captures the effect of significant impairments such as oscillator phase noise, low-noise amplifier noise figure, mixer noise, and analog-to-digital converter quantization noise. Using the detailed signal model, we study the rate gain…
Recent research on joint source channel coding (JSCC) for wireless communications has achieved great success owing to the employment of deep learning (DL). However, the existing work on DL based JSCC usually trains the designed network to operate under a specific signal-to-noise ratio (SNR) regime, without taking into account that the SNR level during the deployment stage may differ from that during the training stage. A number of networks are required to cover the scenario with a broad range of SNRs, which is computational inefficiency (in the training stage) and requires large storage. To ov…
We consider large-scale sensor networks with n nodes, out of which k are in possession, (e.g., have sensed or collected in some other way) k information packets. In the scenarios in which network nodes are vulnerable because of, for example, limited energy or a hostile environment, it is desirable to disseminate the acquired information throughout the network so that each of the n nodes stores one (possibly coded) packet and the original k source packets can be recovered later in a computationally simple way from any (1 + ε)k nodes for some small ε> 0. We developed two distributed algorithms f…
In this paper, the design of a wireless communication device relying exclusively on energy harvesting is considered. Due to the inability of rechargeable energy sources to charge and discharge at the same time, a constraint we term the energy half-duplex constraint, two rechargeable energy storage devices (ESDs) are assumed so that at any given time, there is always one ESD being recharged. The energy harvesting rate is assumed to be a random variable that is constant over the time interval of interest. A save-then-transmit (ST) protocol is introduced, in which a fraction of time ρ (dubbed the…
This work considers the design of online transmission policy in a wireless-powered communication system with a given energy budget. The system design objective is to maximize the long-term throughput of the system exploiting the energy storage capability at the wireless-powered node. We formulate the design problem as a constrained Markov decision process (CMDP) problem and obtain the optimal policy of transmit power and time allocation in each fading block via the Lagrangian approach. To investigate the system performance in different scenarios, numerical simulations are conducted with variou…
Reliability is essential for storing files in many applications of distributed storage systems. To maintain reliability, when a storage node fails, a new node should be regenerated by a repair process. Most of the previous results on the repair problem assume perfect (error-free) links in the networks. However, in practice, especially in a wireless network, the transmitted packets (for repair) may be lost due to, e.g., link failure or buffer overflow. We study the repair problem of distributed storage systems in packet erasure networks, where a packet loss is modeled as an erasure. The minimum…
Cellular data traffic almost doubles every year, greatly straining network capacity. The main driver for this development is wireless video. Traditional methods for capacity increase (like using more spectrum and increasing base station density) are very costly, and do not exploit the unique features of video, in particular a high degree of {\em asynchronous content reuse}. In this paper we give an overview of our work that proposed and detailed a new transmission paradigm exploiting content reuse, and the fact that storage is the fastest-increasing quantity in modern hardware. Our network str…
This paper studies robust resource allocation algorithm design for a multiuser multiple-input single-output (MISO) cognitive radio (CR) downlink communication network. We focus on a secondary system which provides unicast secure wireless layered video information to multiple single-antenna secondary receivers. The resource allocation algorithm design is formulated as a non-convex optimization problem for minimization of the total transmit power at the secondary transmitter. The proposed framework takes into account a quality of service (QoS) requirement regarding video communication secrecy in…
