有限缓冲认知无线网络中优先级多媒体业务的频谱切换方案

Mao Li, Tigang Jiang, Liang Tong
{"title":"有限缓冲认知无线网络中优先级多媒体业务的频谱切换方案","authors":"Mao Li, Tigang Jiang, Liang Tong","doi":"10.1109/DASC.2013.98","DOIUrl":null,"url":null,"abstract":"Multimedia applications have been becoming a majority type of traffic over cognitive radio network (CRN). Considering the different delay requirements of heterogeneous multimedia applications, we classified the secondary users (SUs) into four priority classes. Due to delay-sensitive nature of real-time (RT) multimedia services, we give it high priority to access channels. Non-real-time (NRT) traffic is characterized as delay-insensitive. In this paper, we proposed a dynamic spectrum handoff scheme with finite-size buffer queues to store preempted SUs which aims at avoiding the dropping events even though slightly increase the blocking probability. The finite-size buffer queue can avoid too many RT traffics piling up. Through limiting the buffer size the NRT traffics can get a fair chance to use channels. Additionally, spectrum sensing and channel allocation are controlled by a central base station (CBS). Such centralized admission control mechanism can efficiently prevent multiple SUs from simultaneously requesting to access the same spectrum band, consequently, to protect the channel form SUs' collision. A preemptive resume priority (PRP) M/M/c/c+k Markov model is established to analysis the performance, including the blocking probability, the throughput of SUs and the average completion time of RT traffic. The results show that the proposed scheme can meet the various performance requirements of heterogeneous multi-media applications. Moreover, the buffer mechanism can improve the channel utilization considerably.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Spectrum Handoff Scheme for Prioritized Multimedia Services in Cognitive Radio Network with Finite Buffer\",\"authors\":\"Mao Li, Tigang Jiang, Liang Tong\",\"doi\":\"10.1109/DASC.2013.98\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multimedia applications have been becoming a majority type of traffic over cognitive radio network (CRN). Considering the different delay requirements of heterogeneous multimedia applications, we classified the secondary users (SUs) into four priority classes. Due to delay-sensitive nature of real-time (RT) multimedia services, we give it high priority to access channels. Non-real-time (NRT) traffic is characterized as delay-insensitive. In this paper, we proposed a dynamic spectrum handoff scheme with finite-size buffer queues to store preempted SUs which aims at avoiding the dropping events even though slightly increase the blocking probability. The finite-size buffer queue can avoid too many RT traffics piling up. Through limiting the buffer size the NRT traffics can get a fair chance to use channels. Additionally, spectrum sensing and channel allocation are controlled by a central base station (CBS). Such centralized admission control mechanism can efficiently prevent multiple SUs from simultaneously requesting to access the same spectrum band, consequently, to protect the channel form SUs' collision. A preemptive resume priority (PRP) M/M/c/c+k Markov model is established to analysis the performance, including the blocking probability, the throughput of SUs and the average completion time of RT traffic. The results show that the proposed scheme can meet the various performance requirements of heterogeneous multi-media applications. Moreover, the buffer mechanism can improve the channel utilization considerably.\",\"PeriodicalId\":179557,\"journal\":{\"name\":\"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DASC.2013.98\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC.2013.98","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

多媒体应用已经成为认知无线网络(CRN)上的主要业务类型。考虑到异构多媒体应用对时延的不同要求,我们将辅助用户划分为四个优先级。由于实时(RT)多媒体业务的延迟敏感特性,我们给予它高优先级的访问通道。NRT (Non-real-time)流量的特点是对延迟不敏感。在本文中,我们提出了一种动态频谱切换方案,该方案使用有限大小的缓冲队列来存储被抢占的单元,旨在避免丢弃事件,即使稍微增加阻塞概率。有限大小的缓冲队列可以避免太多的RT流量堆积。通过限制缓冲区大小,NRT流量可以获得公平的通道使用机会。此外,频谱感知和信道分配由中央基站(CBS)控制。这种集中的准入控制机制可以有效地防止多个单元同时请求访问同一频段,从而保护信道免受单元的碰撞。建立了抢占式恢复优先级(PRP) M/M/c/c+k马尔可夫模型,分析了抢占式恢复优先级的性能,包括阻塞概率、单节点吞吐量和RT流量的平均完成时间。结果表明,该方案能够满足异构多媒体应用的各种性能要求。此外,该缓冲机制可以显著提高信道利用率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Spectrum Handoff Scheme for Prioritized Multimedia Services in Cognitive Radio Network with Finite Buffer
Multimedia applications have been becoming a majority type of traffic over cognitive radio network (CRN). Considering the different delay requirements of heterogeneous multimedia applications, we classified the secondary users (SUs) into four priority classes. Due to delay-sensitive nature of real-time (RT) multimedia services, we give it high priority to access channels. Non-real-time (NRT) traffic is characterized as delay-insensitive. In this paper, we proposed a dynamic spectrum handoff scheme with finite-size buffer queues to store preempted SUs which aims at avoiding the dropping events even though slightly increase the blocking probability. The finite-size buffer queue can avoid too many RT traffics piling up. Through limiting the buffer size the NRT traffics can get a fair chance to use channels. Additionally, spectrum sensing and channel allocation are controlled by a central base station (CBS). Such centralized admission control mechanism can efficiently prevent multiple SUs from simultaneously requesting to access the same spectrum band, consequently, to protect the channel form SUs' collision. A preemptive resume priority (PRP) M/M/c/c+k Markov model is established to analysis the performance, including the blocking probability, the throughput of SUs and the average completion time of RT traffic. The results show that the proposed scheme can meet the various performance requirements of heterogeneous multi-media applications. Moreover, the buffer mechanism can improve the channel utilization considerably.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Improved Algorithm for Dynamic Cognitive Extraction Based on Fuzzy Rough Set An Improved Search Algorithm Based on Path Compression for Complex Network Dynamic Spectrum Sensing for Energy Harvesting Wireless Sensor Study and Application of Dynamic Collocation of Variable Weights Combination Forecasting Model A Multicast Routing Algorithm for GEO/LEO Satellite IP Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1