Channel scheduling by spectrum channel white space filling in cognitive radio networks

A new algorithm is elucidated for scheduling the channel for different size windows broadcast in cognitive radio based wireless networks. Getting high throughput and curtailing the loss in transmission with best possible utilization of the channel is the primary focus. Suitable bandwidth and the attainability of the required channel are the factors that play a key role in scheduling the channel. Three stages of hierarchy are followed in the algorithm proposed. They are allocation of the optimal idle channel, allocating optimal multiple idle channels as well as the allocation of optimal multiple channels. The key areas that are elaborated in this paper are channel scheduling and cognitive radio networks related content along with the detailed analysis of the scheduling strategy that is proposed. To explore the proposed approach, a simulation study is added. The results of the experiment are enforcing the robustness and standards of the proposed model concerning enhanced throughput and low transmission loss. A comparative study was done between the proposed model and the contemporary models that were found in recent past literature. Throughput, Packet Delivery Ratio (PDR), End to End delay and data-frame loss are used to assess the performance.