检索结果-内蒙古大学图书馆

Resource Allocation for User-Centric Cell-Free Massive MIMO Downlink

IEEE SENSORS JOURNAL 2025年第1期25卷 1682-1693页

作者： Wang, Xuan Liu, Yi Li, Cong Xidian Univ State Key Lab Integrated Serv Network Xian 710071 Peoples R China Acad Space Elect Informat Technol Xian 710100 Peoples R China

Given the strong macro-diversity gain, cell-free massive multiple-input-multiple-output (MIMO) with many access points (APs) can provide a more uniform service level for randomly distributed users or user sensors (USs). There has, however, been little implemented in practical applications, due to the challenges of substantial backhaul overhead and high signal processing demands in cell-free massive MIMO systems. In this article, we propose a resource allocation scheme that incorporates the effective algorithms for AP selection, pilot assignment, and power allocation, to improve the performance of user-centric cell-free massive MIMO systems. In particular, a grouping-based AP selection algorithm is investigated to select APs with significant gain contributions to USs. Based on this, we propose an improved K-means clustering (I-KMC)-based pilot assignment algorithm to reduce pilot contamination caused by pilot reuse. To improve the reliability of data transmission, we present two power allocation algorithms to maximize the achievable sum-rate, namely sequential convex approximation in combination with geometric programming (SCA-GP) approach, and nonmonotone accelerated proximal gradient (NAPG) approach with line search. Results demonstrate that the proposed scheme achieves similar sum-rate performance to the scenario where all USs are served by all APs, but with significantly lower power consumption.

关键词： Massive MIMO Resource management Downlink Backhaul networks Signal processing algorithms Sensors clustering algorithms Uplink Fading channels Array signal processing Cell-free massive multiple-input-multiple-output (MIMO) grouping-based access point (AP) selection improved K-means clustering (I-KMC) nonmonotone accelerated proximal gradient (NAPG) sequential convex approximation in combination with geometric programming (SCA-GP)

来源：评论

学校读者我要写书评

暂无评论

A Distributed Robust Voltage Control Framework for Active Distribution Systems

引用

IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS 2025年第2期61卷 1896-1906页

作者： Xu, Junjun Mu, Yu Cheng, Wei Gong, Guangjing Huang, Jungao Zhang, Tengfei Hu, Qinran Chen, Kang Wu, Andrew Yang Nanjing Univ Posts & Telecommun Coll Automat Nanjing 210023 Peoples R China Nanjing Univ Posts & Telecommun Coll Artificial Intelligence Nanjing 210023 Peoples R China State Grid Elect Power Res Inst NARI Grp Corp Nanjing 211106 Peoples R China Southeast Univ Sch Elect Engn Nanjing 210096 Peoples R China Hong Kong Polytech Univ Sch Profess Educ & Execut Dev Hong Kong 999077 Peoples R China

Voltage fluctuations in active distribution systems (ADS) have increased with the high penetration of uncertain energy resources, making unified governance more challenging. This paper proposes a novel distributed robust voltage control (DRVC) method for ADS based on coordinated clustering of photovoltaic and energy storage systems, aiming to aggregate decentralized resources into interrelated clusters to achieve distributed voltage regulation. Firstly, an improved Louvain algorithm based clustering method for ADS is introduced, further incorporating the voltage sensitivity and regulation capability of generators into the modularized function. After that, a local robust voltage regulation model for each cluster is constructed, and the global multi-objective optimization function is solved through a distributed robust solution method for integrating intelligent optimization to further enhance the robustness. Case studies and results demonstrate the performance of the proposed voltage control framework in resisting uncertainties by contrast with existing models.

关键词： Voltage control clustering algorithms Data models Power system stability Sensitivity Reactive power Partitioning algorithms Robust control Regulation Microgrids Distributed generator distribution system robust voltage control uncertainty

来源：评论

学校读者我要写书评

暂无评论

Differential Fault Attack of Lightweight Cipher GIFT Based on Byte Model

引用

IEEE INTERNET OF THINGS JOURNAL 2025年第1期12卷 435-444页

作者： Gao, Yuan Zhang, Zhongya Zhang, Zhiyong Henan Univ Sci & Technol Informat Engn Coll Luoyang 471023 Peoples R China

GIFT, as a lightweight block cipher algorithm, is mainly suitable for resource-constrained environments, such as the Internet of Things, to achieve efficient cryptographic communication. For the diffusion characteristics of round function of the GIFT algorithm, this article proposes two byte-based differential fault attack models. Theoretically, the first and second models require 53.44 and 12.42 byte faults to recover the master key. Experimental results show that the first and second models require about 79 and 16 byte faults, respectively, to recover the master key. The models proposed in this article have made significant breakthroughs in terms of both the attack range and the number of required faults, which provide important guidance for algorithmic security research and the design of fault-tolerant mechanisms for IoT devices.

