基于TCIPC的隐蔽通信网络中多干扰者与多守卫者的关联问题

IF 0.5 Q4 TELECOMMUNICATIONS
Fanfeng Shi, Xinfeng Zhu
{"title":"基于TCIPC的隐蔽通信网络中多干扰者与多守卫者的关联问题","authors":"Fanfeng Shi,&nbsp;Xinfeng Zhu","doi":"10.1002/itl2.70049","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Network survivability refers to the capability of the networks to maintain a guaranteed quality of service (QoS) in the presence of malicious attacks and node failures. The covert wireless communication (CWC) technique can improve the survivability of wireless Internet of Things (IoT) networks by hiding the desired signals in background noises. In this paper, the CWC scheme for the multiple jammers and multiple wardens networks is investigated, where the truncated channel inversion power control (TCIPC) is applied. The outage probability is utilized to evaluate the communication effectiveness, and the detection error probability (DEP) is used to evaluate the covertness. Then, the association problem between the multiple jammers and the multiple wardens is studied. The optimal association problem is formulated as a min-max integer programming problem to minimize the outage probability between Alice and Bob, subject to the DEP constraints, which are hard to solve. It is demonstrated that the genetic algorithm is a valid method to solve the proposed min-max integer programming problem, and the performances are analyzed.</p>\n </div>","PeriodicalId":100725,"journal":{"name":"Internet Technology Letters","volume":"8 4","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2025-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Association Problem Between Multiple Jammers and Multiple Wardens in Covert Communication Networks With TCIPC\",\"authors\":\"Fanfeng Shi,&nbsp;Xinfeng Zhu\",\"doi\":\"10.1002/itl2.70049\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>Network survivability refers to the capability of the networks to maintain a guaranteed quality of service (QoS) in the presence of malicious attacks and node failures. The covert wireless communication (CWC) technique can improve the survivability of wireless Internet of Things (IoT) networks by hiding the desired signals in background noises. In this paper, the CWC scheme for the multiple jammers and multiple wardens networks is investigated, where the truncated channel inversion power control (TCIPC) is applied. The outage probability is utilized to evaluate the communication effectiveness, and the detection error probability (DEP) is used to evaluate the covertness. Then, the association problem between the multiple jammers and the multiple wardens is studied. The optimal association problem is formulated as a min-max integer programming problem to minimize the outage probability between Alice and Bob, subject to the DEP constraints, which are hard to solve. It is demonstrated that the genetic algorithm is a valid method to solve the proposed min-max integer programming problem, and the performances are analyzed.</p>\\n </div>\",\"PeriodicalId\":100725,\"journal\":{\"name\":\"Internet Technology Letters\",\"volume\":\"8 4\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2025-05-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Internet Technology Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/itl2.70049\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Internet Technology Letters","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/itl2.70049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

网络生存性是指网络在存在恶意攻击和节点故障的情况下保持有保证的服务质量(QoS)的能力。隐蔽无线通信(CWC)技术通过将所需信号隐藏在背景噪声中,提高了无线物联网(IoT)网络的生存性。本文研究了多干扰器和多看守器网络中的CWC方案,该方案采用截断信道反转功率控制(TCIPC)。用中断概率评估通信有效性,用检测错误概率(DEP)评估通信的隐蔽性。然后,研究了多干扰机与多监守之间的关联问题。最优关联问题被表述为最小化Alice和Bob之间的中断概率的最小-最大整数规划问题,该问题受DEP约束,难以求解。结果表明,遗传算法是求解最小-最大整数规划问题的有效方法,并对遗传算法的性能进行了分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Association Problem Between Multiple Jammers and Multiple Wardens in Covert Communication Networks With TCIPC

Network survivability refers to the capability of the networks to maintain a guaranteed quality of service (QoS) in the presence of malicious attacks and node failures. The covert wireless communication (CWC) technique can improve the survivability of wireless Internet of Things (IoT) networks by hiding the desired signals in background noises. In this paper, the CWC scheme for the multiple jammers and multiple wardens networks is investigated, where the truncated channel inversion power control (TCIPC) is applied. The outage probability is utilized to evaluate the communication effectiveness, and the detection error probability (DEP) is used to evaluate the covertness. Then, the association problem between the multiple jammers and the multiple wardens is studied. The optimal association problem is formulated as a min-max integer programming problem to minimize the outage probability between Alice and Bob, subject to the DEP constraints, which are hard to solve. It is demonstrated that the genetic algorithm is a valid method to solve the proposed min-max integer programming problem, and the performances are analyzed.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
3.10
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信