Skip to main navigation Skip to search Skip to main content

Multi-path routing and forwarding in non-cooperative wireless networks

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

Multi-path routing and forwarding in non-cooperative networks is extremely challenging due to the co-existence of both rational and Byzantine nodes. They both might deviate from the protocol; however, their intentions and behaviors are totally different. Rational nodes aim to maximize their utilities, while Byzantine nodes purposefully deviate from the protocol to disrupt the normal operation of a network. Most work in the literature treat both kinds of misbehavior without distinction and thus lead to ineffective solutions. This paper presents a hybrid design that seamlessly integrates mechanisms for different misbehavior in a unified framework. The GSP auction provides incentives for rational nodes to cooperate and results in truth-telling Nash equilibria. With the possible inclusion of Byzantine nodes in the least cost paths selected by GSP, the FORBID mechanism builds a decentralized reputation system such that malicious behavior is effectively detected. This in turn triggers the GSP auction to update the least cost paths so as to exclude the malicious nodes from being selected for communication. It is proved that the unified protocol is cooperation-optimal. Experiments have been conducted to further investigate the performance of the proposed protocol and the impact of various parameters.
Original languageEnglish
Article number6577364
Pages (from-to)2638-2647
JournalIEEE Transactions on Parallel and Distributed Systems
Volume25
Issue number10
DOIs
Publication statusPublished - 1 Oct 2014

Research Keywords

  • Distributed networks
  • mechanism design and analysis
  • non-cooperative networks
  • routing and forwarding

Fingerprint

Dive into the research topics of 'Multi-path routing and forwarding in non-cooperative wireless networks'. Together they form a unique fingerprint.

Cite this