IET Communications最新文献

筛选
英文 中文
A RIS-Based Single-Channel Direction-of-Arrival Estimation Method for Communication Signals 基于ris的单通道通信信号到达方向估计方法
IF 1.5 4区 计算机科学
IET Communications Pub Date : 2025-02-17 DOI: 10.1049/cmu2.70012
Keming Ma, Qinlong Li, Kaizhi Huang, Ming Yi, Liang Jin
{"title":"A RIS-Based Single-Channel Direction-of-Arrival Estimation Method for Communication Signals","authors":"Keming Ma,&nbsp;Qinlong Li,&nbsp;Kaizhi Huang,&nbsp;Ming Yi,&nbsp;Liang Jin","doi":"10.1049/cmu2.70012","DOIUrl":"https://doi.org/10.1049/cmu2.70012","url":null,"abstract":"<p>The development of reconfigurable intelligent surface (RIS) makes direction-of-arrival (DOA) estimation possible for single-antenna receivers. However, non-ideal situations such as spectral aliasing occur when facing communication signals using orthogonal frequency division multiplexing modulation. This paper proposes a RIS-based single-channel DOA estimation method for communication signals. Specifically, by extending the time intervals to dynamically reduce the RIS state change rate, a real-time DOA estimation is achieved while mitigating the impact of non-ideal spectral shifts on communication. Then, based on the compressed sensing and mutual incoherence property, the method exploits the sparse property of the signal in space to reduce the estimation time while improving the estimation accuracy. Simulation results show an <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>86</mn>\u0000 <mo>%</mo>\u0000 </mrow>\u0000 <annotation>$86%$</annotation>\u0000 </semantics></math> reduction in computation time for the proposed method compared to the traditional CVX tool. Additionally, the estimation accuracy is as low as <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>0.02</mn>\u0000 <mo>deg</mo>\u0000 </mrow>\u0000 <annotation>$0.02deg$</annotation>\u0000 </semantics></math>. To verify the practicality and robustness, we develop a prototype system and conduct extensive experiments. The results are consistent with our theoretical analysis, and the method proposed in this paper can realize single-path DOA estimation with an accuracy of less than <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>0.1</mn>\u0000 <mo>deg</mo>\u0000 </mrow>\u0000 <annotation>$0.1deg$</annotation>\u0000 </semantics></math> within <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>0.4276</mn>\u0000 <mspace></mspace>\u0000 <mi>s</mi>\u0000 </mrow>\u0000 <annotation>$0.4276text{ s}$</annotation>\u0000 </semantics></math>. More excitingly, the presented experimental platform achieves DOA estimation for two coherent paths.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70012","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143423811","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}
引用次数: 0
Physical layer security in satellite communication: State-of-the-art and open problems 卫星通信中的物理层安全:最新的和开放的问题
IF 1.5 4区 计算机科学
IET Communications Pub Date : 2025-02-14 DOI: 10.1049/cmu2.12830
Nora Abdelsalam, Saif Al-Kuwari, Aiman Erbad
{"title":"Physical layer security in satellite communication: State-of-the-art and open problems","authors":"Nora Abdelsalam,&nbsp;Saif Al-Kuwari,&nbsp;Aiman Erbad","doi":"10.1049/cmu2.12830","DOIUrl":"https://doi.org/10.1049/cmu2.12830","url":null,"abstract":"<p>Satellite communications have emerged as a promising extension of terrestrial networks in future 6G network research due to their extensive coverage in remote areas and their ability to support the increasing traffic rate and heterogeneous networks. Like other wireless communication technologies, satellite signals are transmitted in a shared medium, making them vulnerable to attacks such as eavesdropping, jamming, and spoofing. A good candidate to overcome these issues is physical layer security (PLS), which utilizes physical layer characteristics to provide security, mainly due to its suitability for resource-limited devices such as satellites and IoT devices. This paper provides a comprehensive and up-to-date review of PLS solutions to secure satellite communication. Main satellite applications are classified into five domains: satellite-terrestrial, satellite-based IoT, satellite navigation systems, FSO-based, and inter-satellite. In each domain, how PLS can improve the overall security of the system, preserve desirable security properties, and resist widespread attacks are discussed and investigated. Finally, some gaps in the related literature are highlight and open research problems, including uplink secrecy techniques, smart threat models, authentication and integrity techniques, PLS for inter-satellite links, and machine learning-based PLS, are discussed.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12830","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143423685","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}
引用次数: 0
Deep multi-agent RL for anti-jamming and inter-cell interference mitigation in NOMA networks 基于深度多智能体RL的NOMA网络抗干扰和小区间干扰抑制
IF 1.5 4区 计算机科学
IET Communications Pub Date : 2025-02-14 DOI: 10.1049/cmu2.12872
Sina Yousefzadeh Marandi, Mohammad Ali Amirabadi, Mohammad Hossein Kahaei, S. Mohammad Razavizadeh
{"title":"Deep multi-agent RL for anti-jamming and inter-cell interference mitigation in NOMA networks","authors":"Sina Yousefzadeh Marandi,&nbsp;Mohammad Ali Amirabadi,&nbsp;Mohammad Hossein Kahaei,&nbsp;S. Mohammad Razavizadeh","doi":"10.1049/cmu2.12872","DOIUrl":"https://doi.org/10.1049/cmu2.12872","url":null,"abstract":"<p>Inter-cell interference and smart jammer attacks significantly impair the performance of non-orthogonal multiple access (NOMA) networks. This issue is particularly critical when considering strategic interactions with malicious actors. To address this challenge, the power allocation problem is framed in a two-cell NOMA network as a sequential game. In this game, each base station acts as a leader, choosing a power allocation strategy, while the smart jammer acts as a follower, reacting optimally to the base stations' choices. To address this multi-agent scenario, four multi-agent reinforcement learning algorithms are proposed: Q-learning based unselfish (QLU), deep QLU, hot booting deep QLU, and decreased state deep QLU. A game-theoretic analysis that demonstrates the algorithms' convergence to the optimal network-wide strategy with high probability is provided. Simulation results further confirm the superiority of our proposed algorithms compared to the Q-learning-based selfish NOMA power allocation method.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12872","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143423686","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}
引用次数: 0
A squeeze-and-excitation network for SNR estimation of communication signals 一种用于通信信号信噪比估计的压缩激励网络
IF 1.5 4区 计算机科学
IET Communications Pub Date : 2025-02-11 DOI: 10.1049/cmu2.70006
Deming Hu, Yongjie Zhao, WenJun Xie, Qingxin Xiao, Longqing Li
{"title":"A squeeze-and-excitation network for SNR estimation of communication signals","authors":"Deming Hu,&nbsp;Yongjie Zhao,&nbsp;WenJun Xie,&nbsp;Qingxin Xiao,&nbsp;Longqing Li","doi":"10.1049/cmu2.70006","DOIUrl":"https://doi.org/10.1049/cmu2.70006","url":null,"abstract":"<p>Accurate signal-to-noise ratio (SNR) estimation is critical in wireless communication systems as it directly impacts system performance and the assessment of signal quality. Recent advances in deep learning-based SNR estimation have significantly improved estimation accuracy in low SNR conditions. This paper presents a novel deep learning approach that uses a power spectrum generated through overlapping segmentation as input to a neural network for SNR estimation. The performance of SNR estimation has been enhanced by integrating an augmented squeeze-and-excitation (SE) attention mechanism with a residual block fusion module, employing multiple residual structures, and deepening the network architecture. To validate the efficacy of this method, extensive simulation experiments were conducted under various scenarios, including additive white Gaussian noise (AWGN), Rayleigh, and Rician channel conditions. The results demonstrate that this method outperforms state-of-the-art techniques in high SNR environments and across diverse channel conditions. Furthermore, there is only minimal performance degradation under low signal-to-noise ratio conditions.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143389233","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}
引用次数: 0
Dynamic spectrum sharing based on federated learning in smart grids and power communication networks 基于联邦学习的智能电网和电力通信网络动态频谱共享
IF 1.5 4区 计算机科学
IET Communications Pub Date : 2025-02-09 DOI: 10.1049/cmu2.12766
Xiaoyong Wang, Qiusheng Yu, Depin Lv, Tongtong Yang, Yongjing Wei, Lei Liu, Pu Zhang, Yan Zhang, Wensheng Zhang
{"title":"Dynamic spectrum sharing based on federated learning in smart grids and power communication networks","authors":"Xiaoyong Wang,&nbsp;Qiusheng Yu,&nbsp;Depin Lv,&nbsp;Tongtong Yang,&nbsp;Yongjing Wei,&nbsp;Lei Liu,&nbsp;Pu Zhang,&nbsp;Yan Zhang,&nbsp;Wensheng Zhang","doi":"10.1049/cmu2.12766","DOIUrl":"https://doi.org/10.1049/cmu2.12766","url":null,"abstract":"<p>As the guaranteed basis for providing communication services, the power communication network plays a vital role in the smart grid. However, during natural disasters, wired communication networks have inherent limitations and come with substantial construction and maintenance costs, which makes it difficult to function effectively. Therefore, it is imperative to apply wireless communication to smart grids and power communication networks in emergency scenarios. To solve the problems of spectrum resource scarcity and insufficient spectrum utilization in wireless communication, the integration of cognitive radio networks (CRNs) into smart grids and power communication networks is considered, which can effectively solve the problems and promote their development. Based on the deep reinforcement learning (DRL) and federated learning (FL) algorithms, this paper proposes a novel dynamic spectrum sharing framework which is applied to smart grids and power communication networks in emergency scenarios. In the proposed framework, the maximum entropy based multi-agent actor-critic (ME-MAAC) algorithm is used as the local learning model, which can not only improve system performance but also help power users to choose an optimum dynamic spectrum sharing strategy. It can be seen from the simulation results that the proposed scheme has better performance in reward value, access rate, and convergence speed.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12766","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143380170","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}
引用次数: 0
A routing algorithm for wireless mesh network based on information entropy theory 基于信息熵理论的无线网状网络路由算法
IF 1.5 4区 计算机科学
IET Communications Pub Date : 2025-02-07 DOI: 10.1049/cmu2.70011
Dana Abdikumarovna Turlykozhayeva, Sayat Nusipbeckovich Akhtanov, Zeinulla Zhanabaevich Zhanabaev, Nurzhan Musaipovich Ussipov, Almat Akhmetali
{"title":"A routing algorithm for wireless mesh network based on information entropy theory","authors":"Dana Abdikumarovna Turlykozhayeva,&nbsp;Sayat Nusipbeckovich Akhtanov,&nbsp;Zeinulla Zhanabaevich Zhanabaev,&nbsp;Nurzhan Musaipovich Ussipov,&nbsp;Almat Akhmetali","doi":"10.1049/cmu2.70011","DOIUrl":"https://doi.org/10.1049/cmu2.70011","url":null,"abstract":"<p>Nowadays, wireless mesh networks (WMNs) are rapidly spreading around the world due to their competitive advantages. Beyond this, their adaptability is evident in supporting a wide range of applications: from powering broadband home networks and educational programs to driving healthcare advancements, simplifying building automation systems, assisting in expedited rescue operations, and even serving military needs. The routing within WMNs plays a pivotal role in enhancing reliability and optimizing performance. Notably, WMNs can consist of several cascading channels, however, the literature lacks routing algorithms based on the concept of information entropy for these channels. This work introduces an information-entropy-based algorithm specifically designed for wireless cascaded channels within WMNs. The proposed algorithm aims to enhance bandwidth in WMNs by constructing routes based on the maximum value of entropy of the cascading binary channel. This algorithm builds a route with the maximum value of the path entropy and bandwidth in WMNs. Furthermore, this study validates the applicability and competitiveness of the proposed method through a comparative analysis against established algorithms like Dijkstra, ACO, OLSR, AODV, and a previous method by the authors.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70011","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143362315","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}
引用次数: 0
Digital twin assisted multi-task offloading for vehicular edge computing under SAGIN with blockchain 基于区块链的SAGIN下数字孪生辅助车辆边缘计算多任务卸载
IF 1.5 4区 计算机科学
IET Communications Pub Date : 2025-02-05 DOI: 10.1049/cmu2.70002
Qiyong Chen, Chunhai Li, Mingfeng Chen, Maoqiang Wu, Gen Zhang
{"title":"Digital twin assisted multi-task offloading for vehicular edge computing under SAGIN with blockchain","authors":"Qiyong Chen,&nbsp;Chunhai Li,&nbsp;Mingfeng Chen,&nbsp;Maoqiang Wu,&nbsp;Gen Zhang","doi":"10.1049/cmu2.70002","DOIUrl":"https://doi.org/10.1049/cmu2.70002","url":null,"abstract":"<p>To better provide fast computing services, vehicular edge computing can improve the quality of service and quality of experience for intelligent transportation in 6G by reducing task transmission delay. However, vehicular edge networks face network capability limitations and privacy issues in practice. High-speed vehicles and the time-varying environment make them unpredictable. In the meantime, smart vehicles with distinct computation capabilities need to process various tasks with different resource requirements, which will inevitably cause untimely task offloading and massive energy consumption. This paper proposes to use the space-air-ground integrated network with blockchain to enhance the network capability and the privacy protection of vehicular edge networks. The digital twin is taken to better capture the dynamic characteristics of vehicles and the entire environment. The urgency level is introduced to meet the delay requirements of different tasks, while considering the impact of digital twin deviation on task offloading. Moreover, the selection algorithm and the task distribution algorithm based on the improved genetic algorithmare are proposed to obtain the optimal offloading strategy. Simulation results demonstrate that, compared with the existing algorithms, the proposed scheme can maximize the system utility while diminishing the total time for task processing.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143248525","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}
引用次数: 0
A social relationship-aware collaborative D2D secure caching strategy 一种感知社会关系的协作式D2D安全缓存策略
IF 1.5 4区 计算机科学
IET Communications Pub Date : 2025-02-05 DOI: 10.1049/cmu2.70009
Songnong Li, Yongliang Ji, Wenxin Peng, Haoreng Dai, Jinyang Jiang
{"title":"A social relationship-aware collaborative D2D secure caching strategy","authors":"Songnong Li,&nbsp;Yongliang Ji,&nbsp;Wenxin Peng,&nbsp;Haoreng Dai,&nbsp;Jinyang Jiang","doi":"10.1049/cmu2.70009","DOIUrl":"https://doi.org/10.1049/cmu2.70009","url":null,"abstract":"<p>In response to the issue of wireless spectrum scarcity and secure transmission caused by frequent requests for short videos from a large number of devices within the network, this article proposes a social relationship-aware collaborative Device-to-Device (D2D) secure caching strategy. By thoroughly analyzing the physical and social characteristics of devices, a collaborative secure caching policy based on user social relationships is designed, aiming to enhance the willingness of end users to share, reduce network traffic loads, and decrease transmission latency. To maximize traffic offloading, users are divided into communities based on their physical-social attributes, grouping users with strong physical-social attributes in the same community to increase their sharing willingness. For users within the community, relay nodes are chosen for users according to the contribution of the cached content to the community, and personalized video content caching placement is further realized based on the video content popularity predicted by the collaborative filtering algorithm to meet user demands. Simulation results suggest that the proposed algorithm can improve traffic offloading and reduce transmission latency.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70009","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143248526","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}
引用次数: 0
A novel distinguishing attack on Rocca 对罗卡的一次新颖而独特的攻击
IF 1.5 4区 计算机科学
IET Communications Pub Date : 2025-02-04 DOI: 10.1049/cmu2.70008
Nan Liu, Chenhui Jin, Junwei Yu, Jie Guan, Ting Cui
{"title":"A novel distinguishing attack on Rocca","authors":"Nan Liu,&nbsp;Chenhui Jin,&nbsp;Junwei Yu,&nbsp;Jie Guan,&nbsp;Ting Cui","doi":"10.1049/cmu2.70008","DOIUrl":"https://doi.org/10.1049/cmu2.70008","url":null,"abstract":"&lt;p&gt;The security of an encryption algorithm often hinges on the indistinguishability between ciphertext and random numbers. In block ciphers, pseudorandomness and super-pseudorandomness are commonly used to depict the indistinguishability between ciphertext and random numbers. Whereas, stream cipher algorithms can be viewed as functions of variables such as the key K, initialization vector IV, and plaintext M. For an ideal stream cipher algorithm, the ciphertext sequences for any two different plaintexts should exhibit good independence across various K-IV pairs. Consequently, the probability of the two ciphertext sequences being equal or having sufficiently long matching segments should be negligible. This study examines a new type of attack that stems from key commitment attacks. By exploiting the independence between the ciphertext sequences, a novel distinguishing attack against the stream cipher is constructed and applied to the encryption of Rocca. Focusing on the authenticated encryption algorithm Rocca, a guess-and-determine method is employed to demonstrate that for any plaintext and two different sets of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;mi&gt;e&lt;/mi&gt;\u0000 &lt;mi&gt;y&lt;/mi&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;mi&gt;N&lt;/mi&gt;\u0000 &lt;mi&gt;o&lt;/mi&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;mi&gt;c&lt;/mi&gt;\u0000 &lt;mi&gt;e&lt;/mi&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;mi&gt;A&lt;/mi&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$( {key,Nonce,AD} )$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, another plaintext can be found with a time complexity &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;O&lt;/mi&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;msup&gt;\u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;mn&gt;160&lt;/mn&gt;\u0000 &lt;/msup&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$O( {{{2}^{160}}} )$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, resulting in identical ciphertext sequences except for the initial &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 &lt;mo&gt;×&lt;/mo&gt;\u0000 &lt;mn&gt;256&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$4 times 256$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; bits. Furthermore, it is proved that under chosen plaintext conditions, the time complexity of this distinguishing attack is &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;O&lt;/mi&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;msup&gt;\u0000 ","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70008","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143111835","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}
引用次数: 0
Green communication for OverGNN enabled heterogeneous ultra-dense networks 绿色通信为OverGNN支持异构超密集网络
IF 1.5 4区 计算机科学
IET Communications Pub Date : 2025-01-29 DOI: 10.1049/cmu2.70005
Jun Zeng, Sisi Lin, Yuhan Ai, Guo Wan, Wei Luo, Qimei Chen
{"title":"Green communication for OverGNN enabled heterogeneous ultra-dense networks","authors":"Jun Zeng,&nbsp;Sisi Lin,&nbsp;Yuhan Ai,&nbsp;Guo Wan,&nbsp;Wei Luo,&nbsp;Qimei Chen","doi":"10.1049/cmu2.70005","DOIUrl":"https://doi.org/10.1049/cmu2.70005","url":null,"abstract":"<p>With the development of wireless communications, heterogeneous ultra-dense networks (HUDNs) have emerged to meet the requirements of massive connectivity, high data rate, and low latency in the 5G era. Nevertheless, HUDN usually leads to a high-complexity and non-convex NP-hard energy-efficient resource allocation problem. Therefore, A novel heterogeneous Graph neural network (GNN) with high-dimensional computation structure (namely OverGNN) is proposed for the power allocation problem in this work. Particularly, OverGNN enabled nodes directly interact with high-order neighbours and extract abundant graph topological information, which can facilitate effective feature aggregation among nodes as well as alleviate the over-smoothing problem. Based on this fact, an efficient message passing scheme for user equipments under the same base station is developed to approximate the optimal power allocation strategy for maximizing system energy efficiency. In addition, an unsupervised approach is proposed to train the GNN model that can reduce the cost of dataset collection and enhance the scalability of the proposed method. Numerical results verify the effectiveness of the proposed OverGNN and demonstrate its advantages over the benchmarks.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70005","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143120854","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信