The advent of sixth-generation(6G)networks introduces unprecedented challenges in achieving seamless connectivity,ultra-low latency,and efficient resource management in highly dynamic environments.Although fifth-gener...The advent of sixth-generation(6G)networks introduces unprecedented challenges in achieving seamless connectivity,ultra-low latency,and efficient resource management in highly dynamic environments.Although fifth-generation(5G)networks transformed mobile broadband and machine-type communications at massive scales,their properties of scaling,interference management,and latency remain a limitation in dense high mobility settings.To overcome these limitations,artificial intelligence(AI)and unmanned aerial vehicles(UAVs)have emerged as potential solutions to develop versatile,dynamic,and energy-efficient communication systems.The study proposes an AI-based UAV architecture that utilizes cooperative reinforcement learning(CoRL)to manage an autonomous network.The UAVs collaborate by sharing local observations and real-time state exchanges to optimize user connectivity,movement directions,allocate power,and resource distribution.Unlike conventional centralized or autonomous methods,CoRL involves joint state sharing and conflict-sensitive reward shaping,which ensures fair coverage,less interference,and enhanced adaptability in a dynamic urban environment.Simulations conducted in smart city scenarios with 10 UAVs and 50 ground users demonstrate that the proposed CoRL-based UAV system increases user coverage by up to 10%,achieves convergence 40%faster,and reduces latency and energy consumption by 30%compared with centralized and decentralized baselines.Furthermore,the distributed nature of the algorithm ensures scalability and flexibility,making it well-suited for future large-scale 6G deployments.The results highlighted that AI-enabled UAV systems enhance connectivity,support ultra-reliable low-latency communications(URLLC),and improve 6G network efficiency.Future work will extend the framework with adaptive modulation,beamforming-aware positioning,and real-world testbed deployment.展开更多
This paper investigates the traffic offloading optimization challenge in Space-Air-Ground Integrated Networks(SAGIN)through a novel Recursive Multi-Agent Proximal Policy Optimization(RMAPPO)algorithm.The exponential g...This paper investigates the traffic offloading optimization challenge in Space-Air-Ground Integrated Networks(SAGIN)through a novel Recursive Multi-Agent Proximal Policy Optimization(RMAPPO)algorithm.The exponential growth of mobile devices and data traffic has substantially increased network congestion,particularly in urban areas and regions with limited terrestrial infrastructure.Our approach jointly optimizes unmanned aerial vehicle(UAV)trajectories and satellite-assisted offloading strategies to simultaneously maximize data throughput,minimize energy consumption,and maintain equitable resource distribution.The proposed RMAPPO framework incorporates recurrent neural networks(RNNs)to model temporal dependencies in UAV mobility patterns and utilizes a decentralized multi-agent reinforcement learning architecture to reduce communication overhead while improving system robustness.The proposed RMAPPO algorithm was evaluated through simulation experiments,with the results indicating that it significantly enhances the cumulative traffic offloading rate of nodes and reduces the energy consumption of UAVs.展开更多
Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may r...Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.展开更多
Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and ...Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and severe class imbalance,and occasional imaging artifacts can create ambiguity for state-of-the-art convolutional neural networks(CNNs).We frame skin lesion recognition as graph-based reasoning and,to ensure fair evaluation and avoid data leakage,adopt a strict lesion-level partitioning strategy.Each image is first over-segmented using SLIC(Simple Linear Iterative Clustering)to produce perceptually homogeneous superpixels.These superpixels form the nodes of a region-adjacency graph whose edges encode spatial continuity.Node attributes are 1280-dimensional embeddings extracted with a lightweight yet expressive EfficientNet-B0 backbone,providing strong representational power at modest computational cost.The resulting graphs are processed by a five-layer Graph Attention Network(GAT)that learns to weight inter-node relationships dynamically and aggregates multi-hop context before classifying lesions into seven classes with a log-softmax output.Extensive experiments on the DermaMNIST benchmark show the proposed pipeline achieves 88.35%accuracy and 98.04%AUC,outperforming contemporary CNNs,AutoML approaches,and alternative graph neural networks.An ablation study indicates EfficientNet-B0 produces superior node descriptors compared with ResNet-18 and DenseNet,and that roughly five GAT layers strike a good balance between being too shallow and over-deep while avoiding oversmoothing.The method requires no data augmentation or external metadata,making it a drop-in upgrade for clinical computer-aided diagnosis systems.展开更多
The rapid growth of distributed data-centric applications and AI workloads increases demand for low-latency,high-throughput communication,necessitating frequent and flexible updates to network routing configurations.H...The rapid growth of distributed data-centric applications and AI workloads increases demand for low-latency,high-throughput communication,necessitating frequent and flexible updates to network routing configurations.However,maintaining consistent forwarding states during these updates is challenging,particularly when rerouting multiple flows simultaneously.Existing approaches pay little attention to multi-flow update,where improper update sequences across data plane nodes may construct deadlock dependencies.Moreover,these methods typically involve excessive control-data plane interactions,incurring significant resource overhead and performance degradation.This paper presents P4LoF,an efficient loop-free update approach that enables the controller to reroute multiple flows through minimal interactions.P4LoF first utilizes a greedy-based algorithm to generate the shortest update dependency chain for the single-flow update.These chains are then dynamically merged into a dependency graph and resolved as a Shortest Common Super-sequence(SCS)problem to produce the update sequence of multi-flow update.To address deadlock dependencies in multi-flow updates,P4LoF builds a deadlock-fix forwarding model that leverages the flexible packet processing capabilities of the programmable data plane.Experimental results show that P4LoF reduces control-data plane interactions by at least 32.6%with modest overhead,while effectively guaranteeing loop-free consistency.展开更多
Ensuring reliable power supply in urban distribution networks is a complex and critical task.To address the increased demand during extreme scenarios,this paper proposes an optimal dispatch strategy that considers the...Ensuring reliable power supply in urban distribution networks is a complex and critical task.To address the increased demand during extreme scenarios,this paper proposes an optimal dispatch strategy that considers the coordination with virtual power plants(VPPs).The proposed strategy improves systemflexibility and responsiveness by optimizing the power adjustment of flexible resources.In the proposed strategy,theGaussian Process Regression(GPR)is firstly employed to determine the adjustable range of aggregated power within the VPP,facilitating an assessment of its potential contribution to power supply support.Then,an optimal dispatch model based on a leader-follower game is developed to maximize the benefits of the VPP and flexible resources while guaranteeing the power balance at the same time.To solve the proposed optimal dispatch model efficiently,the constraints of the problem are reformulated and resolved using the Karush-Kuhn-Tucker(KKT)optimality conditions and linear programming duality theorem.The effectiveness of the strategy is illustrated through a detailed case study.展开更多
With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based...With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based on GNN can deal with encrypted traffic well. However, existing GNN-based approaches ignore the relationship between client or server packets. In this paper, we design a network traffic topology based on GCN, called Flow Mapping Graph (FMG). FMG establishes sequential edges between vertexes by the arrival order of packets and establishes jump-order edges between vertexes by connecting packets in different bursts with the same direction. It not only reflects the time characteristics of the packet but also strengthens the relationship between the client or server packets. According to FMG, a Traffic Mapping Classification model (TMC-GCN) is designed, which can automatically capture and learn the characteristics and structure information of the top vertex in FMG. The TMC-GCN model is used to classify the encrypted traffic. The encryption stream classification problem is transformed into a graph classification problem, which can effectively deal with data from different data sources and application scenarios. By comparing the performance of TMC-GCN with other classical models in four public datasets, including CICIOT2023, ISCXVPN2016, CICAAGM2017, and GraphDapp, the effectiveness of the FMG algorithm is verified. The experimental results show that the accuracy rate of the TMC-GCN model is 96.13%, the recall rate is 95.04%, and the F1 rate is 94.54%.展开更多
The increasing popularity of the Internet and the widespread use of information technology have led to a rise in the number and sophistication of network attacks and security threats.Intrusion detection systems are cr...The increasing popularity of the Internet and the widespread use of information technology have led to a rise in the number and sophistication of network attacks and security threats.Intrusion detection systems are crucial to network security,playing a pivotal role in safeguarding networks from potential threats.However,in the context of an evolving landscape of sophisticated and elusive attacks,existing intrusion detection methodologies often overlook critical aspects such as changes in network topology over time and interactions between hosts.To address these issues,this paper proposes a real-time network intrusion detection method based on graph neural networks.The proposedmethod leverages the advantages of graph neural networks and employs a straightforward graph construction method to represent network traffic as dynamic graph-structured data.Additionally,a graph convolution operation with a multi-head attention mechanism is utilized to enhance the model’s ability to capture the intricate relationships within the graph structure comprehensively.Furthermore,it uses an integrated graph neural network to address dynamic graphs’structural and topological changes at different time points and the challenges of edge embedding in intrusion detection data.The edge classification problem is effectively transformed into node classification by employing a line graph data representation,which facilitates fine-grained intrusion detection tasks on dynamic graph node feature representations.The efficacy of the proposed method is evaluated using two commonly used intrusion detection datasets,UNSW-NB15 and NF-ToN-IoT-v2,and results are compared with previous studies in this field.The experimental results demonstrate that our proposed method achieves 99.3%and 99.96%accuracy on the two datasets,respectively,and outperforms the benchmark model in several evaluation metrics.展开更多
This paper proposes a model-based control framework for vehicle platooning systems with secondorder nonlinear dynamics operating over switching signed networks,time-varying delays,and deception attacks.The study inclu...This paper proposes a model-based control framework for vehicle platooning systems with secondorder nonlinear dynamics operating over switching signed networks,time-varying delays,and deception attacks.The study includes two configurations:a leaderless structure using Finite-Time Non-Singular Terminal Bipartite Consensus(FNTBC)and Fixed-Time Bipartite Consensus(FXTBC),and a leader—follower structure ensuring structural balance and robustness against deceptive signals.In the leaderless model,a bipartite controller based on impulsive control theory,gauge transformation,and Markovian switching Lyapunov functions ensures mean-square stability and coordination under deception attacks and communication delays.The FNTBC achieves finite-time convergence depending on initial conditions,while the FXTBC guarantees fixed-time convergence independent of them,providing adaptability to different operating states.In the leader—follower case,a discontinuous impulsive control law synchronizes all followers with the leader despite deceptive attacks and switching topologies,maintaining robust coordination through nonlinear corrective mechanisms.To validate the approach,simulations are conducted on systems of five and seventeen vehicles in both leaderless and leader—follower configurations.The results demonstrate that the proposed framework achieves rapid consensus,strong robustness,and high resistance to deception attacks,offering a secure and scalable model-based control solution for modern vehicular communication networks.展开更多
Dear Editor,This letter proposes a dynamic switching soft slicing strategy for industrial mixed traffic in 5G networks. Considering two types of traffic, periodic delay-sensitive (PDS) traffic and sporadic delay-toler...Dear Editor,This letter proposes a dynamic switching soft slicing strategy for industrial mixed traffic in 5G networks. Considering two types of traffic, periodic delay-sensitive (PDS) traffic and sporadic delay-tolerant (SDT) traffic, we design a dynamic switching strategy based on a traffic-Qo S-aware soft slicing (TQASS) scheme and a resource-efficiency-aware soft slicing (REASS) scheme.展开更多
Friendship paradox states that individuals are likely to have fewer friends than their friends do,on average.Despite of its wide existence and appealing applications in real social networks,the mathematical understand...Friendship paradox states that individuals are likely to have fewer friends than their friends do,on average.Despite of its wide existence and appealing applications in real social networks,the mathematical understanding of friendship paradox is very limited.Only few works provide theoretical evidence of single-step and multi-step friendship paradoxes,given that the neighbors of interest are onehop and multi-hop away from the target node.However,they consider non-evolving networks,as opposed to the topology of real social networks that are constantly growing over time.We are thus motivated to present a first look into friendship paradox in evolving networks,where newly added nodes preferentially attach themselves to those with higher degrees.Our analytical verification of both single-step and multistep friendship paradoxes in evolving networks,along with comparison to the non-evolving counterparts,discloses that“friendship paradox is even more paradoxical in evolving networks”,primarily from three aspects:1)we demonstrate a strengthened effect of single-step friendship paradox in evolving networks,with a larger probability(more than 0.8)of a random node’s neighbors having higher average degree than the random node itself;2)we unravel higher effectiveness of multi-step friendship paradox in seeking for influential nodes in evolving networks,as the rate of reaching the max degree node can be improved by a factor of at least Θ(t^(2/3))with t being the network size;3)we empirically verify our findings through both synthetic and real datasets,which suggest high agreements of results and consolidate the reasonability of evolving model for real social networks.展开更多
This paper proposes a novel blended hyper-cellular architecture for low-altitude aerial intelligent networks(LAINs)to provide agile coverage tailored to active air routes and takeoff/landing spots.Traditional cellular...This paper proposes a novel blended hyper-cellular architecture for low-altitude aerial intelligent networks(LAINs)to provide agile coverage tailored to active air routes and takeoff/landing spots.Traditional cellular networks struggle to meet the dynamic demands of low-altitude UAV communications due to their rigid structures.The hyper-cellular network(HCN)architecture separates control and traffic coverage,enabling flexible and energy-efficient operations.The key components include control base stations(CBSs)for wide-area signaling coverage and traffic base stations(TBSs)that can be dynamically activated based on traffic demands.The proposed solution also integrates space information networks(SINs)to enhance the coverage efficiency.Key technologies such as all-G CBS using RISC-V architecture,AI-powered radio maps for low-altitude environments,and agile TBS coverage adaptation are introduced with some preliminary studies.These designs aim to address challenges like mobility management,interference coordination,and the need for real-time spectrum sharing in blended satellite-terrestrial networks.The proposed solution offers a scalable and agile framework to support the rapidly growing demand for reliable,low-latency,and high-capacity UAV communications in urban environments.展开更多
This paper study the finite time internal synchronization and the external synchronization(hybrid synchronization)for duplex heterogeneous complex networks by time-varying intermittent control.There few study hybrid s...This paper study the finite time internal synchronization and the external synchronization(hybrid synchronization)for duplex heterogeneous complex networks by time-varying intermittent control.There few study hybrid synchronization of heterogeneous duplex complex networks.Therefore,we study the finite time hybrid synchronization of heterogeneous duplex networks,which employs the time-varying intermittent control to drive the duplex heterogeneous complex networks to achieve hybrid synchronization in finite time.To be specific,the switch frequency of the controllers can be changed with time by devise Lyapunov function and boundary function,the internal synchronization and external synchronization are achieved simultaneously in finite time.Finally,numerical examples are presented to illustrate the validness of theoretical results.展开更多
Recently,a novel type of neural networks,known as liquid neural networks(LNNs),has been designed from first principles to address robustness and interpretability challenges facing artificial intelligence(AI)solutions....Recently,a novel type of neural networks,known as liquid neural networks(LNNs),has been designed from first principles to address robustness and interpretability challenges facing artificial intelligence(AI)solutions.The potential of LNNs in telecommunications is explored in this paper.First,we illustrate the mechanisms of LNNs and highlight their unique advantages over traditional networks.Then we explore the opportunities that LNNs bring to future wireless networks.Furthermore,we discuss the challenges and design directions for the implementation of LNNs.Finally,we summarize the performance of LNNs in two case studies.展开更多
Wireless Sensor Networks(WSNs)have emerged as crucial tools for real-time environmental monitoring through distributed sensor nodes(SNs).However,the operational lifespan of WSNs is significantly constrained by the lim...Wireless Sensor Networks(WSNs)have emerged as crucial tools for real-time environmental monitoring through distributed sensor nodes(SNs).However,the operational lifespan of WSNs is significantly constrained by the limited energy resources of SNs.Current energy efficiency strategies,such as clustering,multi-hop routing,and data aggregation,face challenges,including uneven energy depletion,high computational demands,and suboptimal cluster head(CH)selection.To address these limitations,this paper proposes a hybrid methodology that optimizes energy consumption(EC)while maintaining network performance.The proposed approach integrates the Low Energy Adaptive Clustering Hierarchy with Deterministic(LEACH-D)protocol using an Artificial Neural Network(ANN)and Bayesian Regularization Algorithm(BRA).LEACH-D improves upon conventional LEACH by ensuring more uniform energy usage across SNs,mitigating inefficiencies from random CH selection.The ANN further enhances CH selection and routing processes,effectively reducing data transmission overhead and idle listening.Simulation results reveal that the LEACH-D-ANN model significantly reduces EC and extends the network’s lifespan compared to existing protocols.This framework offers a promising solution to the energy efficiency challenges in WSNs,paving the way for more sustainable and reliable network deployments.展开更多
Structural properties of the ship container logistics network of China(SCLNC)are studied in the light of recent investigations of complex networks.SCLNC is composed of a set of routes and ports located along the sea o...Structural properties of the ship container logistics network of China(SCLNC)are studied in the light of recent investigations of complex networks.SCLNC is composed of a set of routes and ports located along the sea or river.Network properties including the degree distribution,degree correlations,clustering,shortest path length,centrality and betweenness are studied in different definition of network topology.It is found that geographical constraint plays an important role in the network topology of SCLNC.We also study the traffic flow of SCLNC based on the weighted network representation,and demonstrate the weight distribution can be described by power law or exponential function depending on the assumed definition of network topology.Other features related to SCLNC are also investigated.展开更多
Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently...Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently,enhancing the robustness of scale-free networks has become a pressing issue.To address this problem,this paper proposes a Multi-Granularity Integration Algorithm(MGIA),which aims to improve the robustness of scale-free networks while keeping the initial degree of each node unchanged,ensuring network connectivity and avoiding the generation of multiple edges.The algorithm generates a multi-granularity structure from the initial network to be optimized,then uses different optimization strategies to optimize the networks at various granular layers in this structure,and finally realizes the information exchange between different granular layers,thereby further enhancing the optimization effect.We propose new network refresh,crossover,and mutation operators to ensure that the optimized network satisfies the given constraints.Meanwhile,we propose new network similarity and network dissimilarity evaluation metrics to improve the effectiveness of the optimization operators in the algorithm.In the experiments,the MGIA enhances the robustness of the scale-free network by 67.6%.This improvement is approximately 17.2%higher than the optimization effects achieved by eight currently existing complex network robustness optimization algorithms.展开更多
Free Space Optical （FSO） networks, also known as optical wireless networks, have emerged as viable candidates for broadband wireless communications in the near future. The range of the potential application of FSO n...Free Space Optical （FSO） networks, also known as optical wireless networks, have emerged as viable candidates for broadband wireless communications in the near future. The range of the potential application of FSO networks is extensive, from home to satellite. However, FSO networks have not been popularized because of insufficient availability and reliability. Researchers have focused on the problems in the physical layer in order to exploit the properties of wireless optical channels. However, recent technological developments with successful results make it practical to explore the advantages of the high bandwidth. Some researchers have begun to focus on the problems of network and upper layers in FSO networks. In this survey, we classify prospective global FSO networks into three subnetworks and give an account of them. We also present state-of- the-art research and discuss what kinds of challenges exist.展开更多
The integration of image analysis through deep learning(DL)into rock classification represents a significant leap forward in geological research.While traditional methods remain invaluable for their expertise and hist...The integration of image analysis through deep learning(DL)into rock classification represents a significant leap forward in geological research.While traditional methods remain invaluable for their expertise and historical context,DL offers a powerful complement by enhancing the speed,objectivity,and precision of the classification process.This research explores the significance of image data augmentation techniques in optimizing the performance of convolutional neural networks(CNNs)for geological image analysis,particularly in the classification of igneous,metamorphic,and sedimentary rock types from rock thin section(RTS)images.This study primarily focuses on classic image augmentation techniques and evaluates their impact on model accuracy and precision.Results demonstrate that augmentation techniques like Equalize significantly enhance the model's classification capabilities,achieving an F1-Score of 0.9869 for igneous rocks,0.9884 for metamorphic rocks,and 0.9929 for sedimentary rocks,representing improvements compared to the baseline original results.Moreover,the weighted average F1-Score across all classes and techniques is 0.9886,indicating an enhancement.Conversely,methods like Distort lead to decreased accuracy and F1-Score,with an F1-Score of 0.949 for igneous rocks,0.954 for metamorphic rocks,and 0.9416 for sedimentary rocks,exacerbating the performance compared to the baseline.The study underscores the practicality of image data augmentation in geological image classification and advocates for the adoption of DL methods in this domain for automation and improved results.The findings of this study can benefit various fields,including remote sensing,mineral exploration,and environmental monitoring,by enhancing the accuracy of geological image analysis both for scientific research and industrial applications.展开更多
基金supported by the National Research Foundation of Korea(NRF)grant funded by the Korea government(MSIT)(RS-2025-00559546)supported by the IITP(Institute of Information&Coummunications Technology Planning&Evaluation)-ITRC(Information Technology Research Center)grant funded by the Korea government(Ministry of Science and ICT)(IITP-2025-RS-2023-00259004).
文摘The advent of sixth-generation(6G)networks introduces unprecedented challenges in achieving seamless connectivity,ultra-low latency,and efficient resource management in highly dynamic environments.Although fifth-generation(5G)networks transformed mobile broadband and machine-type communications at massive scales,their properties of scaling,interference management,and latency remain a limitation in dense high mobility settings.To overcome these limitations,artificial intelligence(AI)and unmanned aerial vehicles(UAVs)have emerged as potential solutions to develop versatile,dynamic,and energy-efficient communication systems.The study proposes an AI-based UAV architecture that utilizes cooperative reinforcement learning(CoRL)to manage an autonomous network.The UAVs collaborate by sharing local observations and real-time state exchanges to optimize user connectivity,movement directions,allocate power,and resource distribution.Unlike conventional centralized or autonomous methods,CoRL involves joint state sharing and conflict-sensitive reward shaping,which ensures fair coverage,less interference,and enhanced adaptability in a dynamic urban environment.Simulations conducted in smart city scenarios with 10 UAVs and 50 ground users demonstrate that the proposed CoRL-based UAV system increases user coverage by up to 10%,achieves convergence 40%faster,and reduces latency and energy consumption by 30%compared with centralized and decentralized baselines.Furthermore,the distributed nature of the algorithm ensures scalability and flexibility,making it well-suited for future large-scale 6G deployments.The results highlighted that AI-enabled UAV systems enhance connectivity,support ultra-reliable low-latency communications(URLLC),and improve 6G network efficiency.Future work will extend the framework with adaptive modulation,beamforming-aware positioning,and real-world testbed deployment.
文摘This paper investigates the traffic offloading optimization challenge in Space-Air-Ground Integrated Networks(SAGIN)through a novel Recursive Multi-Agent Proximal Policy Optimization(RMAPPO)algorithm.The exponential growth of mobile devices and data traffic has substantially increased network congestion,particularly in urban areas and regions with limited terrestrial infrastructure.Our approach jointly optimizes unmanned aerial vehicle(UAV)trajectories and satellite-assisted offloading strategies to simultaneously maximize data throughput,minimize energy consumption,and maintain equitable resource distribution.The proposed RMAPPO framework incorporates recurrent neural networks(RNNs)to model temporal dependencies in UAV mobility patterns and utilizes a decentralized multi-agent reinforcement learning architecture to reduce communication overhead while improving system robustness.The proposed RMAPPO algorithm was evaluated through simulation experiments,with the results indicating that it significantly enhances the cumulative traffic offloading rate of nodes and reduces the energy consumption of UAVs.
文摘Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.
基金funded by the Deanship of Graduate Studies and Scientific Research at Jouf University under grant No.(DGSSR-2025-02-01296).
文摘Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and severe class imbalance,and occasional imaging artifacts can create ambiguity for state-of-the-art convolutional neural networks(CNNs).We frame skin lesion recognition as graph-based reasoning and,to ensure fair evaluation and avoid data leakage,adopt a strict lesion-level partitioning strategy.Each image is first over-segmented using SLIC(Simple Linear Iterative Clustering)to produce perceptually homogeneous superpixels.These superpixels form the nodes of a region-adjacency graph whose edges encode spatial continuity.Node attributes are 1280-dimensional embeddings extracted with a lightweight yet expressive EfficientNet-B0 backbone,providing strong representational power at modest computational cost.The resulting graphs are processed by a five-layer Graph Attention Network(GAT)that learns to weight inter-node relationships dynamically and aggregates multi-hop context before classifying lesions into seven classes with a log-softmax output.Extensive experiments on the DermaMNIST benchmark show the proposed pipeline achieves 88.35%accuracy and 98.04%AUC,outperforming contemporary CNNs,AutoML approaches,and alternative graph neural networks.An ablation study indicates EfficientNet-B0 produces superior node descriptors compared with ResNet-18 and DenseNet,and that roughly five GAT layers strike a good balance between being too shallow and over-deep while avoiding oversmoothing.The method requires no data augmentation or external metadata,making it a drop-in upgrade for clinical computer-aided diagnosis systems.
基金supported by the National Key Research and Development Program of China under Grant 2022YFB2901501in part by the Science and Technology Innovation leading Talents Subsidy Project of Central Plains under Grant 244200510038.
文摘The rapid growth of distributed data-centric applications and AI workloads increases demand for low-latency,high-throughput communication,necessitating frequent and flexible updates to network routing configurations.However,maintaining consistent forwarding states during these updates is challenging,particularly when rerouting multiple flows simultaneously.Existing approaches pay little attention to multi-flow update,where improper update sequences across data plane nodes may construct deadlock dependencies.Moreover,these methods typically involve excessive control-data plane interactions,incurring significant resource overhead and performance degradation.This paper presents P4LoF,an efficient loop-free update approach that enables the controller to reroute multiple flows through minimal interactions.P4LoF first utilizes a greedy-based algorithm to generate the shortest update dependency chain for the single-flow update.These chains are then dynamically merged into a dependency graph and resolved as a Shortest Common Super-sequence(SCS)problem to produce the update sequence of multi-flow update.To address deadlock dependencies in multi-flow updates,P4LoF builds a deadlock-fix forwarding model that leverages the flexible packet processing capabilities of the programmable data plane.Experimental results show that P4LoF reduces control-data plane interactions by at least 32.6%with modest overhead,while effectively guaranteeing loop-free consistency.
基金supported by the Science and Technology Project of Sichuan Electric Power Company“Power Supply Guarantee Strategy for Urban Distribution Networks Considering Coordination with Virtual Power Plant during Extreme Weather Event”(No.521920230003).
文摘Ensuring reliable power supply in urban distribution networks is a complex and critical task.To address the increased demand during extreme scenarios,this paper proposes an optimal dispatch strategy that considers the coordination with virtual power plants(VPPs).The proposed strategy improves systemflexibility and responsiveness by optimizing the power adjustment of flexible resources.In the proposed strategy,theGaussian Process Regression(GPR)is firstly employed to determine the adjustable range of aggregated power within the VPP,facilitating an assessment of its potential contribution to power supply support.Then,an optimal dispatch model based on a leader-follower game is developed to maximize the benefits of the VPP and flexible resources while guaranteeing the power balance at the same time.To solve the proposed optimal dispatch model efficiently,the constraints of the problem are reformulated and resolved using the Karush-Kuhn-Tucker(KKT)optimality conditions and linear programming duality theorem.The effectiveness of the strategy is illustrated through a detailed case study.
基金supported by the National Key Research and Development Program of China No.2023YFA1009500.
文摘With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based on GNN can deal with encrypted traffic well. However, existing GNN-based approaches ignore the relationship between client or server packets. In this paper, we design a network traffic topology based on GCN, called Flow Mapping Graph (FMG). FMG establishes sequential edges between vertexes by the arrival order of packets and establishes jump-order edges between vertexes by connecting packets in different bursts with the same direction. It not only reflects the time characteristics of the packet but also strengthens the relationship between the client or server packets. According to FMG, a Traffic Mapping Classification model (TMC-GCN) is designed, which can automatically capture and learn the characteristics and structure information of the top vertex in FMG. The TMC-GCN model is used to classify the encrypted traffic. The encryption stream classification problem is transformed into a graph classification problem, which can effectively deal with data from different data sources and application scenarios. By comparing the performance of TMC-GCN with other classical models in four public datasets, including CICIOT2023, ISCXVPN2016, CICAAGM2017, and GraphDapp, the effectiveness of the FMG algorithm is verified. The experimental results show that the accuracy rate of the TMC-GCN model is 96.13%, the recall rate is 95.04%, and the F1 rate is 94.54%.
文摘The increasing popularity of the Internet and the widespread use of information technology have led to a rise in the number and sophistication of network attacks and security threats.Intrusion detection systems are crucial to network security,playing a pivotal role in safeguarding networks from potential threats.However,in the context of an evolving landscape of sophisticated and elusive attacks,existing intrusion detection methodologies often overlook critical aspects such as changes in network topology over time and interactions between hosts.To address these issues,this paper proposes a real-time network intrusion detection method based on graph neural networks.The proposedmethod leverages the advantages of graph neural networks and employs a straightforward graph construction method to represent network traffic as dynamic graph-structured data.Additionally,a graph convolution operation with a multi-head attention mechanism is utilized to enhance the model’s ability to capture the intricate relationships within the graph structure comprehensively.Furthermore,it uses an integrated graph neural network to address dynamic graphs’structural and topological changes at different time points and the challenges of edge embedding in intrusion detection data.The edge classification problem is effectively transformed into node classification by employing a line graph data representation,which facilitates fine-grained intrusion detection tasks on dynamic graph node feature representations.The efficacy of the proposed method is evaluated using two commonly used intrusion detection datasets,UNSW-NB15 and NF-ToN-IoT-v2,and results are compared with previous studies in this field.The experimental results demonstrate that our proposed method achieves 99.3%and 99.96%accuracy on the two datasets,respectively,and outperforms the benchmark model in several evaluation metrics.
基金Deanship of Research and Graduate Studies at King Khalid University for funding this work through Large Research Project under grant number RGP.2/103/46”Deanship of Scientific Research at Northern Border University,Arar,Saudi Arabia for funding this research work through project number“NBU-FFR-2025-871-15”funding from Prince Sattam bin Abdulaziz University project number(PSAU/2025/R/1447).
文摘This paper proposes a model-based control framework for vehicle platooning systems with secondorder nonlinear dynamics operating over switching signed networks,time-varying delays,and deception attacks.The study includes two configurations:a leaderless structure using Finite-Time Non-Singular Terminal Bipartite Consensus(FNTBC)and Fixed-Time Bipartite Consensus(FXTBC),and a leader—follower structure ensuring structural balance and robustness against deceptive signals.In the leaderless model,a bipartite controller based on impulsive control theory,gauge transformation,and Markovian switching Lyapunov functions ensures mean-square stability and coordination under deception attacks and communication delays.The FNTBC achieves finite-time convergence depending on initial conditions,while the FXTBC guarantees fixed-time convergence independent of them,providing adaptability to different operating states.In the leader—follower case,a discontinuous impulsive control law synchronizes all followers with the leader despite deceptive attacks and switching topologies,maintaining robust coordination through nonlinear corrective mechanisms.To validate the approach,simulations are conducted on systems of five and seventeen vehicles in both leaderless and leader—follower configurations.The results demonstrate that the proposed framework achieves rapid consensus,strong robustness,and high resistance to deception attacks,offering a secure and scalable model-based control solution for modern vehicular communication networks.
基金supported by the Liaoning Revitalization Talents Program(XLYC2203148)
文摘Dear Editor,This letter proposes a dynamic switching soft slicing strategy for industrial mixed traffic in 5G networks. Considering two types of traffic, periodic delay-sensitive (PDS) traffic and sporadic delay-tolerant (SDT) traffic, we design a dynamic switching strategy based on a traffic-Qo S-aware soft slicing (TQASS) scheme and a resource-efficiency-aware soft slicing (REASS) scheme.
基金supported by NSF China(No.61960206002,62020106005,42050105,62061146002)Shanghai Pilot Program for Basic Research–Shanghai Jiao Tong University.
文摘Friendship paradox states that individuals are likely to have fewer friends than their friends do,on average.Despite of its wide existence and appealing applications in real social networks,the mathematical understanding of friendship paradox is very limited.Only few works provide theoretical evidence of single-step and multi-step friendship paradoxes,given that the neighbors of interest are onehop and multi-hop away from the target node.However,they consider non-evolving networks,as opposed to the topology of real social networks that are constantly growing over time.We are thus motivated to present a first look into friendship paradox in evolving networks,where newly added nodes preferentially attach themselves to those with higher degrees.Our analytical verification of both single-step and multistep friendship paradoxes in evolving networks,along with comparison to the non-evolving counterparts,discloses that“friendship paradox is even more paradoxical in evolving networks”,primarily from three aspects:1)we demonstrate a strengthened effect of single-step friendship paradox in evolving networks,with a larger probability(more than 0.8)of a random node’s neighbors having higher average degree than the random node itself;2)we unravel higher effectiveness of multi-step friendship paradox in seeking for influential nodes in evolving networks,as the rate of reaching the max degree node can be improved by a factor of at least Θ(t^(2/3))with t being the network size;3)we empirically verify our findings through both synthetic and real datasets,which suggest high agreements of results and consolidate the reasonability of evolving model for real social networks.
基金Feng Wei was supported by the National Natural Science Foundation of China under Grant 62425110.
文摘This paper proposes a novel blended hyper-cellular architecture for low-altitude aerial intelligent networks(LAINs)to provide agile coverage tailored to active air routes and takeoff/landing spots.Traditional cellular networks struggle to meet the dynamic demands of low-altitude UAV communications due to their rigid structures.The hyper-cellular network(HCN)architecture separates control and traffic coverage,enabling flexible and energy-efficient operations.The key components include control base stations(CBSs)for wide-area signaling coverage and traffic base stations(TBSs)that can be dynamically activated based on traffic demands.The proposed solution also integrates space information networks(SINs)to enhance the coverage efficiency.Key technologies such as all-G CBS using RISC-V architecture,AI-powered radio maps for low-altitude environments,and agile TBS coverage adaptation are introduced with some preliminary studies.These designs aim to address challenges like mobility management,interference coordination,and the need for real-time spectrum sharing in blended satellite-terrestrial networks.The proposed solution offers a scalable and agile framework to support the rapidly growing demand for reliable,low-latency,and high-capacity UAV communications in urban environments.
基金Project supported by Jilin Provincial Science and Technology Development Plan(Grant No.20220101137JC).
文摘This paper study the finite time internal synchronization and the external synchronization(hybrid synchronization)for duplex heterogeneous complex networks by time-varying intermittent control.There few study hybrid synchronization of heterogeneous duplex complex networks.Therefore,we study the finite time hybrid synchronization of heterogeneous duplex networks,which employs the time-varying intermittent control to drive the duplex heterogeneous complex networks to achieve hybrid synchronization in finite time.To be specific,the switch frequency of the controllers can be changed with time by devise Lyapunov function and boundary function,the internal synchronization and external synchronization are achieved simultaneously in finite time.Finally,numerical examples are presented to illustrate the validness of theoretical results.
基金supported by the China National Key R&D Program under Grant Nos.2021YFA1000500 and 2023YFB2904804National Natural Science Foundation of China under Grant Nos.62331023,62101492,62394292 and U20A20158+1 种基金Zhejiang Provincial Natural Science Foundation of China under Grant No.LR22F010002Zhejiang Provincial Science and Technology Plan Project under Grant No.2024C01033。
文摘Recently,a novel type of neural networks,known as liquid neural networks(LNNs),has been designed from first principles to address robustness and interpretability challenges facing artificial intelligence(AI)solutions.The potential of LNNs in telecommunications is explored in this paper.First,we illustrate the mechanisms of LNNs and highlight their unique advantages over traditional networks.Then we explore the opportunities that LNNs bring to future wireless networks.Furthermore,we discuss the challenges and design directions for the implementation of LNNs.Finally,we summarize the performance of LNNs in two case studies.
文摘Wireless Sensor Networks(WSNs)have emerged as crucial tools for real-time environmental monitoring through distributed sensor nodes(SNs).However,the operational lifespan of WSNs is significantly constrained by the limited energy resources of SNs.Current energy efficiency strategies,such as clustering,multi-hop routing,and data aggregation,face challenges,including uneven energy depletion,high computational demands,and suboptimal cluster head(CH)selection.To address these limitations,this paper proposes a hybrid methodology that optimizes energy consumption(EC)while maintaining network performance.The proposed approach integrates the Low Energy Adaptive Clustering Hierarchy with Deterministic(LEACH-D)protocol using an Artificial Neural Network(ANN)and Bayesian Regularization Algorithm(BRA).LEACH-D improves upon conventional LEACH by ensuring more uniform energy usage across SNs,mitigating inefficiencies from random CH selection.The ANN further enhances CH selection and routing processes,effectively reducing data transmission overhead and idle listening.Simulation results reveal that the LEACH-D-ANN model significantly reduces EC and extends the network’s lifespan compared to existing protocols.This framework offers a promising solution to the energy efficiency challenges in WSNs,paving the way for more sustainable and reliable network deployments.
基金supported by Youth Foundation for Research of the Waterborne Transportation Institute.
文摘Structural properties of the ship container logistics network of China(SCLNC)are studied in the light of recent investigations of complex networks.SCLNC is composed of a set of routes and ports located along the sea or river.Network properties including the degree distribution,degree correlations,clustering,shortest path length,centrality and betweenness are studied in different definition of network topology.It is found that geographical constraint plays an important role in the network topology of SCLNC.We also study the traffic flow of SCLNC based on the weighted network representation,and demonstrate the weight distribution can be described by power law or exponential function depending on the assumed definition of network topology.Other features related to SCLNC are also investigated.
基金National Natural Science Foundation of China(11971211,12171388).
文摘Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently,enhancing the robustness of scale-free networks has become a pressing issue.To address this problem,this paper proposes a Multi-Granularity Integration Algorithm(MGIA),which aims to improve the robustness of scale-free networks while keeping the initial degree of each node unchanged,ensuring network connectivity and avoiding the generation of multiple edges.The algorithm generates a multi-granularity structure from the initial network to be optimized,then uses different optimization strategies to optimize the networks at various granular layers in this structure,and finally realizes the information exchange between different granular layers,thereby further enhancing the optimization effect.We propose new network refresh,crossover,and mutation operators to ensure that the optimized network satisfies the given constraints.Meanwhile,we propose new network similarity and network dissimilarity evaluation metrics to improve the effectiveness of the optimization operators in the algorithm.In the experiments,the MGIA enhances the robustness of the scale-free network by 67.6%.This improvement is approximately 17.2%higher than the optimization effects achieved by eight currently existing complex network robustness optimization algorithms.
基金This work is supported in part by the US National Science Foundation under Grants CNS-1320664, and by the Wireless Engineering Research and Education Center （WEREC） at Auburn University, Aubur, AL, USA.
文摘Free Space Optical （FSO） networks, also known as optical wireless networks, have emerged as viable candidates for broadband wireless communications in the near future. The range of the potential application of FSO networks is extensive, from home to satellite. However, FSO networks have not been popularized because of insufficient availability and reliability. Researchers have focused on the problems in the physical layer in order to exploit the properties of wireless optical channels. However, recent technological developments with successful results make it practical to explore the advantages of the high bandwidth. Some researchers have begun to focus on the problems of network and upper layers in FSO networks. In this survey, we classify prospective global FSO networks into three subnetworks and give an account of them. We also present state-of- the-art research and discuss what kinds of challenges exist.
文摘The integration of image analysis through deep learning(DL)into rock classification represents a significant leap forward in geological research.While traditional methods remain invaluable for their expertise and historical context,DL offers a powerful complement by enhancing the speed,objectivity,and precision of the classification process.This research explores the significance of image data augmentation techniques in optimizing the performance of convolutional neural networks(CNNs)for geological image analysis,particularly in the classification of igneous,metamorphic,and sedimentary rock types from rock thin section(RTS)images.This study primarily focuses on classic image augmentation techniques and evaluates their impact on model accuracy and precision.Results demonstrate that augmentation techniques like Equalize significantly enhance the model's classification capabilities,achieving an F1-Score of 0.9869 for igneous rocks,0.9884 for metamorphic rocks,and 0.9929 for sedimentary rocks,representing improvements compared to the baseline original results.Moreover,the weighted average F1-Score across all classes and techniques is 0.9886,indicating an enhancement.Conversely,methods like Distort lead to decreased accuracy and F1-Score,with an F1-Score of 0.949 for igneous rocks,0.954 for metamorphic rocks,and 0.9416 for sedimentary rocks,exacerbating the performance compared to the baseline.The study underscores the practicality of image data augmentation in geological image classification and advocates for the adoption of DL methods in this domain for automation and improved results.The findings of this study can benefit various fields,including remote sensing,mineral exploration,and environmental monitoring,by enhancing the accuracy of geological image analysis both for scientific research and industrial applications.