关键词： Cryptography Internet of Things Ciphers Computational modeling clustering algorithms Technological innovation Manufacturing Block cipher differential analysis differential fault attack GIFT lightweight cipher

来源：评论

学校读者我要写书评

暂无评论

Dual-Path Beam Tracking for Service Continuity of Ultra-Reliable and Low-Latency Communications

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2025年第1期73卷 524-539页

作者： Wang, Rui She, Changyang Li, Chunhui Li, Yonghui Vucetic, Branka Univ Sydney Sch Elect & Informat Engn Sydney NSW 2006 Australia Harbin Inst Technol Shenzhen Sch Elect & Informat Engn Shenzhen 518055 Peoples R China Ericsson Res Yokohama 2200041 Japan

Multi-antenna millimeter-wave (mmWave) communication systems have become a promising approach to improve throughput. However, mmWave narrow beams are susceptible to blockages, making it difficult to guarantee continuous services for ultra-reliable and low-latency communications (URLLC). To address this issue, we propose a novel dual-path beam tracking framework and develop a Recurrent Neural Network-based Constrained Deep Reinforcement Learning (RCDRL) algorithm to optimize the beam search sets of the beam tracking algorithm. The objective is to minimize the total time and frequency resources allocated for beam sweeping, beam tracking, and data transmission, subject to the constraint on the service interruption probability of URLLC. A pre-training method is developed to improve the initial performance and stability of the RCDRL algorithm. Comprehensive evaluation results indicate that the proposed approach outperforms other baseline methods in terms of the tradeoff between service interruption probability and resource utilization efficiency. Specifically, the RCDRL algorithm reduces the service interruption probability by three orders of magnitude compared with a standardized single-beam tracking method at the cost of sacrificing the resource utilization efficiency by 14.6%. In addition, our policy achieves lower service interruption probability and higher resource utilization efficiency compared with an existing dual-beam tracking algorithm.

关键词： Millimeter wave communication clustering algorithms Ultra reliable low latency communication Signal to noise ratio Resource management Training Prediction algorithms Beam tracking ultra-reliable and low-latency communications deep reinforcement learning mobile communication network millimeter-wave communications

来源：评论

学校读者我要写书评

暂无评论

A Flexible Multi-Rate Adaptive Blind Equalization Scheme Based on Constellation Probability Shaping in Coherent Optical Fiber Communication Systems

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2025年第7期43卷 3078-3089页

作者： Yuan, Xinyu Zhang, Qi Gao, Ran Yao, Haipeng Zhao, Qihan Tian, Feng Wang, Fu Xin, Gang Tian, Qinghua Wang, Yongjun Beijing Univ Posts & Telecommun Sch Elect Engn State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China Beijing Inst Technol Beijing 100081 Peoples R China Beijing Univ Posts & Telecommun Beijing Key Lab Space Round Interconnect & Converg Beijing 100876 Peoples R China Changzhou Jingxin New Generat Informat Technol Res Changzhou 213161 Peoples R China

A flexible multi-rate adaptive blind equalization scheme based on probabilistic shaping (PS) in coherent optical fiber communication systems is proposed, addressing the performance degradation of clustering algorithms when performing nonlinear blind equalization for high-order modulation signals in PS systems. The scheme analyzes received signals distribution using the discrete Gaussian fitting theory and combines it with a weighted clustering algorithm to implement the Gaussian-weighted decision equalization (GWDE) method, enabling adaptive blind equalization for PS signals. Moreover, the scheme utilizes the probability distribution characteristics of the equalization process to implement the shaping degree estimation (SDE), enabling accurate quantification of the signal shaping degree. The proposed scheme has been experimentally and numerically validated in a 64QAM coherent optical fiber communication system. The results show that for $\nu = 0.05$ PS-64QAM signals, the proposed scheme improves tolerance to nonlinear effects caused by launched optical power (LOP). Compared to the unequalized signal, tolerance to these effects increases by over 1 dBm;relative to the K-means equalized signal, tolerance to LOP nonlinear effects improves by approximately 0.7 dBm. Additionally, the scheme reduces computational complexity by 12% compared to K-means. The proposed scheme also achieves 100% accuracy in estimating the degree of signal shaping, given the prerequisite of ensuring reliable communication. This approach holds significant potential for the dynamic rate transmission of diverse fine-grained services in future optical fiber communication systems.

关键词： Blind equalizers Fitting Probabilistic logic Optical fibers Optical fiber networks Adaptive equalizers Accuracy Optical transmitters Estimation clustering algorithms Blind equalization probabilistic shaping discrete Gaussian fitting coherent optical fiber communication

