Please wait a minute...
Frontiers of Computer Science

ISSN 2095-2228

ISSN 2095-2236(Online)

CN 10-1014/TP

Postal Subscription Code 80-970

2018 Impact Factor: 1.129

Front. Comput. Sci.    2008, Vol. 2 Issue (4) : 438-450    https://doi.org/10.1007/s11704-008-0018-7
A robust localization algorithm in wireless sensor networks
LI Xin1, HUA Bei1, XIONG Yan1, SHANG Yi2
1.Department of Computer Science and Technology, University of Science and Technology of China; 2.Department of Computer Science, University of Missouri-Columbia;
 Download: PDF(319 KB)   HTML
 Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks
Abstract Most of the state-of-the-art localization algorithms in wireless sensor networks (WSNs) are vulnerable to various kinds of location attacks, whereas secure localization schemes proposed so far are too complex to apply to power constrained WSNs. This paper provides a distributed robust localization algorithm called Bilateration that employs a unified way to deal with all kinds of location attacks as well as other kinds of information distortion caused by node malfunction or abnormal environmental noise. Bilateration directly calculates two candidate positions for every two heard anchors, and then uses the average of a maximum set of close-by candidate positions as the location estimation. The basic idea behind Bilateration is that candidate positions calculated from reasonable (i.e., error bounded) anchor positions and distance measurements tend to be close to each other, whereas candidate positions calculated from false anchor positions or distance measurements are highly unlikely to be close to each other if false information are not collaborated. By using ilateration instead of classical multilateration to compute location estimation, Bilateration requires much lower computational complexity, yet still retains the same localization accuracy. This paper also evaluates and compares Bilateration with three multilateration-based localization algorithms, and the simulation results show that Bilateration achieves the best comprehensive performance and is more suitable to real wireless sensor networks.
Issue Date: 05 December 2008
 Cite this article:   
HUA Bei,LI Xin,SHANG Yi, et al. A robust localization algorithm in wireless sensor networks[J]. Front. Comput. Sci., 2008, 2(4): 438-450.
 URL:  
https://academic.hep.com.cn/fcs/EN/10.1007/s11704-008-0018-7
https://academic.hep.com.cn/fcs/EN/Y2008/V2/I4/438
1 Niculescu D, Nath B . Ad hoc positioning system(APS). In: Proceedings of the IEEE GlobalCommunications Conference of GLOBECOM. San Antonio: IEEE Computer Society, 2001, 2926–2931
2 Bulusu N, Heidemann J, Estrin D . GPS-less low cost outdoor localization for very smalldevices. IEEE Personal Communications Magazine, 2000, 7(5): 28–34.
doi:10.1109/98.878533
3 He T, Huang C . Range-free localization schemesfor large scale sensor networks. In: Proceedingsof the 9th annual international conference on Mobile computing andnetworking. San Diego: ACM, 2003, 81–95
4 Niculescu D, Nath B . DV based positioning in adhoc networks. Journal of TelecommunicationSystems, 2003, 22(1–4): 267–280.
doi:10.1023/A:1023403323460
5 Nagpal R, et al.. Organizing a global coordinate system from local information on anad hoc sensor network. In: Proceedingsof 2nd International Workshop on IPSN. Berlin: Springer, 2003, 333–348
6 Doherty L, Pister K . Convex position estimationin wireless sensor networks. In: Proceedingsof 20th Annual Joint Conference of the IEEE Computer and CommunicationsSocieties. Anchorage, AK, USA: IEEE, 2001, 1655–1663
7 Bahl P, Padmanabhan V N . RADAR: an in-building RF-baseduser location and tracking system. In: Proceedings of 19th Annual Joint Conference of the IEEE Computerand Communications Societies. Tel-Aviv, Israel: IEEE ComputerSociety, 2000, 775–784
8 Niculescu D, NatB h . Ad hoc positioning system(APS) using AOA. In: Proceedings of 22Annual Joint Conference of the IEEE Computer and Communications Societies. San Francisco, CA: IEEE Press, 2003, 1734–1743
9 Lymberopoulos D, Lindsey Q . An Empirical Analysis ofRadio Signal Strength Variability in IEEE 802.15.4 Networks usingMonopole Antennas. ENALAB Technical Report050501. Yale University, 2006
10 Xu W, Wood T, Trappe W, et al.. Channel surfing and spatial retreats: defensesagainst wireless denial of service. In: Proceedings of the ACM workshop on Wireless security. Philadelphia, PA, USA: ACM, 2004, 80–89
11 Hu Y C, Perrig A, Johnson D . Packet leashes: a defense against wormhole attacks inwireless networks. In: 22 Annual JointConference of the IEEE Computer and Communications Societies. San Francisco, CA: IEEE, 2003, 1976–1986
12 Brands S, Chaum D . Distance-bounding protocols. In: Workshop on the theory and application of cryptographictechniques on Advances in cryptology. New York: Springer-Verlag, 1993, 344–359
13 Sastry N, Shankar U, Wagner D . Secure verification of location claims. In: Proceedings of the 2nd ACM workshop on Wireless security. San Diego, CA, USA: ACM, 2003, 1–10
14 Waters B, Felten E . Proving the Location of TamperResistant Devices. Technical Report. Princeton University, 2003
15 C˘apkun S, Buttyăn L, Hubaux J P . SECTOR: Secure tracking of node encounters in multi-hopwireless networks. In: Proceedings of the1st ACM workshop on Security of ad hoc and sensor networks. Fairfax, Virginia: ACM, 2003, 21–32
16 Tao P, Rudys A, Ladd A M, et al.. Wireless lan location-sensing for security applications. In: Proceedings of the ACM Workshop on WirelessSecurity. New York, NY, USA: ACM, 2003, 11–20
17 Li Z, Trappe W, Zhang Y Y, et al.. Robust statistical methods for securing wirelesslocalization in sensor networks. In: Proceedingsof Information Processing in Sensor Networks. Piscataway, NJ, USA: IEEE, 2005, 91–98
18 Gabber E, Wool A . How to prove where you are:tracking the location of customer equipment. In: Proceedings of Conference on Computer and Communications Security. New York, NY, USA: ACM, 1998, 142–149
19 Lazos L, Poovendran R . SeRLoc: Secure range-independentlocalization for wireless sensor networks. In: Proceedings of the 2004 ACM Workshop on Wireless Security. New York, NY, USA: ACM, 2004, 21–30
20 Kuhn M G . An asymmetric security mechanism for navigation signals. In: Proceedings of the Information Hiding Workshop. Berlin: Springer, 2004, 239–252
21 Liu D, Ning P, Du W . Attack-resistant location estimation in sensor networks. In: Proceedings of Information Processing in SensorNetworks. UCLA, Los Angeles, California,USA: IEEE, 2005, 99–106
22 Moore D, Leonard J, Rus D, et al.. Robust distributed network localization withnoisy range measurements. In: Proceedingsof the Second ACM Conference on Embedded Networked Sensor Systems. New York, NY, USA: ACM, 2004, 50–61
23 Przydatek B, Song D, Perrig A . SIA: Secure information aggregation in sensor networks. In: Proceedings of the 1st International Conferenceon Embedded Networked Sensor Systems. New York, NY, USA: ACM, 2003, 255–265
24 Wagner D . Resilientaggregation in sensor networks. In: Proceedingsof the 2nd ACM workshop on Security of ad hoc and sensor networks. New York, NY, USA: ACM, 2004, 78–87
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed