FORBID: Cope with Byzantine behaviors in wireless multi-path routing and forwarding

Xueyuan Su; Gang Peng; Sammy Chan

doi:10.1109/GLOCOM.2011.6133892

FORBID: Cope with Byzantine behaviors in wireless multi-path routing and forwarding

Xueyuan Su, Gang Peng, Sammy Chan

Department of Electrical Engineering

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

6 Citations (Scopus)

Abstract

Consider multi-path routing and forwarding scenarios in wireless ad hoc networks. Rational and Byzantine nodes both might deviate from the protocol. However, their intentions and behaviors are different. To extend our previous work on generalized second price (GSP) auction for stimulating rational nodes for cooperation, we propose FORBID mechanism in this work to cope with Byzantine behaviors. The core of the FORBID mechanism is a decentralized reputation system. Based on available evidence, each node relies on Bayesian inference to internally update its reputation beliefs that how reliable each other node is. Different from the passive overhearing techniques such as ''watchdog'', each source node under FORBID actively triggers detection process to collect evidence towards Byzantine behaviors. In addition, FORBID includes a flocking algorithm to allow careful dissemination of reputation information and thus shortens the misbehavior detection time. © 2011 IEEE.

Original language	English
Title of host publication	GLOBECOM - IEEE Global Telecommunications Conference
DOIs	https://doi.org/10.1109/GLOCOM.2011.6133892
Publication status	Published - 2011
Event	54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States Duration: 5 Dec 2011 → 9 Dec 2011

Conference

Conference	54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Place	United States
City	Houston, TX
Period	5/12/11 → 9/12/11

Research Keywords

Bayesian inference
flocking algorithm
multi-path routing and forwarding
Wireless ad hoc networks

Access Output

10.1109/GLOCOM.2011.6133892

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{af32f1a250d94b67a1698d963982fb25,

title = "FORBID: Cope with Byzantine behaviors in wireless multi-path routing and forwarding",

abstract = "Consider multi-path routing and forwarding scenarios in wireless ad hoc networks. Rational and Byzantine nodes both might deviate from the protocol. However, their intentions and behaviors are different. To extend our previous work on generalized second price (GSP) auction for stimulating rational nodes for cooperation, we propose FORBID mechanism in this work to cope with Byzantine behaviors. The core of the FORBID mechanism is a decentralized reputation system. Based on available evidence, each node relies on Bayesian inference to internally update its reputation beliefs that how reliable each other node is. Different from the passive overhearing techniques such as ''watchdog'', each source node under FORBID actively triggers detection process to collect evidence towards Byzantine behaviors. In addition, FORBID includes a flocking algorithm to allow careful dissemination of reputation information and thus shortens the misbehavior detection time. {\textcopyright} 2011 IEEE.",

keywords = "Bayesian inference, flocking algorithm, multi-path routing and forwarding, Wireless ad hoc networks",

author = "Xueyuan Su and Gang Peng and Sammy Chan",

year = "2011",

doi = "10.1109/GLOCOM.2011.6133892",

language = "English",

isbn = "9781424492688",

booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

note = "54th Annual IEEE Global Telecommunications Conference: {"}Energizing Global Communications{"}, GLOBECOM 2011 ; Conference date: 05-12-2011 Through 09-12-2011",

}

TY - GEN

T1 - FORBID

T2 - 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011

AU - Su, Xueyuan

AU - Peng, Gang

AU - Chan, Sammy

PY - 2011

Y1 - 2011

N2 - Consider multi-path routing and forwarding scenarios in wireless ad hoc networks. Rational and Byzantine nodes both might deviate from the protocol. However, their intentions and behaviors are different. To extend our previous work on generalized second price (GSP) auction for stimulating rational nodes for cooperation, we propose FORBID mechanism in this work to cope with Byzantine behaviors. The core of the FORBID mechanism is a decentralized reputation system. Based on available evidence, each node relies on Bayesian inference to internally update its reputation beliefs that how reliable each other node is. Different from the passive overhearing techniques such as ''watchdog'', each source node under FORBID actively triggers detection process to collect evidence towards Byzantine behaviors. In addition, FORBID includes a flocking algorithm to allow careful dissemination of reputation information and thus shortens the misbehavior detection time. © 2011 IEEE.

AB - Consider multi-path routing and forwarding scenarios in wireless ad hoc networks. Rational and Byzantine nodes both might deviate from the protocol. However, their intentions and behaviors are different. To extend our previous work on generalized second price (GSP) auction for stimulating rational nodes for cooperation, we propose FORBID mechanism in this work to cope with Byzantine behaviors. The core of the FORBID mechanism is a decentralized reputation system. Based on available evidence, each node relies on Bayesian inference to internally update its reputation beliefs that how reliable each other node is. Different from the passive overhearing techniques such as ''watchdog'', each source node under FORBID actively triggers detection process to collect evidence towards Byzantine behaviors. In addition, FORBID includes a flocking algorithm to allow careful dissemination of reputation information and thus shortens the misbehavior detection time. © 2011 IEEE.

KW - Bayesian inference

KW - flocking algorithm

KW - multi-path routing and forwarding

KW - Wireless ad hoc networks

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

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84857214330&origin=recordpage

U2 - 10.1109/GLOCOM.2011.6133892

DO - 10.1109/GLOCOM.2011.6133892

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781424492688

BT - GLOBECOM - IEEE Global Telecommunications Conference

Y2 - 5 December 2011 through 9 December 2011

ER -

FORBID: Cope with Byzantine behaviors in wireless multi-path routing and forwarding

Abstract

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this