Game theoretic models for multiple access and resource allocation in wireless networks

We first present a non-cooperative auction game to solve the bandwidth allocation problem for non-cooperative channel access in a wireless network. The Nash equilibrium is obtained as a solution of the game. To address this problem of bandwidth sharing under unknown information, we further develop...

Full description

Bibliographic Details
Main Author: Akkarajitsakul, Khajonpong
Other Authors: Hossain, Ekram (Electrical and Computer Engineering)
Published: IEEE 2012
Subjects:
Online Access:http://hdl.handle.net/1993/8900
id ndltd-LACETR-oai-collectionscanada.gc.ca-MWU.1993-8900
record_format oai_dc
spelling ndltd-LACETR-oai-collectionscanada.gc.ca-MWU.1993-89002014-03-29T03:44:45Z Game theoretic models for multiple access and resource allocation in wireless networks Akkarajitsakul, Khajonpong Hossain, Ekram (Electrical and Computer Engineering) McLeod, Robert D.(Electrical and Computer Engineering), Yahampath, Pradeepa (Electrical and Computer Engineering), Eskicioglu, Rasit (Computer Science), and Hassanein, Hossam (School of Computing, Queen's University) multiple access game theory resource allocation wireless networks coalitional game auction game We first present a non-cooperative auction game to solve the bandwidth allocation problem for non-cooperative channel access in a wireless network. The Nash equilibrium is obtained as a solution of the game. To address this problem of bandwidth sharing under unknown information, we further develop a Bayesian auction game model and then Bayesian Nash equilibrium is then obtained. Next, we present a framework based on coalitional game for cooperative channel access for carry-and-forward-based data delivery. Each mobile node helps others to carry and then forward their data. A coalitional game is proposed to find a stable coalition structure for this cooperative data delivery. We next present static and dynamic coalitional games for carry-and-forward-based data delivery when the behavior of each mobile node is unknown by others. In the dynamic game, each mobile node can update its beliefs about other mobile nodes’ types when the static coalitional game is played repeatedly. 2012-09-20T20:18:14Z 2012-09-20T20:18:14Z 2009-06 2011-07 2011-08 2011-11-26 2012-12-13 K. Akkarajitsakul and E. Hossain, "An auction mechanism for channel access in vehicle-to-roadside communications," in Proc. 2nd International Workshop on Multiple Access Communications (MACOM'09) co-located with IEEE ICC'2009, Dresden, Germany, 14-18 June 2009. K. Akkarajitsakul, E. Hossain, D. Niyato, and D. I. Kim, "Game theoretic approaches for multiple access in wireless networks: A survey," IEEE Communications Surveys and Tutorials, vol. 13, no. 3, Third Quarter, 2011. K. Akkarajitsakul, E. Hossain, and D. Niyato, "Distributed resource allocation in wireless networks under uncertainty and application of Bayesian game," IEEE Communications Magazine, Special Issue on "Game Theory in Wireless Networks", vol. 49, no. 8, pp. 120-127, August 2011. K. Akkarajitsakul, E. Hossain, and D. Niyato, "Coalition-based cooperative packet delivery under uncertainty: A dynamic Bayesian coalitional game," IEEE Transactions on Mobile Computing, IEEE computer Society Digital Library, Digital Object Identifier: 10.1109/TMC.2011.251, Date of Publication: 22 November 2011. K. Akkarajitsakul, E. Hossain, and D. Niyato, "Cooperative packet delivery in hybrid wireless mobile networks: A coalitional game approach," IEEE Transactions on Mobile Computing, IEEE computer Society Digital Library, Digital Object Identifier: 10.1109/TMC.2012.46, Date of Pubication: 13 February 2012. http://hdl.handle.net/1993/8900 IEEE
collection NDLTD
sources NDLTD
topic multiple access
game theory
resource allocation
wireless networks
coalitional game
auction game
spellingShingle multiple access
game theory
resource allocation
wireless networks
coalitional game
auction game
Akkarajitsakul, Khajonpong
Game theoretic models for multiple access and resource allocation in wireless networks
description We first present a non-cooperative auction game to solve the bandwidth allocation problem for non-cooperative channel access in a wireless network. The Nash equilibrium is obtained as a solution of the game. To address this problem of bandwidth sharing under unknown information, we further develop a Bayesian auction game model and then Bayesian Nash equilibrium is then obtained. Next, we present a framework based on coalitional game for cooperative channel access for carry-and-forward-based data delivery. Each mobile node helps others to carry and then forward their data. A coalitional game is proposed to find a stable coalition structure for this cooperative data delivery. We next present static and dynamic coalitional games for carry-and-forward-based data delivery when the behavior of each mobile node is unknown by others. In the dynamic game, each mobile node can update its beliefs about other mobile nodes’ types when the static coalitional game is played repeatedly.
author2 Hossain, Ekram (Electrical and Computer Engineering)
author_facet Hossain, Ekram (Electrical and Computer Engineering)
Akkarajitsakul, Khajonpong
author Akkarajitsakul, Khajonpong
author_sort Akkarajitsakul, Khajonpong
title Game theoretic models for multiple access and resource allocation in wireless networks
title_short Game theoretic models for multiple access and resource allocation in wireless networks
title_full Game theoretic models for multiple access and resource allocation in wireless networks
title_fullStr Game theoretic models for multiple access and resource allocation in wireless networks
title_full_unstemmed Game theoretic models for multiple access and resource allocation in wireless networks
title_sort game theoretic models for multiple access and resource allocation in wireless networks
publisher IEEE
publishDate 2012
url http://hdl.handle.net/1993/8900
work_keys_str_mv AT akkarajitsakulkhajonpong gametheoreticmodelsformultipleaccessandresourceallocationinwirelessnetworks
_version_ 1716658953956360192