A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Introduction to Algorithms
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On deriving the upper bound of α-lifetime for large sensor networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Sharp thresholds For monotone properties in random geometric graphs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
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
Mobility improves coverage of sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Unbalanced Points and Vertices Problem
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Coverage by randomly deployed wireless sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Deploying Wireless Sensor Networks under Limited Mobility Constraints
IEEE Transactions on Mobile Computing
Managing random sensor networks by means of grid emulation
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Review: Coverage and connectivity issues in wireless sensor networks: A survey
Pervasive and Mobile Computing
Adaptive redundancy for data propagation exploiting dynamic sensory mobility
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Data fusion improves the coverage of wireless sensor networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Adaptive, direction-aware data dissemination for diverse sensor mobility
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
Measuring and guaranteeing quality of barrier coverage for general belts with wireless sensors
ACM Transactions on Sensor Networks (TOSN)
Coverage optimization in wireless mobile sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Impact of mobile node density on detection performance measures in a hybrid sensor network
IEEE Transactions on Wireless Communications
Vector method based coverage hole recovery in wireless sensor networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Sensor relocation for emergent data acquisition in sparse mobile sensor networks
Mobile Information Systems
Design and implementation of mobile sink node in SDMA applications
UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing
IEEE/ACM Transactions on Networking (TON)
Probabilistic path selection in mobile wireless sensor networks for stochastic events detection
UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing
Direction-based adaptive data propagation for heterogeneous sensor mobility
Journal of Parallel and Distributed Computing
Optimal and distributed algorithms for coverage hole healing in hybrid sensor networks
International Journal of Sensor Networks
Exploiting data fusion to improve the coverage of wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Mobility increases the surface coverage of distributed sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
International Journal of Sensor Networks
Hi-index | 0.00 |
In this paper, we study the coverage problem for hybrid networks which comprise both static and mobile sensors. We consider mobile sensors with limited mobility, i.e., they can move only once over a short distance. Such mobiles are simple and cheap compared to sophisticated mobile robots. In conventional static sensor networks, for a random deployment, the sensor density should increase as O(log L + k log log L) to provide k-coverage in a network with a size of L. As an alternative, an all mobile sensor network can provide k-coverage over the field with a constant density of O(k), independent of network size L. We show that the maximum distance that any mobile sensor will have to move is O(1 over √k log 3 over 4 (kL)). We then propose a hybrid network structure, comprising static sensors and a small fraction of O(1 over √(k)) of mobile sensors. For this network structure, we prove that k-coverage is achievable with a constant sensor density of O(k), independent of network size L. Furthermore, for this hybrid structure, we prove that the maximum distance which any mobile sensor has to move is bounded as O(log3 over 4 L). We then propose a distributed relocation algorithm, where each mobile sensor only requires local information in order to optimally relocate itself and characterize the algorithm's computational complexity and message overhead. Finally, we verify our analysis via extensive numerical evaluations.