Abstract
In wireless sensor networks, sensors should have some mechanisms to learn their locations since sensed data without associated location information may be meaningless. While many sensor localization algorithms have been proposed, security issues in sensor localization are usually not addressed in their original design. Secure sensor localization is very challenging due to limited computation and energy resources in sensors. It is highly desirable that a localization scheme is robust and is able to detect malicious attacks without using complex cryptographic operations. In this paper, we present and analyze detection methods purely based on geometric constraints in sensor networks. Our detection methods can protect the localization algorithm from malicious attacks by detecting and eliminating the negative impact of fake information.













Similar content being viewed by others
Notes
Collusive attackers may decide not to broadcast any information or broadcast fake information in Steps 1 and 2. Collusive attacks are discussed in the next section.
References
Bulusu N, Heidemann J, Estrin D (2000) Gps-less low cost outdoor localization for very small devices. IEEE Pers Commun Mag 7(5):28–34, October
Capkun S, Hubaux, J-P (2005) Secure positioning of wireless devices with application to sensor networks. Proceedings of IEEE INFOCOM 05
Chan H, Perrig A, Song D (2003) Random key predistribution schemes for sensor networks. IEEE symposium on security and privacy, May
Du W, Fang L, Ning P (2006) Lad: localization anomaly detection for wireless sensor networks. J Parallel Distrib Comput 66(7):874–886, July
Du W, Deng J, Han Y, Varshney P (2003) A pairwise key predistribution scheme for wireless sensor networks. Proc. of 10th ACM conference on computer and communications security (CCS), October
Ekici E, McNair J, Al-Abri D (2005) A probabilistic approach to location verification in wireless sensor networks. ACM workshop on security of ad hoc and sensor networks (SASN05), November
He T, Huang BBC, Stankovic JA, Abdelzaheri T (2003) Range-free localization schemes for large scale sensor networks. In: Proceedings of the ninth annual international conference on mobile computing and networking (MobiCom 2003), pp 81–95, September
Lazos L, Poovendran R (2005) Serloc: secure range-independent localization for wireless sensor networks. ACM Trans Sensor Netw 1(1):73–100, August
Lazos L, Poovendran R (2006) HiRLoc: high-resolution robust localization for wireless sensor networks. IEEE J Sel Areas Commun 24(2):233–246, February
Lazos L, Poovendran R, Capkun S (2005) Rope: robust position estimation in wireless sensor networks. Fourth international symposium on information processing in sensor networks (IPSN), April
Liu D, Ning P, Du W (2005) Attack-resistant location estimation in sensor networks. Fourth international symposium on information processing in sensor networks (IPSN), April
Liu C, Scott T, Wu K, Hoffman D (2007) Range-free sensor localization with ring overlapping based on comparison of received signal strength indicator. Int J Sens Netw (IJSNet) 2(5/6):399–413
Nagpal R (1999) Organizing a global coordinate system from local information on an amorphous computer. A.I. Memo1666, MIT AI Laboratory, August
Niculescu D, Nath B (2003) Ad hoc positioning system (APS) using aoa. Proceedings of IEEE INFOCOM 03
Niculescu D, Nath B (2003) DV based positioning in ad hoc networks. J Telecommun Syst 22:267–280
Patwari N, Hero AO, Perkins M, Correal NS, ODea RJ (2003) Relative location estimation in wireless sensor networks. IEEE Trans Signal Process 51(8):2137–2148
Perrig A, Stankovic J, Wagner D (2004) Security in wireless sensor networks. Commun ACM 47(6):53–57, June
Priyanath NB, Chakraborty A, Balakrishna H (2000) The cricket location support system. In: Proceedings of the sixth annual international conference on mobile computing and networks (MobiCom 00), August
Ray S, Ungrangsi R, Pellegrini FD, Trachtenberg A, Starobinski D (2003) Robust location detection in emergency sensor networks. In: IEEE INFOCOM 2003, April
Savvides A, Han C, Strivastava MB (2001) Dynamic fine-grained localization in ad-hoc networks of sensors. In: Proceedings of the seventh annual international conference on mobile computing and networking (MobiCom 01), July
Srinivasan A, Teitelbaum J, Wu J (2006) Drbts: Distributed reputation-based beacon trust system. In: 2nd IEEE international symposium on dependable, autonomic and secure computing (DASC 06), pp 277–283
Warneke B, Last M, Leibowitz B, Pister K (2001) Smart dust: communicating with a cubic-millimeter computer. IEEE Comput Mag 134(1):44–51, January
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
1.1 A. Proof of Theorem 1
Based on Remarks 1, 2, and 3, the probability that an anchor node, A, is detected as a cheater is lowered bounded by a function of l, the distance between the real location and the fake location of A. The function is a monotonically increasing function of l due to the fact that the size of the shadowed area in Fig. 2a, b, c and d monotonically increases with the increase of l.
Case 1—Fig. 2 a: The size of the shadowed area can be calculated with Eq. 2, which is clearly a monotonically increasing function of l because
when l < 2R. When l ≥ 2R, the shadowed area reached its maximum, πR 2.
Case 2—Fig. 2 b: The size of the shadowed area can be calculated with Eq. 4, which is,
where d is the distance between S and A′ and R < d ≤ 2R. For given ρ and θ, f 2 is a monotonically increasing function of l because (1) d is a monotonically increasing function of l and (2) f 2 is a monotonically increasing function of d. The first reason is obvious since \(d=\sqrt{(l-\sqrt{\rho}cos\theta)^2+\rho sin^2\theta}\). The second reason is true since
It is easy to see that \(\frac{\partial f_2}{\partial d}>0\) when R < d ≤ 2R, because
Case 3—Fig. 2 c (l ≤ R): The shadowed area is simply the union of the shadowed areas of Case 1 and Case 2, and as such the size of the shadowed area in Case 3 monotonically increases with the increase of l.
Case 4—Fig. 2 d (R < l ≤ 2R): The shadowed area is the union of the shadowed areas of Case 1 and Case 2 minus the stroked area. Although the stroked area can be calculated numerically in Matlab, its exact mathematical expression is hard to get. Nevertheless, that the size of the shadowed area in Fig. 2d monotonically increases with the increase of l is equivalent to that the size of the shadowed area in Fig. 14 monotonically decreases with the increase of l.
The shadowed area in Fig. 14 is the union of the starred area and the stroked area. It is easy to see that the size of the starred area monotonically decreases with the increase of l because its size equals \(\pi R^2-f_1\), where f 1 is the monotonically increasing function of l in Case 1.
Next we prove that the stroked area in Fig. 14 also monotonically decreases with the increase of l. As shown in Fig. 14, we use line SA′ as the x-axis and S as the origin. The y-axis is selected upward if S sits above line AA′ and downward otherwise. We denote points B, D, E, and A as (B x ,B y ), (D x ,D y ), (E x ,E y ), and (A x , A y ) respectively. Note that B x ,B y ,D x , and D y all are a function of l, but E x , E y , A x , and A y do not change with l. If we use d to denote the distance between S and A′ as before, d is also a function of l. The size of the stroked area, denoted as f 4, can be calculated as:
Therefore,
Note that in Case 4, R < l ≤ 2R and \(\sqrt{\rho}\cos\theta \leq R\) (S must be able to hear A). Thus \(\frac{l-\sqrt{\rho}\cos\theta}{\sqrt{l^2+\rho-2l\sqrt{\rho}\cos\theta}}>0\). Due to the way that we set the direction of y-axis, B y < D y . Therefore \(\frac{\partial f_4}{\partial l} <0\), which means, the size of the stroked area in Fig. 14 monotonically decreases with the increase of l. □
Rights and permissions
About this article
Cite this article
Wu, K., Liu, C., Pan, J. et al. Robust Range-Free Localization in Wireless Sensor Networks. Mobile Netw Appl 12, 392–405 (2007). https://doi.org/10.1007/s11036-008-0041-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11036-008-0041-9