Download now Free registration required
Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-hoc networks. In this paper, the authors study the competitive multi-radio channel allocation problem in multi-hop wireless networks in detail. They model the channel allocation problem as a static cooperative game, in which some players collaborate to achieve high date rate. They propose the Min-Max Coalition-Proof Nash Equilibrium (MMCPNE) channel allocation scheme in the game, which aims to max the achieved date rates of communication links.
- Format: PDF
- Size: 678.5 KB