Time and Frequency Resource Allocation using Graph Theory in OFDMA Wireless Mesh Networks
暂无分享,去创建一个
[1] Dusit Niyato,et al. Radio Resource Management in MIMO- OFDM-Based Wireless Infrastructure Mesh Networks: Issues and Approaches , 2007 .
[2] D. de Werra,et al. Graph Coloring Problems , 2013 .
[3] Murali S. Kodialam,et al. Cross-Layer Optimization for OFDMA-Based Wireless Mesh Backhaul Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.
[4] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[5] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[6] Ozgur Oyman,et al. Multihop Relaying for Broadband Wireless Mesh Networks: From Theory to Practice , 2007, IEEE Communications Magazine.
[7] Reinhard Diestel,et al. Graph Theory , 1997 .
[8] Ian F. Akyildiz,et al. A survey on wireless mesh networks , 2005, IEEE Communications Magazine.
[9] Victor Leung,et al. Dynamic resource allocation in OFDMA wireless metropolitan area networks [Radio Resource Management and Protocol Engineering for IEEE 802.16] , 2007, IEEE Wireless Communications.
[10] Andreas Czylwik,et al. Time and Frequency Resource Allocation in OFDMA Wireless Mesh Networks , 2012 .
[11] Andreas Czylwik,et al. Broadband wireless mesh networks , 2011, 2011 IEEE International Conference on Microwaves, Communications, Antennas and Electronic Systems (COMCAS 2011).
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] Preetha Thulasiraman,et al. Interference Aware Subcarrier Assignment for Throughput Maximization in OFDMA Wireless Relay Mesh Networks , 2009, 2009 IEEE International Conference on Communications.