The Community for Technology Leaders
Green Image
Issue No. 06 - June (2013 vol. 12)
ISSN: 1536-1233
pp: 1133-1145
Miao Pan , University of Florida, Gainesville
Hao Yue , University of Florida, Gainesville
Chi Zhang , University of Science and Technology of China, Heifei
Yuguang Fang , University of Florida, Gainesville
Cognitive radio (CR) technology opens the licensed spectrum bands for opportunistic usage and initiates spectrum trading to improve the spectrum utilization. In this paper, we investigate the path selection problem in multihop cognitive radio networks (CRNs) under constraints on flow routing, link scheduling and CR source's budget. We extend the per-user-based spectrum trading in prior work to CR session-based spectrum trading, and effectively develop the spectrum trading mechanisms based on the cross-layer optimization in multihop CRNs. We introduce a new service provider, called secondary service provider (SSP), to help CR sessions to select the paths for packet delivery. Considering the price of bands and the potential returning of primary services at different CR links, the SSP purchases the licensed spectrum and jointly conducts flow routing and link scheduling under the budget constraints. We also propose a 4D conflict graph to characterize the conflict relationship among CR links and mathematically formulate the path selection problem under multiple constraints into an optimization problem with the objective of maximizing the end-to-end throughput. Due to the NP-hardness of the problem, we have also developed a heuristic algorithm to find the approximate solution.
Routing, Throughput, Interference, Optimization, Heuristic algorithms, Availability, Spread spectrum communication, optimization, Cognitive radio networks, uncertain spectrum supply, link scheduling, multihop multipath routing

C. Zhang, H. Yue, M. Pan and Y. Fang, "Path Selection under Budget Constraints in Multihop Cognitive Radio Networks," in IEEE Transactions on Mobile Computing, vol. 12, no. , pp. 1133-1145, 2013.
84 ms
(Ver 3.3 (11022016))