Abstract
In this chapter, we study trap coverage in sensor networks, which is recognized to be efficient for intruder detection. We formally formulate the Minimum Weight Trap Cover Problem and prove it is an NP-hard problem. To solve the problem, we introduce a bounded approximation algorithm, called Trap Cover Optimization (TCO) to schedule the activation of sensors while satisfying specified trap coverage requirement. We design Localized Trap Coverage Protocol as the localized implementation of TCO. We show that the performance of Minimum Weight Trap Coverage is at most O(ρ) times of the optimal solution, where ρ is the density of sensor nodes in the region. We perform extensive simulations to demonstrate the effectiveness of the proposed algorithm.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
