Auction-based resource allocation for hierarchical wireless mesh networks in rural areas
Proceedings of the 4th ACM workshop on Challenged networks
Constraint-based winner determination for auction-based scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Decentralized link adaptation for multi-link MIMO interference system
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Auction-based radio resource allocation for OFDMA systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
VCG-based time-slot auctioning in IEEE 802.16 OFDM/TDMA wireless mesh networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
QoS-adaptive bandwidth allocation scheme based on measurement report real-time analysis
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Optimal pricing in a free market wireless network
Wireless Networks
An auction-based incentive mechanism for non-altruistic cooperative ARQ via spectrum-leasing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Spectrum sharing in cognitive radio networks: an auction-based approach
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Distributed power allocation in multi-user multi-channel cellular relay networks
IEEE Transactions on Wireless Communications
Cooperative ARQ via auction-based spectrum leasing
IEEE Transactions on Communications
Auction-based spectrum sharing for multiple primary and secondary users in cognitive radio networks
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
IEEE Transactions on Communications
International Journal of Network Management
International Journal of Business Data Communications and Networking
| Hi-index | 0.07 |
We develop a novel auction-based algorithm to allow users to fairly compete for a wireless fading channel. We use the second-price auction mechanism whereby user bids for the channel, during each time slot, based on the fade state of the channel, and the user that makes the highest bid wins use of the channel by paying the second highest bid. Under the assumption that each user has a limited budget for bidding, we show the existence of a Nash equilibrium strategy, and the Nash equilibrium leads to a unique allocation for certain channel state distribution, such as the exponential distribution and the uniform distribution over [0, 1]. For uniformly distributed channel state, we establish that the aggregate throughput received by the users using the Nash equilibrium strategy is at least 3/4 of what can be obtained using an optimal centralized allocation that does not take fairness into account. We also show that the Nash equilibrium strategy leads to an allocation that is Pareto optimal (i.e., it is impossible to make some users better off without making some other users worse off). Based on the Nash equilibrium strategies of the second-price auction with money constraint, we further propose a centralized opportunistic scheduler that does not suffer the shortcomings associated with the proportional fair scheduler.