This letter investigates a delay optimization problem in device-to-device(D2D)networks where users have pre-downloaded subfiles following a coded caching rule.Due to acquiring rest subfiles,users may suffer both recei...This letter investigates a delay optimization problem in device-to-device(D2D)networks where users have pre-downloaded subfiles following a coded caching rule.Due to acquiring rest subfiles,users may suffer both receiving and transmitting delays.To achieve the delay minimization,we first propose a delay-aware mode-selection strategy to adaptively choose multicast or D2D communications mode to reduce the receiving-caused delay.By matching these transmit modes with distinct subfile sizes,we further formulate a min-max optimization problem to minimize the delivery delay.Finally,numerical results prove that the proposed scheme outperforms existing ones in terms of both receiving and transmitting delays.展开更多
Based on the conflict graph model which is formulated as a binary integer optimization problem, a resource allocation method to support device-to-device （D2D） communications in ceUular networks is proposed. First, a...Based on the conflict graph model which is formulated as a binary integer optimization problem, a resource allocation method to support device-to-device （D2D） communications in ceUular networks is proposed. First, a frequency resource assignment algorithm is presented which assigns each D2D link one frequency resource block. For this algorithm, frequency resource blocks are assigned so that the frequency resource spatial reuse opportunities in the cellular networks can be fully exploited. Then a slot scheduling algorithm is presented which schedules time slots among D2D links assigned the same frequency resource block. For this algorithm, time slot resources are scheduled so that the proportional fairness among D2D links which are assigned the same frequency resource block can be achieved. The performance of the proposed method is evaluated via computer simulations. The simulation results show that the proposed method can well support D2D communications in cellular networks.展开更多
The ergodic capacity of device-to-device （D2D） communication underlaying cellular networks is analyzed. First,the D2D communication model is introduced and the interference during uplink period and downlink period i...The ergodic capacity of device-to-device （D2D） communication underlaying cellular networks is analyzed. First,the D2D communication model is introduced and the interference during uplink period and downlink period is analyzed.In a D2D communication system,since it is very difficult to obtain the instantaneous channel state information （CSI）,assume that only the transmitters know the statistical CSI and the channel coefficient follows an independent complex Gaussian distribution.Based on the assumptions,for the uplink period,the signal to interference plus noise ratio （SINR）of the D2D user equipments（DUEs）is expressed. Then the cumulative distribution function （CDF ） and probability distribution function （PDF）formulae of the SINR of the DUEs are presented.Based on the SINR formulae during the uplink period,the ergodic capacity formula of the uplink period is derived. Subsequently, using the same methods,the ergodic capacity formula of the downlink period is derived.The simulation results show that the DUEs can still obtain a high ergodic capacity even in the case of a large number of DUEs.This result can be applied to the design and optimization of D2D communications.展开更多
The performance of the graph-based scheduling for device-to-device communications overlaying cellular networks is studied. The graph-based scheduling consists of two stages, the frequency assignment stage and the time...The performance of the graph-based scheduling for device-to-device communications overlaying cellular networks is studied. The graph-based scheduling consists of two stages, the frequency assignment stage and the time slot scheduling stage. For such scheduling, a theoretical method to analyze the average spectrum efficiency of the D2D subsystem is proposed. The method consists of three steps. First, the frequency assignment stage is analyzed and the approximate formula of the average number of the D2D links which are assigned the same frequency is derived. Secondly, the time slot scheduling stage is analyzed and the approximate formula of the average probability of a D2D link being scheduled in a time slot is derived. Thirdly, the average spectrum efficiency of the D2D subsystem is analyzed and the corresponding approximate formula is derived. Analysis results show that the average spectrum efficiency of the D2D subsystem is approximately inversely linearly proportional to the second- order origin moment of the normalized broadcast radius of D2D links. Simulation results show that the proposed method can correctly predict the average spectrum efficiency of the D2D subsystem.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
The coverage probability of both the cellular users and the Device-to-Device(D2D) users are analyzed. We assume that the cellular users are able to communication with the Base Station(BS) either by relying on the assi...The coverage probability of both the cellular users and the Device-to-Device(D2D) users are analyzed. We assume that the cellular users are able to communication with the Base Station(BS) either by relying on the assistance of Full-Duplex(FD) mode relays or via direct user-to-BS links with high-enough Signal-to-Interference-plus-Noise-Ratio(SINR). Note that the FD-mode devices are capable of simultaneously operating in two modes,i.e. the D2D mode and the cooperative relay mode,with the sum power consumption at these devices kept constant. The closedform expressions for coverage probability of both tier users are derived. After that,numerical analyses are provided,showing that the coverage probability of the both the cellular and the D2D users can be substantially influenced by a variety of parameters,including the power allocation factor of the relays,the density of users,and the self-interference imposed on the FD mode relays,etc. Furthermore,in the D2D enabled networks,it is shown that the FD relay aided transmission is beneficial to enhancing the coverage probability of the cellular users if the target SINR is lower than 5 d B.展开更多
This paper investigates the content placement problem to maximize the cache hit ratio in device-to-device(D2D)communications overlaying cellular networks.We consider offloading contents by users themselves,D2D communi...This paper investigates the content placement problem to maximize the cache hit ratio in device-to-device(D2D)communications overlaying cellular networks.We consider offloading contents by users themselves,D2D communications and multicast,and we analyze the relationship between these offloading methods and the cache hit ratio.Based on this relationship,we formulate the content placement optimization as a cache hit ratio maximization problem,and propose a heuristic algorithm to solve it.Numerical results demonstrate that the proposed scheme can outperform existing schemes in terms of the cache hit ratio.展开更多
With the rapid development of the next-generation mobile network,the number of terminal devices and applications is growing explosively.Therefore,how to obtain a higher data rate,wider network coverage and higher reso...With the rapid development of the next-generation mobile network,the number of terminal devices and applications is growing explosively.Therefore,how to obtain a higher data rate,wider network coverage and higher resource utilization in the limited spectrum resources has become the common research goal of scholars.Device-to-Device(D2D)communication technology and other frontier communication technologies have emerged.Device-to-Device communication technology is the technology that devices in proximity can communicate directly in cellular networks.It has become one of the key technologies of the fifth-generation mobile communications system(5G).D2D communication technology which is introduced into cellular networks can effectively improve spectrum utilization,enhance network coverage,reduce transmission delay and improve system throughput,but it would also bring complicated and various interferences due to reusing cellular resources at the same time.So resource management is one of the most challenging and importing issues to give full play to the advantages of D2D communication.Optimal resource allocation is an important factor that needs to be addressed in D2D communication.Therefore,this paper proposes an optimization method based on the game-matching concept.The main idea is to model the optimization problem of the quality-of-experience based on user fairness and solve it through game-matching theory.Simulation results show that the proposed algorithm effectively improved the resource allocation and utilization as compared with existing algorithms.展开更多
The next-generation wireless networks are expected to provide higher capacity,system throughput with improved energy efficiency.One of the key technologies,to meet the demand for high-rate transmission,is deviceto-dev...The next-generation wireless networks are expected to provide higher capacity,system throughput with improved energy efficiency.One of the key technologies,to meet the demand for high-rate transmission,is deviceto-device(D2D)communication which allows users who are close to communicating directly instead of transiting through base stations,and D2D communication users to share the cellular user chain under the control of the cellular network.As a new generation of cellular network technology,D2D communication technology has the advantages of improving spectrum resource utilization and improving system throughput and has become one of the key technologies that have been widely concerned in the industry.However,due to the sharing of cellular network resources,D2D communication causes severe interference to existing cellular systems.One of the most important factors in D2D communication is the spectrum resources utilization and energy consumption which needs considerable attention from research scholars.To address these issues,this paper proposes an efficient algorithm based on the idea of particle swarm optimization.The main idea is to maximize the energy efficiency based on the overall link optimization of D2D user pairs by generating an allocation matrix of spectrum and power.The D2D users are enabled to reuse multiple cellular user’s resources by enhancing their total energy efficiency based on the quality of service constraints and the modification of location and speed in particle swarm.Such constraint also provides feasibility to solve the original fractional programming problem.Simulation results indicate that the proposed scheme effectively improved the energy efficiency and spectrum utilization as compared with other competing alternatives.展开更多
Medical procedures are inherently invasive and carry the risk of inducing pain to the mind and body.Recently,efforts have been made to alleviate the discomfort associated with invasive medical procedures through the u...Medical procedures are inherently invasive and carry the risk of inducing pain to the mind and body.Recently,efforts have been made to alleviate the discomfort associated with invasive medical procedures through the use of virtual reality(VR)technology.VR has been demonstrated to be an effective treatment for pain associated with medical procedures,as well as for chronic pain conditions for which no effective treatment has been established.The precise mechanism by which the diversion from reality facilitated by VR contributes to the diminution of pain and anxiety has yet to be elucidated.However,the provision of positive images through VR-based visual stimulation may enhance the functionality of brain networks.The salience network is diminished,while the default mode network is enhanced.Additionally,the medial prefrontal cortex may establish a stronger connection with the default mode network,which could result in a reduction of pain and anxiety.Further research into the potential of VR technology to alleviate pain could lead to a reduction in the number of individuals who overdose on painkillers and contribute to positive change in the medical field.展开更多
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.展开更多
Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in us...Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in user demand for latency-sensitive tasks has inevitably led to offloading bottlenecks and insufficient computational capacity on individual satellite edge servers,making it necessary to implement effective task offloading scheduling to enhance user experience.In this paper,we propose a priority-based task scheduling strategy based on a Software-Defined Network(SDN)framework for satellite-terrestrial integrated networks,which clarifies the execution order of tasks based on their priority.Subsequently,we apply a Dueling-Double Deep Q-Network(DDQN)algorithm enhanced with prioritized experience replay to derive a computation offloading strategy,improving the experience replay mechanism within the Dueling-DDQN framework.Next,we utilize the Deep Deterministic Policy Gradient(DDPG)algorithm to determine the optimal resource allocation strategy to reduce the processing latency of sub-tasks.Simulation results demonstrate that the proposed d3-DDPG algorithm outperforms other approaches,effectively reducing task processing latency and thus improving user experience and system efficiency.展开更多
Device-to-Device(D2D) communication has been proposed as a promising implementation of green communication to benefit the existed cellular network.In order to limit cross-tier interference while explore the gain of sh...Device-to-Device(D2D) communication has been proposed as a promising implementation of green communication to benefit the existed cellular network.In order to limit cross-tier interference while explore the gain of short-range communication,we devise a series of distributed power control(DPC) schemes for energy conservation(EC)and enhancement of radio resource utilization in the hybrid system.Firstly,a constrained opportunistic power control model is built up to take advantage of the interference avoidance methodology in the presence of service requirement and power constraint.Then,biasing scheme and admission control are added to evade ineffective power consumption and maintain the feasibility of the system.Upon feasibility,a non-cooperative game is further formulated to exploit the profit in EC with minor influence on spectral efficiency(SE).The convergence of the DPC schemes is validated and their performance is confirmed via simulation results.展开更多
5G is a new generation of mobile networking that aims to achieve unparalleled speed and performance. To accomplish this, three technologies, Device-to-Device communication (D2D), multi-access edge computing (MEC) and ...5G is a new generation of mobile networking that aims to achieve unparalleled speed and performance. To accomplish this, three technologies, Device-to-Device communication (D2D), multi-access edge computing (MEC) and network function virtualization (NFV) with ClickOS, have been a significant part of 5G, and this paper mainly discusses them. D2D enables direct communication between devices without the relay of base station. In 5G, a two-tier cellular network composed of traditional cellular network system and D2D is an efficient method for realizing high-speed communication. MEC unloads work from end devices and clouds platforms to widespread nodes, and connects the nodes together with outside devices and third-party providers, in order to diminish the overloading effect on any device caused by enormous applications and improve users’ quality of experience (QoE). There is also a NFV method in order to fulfill the 5G requirements. In this part, an optimized virtual machine for middle-boxes named ClickOS is introduced, and it is evaluated in several aspects. Some middle boxes are being implemented in the ClickOS and proved to have outstanding performances.展开更多
基金partly supported by the National Natural Science Foundation of China (No.61601334,61601509)
文摘This letter investigates a delay optimization problem in device-to-device(D2D)networks where users have pre-downloaded subfiles following a coded caching rule.Due to acquiring rest subfiles,users may suffer both receiving and transmitting delays.To achieve the delay minimization,we first propose a delay-aware mode-selection strategy to adaptively choose multicast or D2D communications mode to reduce the receiving-caused delay.By matching these transmit modes with distinct subfile sizes,we further formulate a min-max optimization problem to minimize the delivery delay.Finally,numerical results prove that the proposed scheme outperforms existing ones in terms of both receiving and transmitting delays.
基金The National High Technology Research and Development Program of China(863 Program)(No.SS2014AA012103)the National Natural Science Foundation of China(No.61001103)
文摘Based on the conflict graph model which is formulated as a binary integer optimization problem, a resource allocation method to support device-to-device （D2D） communications in ceUular networks is proposed. First, a frequency resource assignment algorithm is presented which assigns each D2D link one frequency resource block. For this algorithm, frequency resource blocks are assigned so that the frequency resource spatial reuse opportunities in the cellular networks can be fully exploited. Then a slot scheduling algorithm is presented which schedules time slots among D2D links assigned the same frequency resource block. For this algorithm, time slot resources are scheduled so that the proportional fairness among D2D links which are assigned the same frequency resource block can be achieved. The performance of the proposed method is evaluated via computer simulations. The simulation results show that the proposed method can well support D2D communications in cellular networks.
基金The National Natural Science Foundation of China(No.61301110)Foundation of Shanghai Key Laboratory of Intelligent Information Processing of China(No.IIPL-2014-005)
文摘The ergodic capacity of device-to-device （D2D） communication underlaying cellular networks is analyzed. First,the D2D communication model is introduced and the interference during uplink period and downlink period is analyzed.In a D2D communication system,since it is very difficult to obtain the instantaneous channel state information （CSI）,assume that only the transmitters know the statistical CSI and the channel coefficient follows an independent complex Gaussian distribution.Based on the assumptions,for the uplink period,the signal to interference plus noise ratio （SINR）of the D2D user equipments（DUEs）is expressed. Then the cumulative distribution function （CDF ） and probability distribution function （PDF）formulae of the SINR of the DUEs are presented.Based on the SINR formulae during the uplink period,the ergodic capacity formula of the uplink period is derived. Subsequently, using the same methods,the ergodic capacity formula of the downlink period is derived.The simulation results show that the DUEs can still obtain a high ergodic capacity even in the case of a large number of DUEs.This result can be applied to the design and optimization of D2D communications.
基金The National Natural Science Foundation of China(No.61571111)the National High Technology Research and Development Program of China(863 Program)(No.2014AA01A703,2015AA01A706)the Fundamental Research Funds for the Central Universities of China(No.2242016K40098)
文摘The performance of the graph-based scheduling for device-to-device communications overlaying cellular networks is studied. The graph-based scheduling consists of two stages, the frequency assignment stage and the time slot scheduling stage. For such scheduling, a theoretical method to analyze the average spectrum efficiency of the D2D subsystem is proposed. The method consists of three steps. First, the frequency assignment stage is analyzed and the approximate formula of the average number of the D2D links which are assigned the same frequency is derived. Secondly, the time slot scheduling stage is analyzed and the approximate formula of the average probability of a D2D link being scheduled in a time slot is derived. Thirdly, the average spectrum efficiency of the D2D subsystem is analyzed and the corresponding approximate formula is derived. Analysis results show that the average spectrum efficiency of the D2D subsystem is approximately inversely linearly proportional to the second- order origin moment of the normalized broadcast radius of D2D links. Simulation results show that the proposed method can correctly predict the average spectrum efficiency of the D2D subsystem.
基金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.
基金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.
文摘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.
基金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 Key Project of the National Natural Science Foundation of China (Grant No.61431001)National Natural Science Foundation of China (Grant Nos.61501182,U1501253,61377024)+3 种基金Research Foundation of Education Department of Hunan Province (Grant No.15C0558)Startup Foundation for Doctors of Hunan University of Science and Technology (Grant No.E51539)Key Laboratory of Cognitive Radio and Information Processing,Ministry of Education (Guilin University of Electronic Technology)Foundation of Beijing Engineering and Technology Center for Convergence Networks and Ubiquitous Services
文摘The coverage probability of both the cellular users and the Device-to-Device(D2D) users are analyzed. We assume that the cellular users are able to communication with the Base Station(BS) either by relying on the assistance of Full-Duplex(FD) mode relays or via direct user-to-BS links with high-enough Signal-to-Interference-plus-Noise-Ratio(SINR). Note that the FD-mode devices are capable of simultaneously operating in two modes,i.e. the D2D mode and the cooperative relay mode,with the sum power consumption at these devices kept constant. The closedform expressions for coverage probability of both tier users are derived. After that,numerical analyses are provided,showing that the coverage probability of the both the cellular and the D2D users can be substantially influenced by a variety of parameters,including the power allocation factor of the relays,the density of users,and the self-interference imposed on the FD mode relays,etc. Furthermore,in the D2D enabled networks,it is shown that the FD relay aided transmission is beneficial to enhancing the coverage probability of the cellular users if the target SINR is lower than 5 d B.
基金partly supported by the Na-tional Natural Science Foundation of China (No.61601334,61601509)
文摘This paper investigates the content placement problem to maximize the cache hit ratio in device-to-device(D2D)communications overlaying cellular networks.We consider offloading contents by users themselves,D2D communications and multicast,and we analyze the relationship between these offloading methods and the cache hit ratio.Based on this relationship,we formulate the content placement optimization as a cache hit ratio maximization problem,and propose a heuristic algorithm to solve it.Numerical results demonstrate that the proposed scheme can outperform existing schemes in terms of the cache hit ratio.
文摘With the rapid development of the next-generation mobile network,the number of terminal devices and applications is growing explosively.Therefore,how to obtain a higher data rate,wider network coverage and higher resource utilization in the limited spectrum resources has become the common research goal of scholars.Device-to-Device(D2D)communication technology and other frontier communication technologies have emerged.Device-to-Device communication technology is the technology that devices in proximity can communicate directly in cellular networks.It has become one of the key technologies of the fifth-generation mobile communications system(5G).D2D communication technology which is introduced into cellular networks can effectively improve spectrum utilization,enhance network coverage,reduce transmission delay and improve system throughput,but it would also bring complicated and various interferences due to reusing cellular resources at the same time.So resource management is one of the most challenging and importing issues to give full play to the advantages of D2D communication.Optimal resource allocation is an important factor that needs to be addressed in D2D communication.Therefore,this paper proposes an optimization method based on the game-matching concept.The main idea is to model the optimization problem of the quality-of-experience based on user fairness and solve it through game-matching theory.Simulation results show that the proposed algorithm effectively improved the resource allocation and utilization as compared with existing algorithms.
文摘The next-generation wireless networks are expected to provide higher capacity,system throughput with improved energy efficiency.One of the key technologies,to meet the demand for high-rate transmission,is deviceto-device(D2D)communication which allows users who are close to communicating directly instead of transiting through base stations,and D2D communication users to share the cellular user chain under the control of the cellular network.As a new generation of cellular network technology,D2D communication technology has the advantages of improving spectrum resource utilization and improving system throughput and has become one of the key technologies that have been widely concerned in the industry.However,due to the sharing of cellular network resources,D2D communication causes severe interference to existing cellular systems.One of the most important factors in D2D communication is the spectrum resources utilization and energy consumption which needs considerable attention from research scholars.To address these issues,this paper proposes an efficient algorithm based on the idea of particle swarm optimization.The main idea is to maximize the energy efficiency based on the overall link optimization of D2D user pairs by generating an allocation matrix of spectrum and power.The D2D users are enabled to reuse multiple cellular user’s resources by enhancing their total energy efficiency based on the quality of service constraints and the modification of location and speed in particle swarm.Such constraint also provides feasibility to solve the original fractional programming problem.Simulation results indicate that the proposed scheme effectively improved the energy efficiency and spectrum utilization as compared with other competing alternatives.
文摘Medical procedures are inherently invasive and carry the risk of inducing pain to the mind and body.Recently,efforts have been made to alleviate the discomfort associated with invasive medical procedures through the use of virtual reality(VR)technology.VR has been demonstrated to be an effective treatment for pain associated with medical procedures,as well as for chronic pain conditions for which no effective treatment has been established.The precise mechanism by which the diversion from reality facilitated by VR contributes to the diminution of pain and anxiety has yet to be elucidated.However,the provision of positive images through VR-based visual stimulation may enhance the functionality of brain networks.The salience network is diminished,while the default mode network is enhanced.Additionally,the medial prefrontal cortex may establish a stronger connection with the default mode network,which could result in a reduction of pain and anxiety.Further research into the potential of VR technology to alleviate pain could lead to a reduction in the number of individuals who overdose on painkillers and contribute to positive change in the medical field.
基金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.
文摘Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in user demand for latency-sensitive tasks has inevitably led to offloading bottlenecks and insufficient computational capacity on individual satellite edge servers,making it necessary to implement effective task offloading scheduling to enhance user experience.In this paper,we propose a priority-based task scheduling strategy based on a Software-Defined Network(SDN)framework for satellite-terrestrial integrated networks,which clarifies the execution order of tasks based on their priority.Subsequently,we apply a Dueling-Double Deep Q-Network(DDQN)algorithm enhanced with prioritized experience replay to derive a computation offloading strategy,improving the experience replay mechanism within the Dueling-DDQN framework.Next,we utilize the Deep Deterministic Policy Gradient(DDPG)algorithm to determine the optimal resource allocation strategy to reduce the processing latency of sub-tasks.Simulation results demonstrate that the proposed d3-DDPG algorithm outperforms other approaches,effectively reducing task processing latency and thus improving user experience and system efficiency.
基金This work has been partly supported by National Natural Science Foundation of China，National High Technology Research and Development Program of China (863 Program)
文摘Device-to-Device(D2D) communication has been proposed as a promising implementation of green communication to benefit the existed cellular network.In order to limit cross-tier interference while explore the gain of short-range communication,we devise a series of distributed power control(DPC) schemes for energy conservation(EC)and enhancement of radio resource utilization in the hybrid system.Firstly,a constrained opportunistic power control model is built up to take advantage of the interference avoidance methodology in the presence of service requirement and power constraint.Then,biasing scheme and admission control are added to evade ineffective power consumption and maintain the feasibility of the system.Upon feasibility,a non-cooperative game is further formulated to exploit the profit in EC with minor influence on spectral efficiency(SE).The convergence of the DPC schemes is validated and their performance is confirmed via simulation results.
文摘5G is a new generation of mobile networking that aims to achieve unparalleled speed and performance. To accomplish this, three technologies, Device-to-Device communication (D2D), multi-access edge computing (MEC) and network function virtualization (NFV) with ClickOS, have been a significant part of 5G, and this paper mainly discusses them. D2D enables direct communication between devices without the relay of base station. In 5G, a two-tier cellular network composed of traditional cellular network system and D2D is an efficient method for realizing high-speed communication. MEC unloads work from end devices and clouds platforms to widespread nodes, and connects the nodes together with outside devices and third-party providers, in order to diminish the overloading effect on any device caused by enormous applications and improve users’ quality of experience (QoE). There is also a NFV method in order to fulfill the 5G requirements. In this part, an optimized virtual machine for middle-boxes named ClickOS is introduced, and it is evaluated in several aspects. Some middle boxes are being implemented in the ClickOS and proved to have outstanding performances.
