IJIRST (International Journal for Innovative Research in Science & Technology)ISSN (online) : 2349-6010

 International Journal for Innovative Research in Science & Technology

An Effective Data Distribution Using Resource Allocation in CR Networks through Balanced Queue


Print Email Cite
International Journal for Innovative Research in Science & Technology
Volume 1 Issue - 9
Year of Publication : 2015
Authors : T Karthikeyan ; B Shivashankar; M Selvakumar; E Mohanraj

BibTeX:

@article{IJIRSTV1I9025,
     title={An Effective Data Distribution Using Resource Allocation in CR Networks through Balanced Queue},
     author={T Karthikeyan, B Shivashankar, M Selvakumar and E Mohanraj},
     journal={International Journal for Innovative Research in Science & Technology},
     volume={1},
     number={9},
     pages={64--69},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV1I9025.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}



Abstract:

Cognitive Radio (CR) is an emerging technology for future wireless communication and technology. In the existing system, there is a multiple allocation over all the bands and also there is a crisis for spectrum availability, therefore a new approach for spectrum licensing is needed. Hence the optimal solution for the above case is cognitive radio. the resource-allocation problem in multihop CR networks is modeled as a multicommodity flow problem. To solve this problem, the queue-balancing flow control method is proposed. Considering the characteristics of CR, we adopt the queue-balancing to multihop CR networks with varying link capacity and dynamic spectrum conditions. Using the queue-balancing framework, we analyzed distributed resource allocation. The data rate, power, and channel allocation are determined by the local queue size and adjusted to reflect the status of channels and the throughput requirement on each link. The optimal rate control for each session on a link is derived first. Power allocation at nodes is divided into two levels, which are the power allocation between links and the water-filling power allocation for the channels within a link. Coordination between links for channel allocation is achieved by exchanging some control messages between neighboring nodes according to the estimated channel-holding utilities for each channel on a link. We also proposed a time based scheme in order to change the spectrum dynamically to avoid data stagnation.


Keywords:

Resource Allocation, Queue Balancing, Throughput


Download Article