Energy Harvesting Wireless Communications: A Review of Recent Advances

This article summarizes recent contributions in the broad area of energy harvesting wireless communications. In particular, we provide the current state of the art for wireless networks composed of energy harvesting nodes, starting from the information-theoretic performance limits to transmission scheduling policies and resource allocation, medium access and networking issues. The emerging related area of energy transfer for self-sustaining energy harvesting wireless networks is considered in detail covering both energy cooperation aspects and simultaneous energy and information transfer. Various potential models with energy harvesting nodes at different network scales are reviewed as well as models for energy consumption at the nodes.Comment: To appear in the IEEE Journal of Selected Areas in Communications (Special Issue: Wireless Communications Powered by Energy Harvesting and Wireless Energy Transfer

Optimal Sensor Collaboration for Parameter Tracking Using Energy Harvesting Sensors

In this paper, we design an optimal sensor collaboration strategy among neighboring nodes while tracking a time-varying parameter using wireless sensor networks in the presence of imperfect communication channels. The sensor network is assumed to be self-powered, where sensors are equipped with energy harvesters that replenish energy from the environment. In order to minimize the mean square estimation error of parameter tracking, we propose an online sensor collaboration policy subject to real-time energy harvesting constraints. The proposed energy allocation strategy is computationally light and only relies on the second-order statistics of the system parameters. For this, we first consider an offline non-convex optimization problem, which is solved exactly using semidefinite programming. Based on the offline solution, we design an online power allocation policy that requires minimal online computation and satisfies the dynamics of energy flow at each sensor. We prove that the proposed online policy is asymptotically equivalent to the optimal offline solution and show its convergence rate and robustness. We empirically show that the estimation performance of the proposed online scheme is better than that of the online scheme when channel state information about the dynamical system is available in the low SNR regime. Numerical results are conducted to demonstrate the effectiveness of our approach

Resource Management for Distributed Estimation via Sparsity-Promoting Regularization

Recent advances in wireless communications and electronics have enabled the development of low-cost, low-power, multifunctional sensor nodes that are small in size and communicate untethered in a sensor network. These sensor nodes can sense, measure, and gather information from the environment and, based on some local processing, they transmit the sensed data to a fusion center that is responsible for making the global inference. Sensor networks are often tasked to perform parameter estimation; example applications include battlefield surveillance, medical monitoring, and navigation. However, under limited resources, such as limited communication bandwidth and sensor battery power, it is important to design an energy-efficient estimation architecture. The goal of this thesis is to provide a fundamental understanding and characterization of the optimal tradeoffs between estimation accuracy and resource usage in sensor networks. In the thesis, two basic issues of resource management are studied, sensor selection/scheduling and sensor collaboration for distributed estimation, where the former refers to finding the best subset of sensors to activate for data acquisition in order to minimize the estimation error subject to a constraint on the number of activations, and the latter refers to seeking the optimal inter-sensor communication topology and energy allocation scheme for distributed estimation systems. Most research on resource management so far has been based on several key assumptions, a) independence of observation, b) strict resource constraints, and c) absence of inter-sensor communication, which lend analytical tractability to the problem but are often found lacking in practice. This thesis introduces novel techniques to relax these assumptions and provide new insights into addressing resource management problems. The thesis analyzes how noise correlation affects solutions of sensor selection problems, and proposes both a convex relaxation approach and a greedy algorithm to find these solutions. Compared to the existing sensor selection approaches that are limited to the case of uncorrelated noise or weakly correlated noise, the methodology proposed in this thesis is valid for any arbitrary noise correlation regime. Moreover, this thesis shows a correspondence between active sensors and the nonzero columns of an estimator gain matrix. Based on this association, a sparsity-promoting optimization framework is established, where the desire to reduce the number of selected sensors is characterized by a sparsity-promoting penalty term in the objective function. Instead of placing a hard constraint on sensor activations, the promotion of sparsity leads to trade-offs between estimation performance and the number of selected sensors. To account for the individual power constraint of each sensor, a novel sparsity-promoting penalty function is presented to avoid scenarios in which the same sensors are successively selected. For solving the proposed optimization problem, we employ the alternating direction method of multipliers (ADMM), which allows the optimization problem to be decomposed into subproblems that can be solved analytically to obtain exact solutions. The problem of sensor collaboration arises when inter-sensor communication is incorporated in sensor networks, where sensors are allowed to update their measurements by taking a linear combination of the measurements of those they interact with prior to transmission to a fusion center. In this thesis, a sparsity-aware optimization framework is presented for the joint design of optimal sensor collaboration and selection schemes, where the cost of sensor collaboration is associated with the number of nonzero entries of a collaboration matrix, and the cost of sensor selection is characterized by the number of nonzero rows of the collaboration matrix. It is shown that a) the presence of sensor collaboration smooths out the observation noise, thereby improving the quality of the signal and eventual estimation performance, and b) there exists a trade-off between sensor selection and sensor collaboration. This thesis further addresses the problem of sensor collaboration for the estimation of time-varying parameters in dynamic networks that involve, for example, time-varying observation gains and channel gains. Impact of parameter correlation and temporal dynamics of sensor networks on estimation performance is illustrated from both theoretical and practical points of view. Last but not least, optimal energy allocation and storage control polices are designed in sensor networks with energy-harvesting nodes. We show that the resulting optimization problem can be solved as a special nonconvex problem, where the only source of nonconvexity can be isolated to a constraint that contains the difference of convex functions. This specific problem structure enables the use of a convex-concave procedure to obtain a near-optimal solution

