Bilateration: An Attack-Resistant Localization Algorithm of Wireless Sensor Network
Most of the state-of-the-art localization algorithms in wireless sensor networks (WSNs) are vulnerable to attacks from malicious or compromised network nodes, whereas the secure localization schemes proposed so far are too complex to be applied to power c
- PDF / 1,100,765 Bytes
- 12 Pages / 430 x 660 pts Page_size
- 91 Downloads / 266 Views
Department of Computer Science and Technology University of Science and Technology of China, Hefei 230027, China 1, 2,4 Mobile Computing Laboratory Suzhou Institute for Advanced Study, Suzhou, Jiangsu 215123, China {xinxinol,guoyan6}@mail.ustc.edu.cn, {bhua,llyue}@ustc.edu.cn 3 Department of Computer Science University of Missouri-Columbia, Columbia, MO 65211, USA [email protected]
Abstract. Most of the state-of-the-art localization algorithms in wireless sensor networks (WSNs) are vulnerable to attacks from malicious or compromised network nodes, whereas the secure localization schemes proposed so far are too complex to be applied to power constrained WSNs. This paper provides a novel secure scheme “Bilateration” which is derived from multilateration but can be calculated more accurately and quickly to resolve the positions of unknown nodes without explicitly distinguishing what kind of location attacks the WSN is facing. This paper also compares Bilateration with three existing multilateration solutions that optimize the location estimation accuracy via LS, LMS and LLMS respectively in a simulated threat environment. The experiment results show that Bilateration gets the best tradeoff among estimation error, filtering ability and computational complexity. Keywords: localization, WSNs, multilateration, Bilateration, LS.
1
Introduction and Related Work
A WSN may run in a hostile environment without any supervision, where the attackers may easily threat the functionality of position-aware applications by exploiting the vulnerabilities of the localization schemes. There are mainly two types of attacks aiming at the localization process in WSNs [2]. The first type is launched by malicious nodes that are not a part of the network and controlled by an attacker. Typical attacks include modifying distance, jamming communication and creating wormholes [3] [4] in the network. The second type is launched by compromised nodes that are a part of the network and can authenticate
This work was supported by the National Natural Science Foundation of China under Grant No.60673173 and No.60673111, and the Fund for Foreign Scholars in University Research and Teaching Programs. To whom correspondence should be addressed.
T.-W. Kuo et al. (Eds.): EUC 2007, LNCS 4808, pp. 321–332, 2007. c IFIP International Federation for Information Processing 2007
322
X. Li et al.
themselves as honest nodes, but are controlled by an attacker. They report false positions and disseminate false topology information. Most of the existing localization algorithms don’t have the ability to filter out incorrect information, thus are vulnerable to various location attacks. Recently, some secure localization schemes have been proposed to resist the attacks launched by compromised or malicious nodes. The most common techniques include location-verification[5], distance-verification[6][7], distancebounding plus some symmetric key cryptography[8], RSS measurements[10] and “packet leashes”[4]. However these methods always require powerful calculation
Data Loading...
