TY - GEN
T1 - Relay auction algorithms for downlink bandwidth allocation in IEEE 802.16-based OFDM/TDMA wireless mesh networks
AU - Kong, Zhen
AU - Kwok, Yu Kwong
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
KW - Auction algorithms
KW - Downlink bandwidth allocation
KW - Nash equilibrium
KW - Service dependability
KW - Vickrey-Clarke-Groves auction
KW - Wireless mesh networks
UR - https://www.scopus.com/pages/publications/71749105698
U2 - 10.1109/CHINACOM.2009.5339842
DO - 10.1109/CHINACOM.2009.5339842
M3 - Conference contribution
AN - SCOPUS:71749105698
SN - 9781424443376
T3 - 2009 4th International Conference on Communications and Networking in China, CHINACOM 2009
SP - 551
EP - 555
BT - 2009 4th International Conference on Communications and Networking in China, CHINACOM 2009
T2 - 2009 4th International Conference on Communications and Networking in China, CHINACOM 2009
Y2 - 26 August 2009 through 28 August 2009
ER -