Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
TiNA: a scheme for temporal coherency-aware in-network aggregation
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Spatio-temporal correlation: theory and applications for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
Near-optimal sensor placements in Gaussian processes
ICML '05 Proceedings of the 22nd international conference on Machine learning
Mobile Element Scheduling with Dynamic Deadlines
IEEE Transactions on Mobile Computing
SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Multiple controlled mobile elements (data mules) for data collection in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Low cost data gathering using mobile hybrid sensor networks
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
| Hi-index | 0.00 |
We are interested in event collection in a 2D region where sensors are deployed to detect and collect interested events. Using traditional multi-hop routing in wireless sensor networks to report events to a sink node or base station, will result in severe imbalanced energy consumption of static sensors. In addition, full connectivity among all the static sensors may not be possible in some cases since generally the sensors are randomly deployed in the target region. In this paper, we exploit a mobile sensor as the sink node to assist the event collection by controlling the movement of the mobile sink to collect static sensor readings. A key observation of our work is that an event has spatial-temporal correlation. Specifically, the same event can be detected by multiple nearby sensors within a period of time. Thus, it is more energy-efficient if the mobile sink can selectively communicate with only a portion of static sensors, while still collecting all the interested events. In this paper, we discuss the event collection problem by leveraging the mobility of the sink node and the spatial-temporal correlation of the event, in favor of maximizing the network lifetime with a guaranteed event collection rate. We first model the problem as sensor selection problem and show that it could be solved in polynomial time, if global knowledge of events is available and there is no velocity constraints on mobile sink. We also analyze the design of a feasible movement route for mobile sink to minimize the velocity requirements for a practical system. An online scheme is then proposed to relax the assumption about global knowledge of events and we prove that the expected event collection rate can be guaranteed in theory. Through comprehensive simulation on real trace data, we demonstrate that the network lifetime can be significantly extended, comparing to some other schemes.