By Topic

Analysis of distributed route selection scheme in wireless ad hoc 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
$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

2 Author(s)
K. Yamamoto ; Graduate Sch. of Informatics, Kyoto Univ., Japan ; S. Yoshida

The capacity region of ad hoc networks with optimal routing or scheduling has been investigated. Since distributed network control algorithms can be applied without centralized information, the resulting network can be scalable. On the other hand, selfish nodes can severely degrade network performance, for example, the network capacity. We attempt to analyze the obtained network capacity region based upon distributed route selection by using game theory. Simulation results reveal that in some situations, even with optimal routing, each rational selfish node cannot determine a unique route under the assumption that nodes know not only their own end-to-end throughput, but also those of all the other nodes, as a result of their own, and all the other nodes', route selections.

Published in:

Personal, Indoor and Mobile Radio Communications, 2004. PIMRC 2004. 15th IEEE International Symposium on  (Volume:1 )

Date of Conference:

5-8 Sept. 2004