Abstract
Many applications ask for information of nodes in wireless sensor networks (WSNs), among which the node location is an important type of information. In WSNs, localization of target node is often obtained with aid of anchors with providing distance-related information in many algorithms. However some anchors may be attacked in real environments. In order to guarantee the accuracy of localization, it is necessary to identify the malicious anchors under attack. In this paper, we propose a localization detection algorithm with malicious anchors existing in WSNs. The algorithm firstly utilizes Isolation Forest to confirm the reference anchors. After obtaining the initial position estimate of the target nodes, we establish a detection model using the consistency of the measuring distance and the Euclidean distance to the initial position estimate. Finally sequential probability ratio testing (SPRT) is carried out on the remained anchors. The simulation results demonstrate the proposed algorithm can efficiently identify the malicious anchors and outperforms other existing algorithms.
Supported by the National Natural Science Foundation of China under Grant 61572534 and Grant 61873290, by the Special Project of Promoting Economic Development in Guangdong Province under Grant GDME-2018D004, and by the Opening Project of Guangdong Province Key Laboratory of Information Security Technology under Grant 2017B030314131.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Akyildiz, I.F., et al.: A survey on sensor networks. Commun. Mag. 40(8), 102–114 (2002)
Liu, X., et al.: An optimization scheme of enhanced adaptive dynamic energy consumption based on joint network-channel coding in WSNs. Sensors J. 17(18), 6119–6128 (2017)
Liu, X., et al.: Range-based localization for sparse 3-D sensor networks. IoT-J. 6(1), 753–764 (2019)
Lee, J., et al.: Novel range-free localization based on multidimensional support vector regression trained in the primal space. IEEE Trans. Neural Netw. Learn. Syst. 24(7), 1099–1113 (2013)
Assaf, A.E., et al.: Robust ANNs-based WSN localization in the presence of anisotropic signal attenuation. Wirel. Commun. Lett. 5(5), 504–507 (2016)
Niculescu, D., et al.: Ad hoc positioning system (APS). In: Global Telecommunications Conference, pp. 2926–2931. IEEE (2001)
Liu, D., et al.: Attack-resistant location estimation in sensor networks. ACM Trans. Inf. Syst. Secur. 11(4), 1–39 (2008)
Garg, R., et al.: An efficient gradient descent approach to secure localization in resource constrained wireless sensor networks. IEEE Trans. Inf. Forensics Secur. 7(2), 717–730 (2012)
Zhang, Q., et al.: Sparse recovery formulation for secure distance-based localization in the presence of cheating anchors. Wirel. Netw. 24(7), 2657–2668 (2018)
Liu, X., et al.: A range-based secure localization algorithm for wireless sensor networks. Sensors J. 19(2), 785–796 (2018)
Liu, F.T., et al.: Isolation forest. In: 8th International Conference on Data Mining, pp. 413–422. IEEE (2008)
Ho, J.W., et al.: Zone trust: fast zone-based node compromise detection and revocation in wireless sensor networks using sequential hypothesis testing. IEEE Trans. Dependable Secur. Comput. 9(4), 494–511 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Peng, J., Liu, X. (2019). A Malicious Anchor Detection Algorithm Based on Isolation Forest and Sequential Probability Ratio Testing (SPRT). In: Guo, S., Liu, K., Chen, C., Huang, H. (eds) Wireless Sensor Networks. CWSN 2019. Communications in Computer and Information Science, vol 1101. Springer, Singapore. https://doi.org/10.1007/978-981-15-1785-3_7
Download citation
DOI: https://doi.org/10.1007/978-981-15-1785-3_7
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-1784-6
Online ISBN: 978-981-15-1785-3
eBook Packages: Computer ScienceComputer Science (R0)