SVNM: Secure verification of neighborhood membership in static multi-hop wireless networks

Issa Khalil, Mohammad Hayajneh, Mamoun Awad

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Secure verification of neighborhood membership (SVNM) is a relatively recently stated problem that has an increasing number of practical applications. The problem can be stated as the capability of a wireless network node (verifier) to verify the claim by another node (claimer) that it exists within a certain physical distance from the verifier. Several physical properties of the received signal are used for onehop location estimation - signal strength, time of flight, and angle of arrival, etc. However, many of these approaches are either not practically applicable or prohibitively expensive in many wireless network scenarios. In this work, we propose algorithms to detect and isolate nodes that lie about their location in the incremental addition phase of static sensor networks. Every node should announce its position and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. Our results show that we can achieve perfect detection (100%) of nodes that falsify their location information using either high power transmission or with the help of other nodes.

Original languageEnglish
Title of host publicationProceedings - IEEE Symposium on Computers and Communications
Pages368-373
Number of pages6
DOIs
Publication statusPublished - 19 Nov 2009
Externally publishedYes
EventIEEE Symposium on Computers and Communications 2009, ISCC 2009 - Sousse, Tunisia
Duration: 5 Jul 20098 Jul 2009

Other

OtherIEEE Symposium on Computers and Communications 2009, ISCC 2009
CountryTunisia
CitySousse
Period5/7/098/7/09

Fingerprint

Multi-hop Wireless Networks
Wireless networks
Vertex of a graph
Wireless Networks
Power transmission
Base stations
Sensor networks
Angle of Arrival
Physical properties
Location Estimation
Time-of-flight
Physical property
High Power
Sensor Networks
Verify
Scenarios

Keywords

  • Location determination
  • Location verification
  • Multihop wireless networks
  • Security

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software
  • Mathematics(all)
  • Signal Processing

Cite this

Khalil, I., Hayajneh, M., & Awad, M. (2009). SVNM: Secure verification of neighborhood membership in static multi-hop wireless networks. In Proceedings - IEEE Symposium on Computers and Communications (pp. 368-373). [5202232] https://doi.org/10.1109/ISCC.2009.5202232

SVNM : Secure verification of neighborhood membership in static multi-hop wireless networks. / Khalil, Issa; Hayajneh, Mohammad; Awad, Mamoun.

Proceedings - IEEE Symposium on Computers and Communications. 2009. p. 368-373 5202232.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khalil, I, Hayajneh, M & Awad, M 2009, SVNM: Secure verification of neighborhood membership in static multi-hop wireless networks. in Proceedings - IEEE Symposium on Computers and Communications., 5202232, pp. 368-373, IEEE Symposium on Computers and Communications 2009, ISCC 2009, Sousse, Tunisia, 5/7/09. https://doi.org/10.1109/ISCC.2009.5202232
Khalil I, Hayajneh M, Awad M. SVNM: Secure verification of neighborhood membership in static multi-hop wireless networks. In Proceedings - IEEE Symposium on Computers and Communications. 2009. p. 368-373. 5202232 https://doi.org/10.1109/ISCC.2009.5202232
Khalil, Issa ; Hayajneh, Mohammad ; Awad, Mamoun. / SVNM : Secure verification of neighborhood membership in static multi-hop wireless networks. Proceedings - IEEE Symposium on Computers and Communications. 2009. pp. 368-373
@inproceedings{a3218c2c852b45329c0eb24d3be8054d,
title = "SVNM: Secure verification of neighborhood membership in static multi-hop wireless networks",
abstract = "Secure verification of neighborhood membership (SVNM) is a relatively recently stated problem that has an increasing number of practical applications. The problem can be stated as the capability of a wireless network node (verifier) to verify the claim by another node (claimer) that it exists within a certain physical distance from the verifier. Several physical properties of the received signal are used for onehop location estimation - signal strength, time of flight, and angle of arrival, etc. However, many of these approaches are either not practically applicable or prohibitively expensive in many wireless network scenarios. In this work, we propose algorithms to detect and isolate nodes that lie about their location in the incremental addition phase of static sensor networks. Every node should announce its position and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. Our results show that we can achieve perfect detection (100{\%}) of nodes that falsify their location information using either high power transmission or with the help of other nodes.",
keywords = "Location determination, Location verification, Multihop wireless networks, Security",
author = "Issa Khalil and Mohammad Hayajneh and Mamoun Awad",
year = "2009",
month = "11",
day = "19",
doi = "10.1109/ISCC.2009.5202232",
language = "English",
isbn = "9781424446711",
pages = "368--373",
booktitle = "Proceedings - IEEE Symposium on Computers and Communications",

}

TY - GEN

T1 - SVNM

T2 - Secure verification of neighborhood membership in static multi-hop wireless networks

AU - Khalil, Issa

AU - Hayajneh, Mohammad

AU - Awad, Mamoun

PY - 2009/11/19

Y1 - 2009/11/19

N2 - Secure verification of neighborhood membership (SVNM) is a relatively recently stated problem that has an increasing number of practical applications. The problem can be stated as the capability of a wireless network node (verifier) to verify the claim by another node (claimer) that it exists within a certain physical distance from the verifier. Several physical properties of the received signal are used for onehop location estimation - signal strength, time of flight, and angle of arrival, etc. However, many of these approaches are either not practically applicable or prohibitively expensive in many wireless network scenarios. In this work, we propose algorithms to detect and isolate nodes that lie about their location in the incremental addition phase of static sensor networks. Every node should announce its position and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. Our results show that we can achieve perfect detection (100%) of nodes that falsify their location information using either high power transmission or with the help of other nodes.

AB - Secure verification of neighborhood membership (SVNM) is a relatively recently stated problem that has an increasing number of practical applications. The problem can be stated as the capability of a wireless network node (verifier) to verify the claim by another node (claimer) that it exists within a certain physical distance from the verifier. Several physical properties of the received signal are used for onehop location estimation - signal strength, time of flight, and angle of arrival, etc. However, many of these approaches are either not practically applicable or prohibitively expensive in many wireless network scenarios. In this work, we propose algorithms to detect and isolate nodes that lie about their location in the incremental addition phase of static sensor networks. Every node should announce its position and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. Our results show that we can achieve perfect detection (100%) of nodes that falsify their location information using either high power transmission or with the help of other nodes.

KW - Location determination

KW - Location verification

KW - Multihop wireless networks

KW - Security

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

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

U2 - 10.1109/ISCC.2009.5202232

DO - 10.1109/ISCC.2009.5202232

M3 - Conference contribution

AN - SCOPUS:70449512359

SN - 9781424446711

SP - 368

EP - 373

BT - Proceedings - IEEE Symposium on Computers and Communications

ER -