A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
Entropy-based sensor selection heuristic for target localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Wireless adhoc sensor and actuator networks on the farm
Proceedings of the 5th international conference on Information processing in sensor networks
Exploiting mobility for energy efficient data collection in wireless sensor networks
Mobile Networks and Applications
Health monitoring of civil infrastructures using wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Energy Efficiency in the Mobile Ad Hoc Networking Approach to Monitoring Farm Animals
ICN '07 Proceedings of the Sixth International Conference on Networking
Mobile Element Scheduling with Dynamic Deadlines
IEEE Transactions on Mobile Computing
Approximation algorithms for prize collecting forest problems with submodular penalty functions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The Journal of Machine Learning Research
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
SensorScope: Application-specific sensor network for environmental monitoring
ACM Transactions on Sensor Networks (TOSN)
Speed control and scheduling of data mules in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Robust sensor placements at informative and communication-efficient locations
ACM Transactions on Sensor Networks (TOSN)
Pervasive and Mobile Computing
| Hi-index | 0.00 |
We consider the data gathering problem in wireless ad-hoc networks where a data mule traverses a set of sensors, each with vital information on its surrounding, and collects their data. The mule goal is to collect as much information as possible thereby reducing the information uncertainty but in the same time avoid visiting some of the nodes to minimize its travel distance. We study the problem when the mule travels over a tree or a tour and propose a 3-approximation algorithm that minimizes both the information uncertainty and travel distance. We also show the applicability of our approach for solving data collection problems in varying domains such as temperature monitoring, surveillance systems and sensor placement. Simulation results show that the proposed solution converges to the optimal for varying set of topologies, such as grids, stars, linear and random networks.