By Topic

General Auction-Theoretic Strategies for Distributed Partner Selection in 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
$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)
Amitav Mukherjee ; Department of Electrical Engineering and Computer Science, University of California, Irvine, CA 92697 USA ; Hyuck M. Kwon

It is unrealistic to assume that all nodes in an ad hoc wireless network would be willing to participate in cooperative communication, especially if their desired Quality-of-Service (QoS) is achievable via direct transmission. An incentive-based auction mechanism is presented to induce cooperative behavior in wireless networks with emphasis on users with asymmetrical channel fading conditions. A single-object second-price auction is studied for cooperative partner selection in single-carrier networks. In addition, a multiple-object bundled auction is analyzed for the selection of multiple simultaneous partners in a cooperative orthogonal frequency-division multiplexing (OFDM) setting. For both cases, we characterize equilibrium outage probability performance, seller revenue, and feedback bounds. The auction-based partner selection allows winning bidders to achieve their desired QoS while compensating the seller who assists them. At the local level sellers aim for revenue maximization, while connections are drawn to min-max fairness at the network level. The proposed strategies for partner selection in self-configuring cooperative wireless networks are shown to be robust under conditions of uncertainty in the number of users requesting cooperation, as well as minimal topology and channel link information available to individual users.

Published in:

IEEE Transactions on Communications  (Volume:58 ,  Issue: 10 )