Abstract
In this chapter, we study mobile intruder detection in wireless sensor networks (WSNs) under the probabilistic sensing model. Existing trap coverage for intruder detection does not consider the various moving speeds of intruders. To extend the concept of mobile intruders trapping into a real large-scale WSN, we analyze the detection probability of a mobile intruder in the sensor network theoretically and define probabilistic trap coverage which restricts the farthest displacement of a mobile intruder with a detection probability less than the threshold. We develop the theory of circle graph which can be generally applied in the area of intrusion detection such as trap coverage and barrier coverage. We further study the practical issue about how to schedule sensors to maximize the lifetime of network while guaranteeing probabilistic trap coverage. A localized protocol is proposed to solve the problem and the performance of the protocol is analyzed theoretically. We demonstrate the advantages of the proposed algorithm by comparing with the state-of-the-art solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
P. Balister, Z. Zheng, S. Kumar, and P. Sinha. Trap coverage: Allowing coverage holes of bounded diameter in wireless sensor networks. In Proceedings of IEEE International Conference on Computer Communications (INFOCOM), 2009.
J. Li, J. Chen, S. He, T. He, Y. Gu, and Y. Sun. On energy-efficient trap coverage in wireless sensor networks. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), 2011.
R. Tan, G. Xing, B. Liu, and J. Wang. Impact of data fusion on real-time detection in sensor networks. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), 2009.
G. Xing, R. Tan, B. Liu, J. Wang, X. Jia, and C. Yi. Data fusion improves the coverage of wireless sensor networks. In Proceedings of the Annual International Conference on Mobile Computing and Networking (MobiCom), 2009.
I. Altinel, N. Aras, E. Güney, and C. Ersoy. Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks. Computer Netwoks, 52(12):2419–2431, 2008.
J. Chen, J. Li, S. He, Y. Sun, and H. Chen. Energy-efficient coverage based on probabilistic sensing model in wireless sensor networks. IEEE Communication Letters, 14(9):833–835, 2010.
N. Ahmed, S. Kanhere, and S. Jha. Probabilistic coverage in wireless sensor networks. In Proceedings of the IEEE Conference on Local Computer Networks 30th Anniversary (LCN), 2005.
S. Kumar, T. Lai, and A. Arora. Barrier coverage with wireless sensors. In Proceedings of the Annual International Conference on Mobile Computing and Networking (MobiCom), 2005.
J. Chen, J. Li, and T. H. Lai. Trapping mobile targets in wireless sensor networks: An energy-efficient perspective. IEEE Transactions on Vehicular Technology, 62(7):3287–3300, 2013.
G. Mao, B. Fidan, and B. Anderson. Wireless sensor network localization techniques. Computer Networks, 51(10):2529–2553, 2007.
N. Patwari, J. Ash, S. Kyperountas, A. Hero, R. Moses, and N. Correal. Locating the nodes: cooperative localization in wireless sensor networks. IEEE Signal Processing Magazine, 22(4):54–69, 2005.
Y. Zou and K. Chakrabarty. Sensor deployment and target localization in distributed sensor networks. ACM Transactions on Embedded Computing Systems, 3(1):61–91, 2004.
S. Kumar, T. Lai, M. Posner, and P. Sinha. Maximizing the lifetime of a barrier of wireless sensors. IEEE Transactions on Mobile Computing, 9(8):1161–1172, 2010.
J. Li, J. Chen, and T. Lai. Energy-efficient intrusion detection with a barrier of probabilistic sensors. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), 2012.
D.B. West. Introduction to Graph Theory. Prentice Hall, 2001.
T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Data structures for disjoint sets. In Introduction to Algorithms, pages 498–524. MIT Press and McGraw-Hill, 2001.
B. Liu, O. Dousse, J. Wang, and A. Saipulla. Strong barrier coverage of wireless sensor networks. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2008.
A. Chen, S. Kumar, and T. Lai. Designing localized algorithms for barrier coverage. In Proceedings of the Annual ACM International Conference on Mobile Computing and Networking (MobiCom), 2007.
M. Cardei, T. Thai, Y. Li, and W. Wu. Energy-efficient target coverage in wireless sensor networks. In Proceedings of IEEE International Conference on Computer Communications (INFOCOM), 2005.
Y. Zou and K. Chakrabarty. A distributed coverage and connectivity centric technique for selecting active nodes in wireless sensor networks. IEEE Transactions on Computers, 25(8):978–991, 2005.
S. Kumar, T. Lai, and J. Balogh. On k-coverage in a mostly sleeping sensor network. In Proceedings of the Annual International Conference on Mobile Computing and Networking (MobiCom), 2004.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 The Author(s)
About this chapter
Cite this chapter
He, S., Chen, J., Li, J., Sun, Y. (2014). Trapping Mobile Intruders in Sensor Networks. In: Energy-Efficient Area Coverage for Intruder Detection in Sensor Networks. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-04648-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-04648-8_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04647-1
Online ISBN: 978-3-319-04648-8
eBook Packages: Computer ScienceComputer Science (R0)