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.

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.