By Topic

Probabilistic Voting-Theoretic Strategies for Resource Allocation in Heterogenous Wireless 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

1 Author(s)
Amitav Mukherjee ; Electr. Eng. & Comput. Sci., Univ. of California, Irvine, CA, USA

This paper investigates the issue of resource allocation in heterogenous wireless networks, where users have a choice between multiple service providers. We investigate the feasibility of modeling the allocation problem as a probabilistic voting game. In other words, competing transmitters are modeled as candidates in an election, while the receivers form the electorate. Two specific examples are analyzed in this work: a MIMO downlink power allocation game, and an OFDM-based bandwidth allocation game. The robustness and existence of equilibrium outcomes of the proposed voting games are studied in detail. Finally, simulation results are presented to verify the performance of the proposed voting-theoretic algorithms.

Published in:

Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE

Date of Conference:

Nov. 30 2009-Dec. 4 2009