来源：评论

学校读者我要写书评

暂无评论

Field-Based Security Testing of SDN Configuration Updates

引用

IEEE TRANSACTIONS ON RELIABILITY 2025年

作者： Malik, Jahanzaib Pastore, Fabrizio Univ Luxembourg SnT Ctr L-4365 Esch Sur Alzette Luxembourg

Software-defined systems revolutionized the management of hardware devices but introduced quality assurance challenges that remain to be tackled. For example, software defined networks (SDNs) became a key technology for the prompt reconfigurations of network services in many sectors including telecommunications, data centers, financial services, cloud providers, and manufacturing industry. Unfortunately, reconfigurations may lead to mistakes that compromise the dependability of the provided services. In this article, we focus on the reconfigurations of network services in the satellite communication sector, and target security requirements, which are often hard to verify;for example, although connectivity may function properly, confidentiality may be broken by packets forwarded to a wrong destination. We propose an approach for FIeld-based Security Testing of SDN Configurations Updates (FISTS). First, it probes the network before and after configuration updates. Then, using the collected data, it relies on unsupervised machine learning algorithms to prioritize the inspection of suspicious node responses, after identifying the network nodes that likely match across the two configurations. Our empirical evaluation has been conducted with network data from simulated and real SDN configuration updates for our industry partner, a world-leading satellite operator. Our results show that, when combined with K-Nearest Neighbor, FISTS leads to best results (up to 0.95 precision and 1.00 recall). Further, we demonstrated its scalability.

关键词： clustering algorithms Testing Security Software Nearest neighbor methods Anomaly detection Partitioning algorithms Inspection Software algorithms Machine learning algorithms Field-based testing software defined network (SDN) security testing upgrades testing

来源：评论

学校读者我要写书评

暂无评论

Community-Based Memetic Algorithm for Influence Maximization in Large-Scale Networks

引用

IEEE ACCESS 2025年 13卷 72754-72768页

作者： Roy, Mithun Pan, Indrajit Siliguri Inst Technol Siliguri 734009 West Bengal India RCC Inst Informat Technol Kolkata 700015 West Bengal India

Effective information diffusion across large-scale network is key for influence maximization. Recent research has shown a significant surge in interest in modeling, performance estimation, and seed identification across various networked systems. Moreover, a simulation of useful interactions among many significant groups within networks was developed to simulate real-world marketing and spreading information more accurately. A good diffusion model identifies the minimum number of effective seeds capable of achieving maximum diffusion effects across the network. Limited focus has been placed on measuring the strength of seeds in competitive spreading situations. There is a research gap in determining effective strategy for this purpose. This study proposes a memetic algorithm based on a community for large-scale social networks. The proposed algorithm optimizes the influence spread by identifying the most influential nodes among the communities, depending on their inter- or intra-community propagation dynamics. This algorithm combines the concept of genetic algorithm with a reachability-based local search method to accelerate the convergence process. This approach offers a robust method for maximizing the influence of network structure and interactions. An experimental evaluation on real-world social network datasets shows the performance superiority of this community-based memetic algorithm (CBMA-IM) over existing algorithms.

关键词： Social networking (online) Memetics Heuristic algorithms Genetic algorithms clustering algorithms Optimization Greedy algorithms Evolutionary computation Integrated circuit modeling Diffusion models Community structure influence maximization local search method memetic algorithm social structural strength

来源：评论

学校读者我要写书评

暂无评论

On the Distribution of Subnetwork Size With Virtual-Cell-Based Optimal Decomposition for Next-Generation Wireless Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2025年第4期24卷 3073-3087页

作者： Du, Liang Wang, Junyuan Dai, Lin Bai, Bo City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China Tongji Univ Shanghai Inst Intelligent Sci & Technol Coll Elect & Informat Engn Shanghai 201804 Peoples R China Tongji Univ Inst Adv Study Shanghai 201804 Peoples R China Huawei Technol Co Ltd Cent Res Inst Theory Lab Labs 2012 Hong Kong Peoples R China

For large-scale wireless networks, the optimal network decomposition has been proposed from a graph theoretical perspective to maximize the number of decomposed subnetworks with an interference constraint. When each user is associated with multiple base-stations (BSs) to form its virtual cell, however, the optimal network decomposition may lead to highly unbalanced subnetwork sizes if the key system parameters are not properly set. In this paper, an analytical framework is proposed to characterize the distribution of subnetwork size in terms of the number of users in a randomly chosen subnetwork for virtual-cell-based optimal decomposition. The analysis reveals that the distribution of subnetwork size is crucially determined by the virtual cell size, i.e., the number of BSs associated with each user, and the ratio of the number of users to the number of BSs, both of which should be carefully tuned to produce balanced subnetworks.

