Dynamic secure routing game in distributed cognitive radio networks

Quanyan Zhu, Ju Bin Song, Tamer Başar

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

Abstract

In this paper, we propose a dynamic secure routing game framework to effectively combat jamming attacks in distributed cognitive radio networks. We first propose a stochastic multi-stage zero-sum game framework based on the directional exploration of ad hoc on-demand distance vector (AODV) algorithms. The zero-sum game captures the conflicting goals between malicious attackers and honest nodes and considers packet error probability and delay as performance metrics. The game-theoretic routing protocol guarantees a performance level given by the value of the game. Distributed Boltzmann-Gibbs learning is used for an on-line routing algorithm, in which the users do not have the knowledge of the attackers and the utility function. Instead, the users learn the payoffs based on their past observations. We use simulations to illustrate the proposed routing mechanism and compare the algorithm with fictitious-play learning. Unlike typical distributed routing algorithms such as AODV routing, the proposed secure routing algorithm supports a novel recovery of routing path failure against unknown attackers.

Original languageEnglish (US)
Title of host publication2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
DOIs
StatePublished - 2011
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: Dec 5 2011Dec 9 2011

Other

Other54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
CountryUnited States
CityHouston, TX
Period12/5/1112/9/11

Fingerprint

Routing algorithms
Cognitive radio
Jamming
Routing protocols
Parallel algorithms
Recovery

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Zhu, Q., Song, J. B., & Başar, T. (2011). Dynamic secure routing game in distributed cognitive radio networks. In 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011 [6133879] https://doi.org/10.1109/GLOCOM.2011.6133879

Dynamic secure routing game in distributed cognitive radio networks. / Zhu, Quanyan; Song, Ju Bin; Başar, Tamer.

2011 IEEE Global Telecommunications Conference, GLOBECOM 2011. 2011. 6133879.

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

Zhu, Q, Song, JB & Başar, T 2011, Dynamic secure routing game in distributed cognitive radio networks. in 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011., 6133879, 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011, Houston, TX, United States, 12/5/11. https://doi.org/10.1109/GLOCOM.2011.6133879
Zhu Q, Song JB, Başar T. Dynamic secure routing game in distributed cognitive radio networks. In 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011. 2011. 6133879 https://doi.org/10.1109/GLOCOM.2011.6133879
Zhu, Quanyan ; Song, Ju Bin ; Başar, Tamer. / Dynamic secure routing game in distributed cognitive radio networks. 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011. 2011.
@inproceedings{d17843b2adbc45a5aae24f27485d9450,
title = "Dynamic secure routing game in distributed cognitive radio networks",
abstract = "In this paper, we propose a dynamic secure routing game framework to effectively combat jamming attacks in distributed cognitive radio networks. We first propose a stochastic multi-stage zero-sum game framework based on the directional exploration of ad hoc on-demand distance vector (AODV) algorithms. The zero-sum game captures the conflicting goals between malicious attackers and honest nodes and considers packet error probability and delay as performance metrics. The game-theoretic routing protocol guarantees a performance level given by the value of the game. Distributed Boltzmann-Gibbs learning is used for an on-line routing algorithm, in which the users do not have the knowledge of the attackers and the utility function. Instead, the users learn the payoffs based on their past observations. We use simulations to illustrate the proposed routing mechanism and compare the algorithm with fictitious-play learning. Unlike typical distributed routing algorithms such as AODV routing, the proposed secure routing algorithm supports a novel recovery of routing path failure against unknown attackers.",
author = "Quanyan Zhu and Song, {Ju Bin} and Tamer Başar",
year = "2011",
doi = "10.1109/GLOCOM.2011.6133879",
language = "English (US)",
isbn = "9781424492688",
booktitle = "2011 IEEE Global Telecommunications Conference, GLOBECOM 2011",

}

TY - GEN

T1 - Dynamic secure routing game in distributed cognitive radio networks

AU - Zhu, Quanyan

AU - Song, Ju Bin

AU - Başar, Tamer

PY - 2011

Y1 - 2011

N2 - In this paper, we propose a dynamic secure routing game framework to effectively combat jamming attacks in distributed cognitive radio networks. We first propose a stochastic multi-stage zero-sum game framework based on the directional exploration of ad hoc on-demand distance vector (AODV) algorithms. The zero-sum game captures the conflicting goals between malicious attackers and honest nodes and considers packet error probability and delay as performance metrics. The game-theoretic routing protocol guarantees a performance level given by the value of the game. Distributed Boltzmann-Gibbs learning is used for an on-line routing algorithm, in which the users do not have the knowledge of the attackers and the utility function. Instead, the users learn the payoffs based on their past observations. We use simulations to illustrate the proposed routing mechanism and compare the algorithm with fictitious-play learning. Unlike typical distributed routing algorithms such as AODV routing, the proposed secure routing algorithm supports a novel recovery of routing path failure against unknown attackers.

AB - In this paper, we propose a dynamic secure routing game framework to effectively combat jamming attacks in distributed cognitive radio networks. We first propose a stochastic multi-stage zero-sum game framework based on the directional exploration of ad hoc on-demand distance vector (AODV) algorithms. The zero-sum game captures the conflicting goals between malicious attackers and honest nodes and considers packet error probability and delay as performance metrics. The game-theoretic routing protocol guarantees a performance level given by the value of the game. Distributed Boltzmann-Gibbs learning is used for an on-line routing algorithm, in which the users do not have the knowledge of the attackers and the utility function. Instead, the users learn the payoffs based on their past observations. We use simulations to illustrate the proposed routing mechanism and compare the algorithm with fictitious-play learning. Unlike typical distributed routing algorithms such as AODV routing, the proposed secure routing algorithm supports a novel recovery of routing path failure against unknown attackers.

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

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

U2 - 10.1109/GLOCOM.2011.6133879

DO - 10.1109/GLOCOM.2011.6133879

M3 - Conference contribution

SN - 9781424492688

BT - 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011

ER -