Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Convex Optimization
Auction-based spectrum sharing
Mobile Networks and Applications
Dynamic Spectrum Access with QoS and Interference Temperature Constraints
IEEE Transactions on Mobile Computing
Formalizing the interference temperature model
Wireless Communications & Mobile Computing - Cognitive Radio, Software Defined Radio And Adaptive Wireless Systems
Mesh WLAN networks: concept and system design
IEEE Wireless Communications
Cross-layer optimization of wireless networks using nonlinear column generation
IEEE Transactions on Wireless Communications
Fundamental limits of spectrum-sharing in fading environments
IEEE Transactions on Wireless Communications
Mesh networks: commodity multihop ad hoc networks
IEEE Communications Magazine
Multiuser OFDM with adaptive subcarrier, bit, and power allocation
IEEE Journal on Selected Areas in Communications
Cognitive radio: brain-empowered wireless communications
IEEE Journal on Selected Areas in Communications
Spectrum Sharing for Multi-Hop Networking with Cognitive Radios
IEEE Journal on Selected Areas in Communications
Cognitive Wireless Mesh Networks with Dynamic Spectrum Access
IEEE Journal on Selected Areas in Communications
Hi-index | 0.01 |
In this paper, the problem of resource allocation in an Orthogonal Frequency Division Multiple Access-based Cognitive Wireless Mesh Network (CWMN) is addressed. The objective is to maximize the total utilities in a CWMN, which is defined as any increasing, concave and twice differentiable function of the end-to-end flow rate, by jointly allocating each link's rate, power and subchannels under the constraints of multiple primary users' Interference Temperature and multiple access interference. First, a centralized resource allocation algorithm is developed based on the Column Generation approach, and shown to be optimal. So it can perform as a criterion for designing other algorithms. Secondly, considering the applicability of algorithm in distributed system, a near-optimal distributed algorithm is proposed, which allocates subchannel based on routing information at first, and then jointly allocates the resource of rate and power. Finally, the simulation results validate the centralized and distributed algorithms, and show that better performance can be achieved than the conventional algorithm.