Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Introduction to Algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Efficient Data Harvesting in Mobile Sensor Platforms
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Movement-Assisted Sensor Deployment
IEEE Transactions on Mobile Computing
Robomote: enabling mobility in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Mobility Limited Flip-Based Sensor Networks Deployment
IEEE Transactions on Parallel and Distributed Systems
On attack-resilient wireless sensor networks with novel recovery strategies
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Redeployment based sensing hole mitigation in wireless sensor networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Improving network lifetime with mobile wireless sensor networks
Computer Communications
On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile Sensor Networks
Mobile Networks and Applications
Ant colony optimization based sensor deployment protocol for wireless sensor networks
Expert Systems with Applications: An International Journal
On coverage issues in directional sensor networks: A survey
Ad Hoc Networks
Mission-oriented k-coverage in mobile wireless sensor networks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Lifetime extension for surveillance wireless sensor networks with intelligent redeployment
Journal of Network and Computer Applications
On the problem of k-coverage in mission-oriented mobile wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive k-coverage contour evaluation and deployment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Fast and reliable robot deployment for substitution networks
Proceedings of the 10th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networks
ACM Transactions on Sensor Networks (TOSN)
An efficient strategy of nonuniform sensor deployment in cyber physical systems
The Journal of Supercomputing
| Hi-index | 0.00 |
Sensor deployment in mobile sensor networks has received significant attention in recent years. Goals during sensor deployment include improving coverage, achieving load balance, and prolonging the network lifetime. To improve the initial deployment, one possible method is to use mobile sensors, thus allowing sensors to relocate. In this paper, we present a sensor deployment strategy in mobile sensor networks. Our goal is to improve coverage and prolong network lifetime through sensor relocation after the initial deployment. The problem in this paper is defined as Movement-assisted Sensor Positioning (MSP) for network lifetime increase problem. With the observation that the sensors closer to the sink tend to consume more energy than those farther away from the sink, we first compute the desired non-uniform sensor density in the monitored area to reduce the energy holes near the sink and to prolong network lifetime. Assuming that sensors can move only once, we then propose a centralized algorithm to relocate mobile sensors to satisfy the density requirement with minimum cost. We construct the virtual multi-flow graph and solve the sensor relocation problem using a maximum-flow minimum-cost algorithm. The improvement in network lifetime is proved both mathematically and by simulations.