基于喷泉码和协同干扰的协同认知网络拦截概率分析

Q2 Engineering
Tran Trung Duy, Le Chu Khan, N. Binh, Nguyen Luong Nhat
{"title":"基于喷泉码和协同干扰的协同认知网络拦截概率分析","authors":"Tran Trung Duy, Le Chu Khan, N. Binh, Nguyen Luong Nhat","doi":"10.4108/EAI.26-1-2021.168229","DOIUrl":null,"url":null,"abstract":"This paper evaluates intercept probability (IP) of a cooperative cognitive radio network. Using Fountain codes, a secondary source continuously generates encoded packets, and sends them to secondary destination and relay nodes that attempt to receive a sufficient number of the encoded packets for recovering the source data. If the relay can sufficiently collect the packets before the destination, it replaces the source to transmit the encoded packets to the destination. Also in the secondary network, a passive eavesdropper attempts to illegally receive the packets sent by the source and relay nodes, and if it can accumulate enough encoded packets, the source data is intercepted. To enhance secrecy performance, in terms of IP, a cooperative jammer is used to transmit noises on the eavesdropper. We also propose a simple transmit power allocation method for the secondary transmitters such as source, relay and jammer so that outage performance of a primary network is not harmful. We derive an exact closed-form expression of IP over Rayleigh fading channel, and verify it by performing Monte-Carlo simulations. Received on 23 December 2020; accepted on 22 January 2021; published on 26 January 2021","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Intercept Probability Analysis of Cooperative Cognitive Networks Using Fountain Codes and Cooperative Jamming\",\"authors\":\"Tran Trung Duy, Le Chu Khan, N. Binh, Nguyen Luong Nhat\",\"doi\":\"10.4108/EAI.26-1-2021.168229\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper evaluates intercept probability (IP) of a cooperative cognitive radio network. Using Fountain codes, a secondary source continuously generates encoded packets, and sends them to secondary destination and relay nodes that attempt to receive a sufficient number of the encoded packets for recovering the source data. If the relay can sufficiently collect the packets before the destination, it replaces the source to transmit the encoded packets to the destination. Also in the secondary network, a passive eavesdropper attempts to illegally receive the packets sent by the source and relay nodes, and if it can accumulate enough encoded packets, the source data is intercepted. To enhance secrecy performance, in terms of IP, a cooperative jammer is used to transmit noises on the eavesdropper. We also propose a simple transmit power allocation method for the secondary transmitters such as source, relay and jammer so that outage performance of a primary network is not harmful. We derive an exact closed-form expression of IP over Rayleigh fading channel, and verify it by performing Monte-Carlo simulations. Received on 23 December 2020; accepted on 22 January 2021; published on 26 January 2021\",\"PeriodicalId\":33474,\"journal\":{\"name\":\"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4108/EAI.26-1-2021.168229\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/EAI.26-1-2021.168229","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 8

摘要

本文对协同认知无线网络的截获概率(IP)进行了评估。使用喷泉码,辅助源不断生成编码数据包,并将它们发送到辅助目的地和中继节点,这些节点试图接收足够数量的编码数据包以恢复源数据。如果中继可以在目的地之前充分收集数据包,它就取代源将编码的数据包传输到目的地。在二级网络中,被动窃听者试图非法接收源节点和中继节点发送的数据包,如果它能积累足够的编码数据包,源数据就会被截获。为了提高保密性能,在IP方面,采用协同干扰器在窃听器上传输噪声。我们还提出了一种简单的二次发射机(如源、中继和干扰机)的发射功率分配方法,使主网络的中断性能不会受到损害。我们推导了瑞利衰落信道上IP的精确封闭表达式,并通过蒙特卡罗仿真验证了它的正确性。2020年12月23日收到;2021年1月22日接受;于2021年1月26日发布
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Intercept Probability Analysis of Cooperative Cognitive Networks Using Fountain Codes and Cooperative Jamming
This paper evaluates intercept probability (IP) of a cooperative cognitive radio network. Using Fountain codes, a secondary source continuously generates encoded packets, and sends them to secondary destination and relay nodes that attempt to receive a sufficient number of the encoded packets for recovering the source data. If the relay can sufficiently collect the packets before the destination, it replaces the source to transmit the encoded packets to the destination. Also in the secondary network, a passive eavesdropper attempts to illegally receive the packets sent by the source and relay nodes, and if it can accumulate enough encoded packets, the source data is intercepted. To enhance secrecy performance, in terms of IP, a cooperative jammer is used to transmit noises on the eavesdropper. We also propose a simple transmit power allocation method for the secondary transmitters such as source, relay and jammer so that outage performance of a primary network is not harmful. We derive an exact closed-form expression of IP over Rayleigh fading channel, and verify it by performing Monte-Carlo simulations. Received on 23 December 2020; accepted on 22 January 2021; published on 26 January 2021
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.00
自引率
0.00%
发文量
15
审稿时长
10 weeks
×
引用
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学术官方微信