Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Utilization and fairness in spectrum assignment for opportunistic spectrum access
Mobile Networks and Applications
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Allocating dynamic time-spectrum blocks in cognitive radio networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Cognitive radio: brain-empowered wireless communications
IEEE Journal on Selected Areas in Communications
Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework
IEEE Journal on Selected Areas in Communications
HC-MAC: A Hardware-Constrained Cognitive MAC for Efficient Spectrum Management
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We present a novel spectrum access scheme for open spectrum networks. Different from existing works, this work considers the scenario that contending secondary users have heterogeneous channel availability. It is proved to be NP hard to find the optimal spectrum assignment in this scenario. To solve this problem, a novel approximation algorithm is proposed which is based on the maximum weighted matching technique. The performance of the algorithm is evaluated through extensive simulations. Compared with the general optimal spectrum allocation scheme without considering the difference of spectrum availability, the experiments' results demonstrate that the new matching based algorithm improves the network throughput significantly, generally by 20% to 60%. The algorithm's computation complexity is also at a low level of O(M*n2*m).