Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
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
ASAP: An Adaptive Sampling Approach to Data Collection in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Two techniques for fast computation of constrained shortest paths
IEEE/ACM Transactions on Networking (TON)
Rendezvous design algorithms for wireless sensor networks with a mobile base station
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
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
| Hi-index | 0.00 |
The exploitation of sink mobility has been proven to improve various network performance significantly, including network lifetime, data delivery latency, network connectivity, and so on. In this paper we consider a novel network model consisting of sensors, gateways, and a mobile sink, which can be applied to many realistic applications such as city traffic monitoring, patients monitoring, and forest fire surveillance. We assume that there is a roadmap in the monitoring region for the mobile sink to access, and gateways are located on roads. The mobile sink moves at a constant speed along a closed tour of roads to collect data from gateways. The travelling distance of the mobile sink per tour is bounded by a given value. Due to the limited communication time between the sink and each gateway, sometimes it is not possible for the mobile sink to collect the data generated from all sensors, consequently causing monitoring quality loss. In this paper, we study the problem by formulating it to find a closed tour for the mobile sink, such that the monitoring quality loss is minimized, subject to the tour length constraint. Since the problem is NP-hard, we propose a heuristic for it. Also, we design an energy-efficient routing protocol for data collection that balances the energy consumption among sensors. We finally conduct extensive experiments by simulation to evaluate the performance of the proposed schemes. The experiment results show the effectiveness of the proposed heuristic to optimize the network performance.