流量交叉环境下认知多跳网络的资源控制

Shuta Kako, T. Fujii, O. Takyu
{"title":"流量交叉环境下认知多跳网络的资源控制","authors":"Shuta Kako, T. Fujii, O. Takyu","doi":"10.1109/PerComW.2013.6529537","DOIUrl":null,"url":null,"abstract":"In this paper, we have proposed secondary user (SU) resource assignment algorithm for a multi-hop cognitive radio network to improve end-to-end latency. In the multihop networks for spectrum sharing, a traffic-cross, in which multiple flows are crossed each other, degrades the throughput due to appearing high traffic and shortage resource area. However each SU has to protect the flow of primary users (PU). To overcome this problem, we have set the PU acceptable received power which is decided by the acknowledgment (ACK) power from PU receiver to each SU user. From this information, we analyzed the performance of the proposed algorithm to minimize the end-to-end delay of SU multi-hop flow considering PU acceptable interference power by optimizing SU transmit power, where Lagrangian duality based technique has been utilized to solve the optimization problem and effective allocate the power for each SU users.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Resource control for cognitive multi-hop network in traffic cross environment\",\"authors\":\"Shuta Kako, T. Fujii, O. Takyu\",\"doi\":\"10.1109/PerComW.2013.6529537\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we have proposed secondary user (SU) resource assignment algorithm for a multi-hop cognitive radio network to improve end-to-end latency. In the multihop networks for spectrum sharing, a traffic-cross, in which multiple flows are crossed each other, degrades the throughput due to appearing high traffic and shortage resource area. However each SU has to protect the flow of primary users (PU). To overcome this problem, we have set the PU acceptable received power which is decided by the acknowledgment (ACK) power from PU receiver to each SU user. From this information, we analyzed the performance of the proposed algorithm to minimize the end-to-end delay of SU multi-hop flow considering PU acceptable interference power by optimizing SU transmit power, where Lagrangian duality based technique has been utilized to solve the optimization problem and effective allocate the power for each SU users.\",\"PeriodicalId\":101502,\"journal\":{\"name\":\"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PerComW.2013.6529537\",\"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 International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PerComW.2013.6529537","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种多跳认知无线网络的辅助用户资源分配算法,以改善端到端延迟。在频谱共享的多跳网络中,由于多个流相互交叉,导致流量大,资源面积不足,从而降低了吞吐量。但是,每个SU都必须保护主用户(PU)的流。为了克服这个问题,我们设置了PU可接受的接收功率,该功率由PU接收器向每个SU用户的确认(ACK)功率决定。在此基础上,通过优化SU发射功率,分析了该算法在考虑PU可接受的干扰功率的情况下最小化SU多跳流端到端延迟的性能,并利用基于拉格朗日对偶的技术解决了优化问题,有效地为每个SU用户分配了功率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Resource control for cognitive multi-hop network in traffic cross environment
In this paper, we have proposed secondary user (SU) resource assignment algorithm for a multi-hop cognitive radio network to improve end-to-end latency. In the multihop networks for spectrum sharing, a traffic-cross, in which multiple flows are crossed each other, degrades the throughput due to appearing high traffic and shortage resource area. However each SU has to protect the flow of primary users (PU). To overcome this problem, we have set the PU acceptable received power which is decided by the acknowledgment (ACK) power from PU receiver to each SU user. From this information, we analyzed the performance of the proposed algorithm to minimize the end-to-end delay of SU multi-hop flow considering PU acceptable interference power by optimizing SU transmit power, where Lagrangian duality based technique has been utilized to solve the optimization problem and effective allocate the power for each SU users.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A reconfigurable distributed CEP middleware for diverse mobility scenarios TinyBox: Social, local, mobile content sharing PIggy-backed key exchange using online services (PIKE) Towards context-aware internet services with unselfish clients Recommendations-based location privacy control
×
引用
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