Loukas Lazos
Radha Poovendran
ABSTRACT
In many applications of wireless sensor networks (WSN), sensors are deployed un-tethered in hostile environments. For location-aware WSN applications, it is essential to ensure that sensors can determine their location, even in the presence of malicious adversaries. In this paper we address the problem of enabling sensors of WSN to determine their location in an un-trusted environment. Since localization schemes based on distance estimation are expensive for the resource constrained sensors, we propose a range-independent localization algorithm called SeRLoc. SeRLoc is distributed algorithm and does not require any communication among sensors. In addition, we show that SeRLoc is robust against severe WSN attacks, such as the wormhole attack, the sybil attack and compromised sensors. To the best of our knowledge, ours is the first work that provides a security-aware range-independent localization scheme for WSN. We present a threat analysis and comparison of the performance of SeRLoc with state-of-the-art range-independent localization schemes.
- Y. Ko and N. Vaidya, Location-Aided Routing (LAR) in Mobile Adhoc Networks, In Proc. of MOBICOM 1998, Dallas, TX, USA, October 1998.]] Google Scholar
Digital Library
- S. Basagni, I. Chlamtac, V. Syrotiuk, and B. Woodward, A Distance Routing Effect Algorithm for Mobility (DREAM), In Proc. of MOBICOM 1998, Dallas, TX, USA, October 1998.]] Google ScholarDigital Library
- Y. Hu, A. Perrig, and D. Johnson, Packet Leashes: A Defense Against Wormhole Attacks in Wireless Ad Hoc Networks, In Proc. of INFOCOM 2003, San Francisco, CA, USA, April 2003.]]Google ScholarCross Ref
- D. Liu, P. Ning, Location-based pairwise key establishments for static sensor networks, In Proc. of SASN 2003, Fairfax, VA, October 2003.]] Google ScholarDigital Library
- L. Lazos and R. Poovendran, Energy-Aware Secure Multicast Communication in Ad-hoc Networks Using Geographic Location Information, In Proc. of IEEE ICASSP 2003, Hong Kong, China, April 2003.]]Google ScholarCross Ref
- T. He, C. Huang, B. Blum, J. Stankovic and T. Abdelzaher, Range-Free Localization Schemes in Large Scale Sensor Network, In Proc. of MOBICOM 2003, San Diego, CA, USA, September 2003.]] Google ScholarDigital Library
- R. Nagpal, H. Shrobe, J. Bachrach, Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network, In Proc. of IPSN 2003, Palo Alto, USA, April, 2003.]] Google ScholarDigital Library
- N. Bulusu, J. Heidemann and D. Estrin, GPS-less Low Cost Outdoor Localization for Very Small Devices, In IEEE Personal Communications Magazine, 7(5):28-34, October 2000.]]Google Scholar
- D. Nicolescu and B. Nath, Ad-Hoc Positioning Systems (APS), In Proc. of IEEE GLOBECOM 2001, San Antonio, TX, USA, November 2001.]]Google ScholarCross Ref
- D. Niculescu and B. Nath, Ad Hoc Positioning System (APS) using AoA, In Proc. of INFOCOM 2003, San Francisco, CA, USA, March 2003.]]Google ScholarCross Ref
- A. Savvides, C. Han and M. Srivastava, Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors, In Proc. of MOBICOM 2001, Rome, Italy, July 2001.]] Google ScholarDigital Library
- P. Bahl and V. Padmanabhan, RADAR: An In-Building RF-Based User Location and Tracking System, In Proc. of the IEEE INFOCOM 2000, Tel-Aviv, Israel, March 2000.]]Google ScholarCross Ref
- N. Priyantha, A. Chakraborthy and H. Balakrishnan, The Cricket Location-Support System, In Proc. of MOBICOM 2000, Boston, MA, USA, August 2000.]] Google ScholarDigital Library
- L. Doherty, L. Ghaoui and K. Pister, Convex Position Estimation in Wireless Sensor Networks, In Proc. of the IEEE INFOCOM 2001, Anchorage, AK, USA, April 2001.]]Google ScholarCross Ref
- S. Čapkun, M. Hamdi and J. Hubaux, GPS-Free Positioning in Mobile Ad-Hoc Networks, In Proc. of HICCSS 2001, Maui, Hawaii, USA, January 2001.]] Google ScholarDigital Library
- Y. Shang, W. Ruml, Y. Zhang and M. Fromherz, Localization from Mere Connectivity, In Proc. of MOBIHOC 2003, Annapolis, MD, USA, June 2003.]] Google ScholarDigital Library
- R. Rivest, The MD5 Message-Digest Algorithm, RFC 1321, April 1992.]] Google ScholarDigital Library
- S. Čapkun, J. Hubaux, Secure Positioning in Sensor Networks, Technical report EPFL/IC/200444, available at, http://www.terminodes.org/micsPublications.php.]]Google Scholar
- S. Čapkun, L. Buttyan, J. Hubaux, SECTOR: Secure Tracking of Node Encounters in Multi-hop Wireless Networks, in Proc. of SASN 2003, Fairfax, Virginia, October 2003.]] Google ScholarDigital Library
- P. Papadimitratos and Z. J. Haas, Secure Routing for Mobile Ad Hoc Networks, in Proc. of CNDS 2002, January 2002.]]Google Scholar
- J. Douceur, The Sybil Attack, In Proc of IPTPS 2002, Cambridge, MA, USA, March 2002.]] Google ScholarDigital Library
- J. Newsome, E. Shi, D. Song and A. Perrig, The Sybil Attack in Sensor Networks: Analysis and Defenses, In Proc, of IPSN 2004, Berkeley, CA, April 2004.]] Google ScholarDigital Library
- B. Waters and E. Felten, Proving the Location of Tamper Resistant Devices, http://www.cs.princeton.edu/bwaters/research/location_proving.ps.]]Google Scholar
- N. Sastry, U. Shankar and D. Wagner, Secure Verification of Location Claims, In Proc. of WISE 2003, San Diego, CA, USA, September 2003.]] Google ScholarDigital Library
- B. Hofmann-Wellenhof, H. Lichtenegger and J. Collins, Global Positioning System: Theory and Practice, Fourth Edition, Springer-Verlag, 1997.]]Google ScholarCross Ref
- N. Cressie, Statistics for Spatial Data, John Wiley & Sons, 1993.]]Google Scholar
- C. Balanis, Antenna Theory, John Wiley & Sons, 1982.]]Google Scholar
- MICA Wireless Measurement System, available at: http://www.xbow.com /Products/Product_pdf_files/Wireless_pdf/MICA.pdf.]]Google Scholar
- R. L. Rivest, The RC5 encryption algorithm, In Proc. of the first Workshop on Fast Software Encryption, pp. 86--96, 1995.]]Google ScholarCross Ref
- D. Stinson, Cryptograhpy: Theory and Practice, 2nd edition, CRC Press, 2002.]] Google ScholarDigital Library
- R. Pickholtz, D. Schilling, and L. Milstein. Theory of Spread Spectrum Communications - A Tutorial, In the IEEE Transactions on Communications, 30(5):855--884, May 1982.]]Google ScholarCross Ref
- S. B. Wicker and M.D. Bartz, Type-II Hybrid-ARQ Protocols Using Punctured MDS Codes, In Proc. of IEEE Transactions on Communications, April 1994.]]Google Scholar
- L. Lamport, Password Authentication with Insecure Communication, In Communications of the ACM, 24(11):770--772, November 1981.]] Google ScholarDigital Library
- D. Coppersmith and M. Jakobsson, Almost optimal hash sequence traversal, In Proc. of the FC 2002, Lecture Notes in Computer Science, IFCA, Springer-Verlag, Berlin Germany, 2002.]] Google ScholarDigital Library
- Y. Hu, D. Johnson and Adrian Perrig, SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks, In Proc. of WMCSA 2002, Calicoon, NY, USA, June 2002.]] Google ScholarDigital Library
- A. Perrig, R. Szewczyk, V. Wen, D. Culler and J. Tygar, SPINS: Security Protocols for Sensor Networks, In Proc of MOBICOM 2001, Rome, Italy, July 2001.]] Google ScholarDigital Library
- Y. Hu, A. Perrig and D. Johnson, Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols, In Proc. of WISE 2003, October 2003.]] Google ScholarDigital Library
- L. Kleinrock and J.Slivester, Optimum transmission radii for packet radio networks or why six is a magic number, In Proc. of the National Telecom Conference, Pages 4.3.1-4.3.5, 1978.]]Google Scholar
- S. Čapkun, J. P. Hubaux, BISS: Building secure routing out of an incomplete set of security associations, In Proc. of WISE 2003, San Diego, CA, September 2003.]] Google ScholarDigital Library
- C. Hu, A. Perrig, D. Johnson, Ariadne: A Secure On Demand Routing Protocol for Ad Hoc Networks, In Proc. of MOBICOM 2002, Atlanta, GA, USA, September 2002.]] Google ScholarDigital Library
Index Terms
- SeRLoc: secure range-independent localization for wireless sensor networks
Recommendations
SeRLoc: Robust localization for wireless sensor networks
Many distributed monitoring applications of Wireless Sensor Networks (WSNs) require the location information of a sensor node. In this article, we address the problem of enabling nodes of Wireless Sensor Networks to determine their location in an ...
Secure localization and location verification in wireless sensor networks: a survey
The locations of sensor nodes are very important to many wireless sensor networks (WSNs). When WSNs are deployed in hostile environments, two issues about sensors' locations need to be considered. First, attackers may attack the localization process to ...
Resilient secure localization and detection of colluding attackers in WSNs
ADHOC-NOW'12: Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless NetworksThere exists extensive work in wireless sensor networks (WSNs) on security measures that guarantee the correctness of the estimation of the position of a node despite attacks from adversaries. But very little work has investigated how colluding ...
Reviews
Stefano Zanero
This paper presents a technique for range-independent (also called "range free") localization of wireless ad hoc sensors that is designed to be robust against subversion. Previous work on the security of localization in a hostile environment considered only range-dependent algorithms. The authors propose their own localization scheme, called SeRLoc, which makes use of symmetric cryptography and hashing to authenticate and encipher the beacon messages. Lazos and Poovendran show that their algorithm is resistant to two classes of known attacks against localization schemes: the wormhole attack and the Sybil attack. For comparison, they show that Dv-hop, Amorphous, and APIT (which are three state-of-the-art range free schemes) are vulnerable to such attacks (which is expected, since these schemes do not claim to offer security features). The authors complete their work by comparing the performance of SeRLoc against these three other schemes (plus Centroid and PIT), in terms of localization error, power consumption, and robustness, with good results. However, they do not compare the results to range-based schemes, or to schemes that require a centralized computation. The paper is interesting, but a comparison between the security characteristics of SeRLoc and the existing secure range-dependent localization schemes would be helpful, in order to evaluate design tradeoffs between these two classes of algorithms. Online Computing Reviews Service
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments