Secure and robust localization in a wireless ad hoc environment

Satyajayant Misra, Guoliang Xue, Sarvesh Bhardwaj

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

We study the problem of accurate localization of static or mobile nodes in a wireless ad hoc network using the distance estimates of a group of untrusted anchors within the communication range of the nodes. Some of the anchors may be malicious and may independently lie about the distance estimate. The malicious anchors may also collude to lie about the distance estimates. In both cases, accurate node localization may be seriously undermined. We propose a scheme that performs accurate localization of the nodes in the network despite the presence of such malicious anchors. We also show how to identify most of these malicious anchors. In the case where measurements are error free, we derive a critical threshold B for the number of malicious anchors that can be tolerated in the localization process without undermining accuracy. We also show how to correctly localize a node and identify all the malicious anchors in this setting. In the presence of measurement errors, we propose a convex optimization-based localization scheme that can accurately localize a node, as long as the number of malicious anchors in its communication range is no more than B. Simulation results show that our schemes are very effective. When the measurements are error prone and the number of malicious anchors is no more than B, our scheme localizes a node with an error less than 8% and is also able to identify a significant number of malicious anchors. Our schemes guarantee that a true anchor is not identified as malicious.

Original languageEnglish (US)
Pages (from-to)1480-1489
Number of pages10
JournalIEEE Transactions on Vehicular Technology
Volume58
Issue number3
DOIs
StatePublished - 2009

Fingerprint

Anchors
Vertex of a graph
Measurement errors
Estimate
Critical Threshold
Wireless Ad Hoc Networks
Convex Optimization
Measurement Error
Range of data
Convex optimization
Communication
Wireless ad hoc networks
Simulation

Keywords

  • Convex optimization
  • Secure localization
  • Wireless ad hoc network

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Aerospace Engineering
  • Automotive Engineering
  • Computer Networks and Communications
  • Applied Mathematics

Cite this

Secure and robust localization in a wireless ad hoc environment. / Misra, Satyajayant; Xue, Guoliang; Bhardwaj, Sarvesh.

In: IEEE Transactions on Vehicular Technology, Vol. 58, No. 3, 2009, p. 1480-1489.

Research output: Contribution to journalArticle

Misra, Satyajayant ; Xue, Guoliang ; Bhardwaj, Sarvesh. / Secure and robust localization in a wireless ad hoc environment. In: IEEE Transactions on Vehicular Technology. 2009 ; Vol. 58, No. 3. pp. 1480-1489.
@article{973ce9ecaaff44c1bc47f0a1e409af10,
title = "Secure and robust localization in a wireless ad hoc environment",
abstract = "We study the problem of accurate localization of static or mobile nodes in a wireless ad hoc network using the distance estimates of a group of untrusted anchors within the communication range of the nodes. Some of the anchors may be malicious and may independently lie about the distance estimate. The malicious anchors may also collude to lie about the distance estimates. In both cases, accurate node localization may be seriously undermined. We propose a scheme that performs accurate localization of the nodes in the network despite the presence of such malicious anchors. We also show how to identify most of these malicious anchors. In the case where measurements are error free, we derive a critical threshold B for the number of malicious anchors that can be tolerated in the localization process without undermining accuracy. We also show how to correctly localize a node and identify all the malicious anchors in this setting. In the presence of measurement errors, we propose a convex optimization-based localization scheme that can accurately localize a node, as long as the number of malicious anchors in its communication range is no more than B. Simulation results show that our schemes are very effective. When the measurements are error prone and the number of malicious anchors is no more than B, our scheme localizes a node with an error less than 8{\%} and is also able to identify a significant number of malicious anchors. Our schemes guarantee that a true anchor is not identified as malicious.",
keywords = "Convex optimization, Secure localization, Wireless ad hoc network",
author = "Satyajayant Misra and Guoliang Xue and Sarvesh Bhardwaj",
year = "2009",
doi = "10.1109/TVT.2008.926616",
language = "English (US)",
volume = "58",
pages = "1480--1489",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Secure and robust localization in a wireless ad hoc environment

AU - Misra, Satyajayant

AU - Xue, Guoliang

AU - Bhardwaj, Sarvesh

PY - 2009

Y1 - 2009

N2 - We study the problem of accurate localization of static or mobile nodes in a wireless ad hoc network using the distance estimates of a group of untrusted anchors within the communication range of the nodes. Some of the anchors may be malicious and may independently lie about the distance estimate. The malicious anchors may also collude to lie about the distance estimates. In both cases, accurate node localization may be seriously undermined. We propose a scheme that performs accurate localization of the nodes in the network despite the presence of such malicious anchors. We also show how to identify most of these malicious anchors. In the case where measurements are error free, we derive a critical threshold B for the number of malicious anchors that can be tolerated in the localization process without undermining accuracy. We also show how to correctly localize a node and identify all the malicious anchors in this setting. In the presence of measurement errors, we propose a convex optimization-based localization scheme that can accurately localize a node, as long as the number of malicious anchors in its communication range is no more than B. Simulation results show that our schemes are very effective. When the measurements are error prone and the number of malicious anchors is no more than B, our scheme localizes a node with an error less than 8% and is also able to identify a significant number of malicious anchors. Our schemes guarantee that a true anchor is not identified as malicious.

AB - We study the problem of accurate localization of static or mobile nodes in a wireless ad hoc network using the distance estimates of a group of untrusted anchors within the communication range of the nodes. Some of the anchors may be malicious and may independently lie about the distance estimate. The malicious anchors may also collude to lie about the distance estimates. In both cases, accurate node localization may be seriously undermined. We propose a scheme that performs accurate localization of the nodes in the network despite the presence of such malicious anchors. We also show how to identify most of these malicious anchors. In the case where measurements are error free, we derive a critical threshold B for the number of malicious anchors that can be tolerated in the localization process without undermining accuracy. We also show how to correctly localize a node and identify all the malicious anchors in this setting. In the presence of measurement errors, we propose a convex optimization-based localization scheme that can accurately localize a node, as long as the number of malicious anchors in its communication range is no more than B. Simulation results show that our schemes are very effective. When the measurements are error prone and the number of malicious anchors is no more than B, our scheme localizes a node with an error less than 8% and is also able to identify a significant number of malicious anchors. Our schemes guarantee that a true anchor is not identified as malicious.

KW - Convex optimization

KW - Secure localization

KW - Wireless ad hoc network

UR - http://www.scopus.com/inward/record.url?scp=64049093544&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=64049093544&partnerID=8YFLogxK

U2 - 10.1109/TVT.2008.926616

DO - 10.1109/TVT.2008.926616

M3 - Article

AN - SCOPUS:64049093544

VL - 58

SP - 1480

EP - 1489

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 3

ER -