关键词： Bipartite graph Interference Matrix decomposition Wireless networks clustering algorithms Complexity theory Accuracy Vectors Urban areas Unsupervised learning Virtual cell optimal network decomposition subnetwork size active intersection graph random bipartite graph component size

来源：评论

学校读者我要写书评

暂无评论

Guaranteeing Data Privacy in Federated Unlearning With Dynamic User Participation

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2025年第3期22卷 2072-2085页

作者： Liu, Ziyao Jiang, Yu Jiang, Weifeng Guo, Jiale Zhao, Jun Lam, Kwok-Yan Nanyang Technol Univ Singapore 639798 Singapore

Federated Unlearning (FU) is gaining prominence for its capability to eliminate influences of specific users' data from trained global Federated Learning (FL) models. A straightforward FU method involves removing the unlearned user-specified data and subsequently obtaining a new global FL model from scratch with all remaining user data, a process that unfortunately leads to considerable overhead. To enhance unlearning efficiency, a widely adopted strategy employs clustering, dividing FL users into clusters, with each cluster maintaining its own FL model. The final inference is then determined by aggregating the majority vote from the inferences of these sub-models. This method confines unlearning processes to individual clusters for removing the training data of a particular user, thereby enhancing unlearning efficiency by eliminating the need for participation from all remaining user data. However, current clustering-based FU schemes mainly concentrate on refining clustering to boost unlearning efficiency but without addressing the issue of the potential information leakage from FL users' gradients, a privacy concern that has been extensively studied. Typically, integrating secure aggregation (SecAgg) schemes within each cluster can facilitate a privacy-preserving FU. Nevertheless, crafting a clustering methodology that seamlessly incorporates SecAgg schemes is challenging, particularly in scenarios involving adversarial users and dynamic users. In this connection, we systematically explore the integration of SecAgg protocols within the most widely used federated unlearning scheme, which is based on clustering, to establish a privacy-preserving FU framework, aimed at ensuring privacy while effectively managing dynamic user participation. Comprehensive theoretical assessments and experimental results show that our proposed scheme achieves comparable unlearning effectiveness, alongside offering improved privacy protection and resilience in the face of varying user pa

关键词： Protocols Privacy Servers Data models Computational modeling Training Federated learning Information leakage Computational efficiency clustering algorithms AI safety digital trust federated unlearning privacy preservation user dynamics

来源：评论

学校读者我要写书评

暂无评论

Usability and Perceived Efficiency of an Adaptive Route Optimization Solution for Commercial Vehicles

引用

IEEE ACCESS 2025年 13卷 61091-61108页

作者： Anghelache, Florian Goga, Nicolae Marian, Constantin Viorel Alexandru Mitrea, Dan Pavaloiu, Ionel-Bujorel iSYS Profess Res & Dev Dept Bucharest 020312 Romania Natl Univ Sci & Technol POLITEHN Bucharest Fac Engn Foreign Languages FILS Dept Engn Foreign Languages Bucharest 060042 Romania Univ Groningen Mol Dynam Grp NL-9747 AG Groningen Netherlands

This paper details the outcome of a European scientific research and development project, funded to prototype a commercial solution for vehicle fleets. While current route optimization solutions have data sources such as real-time road traffic and weather conditions, our solution was developed to offer companies a proposed plan with adapted optimized routes, considering critical operational requirements, local conditions, and drivers' driving experience. The iRoute solution consists of a module for receiving vehicle positions from GPS devices, an integration layer for end-customer applications, a route optimization engine, and applications for web and mobile users. Unlike other approaches, this innovative solution leverages historical, well-known, and familiar route data to enhance, refine, and adapt the optimized operational routes. This way, the drivers benefit from a more effective daily plan to follow based on business requirements such as locations, quantities, time, and distance. At the end of the day, adding these adjustments results in achieving up to a 20% improvement in the accuracy of executed routes, in terms of distance and time, compared to the planned route, outperforming standard optimization algorithms. This allows business owners to rely more confidently on the optimization results, providing a safer itinerary for their drivers. Also, due to lower incident rates on these known and preferred itineraries, the overall business will benefit from increased vehicle fleet availability and fewer days in service, with lower maintenance costs. The paper evaluates the usability and perceived efficiency value of the proposed solution by statistically analyzing feedback from dispatchers and business owners.

关键词： Vehicles Costs clustering algorithms Business Routing Optimization Companies Usability Software algorithms Software Adaptive algorithms adaptive systems path planning roadmaps (technology planning) road traffic control vehicle routing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：