Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
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
Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Ad Hoc & Sensor Networks: Theory And Applications
Ad Hoc & Sensor Networks: Theory And Applications
Exploiting sink movement for energy-efficient load-balancing in wireless sensor networks
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A moving algorithm for non-uniform deployment in mobile sensor networks
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Improving network lifetime with mobile wireless sensor networks
Computer Communications
Maximizing the Lifetime of Wireless Sensor Networks with Mobile Sink in Delay-Tolerant Applications
IEEE Transactions on Mobile Computing
Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks
IEEE Transactions on Mobile Computing
Efficient Rendezvous Algorithms for Mobility-Enabled Wireless Sensor Networks
IEEE Transactions on Mobile Computing
A simple myopic mobile sink strategy for wireless sensor networks
PCCC '11 Proceedings of the 30th IEEE International Performance Computing and Communications Conference
| Hi-index | 0.00 |
Network lifetime maximization is challenging particularly for large-scale wireless sensor networks. The sensor nodes near the sink node tend to suffer high energy consumption due to heavy traffic relay operations, becoming vulnerable to energy depletion. The rationale of the sink mobility approach is that as the sink node moves around, such risk of energy depletion at some nodes can be alleviated. In this paper, we first obtain the optimal mobile sink sojourning pattern by solving a linear programming model and then we mathematically analyze why the optimal solution exhibits such sojourning pattern. We use the insights from this analysis to design a simple practical heuristic algorithm for sink mobility, which utilizes only local information. Our heuristic is very different from the existing algorithms which often use the traffic volume as the main decision factor, in that we consider the variance of residual energy of neighboring sensor nodes. The simulation results show that our scheme achieves near-optimal network lifetime even with the relatively low moving speed of the mobile sink.