Throughput and Delay Scaling of Cognitive Radio Networks with Heterogeneous Mobile Users

Pengyuan Du, M. Gerla, Xinbing Wang
{"title":"Throughput and Delay Scaling of Cognitive Radio Networks with Heterogeneous Mobile Users","authors":"Pengyuan Du, M. Gerla, Xinbing Wang","doi":"10.1109/ICCCN.2015.7288474","DOIUrl":null,"url":null,"abstract":"We study the throughput and delay scaling laws of cognitive radio networks (CRN) with mobile primary and secondary users. They operate at the same time, space and share the spectrum. The primary users (PUs) have higher priority to access the spectrum while the secondary users (SUs) should access opportunistically. Furthermore, we consider a unique situation where both PUs and SUs move according to a General Heterogeneous Speed-restricted Mobility (GHSM) model. In this model, we define (h + 1) heterogeneous moving patterns using a universal set T ={T<sub>i</sub>|0 ≥ i ≤ h, A<sub>i</sub> = n<sup>-i</sup> χ<sub>0</sub>/h}, where A<sub>i</sub> determines the moving area of each pattern. The set of primary (secondary) moving patterns T<sup>(p)</sup> (T<sup>(s)</sup>) is a randomly and independently selected subset of T. We assign n (n<sup>β</sup>, where β > 1) primary (secondary) nodes to each moving pattern, and their initial positions are subject to a poisson point process. In addition, we have |T<sup>(p)</sup>|~|T<sup>(s)</sup>| = Θ<sup>1</sup>(h) = Θ(log n). By proposing a cooperative routing strategy, we fully utilize the mobility heterogeneity of primary and secondary users and achieve near-optimal throughput and delay performance of order Θ(poly log n) when χ<sub>0</sub> ≥ β. In other cases, our transmission scheme shows advantages over [1] in delay performance of the primary network (PN) and over [2] in capacity of the secondary network (SN).","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2015.7288474","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We study the throughput and delay scaling laws of cognitive radio networks (CRN) with mobile primary and secondary users. They operate at the same time, space and share the spectrum. The primary users (PUs) have higher priority to access the spectrum while the secondary users (SUs) should access opportunistically. Furthermore, we consider a unique situation where both PUs and SUs move according to a General Heterogeneous Speed-restricted Mobility (GHSM) model. In this model, we define (h + 1) heterogeneous moving patterns using a universal set T ={Ti|0 ≥ i ≤ h, Ai = n-i χ0/h}, where Ai determines the moving area of each pattern. The set of primary (secondary) moving patterns T(p) (T(s)) is a randomly and independently selected subset of T. We assign n (nβ, where β > 1) primary (secondary) nodes to each moving pattern, and their initial positions are subject to a poisson point process. In addition, we have |T(p)|~|T(s)| = Θ1(h) = Θ(log n). By proposing a cooperative routing strategy, we fully utilize the mobility heterogeneity of primary and secondary users and achieve near-optimal throughput and delay performance of order Θ(poly log n) when χ0 ≥ β. In other cases, our transmission scheme shows advantages over [1] in delay performance of the primary network (PN) and over [2] in capacity of the secondary network (SN).
具有异构移动用户的认知无线网络的吞吐量和延迟缩放
研究了具有移动主用户和从用户的认知无线网络(CRN)的吞吐量和延迟缩放规律。它们同时运行,空间和共享频谱。主用户(pu)优先访问频谱,而从用户(su)优先访问频谱。此外,我们考虑了一种独特的情况,即pu和su都根据通用异构速度限制迁移(GHSM)模型移动。在该模型中,我们使用通用集T ={Ti|0≥i≤h, Ai = n-i χ0/h}定义(h + 1)个异构移动模式,其中Ai决定每个模式的移动面积。主(次)移动模式集合T(p) (T(s))是T的一个随机和独立选择的子集。我们为每个移动模式分配n (nβ,其中β > 1)主(次)节点,它们的初始位置服从泊松点过程。此外,我们有|T(p)|~|T(s)| = Θ1(h) = Θ(log n)。通过提出一种协作路由策略,我们充分利用了主、从用户的移动性异质性,当χ0≥β时,我们实现了Θ(poly log n)阶的近最优吞吐量和延迟性能。在其他情况下,我们的传输方案在主网络(PN)的延迟性能上优于[1],在从网络(SN)的容量上优于[2]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信