Adding Reputation Extensions to AODV-UU

Laurent Guillaume; Julien Van de Sype; Laurent Schumacher; Giovanni Di Stasi; Roberto Canonico

doi:10.1109/SCVT.2010.5720459

Adding Reputation Extensions to AODV-UU

Laurent Guillaume, Julien Van de Sype, Laurent Schumacher, Giovanni Di Stasi, Roberto Canonico

Faculty of Computer Science

Research output: Contribution in Book/Catalog/Report/Conference proceeding › Conference contribution

Abstract

To tackle an inherent security weakness of wireless procedure onto the routing protocol Ad-hoc On-demand Distance Vector routing (AODV). This procedure relies on the overal cooperation of nodes taking part to the Wireless Mesh Network. Each node associates a reputation value to its neighbours, which reflects the trust it puts in them. Based on that reputation value, the hop count is increased or decreased, depending whether the intermediate node is trusted or not. This mechanism enables to select the most trustworthy paths in the mesh. We present preliminary experimental results obtained with our implementation.

Original language	English
Title of host publication	17th IEEE Symposium on Communications and Vehicular Technology in the Benelux
Subtitle of host publication	SCVT2010 - Novemer 24-25,2010
Publisher	IEEE
ISBN (Electronic)	978-1-4244-8489-8, 978-1-4244-8487-4
ISBN (Print)	978-1-4244-8488-1
DOIs	https://doi.org/10.1109/SCVT.2010.5720459
Publication status	Published - 2010

Publication series

Name	IEEE Symposium on Communications and Vehicular Technology in the Benelux
ISSN (Print)	2373-0854
ISSN (Electronic)	2689-7709

Access to Document

10.1109/SCVT.2010.5720459

Cite this

@inproceedings{bc52284593a54da38a8136e345a06517,

title = "Adding Reputation Extensions to AODV-UU",

abstract = "To tackle an inherent security weakness of wireless procedure onto the routing protocol Ad-hoc On-demand Distance Vector routing (AODV). This procedure relies on the overal cooperation of nodes taking part to the Wireless Mesh Network. Each node associates a reputation value to its neighbours, which reflects the trust it puts in them. Based on that reputation value, the hop count is increased or decreased, depending whether the intermediate node is trusted or not. This mechanism enables to select the most trustworthy paths in the mesh. We present preliminary experimental results obtained with our implementation.",

author = "Laurent Guillaume and {Van de Sype}, Julien and Laurent Schumacher and {Di Stasi}, Giovanni and Roberto Canonico",

year = "2010",

doi = "10.1109/SCVT.2010.5720459",

language = "English",

isbn = "978-1-4244-8488-1",

series = "IEEE Symposium on Communications and Vehicular Technology in the Benelux ",

publisher = "IEEE",

booktitle = "17th IEEE Symposium on Communications and Vehicular Technology in the Benelux",

}

Adding Reputation Extensions to AODV-UU. / Guillaume, Laurent; Van de Sype, Julien; Schumacher, Laurent et al.
17th IEEE Symposium on Communications and Vehicular Technology in the Benelux: SCVT2010 - Novemer 24-25,2010. IEEE, 2010. (IEEE Symposium on Communications and Vehicular Technology in the Benelux ).

Research output: Contribution in Book/Catalog/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Adding Reputation Extensions to AODV-UU

AU - Guillaume, Laurent

AU - Van de Sype, Julien

AU - Schumacher, Laurent

AU - Di Stasi, Giovanni

AU - Canonico, Roberto

PY - 2010

Y1 - 2010

N2 - To tackle an inherent security weakness of wireless procedure onto the routing protocol Ad-hoc On-demand Distance Vector routing (AODV). This procedure relies on the overal cooperation of nodes taking part to the Wireless Mesh Network. Each node associates a reputation value to its neighbours, which reflects the trust it puts in them. Based on that reputation value, the hop count is increased or decreased, depending whether the intermediate node is trusted or not. This mechanism enables to select the most trustworthy paths in the mesh. We present preliminary experimental results obtained with our implementation.

AB - To tackle an inherent security weakness of wireless procedure onto the routing protocol Ad-hoc On-demand Distance Vector routing (AODV). This procedure relies on the overal cooperation of nodes taking part to the Wireless Mesh Network. Each node associates a reputation value to its neighbours, which reflects the trust it puts in them. Based on that reputation value, the hop count is increased or decreased, depending whether the intermediate node is trusted or not. This mechanism enables to select the most trustworthy paths in the mesh. We present preliminary experimental results obtained with our implementation.

U2 - 10.1109/SCVT.2010.5720459

DO - 10.1109/SCVT.2010.5720459

M3 - Conference contribution

SN - 978-1-4244-8488-1

T3 - IEEE Symposium on Communications and Vehicular Technology in the Benelux

BT - 17th IEEE Symposium on Communications and Vehicular Technology in the Benelux

PB - IEEE

ER -

Adding Reputation Extensions to AODV-UU

Abstract

Publication series

Access to Document

Fingerprint

Cite this