By Topic

Channel Allocation in a Multiple Distributed Vehicular Users Using Game Theory

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

4 Author(s)
Yusita Kasdani ; Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore, Singapore ; Yong Huat Chew ; Chau Yuen ; Woon Hau Chin

In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed spatially apart. An algorithm which can search for all pure Nash Equilibrium (NE) solutions is presented. We study how the number of pure NEs grows when either the size of the network or the number of available channels gets higher. Myopic play of a game, in which the players take turn to choose its best response strategy, is a common approach to obtain one of these NE solutions, if the algorithm converges. However, we found that for myopic play of the game, the probability of convergence to the NE which has the desired best global utility is not guaranteed. We further propose two player ordering schemes to study how the probability of hitting the best global solution among all possible NEs is affected. We find that by allowing the node with the lowest "expected" utility to decide first increases the chance of hitting the NE solution with better utility value.

Published in:

Vehicular Technology Conference (VTC 2010-Spring), 2010 IEEE 71st

Date of Conference:

16-19 May 2010