Article Fingerprint
ReserarchID
CSTNWS3GWB3
In this study, a contemporary method of scheduling algorithm has been proposed for working on scheduling of varying size data-frames transmission in CR based wireless networks. The objective of the proposed model is to achieve maximum throughput, and also reduction of loss of data-frames in the transmission. Some of the key elements that are considered in the development of the model are optimal bandwidth and idle channel availability. Using the three level hierarchical approach, the scheduling strategy is constructed. The optimal idle channel allocation, allocation with considerable transmission intervals allocation and optimal multiple channels models are considered at respective levels in the hierarchy in the proposed algorithm.
N Shribala. 2017. \u201cMulti-Channel Scheduling with Optimal Spectrum Channel Hole Filling (MCS-OSHF) for Cognitive Radio Wireless Networks\u201d. Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 16 (GJCST Volume 16 Issue E7).
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 113
Country: India
Subject: Global Journal of Computer Science and Technology - E: Network, Web & Security
Authors: N Shribala, Dr. P. Srihari, Dr. B. C. Jinaga (PhD/Dr. count: 2)
View Count (all-time): 261
Total Views (Real + Logic): 7157
Total Downloads (simulated): 1908
Publish Date: 2017 01, Tue
Monthly Totals (Real + Logic):
This study aims to comprehensively analyse the complex interplay between
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.