Author:
Nguyen Thanh-Tung,Koo Insoo
Abstract
In cognitive radio networks, secondary users may not sense licensed channels efficiently due to problems of fading channel, shadowing, unfamiliar environment, and so forth. To cope with the limitation, a pervasive sensor network can cooperate with cognitive radio network, which is called sensor-aided cognitive radio network. In the paper, we investigate sensor clustering and sensing time of each sensor cluster with aiming at achieving optimal throughput of sensor-aided cognitive radio network supporting multiple licensed channels. Moreover, the minimum throughput requirement of cognitive radio user is also guaranteed in the sensor clustering problem. To do this, we formulate the throughput maximization problem as a mixed-integer nonlinear programming and utilize the Branch and Bound algorithm to solve it. We also propose an heuristic algorithm which can provide similar performance to that of the Branch and Bound algorithm while reducing computation complexity significantly.
Funder
National Research Foundation of Korea
Subject
Computer Networks and Communications,General Engineering
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献