By Topic

Coalition games for transmitter cooperation in 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
$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)
Yerramalli, S. ; Univ. of Southern California, Los Angeles, CA, USA ; Jain, R. ; Mitra, U.

Cooperation between rational users has emerged as a new networking paradigm to improve the performance of wireless networks. In this paper, transmitter cooperation between wireless nodes in a Gaussian multiple access channel is studied under the framework of coalitional game theory. The stability of the grand coalition, the coalition of all users, is studied by modeling the game in partition form, in contrast to previous approaches using characteristic form games, in scenarios with infinite and finite cooperation capacity between transmitters. In both cases, irrespective of the channel gains, the grand coalition is shown to be the sum rate optimal and stable, in the sense that users do not have any incentive to leave the coalition.

Published in:

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Date of Conference:

July 31 2011-Aug. 5 2011