Junyu Lin, Libo Feng, Jinli Wang, Fei Qiu, Bei Yu, Jing Cheng, Shaowen Yao
In the era of 5G, billions of terminal devices achieve global interconnection and intercommunication, which leads to the generation of massive data. However, the existing cloud-based data-sharing mechanism faces challenges such as sensitive information leakage and data islands, which makes it difficult to achieve secure sharing across domains. In this paper, the authors propose a fine-grained data-sharing scheme based on blockchain and ciphertext policy attribute-based encryption, and design a verifiable outsourced computation method to reduce the computational pressure of end users. Second, the authors comprehensively consider the user's identity privacy and transaction privacy, and propose a multi-level privacy protection method based on ring signature and garbled bloom filter, which enhance the user's data privacy and availability, and prevent the traceability of requests. Finally, the authors design a set of interconnected smart contracts, and verify that their scheme can achieve secure and efficient data sharing through security analysis and performance testing.
{"title":"FGDB-MLPP: A fine-grained data-sharing scheme with blockchain based on multi-level privacy protection","authors":"Junyu Lin, Libo Feng, Jinli Wang, Fei Qiu, Bei Yu, Jing Cheng, Shaowen Yao","doi":"10.1049/cmu2.12737","DOIUrl":"https://doi.org/10.1049/cmu2.12737","url":null,"abstract":"<p>In the era of 5G, billions of terminal devices achieve global interconnection and intercommunication, which leads to the generation of massive data. However, the existing cloud-based data-sharing mechanism faces challenges such as sensitive information leakage and data islands, which makes it difficult to achieve secure sharing across domains. In this paper, the authors propose a fine-grained data-sharing scheme based on blockchain and ciphertext policy attribute-based encryption, and design a verifiable outsourced computation method to reduce the computational pressure of end users. Second, the authors comprehensively consider the user's identity privacy and transaction privacy, and propose a multi-level privacy protection method based on ring signature and garbled bloom filter, which enhance the user's data privacy and availability, and prevent the traceability of requests. Finally, the authors design a set of interconnected smart contracts, and verify that their scheme can achieve secure and efficient data sharing through security analysis and performance testing.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 4","pages":"309-321"},"PeriodicalIF":1.6,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12737","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140063806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nowadays, the development of Artificial Intelligence of Things (AIoT) is advancing rapidly, and intelligent devices are increasingly exposed to more security risks on the network. Deep learning-based intrusion detection is an effective security defence approach. Federated learning (FL) is capable of enabling deep learning models to be trained on local clients without uploading their data to a central server. This paper proposes a novel federated learning aggregation algorithm called fed-dynamic gravitational search algorithm (Fed-DGSA), which incorporates the GSA algorithm to optimize the weight updating process of FL local models. During the updating process, the decay rate of the gravity coefficient is optimized and random perturbations and dynamic weights are introduced to ensure a more stable and efficient FL aggregation process. The experimental results show that the detection accuracy of Fed-DGSA has reached about 97.8%, and it is demonstrated that the model trained using Fed-DGSA achieves higher accuracy compared to Fed-Avg.
{"title":"A novel federated learning aggregation algorithm for AIoT intrusion detection","authors":"Yidong Jia, Fuhong Lin, Yan Sun","doi":"10.1049/cmu2.12744","DOIUrl":"10.1049/cmu2.12744","url":null,"abstract":"<p>Nowadays, the development of Artificial Intelligence of Things (AIoT) is advancing rapidly, and intelligent devices are increasingly exposed to more security risks on the network. Deep learning-based intrusion detection is an effective security defence approach. Federated learning (FL) is capable of enabling deep learning models to be trained on local clients without uploading their data to a central server. This paper proposes a novel federated learning aggregation algorithm called fed-dynamic gravitational search algorithm (Fed-DGSA), which incorporates the GSA algorithm to optimize the weight updating process of FL local models. During the updating process, the decay rate of the gravity coefficient is optimized and random perturbations and dynamic weights are introduced to ensure a more stable and efficient FL aggregation process. The experimental results show that the detection accuracy of Fed-DGSA has reached about 97.8%, and it is demonstrated that the model trained using Fed-DGSA achieves higher accuracy compared to Fed-Avg.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 7","pages":"429-436"},"PeriodicalIF":1.6,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12744","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140082479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A transmission power minimization problem for a reconfigurable intelligent surface (RIS) aided non-orthogonal multiple access (NOMA) network has been studied here, which has assumed the channel state information is imperfect. The channel error in this paper has been modeled as two different error models, that is, bounded error model and statistical error model. First, a two-step algorithm is proposed to decouple the decoding order and optimization variables under bounded error model. Then, for the statistical error model, the alternating optimization method is adopted to decouple optimization variables. Finally, the performance difference is compared between the proposed beamforming scheme and the non-RIS scheme from two key parameters, the number of reflected elements and the error factor. Simulation results verify that passive RIS has the advantage on the system performance compared with the scheme without RIS.
{"title":"Robust beamforming design for passive RIS-assisted NOMA systems","authors":"Fengming Yang, Weiran Guo, Jianxin Dai","doi":"10.1049/cmu2.12738","DOIUrl":"https://doi.org/10.1049/cmu2.12738","url":null,"abstract":"<p>A transmission power minimization problem for a reconfigurable intelligent surface (RIS) aided non-orthogonal multiple access (NOMA) network has been studied here, which has assumed the channel state information is imperfect. The channel error in this paper has been modeled as two different error models, that is, bounded error model and statistical error model. First, a two-step algorithm is proposed to decouple the decoding order and optimization variables under bounded error model. Then, for the statistical error model, the alternating optimization method is adopted to decouple optimization variables. Finally, the performance difference is compared between the proposed beamforming scheme and the non-RIS scheme from two key parameters, the number of reflected elements and the error factor. Simulation results verify that passive RIS has the advantage on the system performance compared with the scheme without RIS.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 4","pages":"322-331"},"PeriodicalIF":1.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12738","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140063853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The AIoT, with its artificial intelligence capabilities, can further enhance Device-to-Device (D2D) communication. Based on Non-Orthogonal Multiple Access (NOMA), D2D technology can effectively alleviate wireless spectrum resource pressure and improve the capacity of heterogeneous cellular networks. However, it also introduces significant system interference issues. In this paper, a resource allocation algorithm is proposed for the NOMA-D2D heterogeneous cellular network, based on a multi-agent deep reinforcement learning framework. Firstly, the algorithm allocates appropriate channels to D2D clusters. Then, the power allocation factors and D2D transmit power are jointly optimized to suppress the interference and improve the system performance. Simulation results show that both the channel allocation efficiency and the power control performance of the system can be significantly improved.
{"title":"A joint resource optimization allocation algorithm for NOMA-D2D communication","authors":"Jianli Xie, Lin Li, Cuiran Li","doi":"10.1049/cmu2.12741","DOIUrl":"10.1049/cmu2.12741","url":null,"abstract":"<p>The AIoT, with its artificial intelligence capabilities, can further enhance Device-to-Device (D2D) communication. Based on Non-Orthogonal Multiple Access (NOMA), D2D technology can effectively alleviate wireless spectrum resource pressure and improve the capacity of heterogeneous cellular networks. However, it also introduces significant system interference issues. In this paper, a resource allocation algorithm is proposed for the NOMA-D2D heterogeneous cellular network, based on a multi-agent deep reinforcement learning framework. Firstly, the algorithm allocates appropriate channels to D2D clusters. Then, the power allocation factors and D2D transmit power are jointly optimized to suppress the interference and improve the system performance. Simulation results show that both the channel allocation efficiency and the power control performance of the system can be significantly improved.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 6","pages":"398-408"},"PeriodicalIF":1.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12741","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140411757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ezekia Gilliard, Jinshuo Liu, Ahmed Abubakar Aliyu
In today's digital landscape, cybercriminals are constantly evolving their tactics, making it challenging for traditional cybersecurity methods to keep up. To address this issue, this study explores the potential of knowledge graph reasoning as a more adaptable and sophisticated approach to identify and counter network attacks. By leveraging graph structures imbued with human-like thinking, this method enhances the resilience of cybersecurity systems. The study focuses on three critical aspects: data preparation, semantic foundations, and knowledge graph inference techniques. Through an in-depth analysis of these components, the research aims to reveal how knowledge graph reasoning can improve cyberattack detection and enhance the overall efficacy of cybersecurity measures, including intrusion detection systems. The proposed approach has undergone extensive experimentation to validate its effectiveness compared to existing methods. The results of the experiment have shown a remarkable advancement in accuracy, speed, and recall for recognition, surpassing current methods. This achievement is a notable contribution in the realm of managing big data in cybersecurity. The study establishes a foundation for the automation of network attack detection, ultimately enhancing overall network security.
{"title":"Knowledge graph reasoning for cyber attack detection","authors":"Ezekia Gilliard, Jinshuo Liu, Ahmed Abubakar Aliyu","doi":"10.1049/cmu2.12736","DOIUrl":"https://doi.org/10.1049/cmu2.12736","url":null,"abstract":"<p>In today's digital landscape, cybercriminals are constantly evolving their tactics, making it challenging for traditional cybersecurity methods to keep up. To address this issue, this study explores the potential of knowledge graph reasoning as a more adaptable and sophisticated approach to identify and counter network attacks. By leveraging graph structures imbued with human-like thinking, this method enhances the resilience of cybersecurity systems. The study focuses on three critical aspects: data preparation, semantic foundations, and knowledge graph inference techniques. Through an in-depth analysis of these components, the research aims to reveal how knowledge graph reasoning can improve cyberattack detection and enhance the overall efficacy of cybersecurity measures, including intrusion detection systems. The proposed approach has undergone extensive experimentation to validate its effectiveness compared to existing methods. The results of the experiment have shown a remarkable advancement in accuracy, speed, and recall for recognition, surpassing current methods. This achievement is a notable contribution in the realm of managing big data in cybersecurity. The study establishes a foundation for the automation of network attack detection, ultimately enhancing overall network security.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 4","pages":"297-308"},"PeriodicalIF":1.6,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12736","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140063859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
At present, in order to conduct non-destructive testing on the grounding grid of substations under the condition of continuous power supply and no excavation, researchers have applied wireless technology based on electrochemical methods to remotely monitor the corrosion state of grounding conductors online. Nevertheless, wireless signals are affected by the environment when they are transmitted underground. In the field of grounding gird wireless monitoring, how to plan the information transmission path of wireless sensor network (WSN) with high accuracy of data transfer and low energy consumption earns growing research attention. To address the problem of WSN path planning in grounding grid area, a path planning method for WSN based on the hybrid algorithm of map-matching algorithm and double-pole search algorithm (MM-DPS) is proposed in this paper. The map-matching algorithm is employed to calculate the optimal sampling node number of the data transmission path. On the basis of the optimal sampling node number, the double-pole search algorithm is employed in seeking out each sensor node of the path, and two groups of path plans are obtained. In the simulation experiment, compared with the A-star algorithm, the MM-DPS algorithm shortens the data transmission path length by about 39% and reduces the energy consumption by about 57%. The research work brings a method to alleviate the problem of data transmission underground of WSN in grounding grid area. The method not only ensures the accuracy of data transmission, but also shorts the transmission distance and reduces energy consumption.
{"title":"Data transmission path planning method for wireless sensor network in grounding grid area based on MM-DPS hybrid algorithm","authors":"Xianghui Xiao, Longsheng Huang, Zhenshan Zhang, Mingxian Huang, Luchang Guan, Yunhao Song","doi":"10.1049/cmu2.12729","DOIUrl":"10.1049/cmu2.12729","url":null,"abstract":"<p>At present, in order to conduct non-destructive testing on the grounding grid of substations under the condition of continuous power supply and no excavation, researchers have applied wireless technology based on electrochemical methods to remotely monitor the corrosion state of grounding conductors online. Nevertheless, wireless signals are affected by the environment when they are transmitted underground. In the field of grounding gird wireless monitoring, how to plan the information transmission path of wireless sensor network (WSN) with high accuracy of data transfer and low energy consumption earns growing research attention. To address the problem of WSN path planning in grounding grid area, a path planning method for WSN based on the hybrid algorithm of map-matching algorithm and double-pole search algorithm (MM-DPS) is proposed in this paper. The map-matching algorithm is employed to calculate the optimal sampling node number of the data transmission path. On the basis of the optimal sampling node number, the double-pole search algorithm is employed in seeking out each sensor node of the path, and two groups of path plans are obtained. In the simulation experiment, compared with the A-star algorithm, the MM-DPS algorithm shortens the data transmission path length by about 39% and reduces the energy consumption by about 57%. The research work brings a method to alleviate the problem of data transmission underground of WSN in grounding grid area. The method not only ensures the accuracy of data transmission, but also shorts the transmission distance and reduces energy consumption.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 4","pages":"271-282"},"PeriodicalIF":1.6,"publicationDate":"2024-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12729","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139802391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jing Zhang, Chu-Long Liang, Hong-Xu Gao, Yan He, Hong-Bo Zhu
Opportunistic spectrum access (OSA), a promising technology to resolve radio spectrum scarcity, is still faced with some challenges, of which one is potentially frequent channel handoff (CH) even handoff blocking (HB) for secondary user (SU) to avoid primary user (PU). Reaccess is a direct way to resolve HB. However, multiple handoff blocking-then-reaccess (H-BTR) are time consuming. Whether it is worthwhile to make multiple H-BTR, is an interesting but hardly mentioned issue. To this end, the multiple H-BTR-based OSA are focused on here. Three key indices, the average transmission probability, handoff delay, and average reaccess times of SU in the H-BTR-based OSA, are deduced as close form first. Then, the effects of H-BTR frequency and service traffic rate of SU on OSA are discussed. Finally, the H-BTR-based OSA is compared to two other schemes, the handoff without BTR (HWBTR)-based OSA and the stop-and-waiting (SW)-based OSA. Theoretical and simulated results show that the H-BTR-based OSA performs best among three schemes. Making H-BTR in moderate frequency according to service traffic rate can increase transmission opportunity while additional delay of SU is tolerable, thus the performance of OSA can be well improved.
机会性频谱接入(OSA)是解决无线电频谱稀缺问题的一项前景广阔的技术,但它仍然面临着一些挑战,其中之一就是次级用户(SU)为避开主用户(PU)而可能频繁进行信道切换(CH)甚至切换阻塞(HB)。重新接入是解决 HB 的直接方法。然而,多次切换阻塞-重接入(H-BTR)非常耗时。是否值得进行多次 H-BTR 是一个有趣但很少被提及的问题。为此,本文重点讨论了基于多重 H-BTR 的 OSA。首先推导出基于 H-BTR 的 OSA 中 SU 的平均传输概率、切换延迟和平均再访问时间这三个关键指标的近似形式。然后,讨论了 H-BTR 频率和 SU 的服务流量率对 OSA 的影响。最后,比较了基于 H-BTR 的 OSA 和其他两种方案,即基于无 BTR 移交(HWBTR)的 OSA 和基于停止等待(SW)的 OSA。理论和模拟结果表明,基于 H-BTR 的 OSA 在三种方案中表现最佳。根据服务流量速率以适度频率进行 H-BTR 可以增加传输机会,同时 SU 的额外延迟是可容忍的,因此 OSA 的性能可以得到很好的改善。
{"title":"On multiple handoff blocking-then-reaccess for opportunistic spectrum access","authors":"Jing Zhang, Chu-Long Liang, Hong-Xu Gao, Yan He, Hong-Bo Zhu","doi":"10.1049/cmu2.12733","DOIUrl":"10.1049/cmu2.12733","url":null,"abstract":"<p>Opportunistic spectrum access (OSA), a promising technology to resolve radio spectrum scarcity, is still faced with some challenges, of which one is potentially frequent channel handoff (CH) even handoff blocking (HB) for secondary user (SU) to avoid primary user (PU). Reaccess is a direct way to resolve HB. However, multiple handoff blocking-then-reaccess (H-BTR) are time consuming. Whether it is worthwhile to make multiple H-BTR, is an interesting but hardly mentioned issue. To this end, the multiple H-BTR-based OSA are focused on here. Three key indices, the average transmission probability, handoff delay, and average reaccess times of SU in the H-BTR-based OSA, are deduced as close form first. Then, the effects of H-BTR frequency and service traffic rate of SU on OSA are discussed. Finally, the H-BTR-based OSA is compared to two other schemes, the handoff without BTR (HWBTR)-based OSA and the stop-and-waiting (SW)-based OSA. Theoretical and simulated results show that the H-BTR-based OSA performs best among three schemes. Making H-BTR in moderate frequency according to service traffic rate can increase transmission opportunity while additional delay of SU is tolerable, thus the performance of OSA can be well improved.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 4","pages":"283-296"},"PeriodicalIF":1.6,"publicationDate":"2024-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12733","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139808165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sybil attacks are a very serious challenge in social networks including, the Social Internet of Things (SIoT). This paper introduces the SybilPSIoT method, in which a hybrid prevention and detection decentralized approach is proposed in SIoT based on smart contracts. The owner adds his objects to the smart contract. However, hostile owners can create Sybil things. This paper formally presents a model that uses a signed SIoT network with objects and identifiers as network nodes and information about the type of nodes (acknowledgers). Assuming the relationship between the edge marks between nodes and the node type, the proposed method uses trust paths between verification and desired nodes using a Bayesian inference model and structural balance patterns to judge the target node in these paths. It also uses game theory to control access owners to prevent Sybil from creating new things based on a cost-benefit function. Based on the analysis method, a validating effect proportional to the path length on the target object was presented. This method was compared with the most novel available methods; the results from this comparison depict the scalability and effectiveness of the proposed method for large networks.
{"title":"SybilPSIoT: Preventing Sybil attacks in signed social internet of things based on web of trust and smart contract","authors":"Aboulfazl Dayyani, Maghsoud Abbaspour","doi":"10.1049/cmu2.12734","DOIUrl":"https://doi.org/10.1049/cmu2.12734","url":null,"abstract":"<p>Sybil attacks are a very serious challenge in social networks including, the Social Internet of Things (SIoT). This paper introduces the SybilPSIoT method, in which a hybrid prevention and detection decentralized approach is proposed in SIoT based on smart contracts. The owner adds his objects to the smart contract. However, hostile owners can create Sybil things. This paper formally presents a model that uses a signed SIoT network with objects and identifiers as network nodes and information about the type of nodes (acknowledgers). Assuming the relationship between the edge marks between nodes and the node type, the proposed method uses trust paths between verification and desired nodes using a Bayesian inference model and structural balance patterns to judge the target node in these paths. It also uses game theory to control access owners to prevent Sybil from creating new things based on a cost-benefit function. Based on the analysis method, a validating effect proportional to the path length on the target object was presented. This method was compared with the most novel available methods; the results from this comparison depict the scalability and effectiveness of the proposed method for large networks.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 3","pages":"258-269"},"PeriodicalIF":1.6,"publicationDate":"2024-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12734","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139732270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Today, elastic optical networks (EONs) are required to accommodate traffic with different service priorities. For example, mission-critical applications such as industrial internet, smart grids, and remote surgery require an ultra-reliable low-latency communication system. The novel impairment-aware resource allocation scheme proposed here prioritises traffic. It satisfies the quality and latency requirements of mission-critical traffic while causing minimum disruptions to other forms of low-priority traffic connections. The results obtained for 6-node and 14-node networks under various traffic distribution environments indicate that the proposed algorithm achieves higher spectral efficiency, reduces spectrum fragmentation, and causes minimal disruptions over the benchmark algorithm.
{"title":"Impairment-aware resource allocation scheme for elastic optical networks with different service priorities","authors":"Kusala Munasinghe, Nishan Dharmaweera, Chamitha de Alwis, Uditha Wijewardhana, Rajendran Parthiban","doi":"10.1049/cmu2.12702","DOIUrl":"https://doi.org/10.1049/cmu2.12702","url":null,"abstract":"<p>Today, elastic optical networks (EONs) are required to accommodate traffic with different service priorities. For example, mission-critical applications such as industrial internet, smart grids, and remote surgery require an ultra-reliable low-latency communication system. The novel impairment-aware resource allocation scheme proposed here prioritises traffic. It satisfies the quality and latency requirements of mission-critical traffic while causing minimum disruptions to other forms of low-priority traffic connections. The results obtained for 6-node and 14-node networks under various traffic distribution environments indicate that the proposed algorithm achieves higher spectral efficiency, reduces spectrum fragmentation, and causes minimal disruptions over the benchmark algorithm.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 3","pages":"197-213"},"PeriodicalIF":1.6,"publicationDate":"2024-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12702","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139732404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the continuous evolution and in-depth integration between wireless communication and emerging technology such as internet of things (IoT), artificial intelligence (AI) etc., wireless terminals are growing exponentially, thus bringing great challenges to available spectrum resources. The contradiction between unlimited frequency needs and limited spectrum resources has become a bottleneck restricting the development of wireless communication technology. As an efficient way to improve spectrum efficiency, cognitive radio (CR) continues to be the focus of wireless communication within decades. To conduct CR, the main procedure is the discovery of available spectral holes by periodically monitoring the target authorized band, namely spectrum sensing (SS). Energy detector (ED) is widely accepted for SS due to its low complexity and high convenience. The essence of traditional ED based SS schemes consist in the adaptive variation of sensing threshold/sampling point with environmental signal-to-noise ratio (SNR) at the receiver of CR terminal, namely adaptive sensing threshold/sampling point based SS. However, the performance of both adaptive sensing threshold and adaptive sampling point based SS schemes are always at the expense of computation complexity due to the excessive sampling point. In addition, these two schemes are both about the optimization issue of a single variable under constraints. Actually, both detection probability and false alarm probability of ED are a two-dimensional function of sensing threshold and sampling point for a given SNR. The optimal solution of sensing performance can not be obtained by optimizing sensing threshold or sampling point alone. Motivated by these, the joint optimization of sampling point and sensing threshold is considered for SS in this paper, where sampling point and sensing threshold are jointly adaptive with the variation of environmental SNR. In addition, Q-learning is considered in this paper to obtain the sub-optimal solution due to the non-convexity of the considered optimization problem. Finally, the simulation experiments are made and the results validate the effectiveness of the proposed scheme.
随着无线通信与物联网、人工智能等新兴技术的不断演进和深度融合,无线终端呈指数级增长,给可用频谱资源带来巨大挑战。无限的频率需求与有限的频谱资源之间的矛盾已成为制约无线通信技术发展的瓶颈。作为提高频谱效率的有效途径,认知无线电(CR)在几十年内仍是无线通信领域的焦点。开展认知无线电通信的主要程序是通过定期监测目标授权频段来发现可用的频谱空洞,即频谱感知(SS)。能量探测器(ED)因其低复杂性和高便利性而被广泛用于频谱感测。传统的基于 ED 的频谱感知方案的精髓在于随着 CR 终端接收器的环境信噪比(SNR)而自适应地改变感知阈值/采样点,即基于自适应感知阈值/采样点的频谱感知。然而,基于自适应感应阈值和自适应采样点的 SS 方案的性能总是以采样点过多导致的计算复杂度为代价。此外,这两种方案都涉及约束条件下单一变量的优化问题。实际上,在给定信噪比下,ED 的检测概率和误报概率都是感测阈值和采样点的二维函数。仅优化感测阈值或采样点无法获得感测性能的最优解。受此启发,本文考虑对 SS 进行采样点和传感阈值的联合优化,其中采样点和传感阈值随环境 SNR 的变化而联合自适应。此外,由于所考虑的优化问题具有非凸性,本文还考虑了 Q-learning 来获得次优解。最后,本文进行了仿真实验,结果验证了所提方案的有效性。
{"title":"Joint optimization of sampling point and sensing threshold for spectrum sensing","authors":"Yuebo Li, Wenjiang Ouyang, Jiawu Miao, Junsheng Mu, Xiaojun Jing","doi":"10.1049/cmu2.12730","DOIUrl":"https://doi.org/10.1049/cmu2.12730","url":null,"abstract":"<p>With the continuous evolution and in-depth integration between wireless communication and emerging technology such as internet of things (IoT), artificial intelligence (AI) etc., wireless terminals are growing exponentially, thus bringing great challenges to available spectrum resources. The contradiction between unlimited frequency needs and limited spectrum resources has become a bottleneck restricting the development of wireless communication technology. As an efficient way to improve spectrum efficiency, cognitive radio (CR) continues to be the focus of wireless communication within decades. To conduct CR, the main procedure is the discovery of available spectral holes by periodically monitoring the target authorized band, namely spectrum sensing (SS). Energy detector (ED) is widely accepted for SS due to its low complexity and high convenience. The essence of traditional ED based SS schemes consist in the adaptive variation of sensing threshold/sampling point with environmental signal-to-noise ratio (SNR) at the receiver of CR terminal, namely adaptive sensing threshold/sampling point based SS. However, the performance of both adaptive sensing threshold and adaptive sampling point based SS schemes are always at the expense of computation complexity due to the excessive sampling point. In addition, these two schemes are both about the optimization issue of a single variable under constraints. Actually, both detection probability and false alarm probability of ED are a two-dimensional function of sensing threshold and sampling point for a given SNR. The optimal solution of sensing performance can not be obtained by optimizing sensing threshold or sampling point alone. Motivated by these, the joint optimization of sampling point and sensing threshold is considered for SS in this paper, where sampling point and sensing threshold are jointly adaptive with the variation of environmental SNR. In addition, Q-learning is considered in this paper to obtain the sub-optimal solution due to the non-convexity of the considered optimization problem. Finally, the simulation experiments are made and the results validate the effectiveness of the proposed scheme.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 3","pages":"235-247"},"PeriodicalIF":1.6,"publicationDate":"2024-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12730","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139732405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}