认知无线网络MTTR下界与同步-非对称信道跳频序列的构造

2018 3rd International Conference on Computer and Communication Systems (ICCCS) Pub Date : 2018-04-01 DOI:10.1109/CCOMS.2018.8463323

Ming-hsuan Chiang, Guu-chang Yang, Yu-Chei Lin, Sheng-Hao Huang, Min-Kuan Chang, W. Kwong

{"title":"认知无线网络MTTR下界与同步-非对称信道跳频序列的构造","authors":"Ming-hsuan Chiang, Guu-chang Yang, Yu-Chei Lin, Sheng-Hao Huang, Min-Kuan Chang, W. Kwong","doi":"10.1109/CCOMS.2018.8463323","DOIUrl":null,"url":null,"abstract":"In this paper, a family of synchronous-asymmetric channel-hopping (CH) sequences for cognitive radio (CR) networks is constructed and their maximum-time-to-rendezvous (MTTR) lower bound is derived. The new sequences achieve full degree-of-rendezvous and optimal MTTR. They also have the unique property of enlarging cardinality without scarifying the MTTR. Their rendezvous-success (RS) rate and MTTR are compared with prior works. This family provides a flexible choice of CH sequences that have adjustable cardinality and RS rate for the CR networks with variable QoS.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"MTTR Lower Bound and Construction of Synchronous-Asymmetric Channel-Hopping Sequences for Cognitive Radio Networks\",\"authors\":\"Ming-hsuan Chiang, Guu-chang Yang, Yu-Chei Lin, Sheng-Hao Huang, Min-Kuan Chang, W. Kwong\",\"doi\":\"10.1109/CCOMS.2018.8463323\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a family of synchronous-asymmetric channel-hopping (CH) sequences for cognitive radio (CR) networks is constructed and their maximum-time-to-rendezvous (MTTR) lower bound is derived. The new sequences achieve full degree-of-rendezvous and optimal MTTR. They also have the unique property of enlarging cardinality without scarifying the MTTR. Their rendezvous-success (RS) rate and MTTR are compared with prior works. This family provides a flexible choice of CH sequences that have adjustable cardinality and RS rate for the CR networks with variable QoS.\",\"PeriodicalId\":405664,\"journal\":{\"name\":\"2018 3rd International Conference on Computer and Communication Systems (ICCCS)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 3rd International Conference on Computer and Communication Systems (ICCCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCOMS.2018.8463323\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCOMS.2018.8463323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

本文构造了一类用于认知无线电网络的同步-非对称跳频序列，并推导了它们的最大交会时间下界。新序列实现了全交会度和最佳MTTR。它们还具有在不破坏MTTR的情况下扩大基数的独特性质。比较了他们的约会成功率和MTTR。该系列为具有可变QoS的CR网络提供了具有可调基数和RS率的灵活选择的CH序列。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

MTTR Lower Bound and Construction of Synchronous-Asymmetric Channel-Hopping Sequences for Cognitive Radio Networks

In this paper, a family of synchronous-asymmetric channel-hopping (CH) sequences for cognitive radio (CR) networks is constructed and their maximum-time-to-rendezvous (MTTR) lower bound is derived. The new sequences achieve full degree-of-rendezvous and optimal MTTR. They also have the unique property of enlarging cardinality without scarifying the MTTR. Their rendezvous-success (RS) rate and MTTR are compared with prior works. This family provides a flexible choice of CH sequences that have adjustable cardinality and RS rate for the CR networks with variable QoS.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 3rd International Conference on Computer and Communication Systems (ICCCS)

自引率

0.00%

发文量