Research Article
Relay Auction Algorithms for Downlink Bandwidth Allocation in IEEE 802.16-Based OFDM/TDMA Wireless Mesh Networks
@INPROCEEDINGS{10.1109/CHINACOM.2009.5339842, author={Zhen Kong and Yu-Kwong Kwok}, title={Relay Auction Algorithms for Downlink Bandwidth Allocation in IEEE 802.16-Based OFDM/TDMA Wireless Mesh Networks}, proceedings={ChinaCom2009-Wireless Communications and Networking Symposium}, publisher={IEEE}, proceedings_a={CHINACOM2009-WCN}, year={2009}, month={11}, keywords={Wireless mesh networks downlink bandwidth allocation auction algorithms Nash equilibrium Vickrey- Clarke-Groves auction service dependability}, doi={10.1109/CHINACOM.2009.5339842} }- Zhen Kong
Yu-Kwong Kwok
Year: 2009
Relay Auction Algorithms for Downlink Bandwidth Allocation in IEEE 802.16-Based OFDM/TDMA Wireless Mesh Networks
CHINACOM2009-WCN
IEEE
DOI: 10.1109/CHINACOM.2009.5339842
Abstract
In this paper, we study the problem of downlink bandwidth allocation in a non-cooperative IEEE 802.16 OFDM/TDMA based wireless mesh network, and propose an auction based framework in which the gateway, equipped with the precious high speed Internet connection, serves as the auctioneer while the first-level mesh routers (MRs) (i.e., those with direct wireless connections to the gateway) act as bidders competing resources among each other. We then present two novel relay auction (RA) approaches to allocate time-slots among MRs and analyze the bidding strategy using the solution concept of Nash equilibrium. Through simulations, we find that the proposed RA algorithms can achieve competitive performance in terms of resource allocation efficiency compared with Vickrey-Clarke- Groves (VCG) approaches, while having the capability to strike a proper balance between efficiency and fairness by adjusting the payment function. Specifically, with a smaller payment parameter value, the RA algorithms can also achieve much better connection blocking probability performance than VCG algorithms.
