一种具有自干扰抑制能力的认知无线网络路由方案

Rawan F. El Khatib, H. Salameh
{"title":"一种具有自干扰抑制能力的认知无线网络路由方案","authors":"Rawan F. El Khatib, H. Salameh","doi":"10.1109/SDS.2017.7939135","DOIUrl":null,"url":null,"abstract":"In this work, we investigate the routing and channel assignment problem in Self-Interference Suppression (SIS)-enabled CRNs, where FD communication is possible. Specifically, we propose a novel metric called “Path Capacity” that reflects the number of links that can be simultaneously activated across a given path while using the minimum possible spectrum resources. Accordingly, we develop a novel routing scheme that selects the best path along with the channel assignment such that the highest capacity is achieved. We analytically formulate the routing problem as a route selection and channel assignment optimization, with the objective of minimizing the required number of distinct channels for each CR source-destination pair. We show that the optimization problem is a Binary Quadratic Programming (BQP) problem, which is, in general, NP-hard. Accordingly, we present a sequential fixing procedure that provides a near-optimal solution. Simulation results are provided, which show that a careful routing and channel assignment in SIS-enabled CRNs can significantly improve network performance.","PeriodicalId":326125,"journal":{"name":"2017 Fourth International Conference on Software Defined Systems (SDS)","volume":"76 10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A routing scheme for Cognitive Radio networks with Self-Interference Suppression capabilities\",\"authors\":\"Rawan F. El Khatib, H. Salameh\",\"doi\":\"10.1109/SDS.2017.7939135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we investigate the routing and channel assignment problem in Self-Interference Suppression (SIS)-enabled CRNs, where FD communication is possible. Specifically, we propose a novel metric called “Path Capacity” that reflects the number of links that can be simultaneously activated across a given path while using the minimum possible spectrum resources. Accordingly, we develop a novel routing scheme that selects the best path along with the channel assignment such that the highest capacity is achieved. We analytically formulate the routing problem as a route selection and channel assignment optimization, with the objective of minimizing the required number of distinct channels for each CR source-destination pair. We show that the optimization problem is a Binary Quadratic Programming (BQP) problem, which is, in general, NP-hard. Accordingly, we present a sequential fixing procedure that provides a near-optimal solution. Simulation results are provided, which show that a careful routing and channel assignment in SIS-enabled CRNs can significantly improve network performance.\",\"PeriodicalId\":326125,\"journal\":{\"name\":\"2017 Fourth International Conference on Software Defined Systems (SDS)\",\"volume\":\"76 10\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Fourth International Conference on Software Defined Systems (SDS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SDS.2017.7939135\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Fourth International Conference on Software Defined Systems (SDS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SDS.2017.7939135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

在这项工作中,我们研究了自干扰抑制(SIS)启用crn中的路由和信道分配问题,其中FD通信是可能的。具体来说,我们提出了一种称为“路径容量”的新度量,它反映了在使用最小可能的频谱资源的情况下,可以在给定路径上同时激活的链路数量。因此,我们开发了一种新的路由方案,该方案根据信道分配选择最佳路径,从而实现最高容量。我们将路由问题解析为路由选择和信道分配优化,其目标是最小化每个CR源-目的地对所需的不同信道数量。我们证明了优化问题是一个二元二次规划(BQP)问题,一般来说,它是np困难的。因此,我们提出了一个提供接近最优解的顺序固定过程。仿真结果表明,在启用sis的crn中,仔细的路由和信道分配可以显著提高网络性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A routing scheme for Cognitive Radio networks with Self-Interference Suppression capabilities
In this work, we investigate the routing and channel assignment problem in Self-Interference Suppression (SIS)-enabled CRNs, where FD communication is possible. Specifically, we propose a novel metric called “Path Capacity” that reflects the number of links that can be simultaneously activated across a given path while using the minimum possible spectrum resources. Accordingly, we develop a novel routing scheme that selects the best path along with the channel assignment such that the highest capacity is achieved. We analytically formulate the routing problem as a route selection and channel assignment optimization, with the objective of minimizing the required number of distinct channels for each CR source-destination pair. We show that the optimization problem is a Binary Quadratic Programming (BQP) problem, which is, in general, NP-hard. Accordingly, we present a sequential fixing procedure that provides a near-optimal solution. Simulation results are provided, which show that a careful routing and channel assignment in SIS-enabled CRNs can significantly improve network performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信