Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Sensor deployment strategy for target detection
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Introduction to Algorithms
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Recent Developments in Maximum Flow Algorithms (Invited Lecture)
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Movement-Assisted Sensor Deployment
IEEE Transactions on Mobile Computing
Unreliable sensor grids: coverage, connectivity and diameter
Ad Hoc Networks
Movement-assisted sensor redeployment scheme for network lifetime increase
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Sensor Deployment for Composite Event Detection in Mobile WSNs
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
A Routing Scheme with Localized Movement in Event-Driven Wireless Sensor Networks
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
On Relocation of Hopping Sensors for Balanced Migration Distribution of Sensors
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
An obstacle-free and power-efficient deployment algorithm for wireless sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Improving network lifetime with mobile wireless sensor networks
Computer Communications
Multipath-based relocation schemes considering balanced assignment for hopping sensors
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Sensor deployment for collaborative target detection in the presence of obstacles
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A cellular learning automata-based deployment strategy for mobile wireless sensor networks
Journal of Parallel and Distributed Computing
Limited mobility coverage and connectivity maintenance protocols for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Intelligent Sensor Placement Method to Reach a High Coverage in Wireless Sensor Networks
International Journal of Grid and High Performance Computing
Hi-index | 0.00 |
An important phase of sensor networks operation is deployment of sensors in the field of interest. Critical goals during sensor networks deployment include coverage, connectivity, load balancing, etc. A class of work has recently appeared, where mobility in sensors is leveraged to meet deployment objectives. In this paper, we study deployment of sensor networks using mobile sensors. The distinguishing feature of our work is that the sensors in our model have limited mobilities. More specifically, the mobility in the sensors we consider is restricted to a flip, where the distance of the flip is bounded. We call such sensors as flip-based sensors. Given an initial deployment of flip-based sensors in a field, our problem is to determine a movement plan for the sensors in order to maximize the sensor network coverage and minimize the number of flips. We propose a minimum-cost maximum-flow-based solution to this problem. We prove that our solution optimizes both the coverage and the number of flips. We also study the sensitivity of coverage and the number of flips to flip distance under different initial deployment distributions of sensors. We observe that increased flip distance achieves better coverage and reduces the number of flips required per unit increase in coverage. However, such improvements are constrained by initial deployment distributions of sensors due to the limitations on sensor mobility.