By Topic

Dynamic Secure Routing Game in Distributed Cognitive Radio Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Quanyan Zhu ; Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana Champaign, Urbana, IL, USA ; Ju Bin Song ; Basar, T.

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.

Published in:

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Date of Conference:

5-9 Dec. 2011