1,769 research outputs found
Source-Channel Coding under Energy, Delay and Buffer Constraints
Source-channel coding for an energy limited wireless sensor node is
investigated. The sensor node observes independent Gaussian source samples with
variances changing over time slots and transmits to a destination over a flat
fading channel. The fading is constant during each time slot. The compressed
samples are stored in a finite size data buffer and need to be delivered in at
most time slots. The objective is to design optimal transmission policies,
namely, optimal power and distortion allocation, over the time slots such that
the average distortion at destination is minimized. In particular, optimal
transmission policies with various energy constraints are studied. First, a
battery operated system in which sensor node has a finite amount of energy at
the beginning of transmission is investigated. Then, the impact of energy
harvesting, energy cost of processing and sampling are considered. For each
energy constraint, a convex optimization problem is formulated, and the
properties of optimal transmission policies are identified. For the strict
delay case, , waterfilling interpretation is provided. Numerical
results are presented to illustrate the structure of the optimal transmission
policy, to analyze the effect of delay constraints, data buffer size, energy
harvesting, processing and sampling costs.Comment: 30 pages, 15 figures. Submitted to IEEE Transactions on Wireless
Communication
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
Energy Management Policies for Energy-Neutral Source-Channel Coding
In cyber-physical systems where sensors measure the temporal evolution of a
given phenomenon of interest and radio communication takes place over short
distances, the energy spent for source acquisition and compression may be
comparable with that used for transmission. Additionally, in order to avoid
limited lifetime issues, sensors may be powered via energy harvesting and thus
collect all the energy they need from the environment. This work addresses the
problem of energy allocation over source acquisition/compression and
transmission for energy-harvesting sensors. At first, focusing on a
single-sensor, energy management policies are identified that guarantee a
maximal average distortion while at the same time ensuring the stability of the
queue connecting source and channel encoders. It is shown that the identified
class of policies is optimal in the sense that it stabilizes the queue whenever
this is feasible by any other technique that satisfies the same average
distortion constraint. Moreover, this class of policies performs an independent
resource optimization for the source and channel encoders. Analog transmission
techniques as well as suboptimal strategies that do not use the energy buffer
(battery) or use it only for adapting either source or channel encoder energy
allocation are also studied for performance comparison. The problem of
optimizing the desired trade-off between average distortion and delay is then
formulated and solved via dynamic programming tools. Finally, a system with
multiple sensors is considered and time-division scheduling strategies are
derived that are able to maintain the stability of all data queues and to meet
the average distortion constraints at all sensors whenever it is feasible.Comment: Submitted to IEEE Transactions on Communications in March 2011; last
update in July 201
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
Optimal Energy Allocation for Kalman Filtering over Packet Dropping Links with Imperfect Acknowledgments and Energy Harvesting Constraints
This paper presents a design methodology for optimal transmission energy
allocation at a sensor equipped with energy harvesting technology for remote
state estimation of linear stochastic dynamical systems. In this framework, the
sensor measurements as noisy versions of the system states are sent to the
receiver over a packet dropping communication channel. The packet dropout
probabilities of the channel depend on both the sensor's transmission energies
and time varying wireless fading channel gains. The sensor has access to an
energy harvesting source which is an everlasting but unreliable energy source
compared to conventional batteries with fixed energy storages. The receiver
performs optimal state estimation with random packet dropouts to minimize the
estimation error covariances based on received measurements. The receiver also
sends packet receipt acknowledgments to the sensor via an erroneous feedback
communication channel which is itself packet dropping.
The objective is to design optimal transmission energy allocation at the
energy harvesting sensor to minimize either a finite-time horizon sum or a long
term average (infinite-time horizon) of the trace of the expected estimation
error covariance of the receiver's Kalman filter. These problems are formulated
as Markov decision processes with imperfect state information. The optimal
transmission energy allocation policies are obtained by the use of dynamic
programming techniques. Using the concept of submodularity, the structure of
the optimal transmission energy policies are studied. Suboptimal solutions are
also discussed which are far less computationally intensive than optimal
solutions. Numerical simulation results are presented illustrating the
performance of the energy allocation algorithms.Comment: Submitted to IEEE Transactions on Automatic Control. arXiv admin
note: text overlap with arXiv:1402.663
- …