By Topic

Modelling routing in wireless ad hoc networks with dynamic Bayesian games

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
$33 $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

1 Author(s)
P. Nurmi ; Helsinki Inst. for Inf. Technol., Helsinki Univ., Finland

Mobile agents acting in wireless ad hoc networks are energy constrained, which leads to potential selfishness as nodes are not necessarily willing to forward packets for other nodes. Situations like this are traditionally analyzed using game theory and recently also the ad hoc networking community has witnessed game-theoretic approaches to especially routing. However, from a theoretical point-of-view the contemporary game-theoretic approaches have mainly ignored two important aspects: non-simultaneous decision making and incorporating history information into the decision making process. In this article we propose a new model that fills these gaps and allows to analyze routing theoretically.

Published in:

Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. 2004 First Annual IEEE Communications Society Conference on

Date of Conference:

4-7 Oct. 2004