Efficient Certification Path Discovery for MANET
<p/> <p>A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitioning, and wireless connections. These properties make traditional wireline security solutions not str...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2010-01-01
|
Series: | EURASIP Journal on Wireless Communications and Networking |
Online Access: | http://jwcn.eurasipjournals.com/content/2010/243985 |
id |
doaj-c341af48ddb544f59169126a797b2054 |
---|---|
record_format |
Article |
spelling |
doaj-c341af48ddb544f59169126a797b20542020-11-25T01:03:49ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14721687-14992010-01-0120101243985Efficient Certification Path Discovery for MANETKambourakis GeorgiosKonstantinou ElisavetDouma AnastasiaAnagnostopoulos MariosFotiadis Georgios<p/> <p>A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitioning, and wireless connections. These properties make traditional wireline security solutions not straightforwardly applicable in MANETs, and of course, constitute the establishment of a Public Key Infrastructure (PKI) in such networks a cumbersome task. After surveying related work, we propose a novel public key management scheme using the well-known web-of-trust or trust graph model. Our scheme is based on a binary tree formation of the network's nodes. The binary tree structure is proved very effective for building certificate chains between communicating nodes that are multihops away and the cumbersome problem of certificate chain discovery is avoided. We compare our scheme with related work and show that it presents several advantages, especially when a fair balancing between security and performance is desirable. Simulations of the proposed scheme under different scenarios demonstrate that it is effective in terms of tree formation, join and leave occurrences, and certificate chain establishment.</p>http://jwcn.eurasipjournals.com/content/2010/243985 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Kambourakis Georgios Konstantinou Elisavet Douma Anastasia Anagnostopoulos Marios Fotiadis Georgios |
spellingShingle |
Kambourakis Georgios Konstantinou Elisavet Douma Anastasia Anagnostopoulos Marios Fotiadis Georgios Efficient Certification Path Discovery for MANET EURASIP Journal on Wireless Communications and Networking |
author_facet |
Kambourakis Georgios Konstantinou Elisavet Douma Anastasia Anagnostopoulos Marios Fotiadis Georgios |
author_sort |
Kambourakis Georgios |
title |
Efficient Certification Path Discovery for MANET |
title_short |
Efficient Certification Path Discovery for MANET |
title_full |
Efficient Certification Path Discovery for MANET |
title_fullStr |
Efficient Certification Path Discovery for MANET |
title_full_unstemmed |
Efficient Certification Path Discovery for MANET |
title_sort |
efficient certification path discovery for manet |
publisher |
SpringerOpen |
series |
EURASIP Journal on Wireless Communications and Networking |
issn |
1687-1472 1687-1499 |
publishDate |
2010-01-01 |
description |
<p/> <p>A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitioning, and wireless connections. These properties make traditional wireline security solutions not straightforwardly applicable in MANETs, and of course, constitute the establishment of a Public Key Infrastructure (PKI) in such networks a cumbersome task. After surveying related work, we propose a novel public key management scheme using the well-known web-of-trust or trust graph model. Our scheme is based on a binary tree formation of the network's nodes. The binary tree structure is proved very effective for building certificate chains between communicating nodes that are multihops away and the cumbersome problem of certificate chain discovery is avoided. We compare our scheme with related work and show that it presents several advantages, especially when a fair balancing between security and performance is desirable. Simulations of the proposed scheme under different scenarios demonstrate that it is effective in terms of tree formation, join and leave occurrences, and certificate chain establishment.</p> |
url |
http://jwcn.eurasipjournals.com/content/2010/243985 |
work_keys_str_mv |
AT kambourakisgeorgios efficientcertificationpathdiscoveryformanet AT konstantinouelisavet efficientcertificationpathdiscoveryformanet AT doumaanastasia efficientcertificationpathdiscoveryformanet AT anagnostopoulosmarios efficientcertificationpathdiscoveryformanet AT fotiadisgeorgios efficientcertificationpathdiscoveryformanet |
_version_ |
1725199335981842432 |