TY - GEN
T1 - Multiple multidimensional knapsack problem and its applications in cognitive radio networks
AU - Song, Yang
AU - Zhang, Chi
AU - Fang, Yuguang
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2008
Y1 - 2008
N2 - In this paper, a new variant of the standard knapsack problem is investigated and applied in cognitive radio networks. More specifically, the centralized spectrum allocation in cognitive radio networks is formulated as a multiple multidimensional knapsack problem. We propose an exact solution and a heuristic algorithm with guaranteed performance. The performance of the proposed algorithms are compared numerically. ©2008 IEEE.
AB - In this paper, a new variant of the standard knapsack problem is investigated and applied in cognitive radio networks. More specifically, the centralized spectrum allocation in cognitive radio networks is formulated as a multiple multidimensional knapsack problem. We propose an exact solution and a heuristic algorithm with guaranteed performance. The performance of the proposed algorithms are compared numerically. ©2008 IEEE.
KW - Cognitive radio networks
KW - Combinatorial optimization
KW - Online algorithms
KW - Spectrum allocation
UR - https://www.scopus.com/pages/publications/62349090180
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-62349090180&origin=recordpage
U2 - 10.1109/MILCOM.2008.4753629
DO - 10.1109/MILCOM.2008.4753629
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9781424426775
T3 - Proceedings - IEEE Military Communications Conference MILCOM
BT - 2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success
T2 - 2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success
Y2 - 17 November 2008 through 19 November 2008
ER -