By Topic

Auction-Based Power Allocation for Multi-Source Multi-Relay Cooperative 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

2 Author(s)
Baidas, M.W. ; Bradley Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA, USA ; MacKenzie, A.B.

In this paper, multi-source multi-relay power allocation in cooperative wireless networks is considered. An ascending-clock auction is proposed to efficiently allocate cooperative relay power among multiple source nodes in a distributed fashion. In particular, each source node reports its optimal power demand to each relay node based on the relays' announced prices. It is proven that the proposed auction algorithm enforces truthful power demands and converges in a finite number of time- steps to the unique Walrasian Equilibrium allocation that maximizes the social welfare. Numerical results are presented to supplement the theoretical analysis and demonstrate the efficiency of the proposed distributed relay power allocation algorithm.

Published in:

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Date of Conference:

5-9 Dec. 2011