Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Introduction to Algorithms
Sensor deployment strategy for detection of targets traversing a region
Mobile Networks and Applications
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Mobility improves coverage of sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Robomote: enabling mobility in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Mobile Element Scheduling with Dynamic Deadlines
IEEE Transactions on Mobile Computing
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Defending Against Barrier Intrusions with Mobile Sensors
WASA '07 Proceedings of the International Conference on Wireless Algorithms,Systems and Applications
Deploying Wireless Sensor Networks under Limited Mobility Constraints
IEEE Transactions on Mobile Computing
Strong barrier coverage of wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Barrier Coverage with Mobile Sensors
ISPAN '08 Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks
IEEE Transactions on Parallel and Distributed Systems
Exploiting Reactive Mobility for Collaborative Target Detection in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Multi-round sensor deployment for guaranteed barrier Coverage
INFOCOM'10 Proceedings of the 29th conference on Information communications
Mobile Scheduling for Spatiotemporal Detection in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
Barrier coverage in camera sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Strong barrier coverage in directional sensor networks
Computer Communications
Energy efficient k-barrier coverage in limited mobile wireless sensor networks
Computer Communications
Constructing sensor barriers with minimum cost in wireless sensor networks
Journal of Parallel and Distributed Computing
Barrier coverage in bistatic radar sensor networks: cassini oval sensing and optimal placement
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Achieving full-view coverage in camera sensor networks
ACM Transactions on Sensor Networks (TOSN)
Detect smart intruders in sensor networks by creating network dynamics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attempt to penetrate the region of interest. A sensor barrier is formed by a connected sensor cluster across the entire deployed region, acting as a "trip wire" to detect any crossing intruders. In this paper we study how to efficiently improve barrier coverage using mobile sensors with limited mobility. After the initial deployment, mobile sensors can move to desired locations and connect with other sensors in order to create new barriers. However, simply moving sensors to form a large local cluster does not necessarily yield a global barrier. This global nature of barrier coverage makes it a challenging task to devise effective sensor mobility schemes. Moreover, a good sensor mobility scheme should efficiently improve barrier coverage under the constraints of available mobile sensors and their moving range. We first explore the fundamental limits of sensor mobility on barrier coverage and present a sensor mobility scheme that constructs the maximum number of barriers with minimum sensor moving distance. We then present an efficient algorithm to compute the existence of barrier coverage with sensors of limited mobility, and examine the effects of the number of mobile sensors and their moving ranges on the barrier coverage improvement. Both the analytical results and performance of the algorithms are evaluated via extensive simulations.