MSN: Mutual secure neighbor verification in multi-hop wireless networks

Issa Khalil, M. Awad, S. Bouktif, F. Awwad

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In a wireless network, mutual secure neighbor verification (MSN) is defined as the capability of a node (verifier) to verify the claim by another node (claimer) that it exists within a certain physical distance from the verifier. This problem has received great attention because it has numerous practical applications. Current state-of-the-art approaches to solve this problem, such as the use of time of flight, signal strength, and angle of arrival, suffer from impracticality in terms of application and computation cost. In this work, we propose two algorithms to mitigate the MSN problem during the incremental deployment phase of static senor networks. Each node should announce its location and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. The simulation results show that we can achieve high detection (>90%) of nodes that forge their location information using either high power transmission or by colluding with other malicious nodes.

Original languageEnglish
Pages (from-to)186-196
Number of pages11
JournalSecurity and Communication Networks
Volume5
Issue number2
DOIs
Publication statusPublished - 1 Feb 2012
Externally publishedYes

Fingerprint

Wireless networks
Power transmission
Base stations
Costs

Keywords

  • Location determination
  • Location verification
  • Multi-hop wireless networks
  • Security

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

MSN : Mutual secure neighbor verification in multi-hop wireless networks. / Khalil, Issa; Awad, M.; Bouktif, S.; Awwad, F.

In: Security and Communication Networks, Vol. 5, No. 2, 01.02.2012, p. 186-196.

Research output: Contribution to journalArticle

Khalil, Issa ; Awad, M. ; Bouktif, S. ; Awwad, F. / MSN : Mutual secure neighbor verification in multi-hop wireless networks. In: Security and Communication Networks. 2012 ; Vol. 5, No. 2. pp. 186-196.
@article{a1e2c07e36cf445d937b9c3fd61d77e6,
title = "MSN: Mutual secure neighbor verification in multi-hop wireless networks",
abstract = "In a wireless network, mutual secure neighbor verification (MSN) is defined as the capability of a node (verifier) to verify the claim by another node (claimer) that it exists within a certain physical distance from the verifier. This problem has received great attention because it has numerous practical applications. Current state-of-the-art approaches to solve this problem, such as the use of time of flight, signal strength, and angle of arrival, suffer from impracticality in terms of application and computation cost. In this work, we propose two algorithms to mitigate the MSN problem during the incremental deployment phase of static senor networks. Each node should announce its location and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. The simulation results show that we can achieve high detection (>90{\%}) of nodes that forge their location information using either high power transmission or by colluding with other malicious nodes.",
keywords = "Location determination, Location verification, Multi-hop wireless networks, Security",
author = "Issa Khalil and M. Awad and S. Bouktif and F. Awwad",
year = "2012",
month = "2",
day = "1",
doi = "10.1002/sec.304",
language = "English",
volume = "5",
pages = "186--196",
journal = "Security and Communication Networks",
issn = "1939-0122",
publisher = "John Wiley and Sons Inc.",
number = "2",

}

TY - JOUR

T1 - MSN

T2 - Mutual secure neighbor verification in multi-hop wireless networks

AU - Khalil, Issa

AU - Awad, M.

AU - Bouktif, S.

AU - Awwad, F.

PY - 2012/2/1

Y1 - 2012/2/1

N2 - In a wireless network, mutual secure neighbor verification (MSN) is defined as the capability of a node (verifier) to verify the claim by another node (claimer) that it exists within a certain physical distance from the verifier. This problem has received great attention because it has numerous practical applications. Current state-of-the-art approaches to solve this problem, such as the use of time of flight, signal strength, and angle of arrival, suffer from impracticality in terms of application and computation cost. In this work, we propose two algorithms to mitigate the MSN problem during the incremental deployment phase of static senor networks. Each node should announce its location and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. The simulation results show that we can achieve high detection (>90%) of nodes that forge their location information using either high power transmission or by colluding with other malicious nodes.

AB - In a wireless network, mutual secure neighbor verification (MSN) is defined as the capability of a node (verifier) to verify the claim by another node (claimer) that it exists within a certain physical distance from the verifier. This problem has received great attention because it has numerous practical applications. Current state-of-the-art approaches to solve this problem, such as the use of time of flight, signal strength, and angle of arrival, suffer from impracticality in terms of application and computation cost. In this work, we propose two algorithms to mitigate the MSN problem during the incremental deployment phase of static senor networks. Each node should announce its location and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. The simulation results show that we can achieve high detection (>90%) of nodes that forge their location information using either high power transmission or by colluding with other malicious nodes.

KW - Location determination

KW - Location verification

KW - Multi-hop wireless networks

KW - Security

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

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

U2 - 10.1002/sec.304

DO - 10.1002/sec.304

M3 - Article

AN - SCOPUS:84856281729

VL - 5

SP - 186

EP - 196

JO - Security and Communication Networks

JF - Security and Communication Networks

SN - 1939-0122

IS - 2

ER -