Trusting routers and relays in ad hoc networks

P. Dewan, Partha Dasgupta

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

21 Citations (Scopus)

Abstract

The current generation of ad hoc networks relies on other nodes in the network for routing information and for routing the packets. These networks are based on the fundamental assumption that the nodes will cooperate and not cheat. This assumption becomes invalid when the network nodes have tangential or contradictory goals. A novel method of enhancing routing strategies, and enhancing cooperation is to use "reputations" computed from peer recommendations. Reputation assignment and use cajole cooperation from the nodes in the network even if they do not share the same goal. This paper provides a mechanism that can use reputations in ad hoc network for trusting routers and relays. In addition, it enumerates the issues involved in using reputation in ad hoc networks. The simulations show that the throughput of the network increases by 0% - 71.6% when the neighbor reputations and shortest path are considered, for deciding the next hop. The throughput of the network improves from 3% to 143% when the next hop of the packet is decided using only reputations and ignoring the shortest path. The average hop length is the same irrespective of the fact that reputations are used.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing Workshops
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages351-358
Number of pages8
Volume2003-January
ISBN (Print)0769520189
DOIs
StatePublished - 2003
Event2003 International Conference on Parallel Processing Workshops, ICPPW 2003 - Kaohsiung, Taiwan, Province of China
Duration: Oct 6 2003Oct 9 2003

Other

Other2003 International Conference on Parallel Processing Workshops, ICPPW 2003
CountryTaiwan, Province of China
CityKaohsiung
Period10/6/0310/9/03

Fingerprint

Ad hoc networks
Ad Hoc Networks
Router
Routers
Relay
Throughput
Routing
Vertex of a graph
Shortest path
Reputation
Recommendations
Assignment
Simulation

Keywords

  • Ad hoc networks
  • Adaptive systems
  • Collaborative work
  • Information retrieval
  • Intelligent networks
  • Mobile ad hoc networks
  • Peer to peer computing
  • Relays
  • Routing
  • Throughput

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Dewan, P., & Dasgupta, P. (2003). Trusting routers and relays in ad hoc networks. In Proceedings of the International Conference on Parallel Processing Workshops (Vol. 2003-January, pp. 351-358). [1240389] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPPW.2003.1240389

Trusting routers and relays in ad hoc networks. / Dewan, P.; Dasgupta, Partha.

Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2003-January Institute of Electrical and Electronics Engineers Inc., 2003. p. 351-358 1240389.

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

Dewan, P & Dasgupta, P 2003, Trusting routers and relays in ad hoc networks. in Proceedings of the International Conference on Parallel Processing Workshops. vol. 2003-January, 1240389, Institute of Electrical and Electronics Engineers Inc., pp. 351-358, 2003 International Conference on Parallel Processing Workshops, ICPPW 2003, Kaohsiung, Taiwan, Province of China, 10/6/03. https://doi.org/10.1109/ICPPW.2003.1240389
Dewan P, Dasgupta P. Trusting routers and relays in ad hoc networks. In Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2003-January. Institute of Electrical and Electronics Engineers Inc. 2003. p. 351-358. 1240389 https://doi.org/10.1109/ICPPW.2003.1240389
Dewan, P. ; Dasgupta, Partha. / Trusting routers and relays in ad hoc networks. Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2003-January Institute of Electrical and Electronics Engineers Inc., 2003. pp. 351-358
@inproceedings{33119cb726cf4eb298fe4fe7282242e6,
title = "Trusting routers and relays in ad hoc networks",
abstract = "The current generation of ad hoc networks relies on other nodes in the network for routing information and for routing the packets. These networks are based on the fundamental assumption that the nodes will cooperate and not cheat. This assumption becomes invalid when the network nodes have tangential or contradictory goals. A novel method of enhancing routing strategies, and enhancing cooperation is to use {"}reputations{"} computed from peer recommendations. Reputation assignment and use cajole cooperation from the nodes in the network even if they do not share the same goal. This paper provides a mechanism that can use reputations in ad hoc network for trusting routers and relays. In addition, it enumerates the issues involved in using reputation in ad hoc networks. The simulations show that the throughput of the network increases by 0{\%} - 71.6{\%} when the neighbor reputations and shortest path are considered, for deciding the next hop. The throughput of the network improves from 3{\%} to 143{\%} when the next hop of the packet is decided using only reputations and ignoring the shortest path. The average hop length is the same irrespective of the fact that reputations are used.",
keywords = "Ad hoc networks, Adaptive systems, Collaborative work, Information retrieval, Intelligent networks, Mobile ad hoc networks, Peer to peer computing, Relays, Routing, Throughput",
author = "P. Dewan and Partha Dasgupta",
year = "2003",
doi = "10.1109/ICPPW.2003.1240389",
language = "English (US)",
isbn = "0769520189",
volume = "2003-January",
pages = "351--358",
booktitle = "Proceedings of the International Conference on Parallel Processing Workshops",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Trusting routers and relays in ad hoc networks

AU - Dewan, P.

AU - Dasgupta, Partha

PY - 2003

Y1 - 2003

N2 - The current generation of ad hoc networks relies on other nodes in the network for routing information and for routing the packets. These networks are based on the fundamental assumption that the nodes will cooperate and not cheat. This assumption becomes invalid when the network nodes have tangential or contradictory goals. A novel method of enhancing routing strategies, and enhancing cooperation is to use "reputations" computed from peer recommendations. Reputation assignment and use cajole cooperation from the nodes in the network even if they do not share the same goal. This paper provides a mechanism that can use reputations in ad hoc network for trusting routers and relays. In addition, it enumerates the issues involved in using reputation in ad hoc networks. The simulations show that the throughput of the network increases by 0% - 71.6% when the neighbor reputations and shortest path are considered, for deciding the next hop. The throughput of the network improves from 3% to 143% when the next hop of the packet is decided using only reputations and ignoring the shortest path. The average hop length is the same irrespective of the fact that reputations are used.

AB - The current generation of ad hoc networks relies on other nodes in the network for routing information and for routing the packets. These networks are based on the fundamental assumption that the nodes will cooperate and not cheat. This assumption becomes invalid when the network nodes have tangential or contradictory goals. A novel method of enhancing routing strategies, and enhancing cooperation is to use "reputations" computed from peer recommendations. Reputation assignment and use cajole cooperation from the nodes in the network even if they do not share the same goal. This paper provides a mechanism that can use reputations in ad hoc network for trusting routers and relays. In addition, it enumerates the issues involved in using reputation in ad hoc networks. The simulations show that the throughput of the network increases by 0% - 71.6% when the neighbor reputations and shortest path are considered, for deciding the next hop. The throughput of the network improves from 3% to 143% when the next hop of the packet is decided using only reputations and ignoring the shortest path. The average hop length is the same irrespective of the fact that reputations are used.

KW - Ad hoc networks

KW - Adaptive systems

KW - Collaborative work

KW - Information retrieval

KW - Intelligent networks

KW - Mobile ad hoc networks

KW - Peer to peer computing

KW - Relays

KW - Routing

KW - Throughput

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

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

U2 - 10.1109/ICPPW.2003.1240389

DO - 10.1109/ICPPW.2003.1240389

M3 - Conference contribution

AN - SCOPUS:84943243737

SN - 0769520189

VL - 2003-January

SP - 351

EP - 358

BT - Proceedings of the International Conference on Parallel Processing Workshops

PB - Institute of Electrical and Electronics Engineers Inc.

ER -