ACM Home Page
Please provide us with feedback. Feedback
A game approach for multi-channel allocation in multi-hop wireless networks
Full text PdfPdf (421 KB)
Source
International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing table of contents
Hong Kong, Hong Kong, China
SESSION: Game-theoretical aspects table of contents
Pages 303-312  
Year of Publication: 2008
ISBN:978-1-60558-073-9
Authors
Lin Gao  Shanghai Jiao Tong University, Shanghai, China
Xinbing Wang  Shanghai Jiao Tong University, Shanghai, China
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 43,   Downloads (12 Months): 313,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1374618.1374659
What is a DOI?

ABSTRACT

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, we study the competitive multi-radio channel allocation problem in multi-hop wireless networks in detail. We model the channel allocation problem as a static cooperative game, in which some players collaborate to achieve high date rate. We propose the min-max coalition-proof Nash equilibrium (MMCPNE) channel allocation scheme in the game, which is aiming to max the achieved date rates of communication links. We study the existence of MMCPNE and prove the necessary conditions for MMCPNE. Furthermore, we propose several algorithms that enable the selfish players to converge to MMCPNE. Simulation results show that MMCPNE outperforms CPNE and NE schemes in terms of achieved data rates of the multi-hop links due to cooperation gain.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
M. Schwartz. Mobile Wireless Communications. Cambridge Univ. Press, 2005.
 
3
M. Felegyhazi, M. Cagalj, S. S. Bidokhti, etc. Non-cooperative Multi-radio Channel Allocation in Wireless Networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM '07), March 13-17 2007.
 
4
 
5
I. Katzela and M. Naghshineh. Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey. IEEE Personal Communications, 3(3):10--31, Jun 1996.
 
6
Hac A and Z. Chen. Hybrid channel allocation in wireless networks. In Proceedings of the IEEE Conference on Vehicular Technology Conference (VTC '99), 50(4):2329--2333, Sept. 1999.
 
7
 
8
A. Raniwala and T. C. Chiueh. Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM '05), March 13-17 2005.
9
10
11
12
 
13
M. Cagalj, S. Ganeriwal, I. Aad, etc. On selfish behavior in CSMA/CA networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM '05), March 13-17 2005.
 
14
 
15
A. B. MacKenzie and S. B. Wicker. Stability of multipacket slotted aloha with selfish users and perfect information. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM '03), March 30-April 3 2003.
16
17
 
18
 
19
G. Bianchi. Performance analysis of the IEEE 802.11 distributed coordination function. IEEE Journal on Selected Areas in Communication, 18(3), March 2000.
 
20
D. Fudenberg and J. Tirole. Game Theory. MIT Press, 1991.
 
21
B. D. Bernheim, B. Peleg, and M. D. Whinston. Coalition-proof Nash equilibria: I concepts. Journal of Economic Theory, 42(1), June 1987.