On using reputations in ad hoc networks to counter malicious nodes

Prashant Dewan, Partha Dasgupta, Amiya Bhattacharya

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

55 Citations (Scopus)

Abstract

Nodes in mobile ad hoc networks have a limited transmission range. Hence the nodes expect their neighbors to relay packets meant for far off destinations. These networks are based on the fundamental assumption that if a node promises to relay a packet, it will relay it and will not cheat. This assumption becomes invalid when the nodes in the network have tangential or contradictory goals. The reputations of the nodes, based on their past history of relaying packets, can be used by their neighbors to ensure that the packet will be relayed by the node. This paper introduces a reputation scheme for ad hoc networks. Instead of choosing the shortest path to the destination, the source node chooses a path whose next hop node has the highest reputation. This policy, when used recursively, in the presence of 40% malicious nodes, improves the throughput of the system to 65%, from 22% throughput provided by AODV. This improvement is obtained at the cost of a higher number of route discoveries with a minimal increase in the average hop length.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
EditorsN.F. Tzeng
Pages665-672
Number of pages8
Volume10
DOIs
StatePublished - 2004
EventProceedings - Tenth International Conference on Parallel and Distributed Systems (ICPADS 2004) - Newport Beach, CA, United States
Duration: Jul 7 2004Jul 9 2004

Other

OtherProceedings - Tenth International Conference on Parallel and Distributed Systems (ICPADS 2004)
CountryUnited States
CityNewport Beach, CA
Period7/7/047/9/04

Fingerprint

Ad hoc networks
Throughput
Mobile ad hoc networks

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Dewan, P., Dasgupta, P., & Bhattacharya, A. (2004). On using reputations in ad hoc networks to counter malicious nodes. In N. F. Tzeng (Ed.), Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS (Vol. 10, pp. 665-672) https://doi.org/10.1109/ICPADS.2004.1316153

On using reputations in ad hoc networks to counter malicious nodes. / Dewan, Prashant; Dasgupta, Partha; Bhattacharya, Amiya.

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. ed. / N.F. Tzeng. Vol. 10 2004. p. 665-672.

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

Dewan, P, Dasgupta, P & Bhattacharya, A 2004, On using reputations in ad hoc networks to counter malicious nodes. in NF Tzeng (ed.), Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. vol. 10, pp. 665-672, Proceedings - Tenth International Conference on Parallel and Distributed Systems (ICPADS 2004), Newport Beach, CA, United States, 7/7/04. https://doi.org/10.1109/ICPADS.2004.1316153
Dewan P, Dasgupta P, Bhattacharya A. On using reputations in ad hoc networks to counter malicious nodes. In Tzeng NF, editor, Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. Vol. 10. 2004. p. 665-672 https://doi.org/10.1109/ICPADS.2004.1316153
Dewan, Prashant ; Dasgupta, Partha ; Bhattacharya, Amiya. / On using reputations in ad hoc networks to counter malicious nodes. Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. editor / N.F. Tzeng. Vol. 10 2004. pp. 665-672
@inproceedings{0ab682c2815a4b5787f6493f7110592a,
title = "On using reputations in ad hoc networks to counter malicious nodes",
abstract = "Nodes in mobile ad hoc networks have a limited transmission range. Hence the nodes expect their neighbors to relay packets meant for far off destinations. These networks are based on the fundamental assumption that if a node promises to relay a packet, it will relay it and will not cheat. This assumption becomes invalid when the nodes in the network have tangential or contradictory goals. The reputations of the nodes, based on their past history of relaying packets, can be used by their neighbors to ensure that the packet will be relayed by the node. This paper introduces a reputation scheme for ad hoc networks. Instead of choosing the shortest path to the destination, the source node chooses a path whose next hop node has the highest reputation. This policy, when used recursively, in the presence of 40{\%} malicious nodes, improves the throughput of the system to 65{\%}, from 22{\%} throughput provided by AODV. This improvement is obtained at the cost of a higher number of route discoveries with a minimal increase in the average hop length.",
author = "Prashant Dewan and Partha Dasgupta and Amiya Bhattacharya",
year = "2004",
doi = "10.1109/ICPADS.2004.1316153",
language = "English (US)",
volume = "10",
pages = "665--672",
editor = "N.F. Tzeng",
booktitle = "Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS",

}

TY - GEN

T1 - On using reputations in ad hoc networks to counter malicious nodes

AU - Dewan, Prashant

AU - Dasgupta, Partha

AU - Bhattacharya, Amiya

PY - 2004

Y1 - 2004

N2 - Nodes in mobile ad hoc networks have a limited transmission range. Hence the nodes expect their neighbors to relay packets meant for far off destinations. These networks are based on the fundamental assumption that if a node promises to relay a packet, it will relay it and will not cheat. This assumption becomes invalid when the nodes in the network have tangential or contradictory goals. The reputations of the nodes, based on their past history of relaying packets, can be used by their neighbors to ensure that the packet will be relayed by the node. This paper introduces a reputation scheme for ad hoc networks. Instead of choosing the shortest path to the destination, the source node chooses a path whose next hop node has the highest reputation. This policy, when used recursively, in the presence of 40% malicious nodes, improves the throughput of the system to 65%, from 22% throughput provided by AODV. This improvement is obtained at the cost of a higher number of route discoveries with a minimal increase in the average hop length.

AB - Nodes in mobile ad hoc networks have a limited transmission range. Hence the nodes expect their neighbors to relay packets meant for far off destinations. These networks are based on the fundamental assumption that if a node promises to relay a packet, it will relay it and will not cheat. This assumption becomes invalid when the nodes in the network have tangential or contradictory goals. The reputations of the nodes, based on their past history of relaying packets, can be used by their neighbors to ensure that the packet will be relayed by the node. This paper introduces a reputation scheme for ad hoc networks. Instead of choosing the shortest path to the destination, the source node chooses a path whose next hop node has the highest reputation. This policy, when used recursively, in the presence of 40% malicious nodes, improves the throughput of the system to 65%, from 22% throughput provided by AODV. This improvement is obtained at the cost of a higher number of route discoveries with a minimal increase in the average hop length.

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

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

U2 - 10.1109/ICPADS.2004.1316153

DO - 10.1109/ICPADS.2004.1316153

M3 - Conference contribution

AN - SCOPUS:4544226115

VL - 10

SP - 665

EP - 672

BT - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

A2 - Tzeng, N.F.

ER -