未知大小动态网络中的信道选择

Rohit Kumar, S. Darak
{"title":"未知大小动态网络中的信道选择","authors":"Rohit Kumar, S. Darak","doi":"10.1145/3288599.3299727","DOIUrl":null,"url":null,"abstract":"The dynamic spectrum access (DSA) algorithms aim to maximize network throughput by ensuring orthogonal channel allocation among secondary users (SUs) in cognitive radio network. Most of the existing DSA algorithms need prior knowledge of the number of active SUs and thus may not be suitable for battery operated resource constrained SU terminals in the infrastructure-less cognitive radio terminals. Another drawback of these algorithms is that they assume the static network with a fixed number of SUs in the network throughout the horizon and their extension for dynamic network in which SUs may enter or exit the network anytime is challenging. Thus, our goal is to design the DSA algorithms for the dynamic networks of unknown size.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Channel selection in dynamic networks of unknown size\",\"authors\":\"Rohit Kumar, S. Darak\",\"doi\":\"10.1145/3288599.3299727\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The dynamic spectrum access (DSA) algorithms aim to maximize network throughput by ensuring orthogonal channel allocation among secondary users (SUs) in cognitive radio network. Most of the existing DSA algorithms need prior knowledge of the number of active SUs and thus may not be suitable for battery operated resource constrained SU terminals in the infrastructure-less cognitive radio terminals. Another drawback of these algorithms is that they assume the static network with a fixed number of SUs in the network throughout the horizon and their extension for dynamic network in which SUs may enter or exit the network anytime is challenging. Thus, our goal is to design the DSA algorithms for the dynamic networks of unknown size.\",\"PeriodicalId\":346177,\"journal\":{\"name\":\"Proceedings of the 20th International Conference on Distributed Computing and Networking\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 20th International Conference on Distributed Computing and Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3288599.3299727\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 20th International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3288599.3299727","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在认知无线网络中,动态频谱接入(DSA)算法通过保证辅助用户间信道的正交分配来实现网络吞吐量的最大化。现有的大多数DSA算法需要事先知道活动单元的数量,因此可能不适合在无基础设施的认知无线电终端中使用电池供电的资源受限的单元终端。这些算法的另一个缺点是,它们假设在整个视界中具有固定数量的网络单元的静态网络,并且它们对动态网络中的单元可以随时进入或退出网络的扩展具有挑战性。因此,我们的目标是为未知大小的动态网络设计DSA算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Channel selection in dynamic networks of unknown size
The dynamic spectrum access (DSA) algorithms aim to maximize network throughput by ensuring orthogonal channel allocation among secondary users (SUs) in cognitive radio network. Most of the existing DSA algorithms need prior knowledge of the number of active SUs and thus may not be suitable for battery operated resource constrained SU terminals in the infrastructure-less cognitive radio terminals. Another drawback of these algorithms is that they assume the static network with a fixed number of SUs in the network throughout the horizon and their extension for dynamic network in which SUs may enter or exit the network anytime is challenging. Thus, our goal is to design the DSA algorithms for the dynamic networks of unknown size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improving efficacy of concurrent internal binary search trees using local recovery An accurate missing data prediction method using LSTM based deep learning for health care A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries EnTER: an encounter based trowbox deployment strategy for enhancing network reliability in post-disaster scenarios over DTN Exploration and impact of blockchain-enabled adaptive non-binary trust models
×
引用
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