Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Stream data gathering in wireless sensor networks within expected lifetime
Proceedings of the 3rd international conference on Mobile multimedia communications
Proceedings of the fifth international workshop on Foundations of mobile computing
A queueing approach to optimal resource replication in wireless sensor networks
Performance Evaluation
Mobile Networks and Applications
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Reconfigurable Hardware Based Dynamic Data Aggregation in Wireless Sensor Networks
International Journal of Distributed Sensor Networks - Advances on Heterogeneous Wireless Sensor Networks
Minimizing effective energy consumption in multi-cluster sensor networks for source extraction
IEEE Transactions on Wireless Communications
Analysis of random sleep scheme for wireless sensor networks
International Journal of Sensor Networks
A routing scheme of mobile sink in sensor networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Efficient algorithm for maximum lifetime many-to-one data aggregation in wireless sensor networks
International Journal of Sensor Networks
Energy efficient sink node placement in sensor networks using particle swarm optimization
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Improved approximation algorithms for maximum lifetime problems in wireless networks
Theoretical Computer Science
Compression in wireless sensor networks: A survey and comparative evaluation
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.07 |
The current practice in wireless sensor networks (WSNs) is to develop functional system designs and protocols for information extraction using intuition and heuristics, and validate them through simulations and implementations. We address the need for a complementary formal methodology by developing nonlinear optimization models of static WSN that yield fundamental performance bounds and optimal designs. We present models both for maximizing the total information gathered subject to energy constraints (on sensing, transmission, and reception), and for minimizing the energy usage subject to information constraints. Other constraints in these models correspond to fairness and channel capacity (assuming noise but no interference). We also discuss extensions of these models that can handle data aggregation, interference, and even node mobility. We present results and illustrations from computational experiments using these models that show how the optimal solution varies as a function of the energy/information constraints, network size, fairness constraints, and reception power. We also compare the performance of some simple heuristics with respect to the optimal solutions.