Contributions On Theory And Practice For Multi-Mission Wireless Systems

The field of wireless systems has long been an active research area with various applications. Recently much attention has been given to multi-mission wireless systems that combine capabilities including information sensing, data processing, energy harvesting as well as the traditional data communication. This dissertation describes our endeavor in addressing some of the research challenges in multi-mission wireless systems, including the development of fundamental limits of such multi-mission wireless systems and effective technologies for improved performance. The first challenge addressed in this dissertation is how to handle interference, which is encountered in almost all wireless systems involving multiple nodes, an attribute shared by most multi-mission systems. To deepen our understanding on the impact of interference, we study a class of Gaussian interference channels (GICs) with mixed interference. A simple coding scheme is proposed based on Sato\u27s non-naive frequency division. The achievable region is shown to be equivalent to that of Costa\u27s noiseberg region for the one-sided Gaussian interference channel. This allows for an indirect proof that this simple achievable rate region is indeed equivalent to the Han-Kobayashi (HK) region with Gaussian input and with time sharing for this class of Gaussian interference channels with mixed interference. Optimal power management strategies are then investigated for a remote estimation system with an energy harvesting sensor. We first establish the asymptotic optimality of uncoded transmission for such a system under Gaussian assumption. With the aim of minimizing the mean squared error (MSE) at the receiver, optimal power allocation policies are proposed under various assumptions with regard to the knowledge at the transmitter and the receiver as well as battery storage capacity. For the case where non-causal side information (SI) of future harvested energy is available and battery storage is unlimited, it is shown that the optimal power allocation amounts to a simple \u27staircase-climbing\u27 procedure, where the power level follows a non-decreasing staircase function. For the case where battery storage has a finite capacity, the optimal power allocation policy can also be obtained via standard convex optimization techniques. Dynamic programming is used to optimize the allocation policy when causal SI is available. The issue of unknown transmit power at the receiver is also addressed. Finally, to make the proposed solutions practically more meaningful, two heuristic schemes are proposed to reduce computational complexity. Related to the above remote sensing problem, we provide an information theoretic formulation of a multi-functioning radio where communication between nodes involves transmission of both messages and source sequences. The objective is to study the optimal coding trade-off between the rate for message transmission and the distortion for source sequence estimation. For point-to-point systems, it is optimal to simply split total capacity into two components, one for message transmission and one for source transmission. For the multi-user case, we show that such separation-based scheme leads to a strictly suboptimal rate-distortion trade-off by examining the simple problem of sending a common source sequence and two independent messages through a Gaussian broadcast channel. Finally we study the design of a practical multi-mission wireless system - the dual-use of airborne radio frequency (RF) systems. Specifically, airborne multiple-input-multiple-output (MIMO) communication systems are leveraged for the detection of moving targets in a typical airborne environment that is characterized by the lack of scatterers. With uniform linear arrays (ULAs), angular domain decomposition of channel matrices is utilized and target detection can be accomplished by detection of change in the resolvable paths in the angular domain. For both linear and nonlinear arrays, Doppler frequency analysis can also be applied and the change in frequency components indicates the presence of potential airborne targets. Nonparametric detection of distribution changes is utilized in both approaches

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig