Skip to main content
Log in

Robust Range-Free Localization in Wireless Sensor Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13

Similar content being viewed by others

Notes

  1. This assumption is not always true in practice due to multipath channel fading. The violation of this assumption is actually the main reason causing estimation errors in range-free localization [7, 12]. The performance with irregular radio propagation is presented in Section 4.

  2. 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

  1. 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

    Article  Google Scholar 

  2. Capkun S, Hubaux, J-P (2005) Secure positioning of wireless devices with application to sensor networks. Proceedings of IEEE INFOCOM 05

  3. Chan H, Perrig A, Song D (2003) Random key predistribution schemes for sensor networks. IEEE symposium on security and privacy, May

  4. Du W, Fang L, Ning P (2006) Lad: localization anomaly detection for wireless sensor networks. J Parallel Distrib Comput 66(7):874–886, July

    Article  MATH  Google Scholar 

  5. 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

  6. 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

  7. 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

  8. Lazos L, Poovendran R (2005) Serloc: secure range-independent localization for wireless sensor networks. ACM Trans Sensor Netw 1(1):73–100, August

    Article  Google Scholar 

  9. Lazos L, Poovendran R (2006) HiRLoc: high-resolution robust localization for wireless sensor networks. IEEE J Sel Areas Commun 24(2):233–246, February

    Article  Google Scholar 

  10. 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

  11. 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

  12. 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

    Article  Google Scholar 

  13. Nagpal R (1999) Organizing a global coordinate system from local information on an amorphous computer. A.I. Memo1666, MIT AI Laboratory, August

  14. Niculescu D, Nath B (2003) Ad hoc positioning system (APS) using aoa. Proceedings of IEEE INFOCOM 03

  15. Niculescu D, Nath B (2003) DV based positioning in ad hoc networks. J Telecommun Syst 22:267–280

    Article  Google Scholar 

  16. 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

    Article  Google Scholar 

  17. Perrig A, Stankovic J, Wagner D (2004) Security in wireless sensor networks. Commun ACM 47(6):53–57, June

    Article  Google Scholar 

  18. 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

  19. Ray S, Ungrangsi R, Pellegrini FD, Trachtenberg A, Starobinski D (2003) Robust location detection in emergency sensor networks. In: IEEE INFOCOM 2003, April

  20. 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

  21. 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

  22. 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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kui Wu.

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

$$\frac{\partial f_1}{\partial l} = \sqrt{4R^2-l^2}> 0$$

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,

$$\begin{array}{rll}f_2\! &=&\! 2*\left(\int_{-R}^{d-2R} \sqrt{R^2\!-\!x^2} dx\right. \\ &&{\kern18pt} \left.+\int_{d-2R}^{\frac{d^2\!-\!3R^2}{2d}} \sqrt{R^2\!-\!x^2}-\sqrt{4R^2\!-\!(x-d)^2} \right) dx \\ &=&\!2{\kern-1pt}*{\kern-2.3pt}\left(\int_{-R}^{\frac{d^2\!-\!3R^2}{2d}}\!\! \sqrt{R^2\!-\!x^2} dx \!-\!\!\int_{d-2R}^{\frac{d^2\!-\!3R^2}{2d}}\!\! \sqrt{4R^2\!-\!(x\!-\!d)^2} dx \right) \\ &=&\!2{\kern-1.5pt} *{\kern-1.5pt} \left(\int_{\!-\!R}^{\frac{d^2\!-\!3R^2}{2d}}\!\! \sqrt{R^2\!-\!x^2} dx \!-\!\int_{-2R}^{\frac{-d^2\!-\!3R^2}{2d}}\!\! \sqrt{4R^2\!-\!x^2} dx \right)\end{array}$$
(9)

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

$$\begin{array}{rll}\frac{\partial f_2}{\partial d} &=& 2\sqrt{-d^4+10d^2R^2\!-\!9R^4} \\ &&\times\left(\left(\frac{d^2\!-\!3R^2}{2d}\right)'\!+\!\left(\frac{d^2\!+\!3R^2}{2d}\right)'\right) \\ &=&2\sqrt{-d^4\!+\!10d^2R^2\!-\!9R^4} \end{array}$$
(10)

It is easy to see that \(\frac{\partial f_2}{\partial d}>0\) when R < d ≤ 2R, because

$$-d^4+10d^2R^2-9R^4 = (9R^2-d^2)(d^2-R^2)>0.$$

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.

Figure 14
figure 14

Analysis on cooperative detection

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:

$$\begin{array}{rll}f_4 &=& \int_{B_x}^{D_x}\sqrt{4R^2-(x\!-\!d)^2}dx \\ &&- \int_{B_x}^{D_x}\left(A_y+\sqrt{R^2-(x\!-\!A_x)^2}\right) dx \\ && + \int_{D_x}^{E_x}\!\!\sqrt{R^2\!-\!x^2}dx \!-\! \int_{D_x}^{E_x}\!\left(A_y\!+\!\sqrt{R^2\!-\!(x\!-\!A_x)^2}dx \right. \\ &=& \int_{B_x-d}^{D_x-d}\sqrt{4R^2\!-\!x^2}dx \!+\! \int_{D_x}^{E_x}\sqrt{R^2-x^2}dx \\ &&- \int_{B_x}^{E_x}\left(A_y\!+\!\sqrt{R^2-(x-A_x)^2}\right) dx \end{array}$$
(11)

Therefore,

$$\begin{array}{rll} \frac{\partial f_4}{\partial l} &=& D_y(D_x-d)' - B_y(B_x-d)' - D_yD_x'+ B_yB_x' \\ &=& B_yd'-D_yd' \\ &=& (B_y-D_y)\frac{l-\sqrt{\rho}\cos\theta}{\sqrt{l^2+\rho-2l\sqrt{\rho}\cos\theta}} \end{array}$$
(12)

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

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-008-0041-9

Keywords

Navigation