Lin Gao
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.
- T. S. Rappaport. Wireless Communications: Principles and Practice (2nd). Prentice Hall, 2002. Google Scholar
Digital Library
- M. Schwartz. Mobile Wireless Communications. Cambridge Univ. Press, 2005.Google ScholarDigital Library
- 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.Google ScholarDigital Library
- J. van den Heuvel, R. A. Leese, and M. A. Shepherd. Graph labeling and radio channel assignment. Journal of Graph Theory, 29:263--283, 1998. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- I. F. Akyildiz, X. Wang, and W. Wang. Wireless mesh networks: A survey. Computer Networks, Elsevier North-Holland, Inc., 47:445--487, March 2005. Google ScholarDigital Library
- 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.Google Scholar
- M. Li and Y. H. Liu, Rendered Path: Range-Free Localization in Anisotropic Sensor Networks with Holes, In Proceedings of the ACM Conference on Mobile Computing and Networking (MOBICOM '07), Montreal, Quebec, Canada, Sept 2007. Google ScholarDigital Library
- M. Li and Yunhao Liu, Underground Structure Monitoring with Wireless Sensor Networks, In Proceedings of ACM/IEEE Conference on Information Processing In Sensor Networks (IPSN '07), Cambridge, Massachusetts, USA, April, 2007. Google ScholarDigital Library
- A. Mishra, S. Banerjee, and W. Arbaugh. Weighted coloring based channel assignment for WLANs. Mobile Computing and Communications Review (MC2R), 9(3), 2005. Google ScholarDigital Library
- M. Alicherry, R. Bhatia, and L. (Erran) Li. Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks. In Proceedings of the ACM Conference on Mobile Computing and Networking (MOBICOM '05), pages 58--72, Aug. 28-Sep. 2 2002. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- J. Konorski. Multiple access in ad-hoc wireless LANs with noncooperative stations. In Proceedings of Networking 2002, pages 1141--1146, 2002. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- M. Y. Kao, X. Y. Li and W. Z. Wang. Towards Truthful Mechanisms for Binary Demand Games: A General Framework. In Proceedings of the ACM Conference on Electronic Commerce (EC '05), pages 213--222, 2005. Google ScholarDigital Library
- M. M. Halldorsson, J. Y. Halpern, L. (Erran) Li, etc. On spectrum sharing games. In Proceedings of the 23rd annual ACM symposium on Principles of Distributed Computing (PODC '04), pages 107--114, July 25-28 2004. Google ScholarDigital Library
- A. Adya, P. Bahl, J. Padhye, etc. A multi-radio unification protocol for IEEE 802.11 wireless networks. In Proceedings of the IEEE conference on Broadband Communications, Networks, and Systems (BROADNETS '04), pages 344--354, 2004. Google ScholarDigital Library
- G. Bianchi. Performance analysis of the IEEE 802.11 distributed coordination function. IEEE Journal on Selected Areas in Communication, 18(3), March 2000. Google ScholarDigital Library
- D. Fudenberg and J. Tirole. Game Theory. MIT Press, 1991.Google Scholar
- B. D. Bernheim, B. Peleg, and M. D. Whinston. Coalition-proof Nash equilibria: I concepts. Journal of Economic Theory, 42(1), June 1987.Google Scholar
Index Terms
- A game approach for multi-channel allocation in multi-hop wireless networks
Recommendations
Routing in multi-radio, multi-hop wireless mesh networks
MobiCom '04: Proceedings of the 10th annual international conference on Mobile computing and networkingWe present a new metric for routing in multi-radio, multi-hop wireless networks. We focus on wireless networks with stationary nodes, such as community wireless networks.The goal of the metric is to choose a high-throughput path between a source and a ...
Enhancing multi-hop communication over multi-radio multi-channel wireless mesh networks: A cross-layer approach
The multi-channel multi-radio technology represents a straightforward approach to expand the capacity of wireless mesh networks (WMNs) in broadband wireless access scenarios. However, the effective leveraging of this technology in WMNs requires (i) ...
Review of channel assignment approaches in multi-radio multi-channel wireless mesh network
The Channel Assignment (CA) is an efficient tool to exploit multiple non-overlapping channels to minimize interference and enhance the capacity of the wireless mesh network. Even though the CA can minimize the total network interference, its result may ...
Comments