Wi-Fi technology has evolved significantly since its introduction in 1997,advancing to Wi-Fi 6 as the latest standard,with Wi-Fi 7 currently under development.Despite these advancements,integrating machine learning in...Wi-Fi technology has evolved significantly since its introduction in 1997,advancing to Wi-Fi 6 as the latest standard,with Wi-Fi 7 currently under development.Despite these advancements,integrating machine learning into Wi-Fi networks remains challenging,especially in decentralized environments with multiple access points(mAPs).This paper is a short review that summarizes the potential applications of federated reinforcement learning(FRL)across eight key areas of Wi-Fi functionality,including channel access,link adaptation,beamforming,multi-user transmissions,channel bonding,multi-link operation,spatial reuse,and multi-basic servic set(multi-BSS)coordination.FRL is highlighted as a promising framework for enabling decentralized training and decision-making while preserving data privacy.To illustrate its role in practice,we present a case study on link activation in a multi-link operation(MLO)environment with multiple APs.Through theoretical discussion and simulation results,the study demonstrates how FRL can improve performance and reliability,paving the way for more adaptive and collaborative Wi-Fi networks in the era of Wi-Fi 7 and beyond.展开更多
Fires and human casualties caused by single phase-to-ground faults in distribution networks are frequent.However,existing ground fault suppression methods are affected by ground fault resistance.Thus,an adaptive suppr...Fires and human casualties caused by single phase-to-ground faults in distribution networks are frequent.However,existing ground fault suppression methods are affected by ground fault resistance.Thus,an adaptive suppression method that seamlessly combines principles of current and voltage suppression is proposed,which has good adaptability to different ground fault resistance.Meanwhile,a multi-criteria ground fault suppression exit strategy matched to adaptive suppression method is proposed to avoid damage of device caused by power backflow,which provides the possibility for reliable and fast exit of the fault suppression device.Experimental results demonstrate effectiveness and advantages of the adaptive suppression method and its exit strategy.展开更多
Unmanned Aerial Vehicles(UAVs)in Flying Ad-Hoc Networks(FANETs)are widely used in both civilian and military fields,but they face severe security,trust,and privacy vulnerabilities due to their high mobility,dynamic to...Unmanned Aerial Vehicles(UAVs)in Flying Ad-Hoc Networks(FANETs)are widely used in both civilian and military fields,but they face severe security,trust,and privacy vulnerabilities due to their high mobility,dynamic topology,and open wireless channels.Existing security protocols for Mobile Ad-Hoc Networks(MANETs)cannot be directly applied to FANETs,as FANETs require lightweight,high real-time performance,and strong anonymity.The current FANETs security protocol cannot simultaneously meet the requirements of strong anonymity,high security,and low overhead in high dynamic and resource-constrained scenarios.To address these challenges,this paper proposes an Anonymous Authentication and Key Exchange Protocol(AAKE-OWA)for UAVs in FANETs based on OneWay Accumulators(OWA).During the UAV registration phase,the Key Management Center(KMC)generates an identity ticket for each UAV using OWA and transmits it securely to the UAV’s on-board tamper-proof module.In the key exchange phase,UAVs generate temporary authentication tickets with random numbers and compute the same session key leveraging the quasi-commutativity of OWA.For mutual anonymous authentication,UAVs encrypt random numbers with the session key and verify identities by comparing computed values with authentication values.Formal analysis using the Scyther tool confirms that the protocol resists identity spoofing,man-in-the-middle,and replay attacks.Through Burrows Abadi Needham(BAN)logic proof,it achieves mutual anonymity,prevents simulation and physical capture attacks,and ensures secure connectivity of 1.Experimental comparisons with existing protocols prove that the AAKE-OWA protocol has lower computational overhead,communication overhead,and storage overhead,making it more suitable for resource-constrained FANET scenarios.Performance comparison experiments show that,compared with other schemes,this scheme only requires 8 one-way accumulator operations and 4 symmetric encryption/decryption operations,with a total computational overhead as low as 2.3504 ms,a communication overhead of merely 1216 bits,and a storage overhead of 768 bits.We have achieved a reduction in computational costs from 6.3%to 90.3%,communication costs from 5.0%to 69.1%,and overall storage costs from 33%to 68%compared to existing solutions.It can meet the performance requirements of lightweight,real-time,and anonymity for unmanned aerial vehicles(UAVs)networks.展开更多
In Wireless Sensor Networks(WSNs),survivability is a crucial issue that is greatly impacted by energy efficiency.Solutions that satisfy application objectives while extending network life are needed to address severe ...In Wireless Sensor Networks(WSNs),survivability is a crucial issue that is greatly impacted by energy efficiency.Solutions that satisfy application objectives while extending network life are needed to address severe energy constraints inWSNs.This paper presents an Adaptive Enhanced GreyWolf Optimizer(AEGWO)for energy-efficient cluster head(CH)selection that mitigates the exploration–exploitation imbalance,preserves population diversity,and avoids premature convergence inherent in baseline GWO.The AEGWO combines adaptive control of the parameter of the search pressure to accelerate convergence without stagnation,a hybrid velocity-momentum update based on the dynamics of PSO,and an intelligent mutation operator to maintain the diversity of the population.The search is guided by a multi-objective fitness,which aims at maximizing the residual energy,equal distribution of CH,minimizing the intra-cluster distance,desirable proximity to sinks,and enhancing the coverage.Simulations on 100 nodes homogeneousWSN Tested the proposed AEGWO under the same conditions with LEACH,GWO,IGWO,PSO,WOA,and GA,AEGWO significantly increases stability and lifetime compared to LEACHand other tested algorithms;it has the best first,half,and last node dead,and higher residual energy and smaller communication overhead.The findings prove that AEGWO provides sustainable energy management and better lifetime extension,which makes it a robust,flexible clustering protocol of large-scaleWSNs.展开更多
In this paper,we investigate data-driven bright soliton solutions of the nonlocal reverse-time nonlinear Schrodinger(NLS)equation and the parameter identification using the physically informed neural networks(PINNs)al...In this paper,we investigate data-driven bright soliton solutions of the nonlocal reverse-time nonlinear Schrodinger(NLS)equation and the parameter identification using the physically informed neural networks(PINNs)algorithm.Accurate simulations and comparative analyses of relative and absolute errors are performed for two-soliton and four-soliton solutions including linear solitary waves and periodic waves.In the training process,the standard PINNs scheme is employed for linear solitary wave solutions,while the prior information is added at local sharp regions for periodic wave solutions due to the complicated collision behaviors.For the parameter identification,we accurately recognize the nonlinear coefficients of the nonlocal NLS equation from known solutions with different noises.These results reinforce the application of deep learning with the PINNs framework to successfully study nonlocal integrable systems.展开更多
Next-GenerationNetworks(NGNs)demand high resilience,dynamic adaptability,and efficient resource utilization to enable ubiquitous connectivity.In this context,the Space-Air-Ground Integrated Network(SAGIN)architecture ...Next-GenerationNetworks(NGNs)demand high resilience,dynamic adaptability,and efficient resource utilization to enable ubiquitous connectivity.In this context,the Space-Air-Ground Integrated Network(SAGIN)architecture is uniquely positioned to meet these requirements.However,conventional NGN routing algorithms often fail to account for SAGIN’s intrinsic characteristics,such as its heterogeneous structure,dynamic topology,and constrained resources,leading to suboptimal performance under disruptions such as node failures or cyberattacks.To meet these demands for SAGIN,this study proposes a resilience-oriented routing optimization framework featuring dynamic weighting and multi-objective evaluation.Methodologically,we define three core routing performance metrics,quantified through a four-dimensionalmodel,encompassing robustness Rd,resilience Rr,adaptability Ra,and resource utilization efficiency Ru,and integrate them into a comprehensive evaluation metric.In simulated SAGIN environments,the proposed Multi-Indicator Weighted Resilience Evaluation Algorithm(MIW-REA)demonstrates significant improvements in resilience enhancement,recovery acceleration,and resource optimization.It maintains 82.3%service availability even with a 30%node failure rate,reduces Distributed Denial of Service(DDoS)attack recovery time by 43%,decreases bandwidth waste by 23.4%,and lowers energy consumption by 18.9%.By addressing challenges unique to the SAGIN network,this research provides a flexible real-time solution for NGN routing optimization that balances resilience,efficiency,and adaptability,advancing the field.展开更多
In the process of programmable networks simplifying network management and increasing network flexibility through custom packet behavior,security incidents caused by human logic errors are seriously threatening their ...In the process of programmable networks simplifying network management and increasing network flexibility through custom packet behavior,security incidents caused by human logic errors are seriously threatening their safe operation,robust verificationmethods are required to ensure their correctness.As one of the formalmethods,symbolic execution offers a viable approach for verifying programmable networks by systematically exploring all possible paths within a program.However,its application in this field encounters scalability issues due to path explosion and complex constraint-solving.Therefore,in this paper,we propose NetVerifier,a scalable verification system for programmable networks.Tomitigate the path explosion issue,we developmultiple pruning strategies that strategically eliminate irrelevant execution paths while preserving verification integrity by precisely identifying the execution paths related to the verification purpose.To address the complex constraint-solving problem,we introduce an execution results reuse solution to avoid redundant computation of the same constraints.To apply these solutions intelligently,a matching algorithm is implemented to automatically select appropriate solutions based on the characteristics of the verification requirement.Moreover,Language Aided Verification(LAV),an assertion language,is designed to express verification intentions in a concise form.Experimental results on diverse open-source programs of varying scales demonstrate NetVerifier’s improvement in scalability and effectiveness in identifying potential network errors.In the best scenario,compared with ASSERT-P4,NetVerifier reduced the execution path,verification time,and memory occupation of the verification process by 99.92%,94.76%,and 65.19%,respectively.展开更多
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.展开更多
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%.展开更多
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.展开更多
Multi-band optical networks are a potential technology for increasing network capacity.However,the strong interference and non-uniformity between wavelengths in multi-band optical networks have become a bottleneck res...Multi-band optical networks are a potential technology for increasing network capacity.However,the strong interference and non-uniformity between wavelengths in multi-band optical networks have become a bottleneck restricting the transmission capacity of multi-band optical networks.To overcome these challenges,it is particularly important to implement optical power optimization targeting wavelength differences.Therefore,based on the generalized Gaussian noise model,we first formulate an optimization model for the problems of routing,modulation format,wavelength,and power allocation in C+L+S multi-band optical networks.Our objective function is to maximize the average link capacity of the network while ensuring that the Optical Signal-to-Noise(OSNR)threshold of the service request is not exceeded.Next,we propose a NonLinear Interferenceaware(NLI-aware)routing,modulation format,wavelength,and power allocation algorithm.Finally,we conduct simulations under different test conditions.The simulation results indicate that our algorithm can effectively reduce the blocking probability by 23.5%and improve the average link capacity by 3.78%in C+L+S multi-band optical networks.展开更多
Network virtualization is the development trend and inevitable requirement of hybrid wireless sensor networks(HWSNs).Low mapping efficiency and service interruption caused by mobility seriously affect the reliability ...Network virtualization is the development trend and inevitable requirement of hybrid wireless sensor networks(HWSNs).Low mapping efficiency and service interruption caused by mobility seriously affect the reliability of sensing tasks and ultimately affect the long-term revenue of the infrastructure providers.In response to these problems,this paper proposes an efficient virtual network embedding algorithm with a reliable service guarantee.Based on the topological attributes of nodes,a method for evaluating the physical network resource importance degree is proposed,and the nodes with rich resources are selected to improve embedding efficiency.Then,a method for evaluating the physical network reliability degree is proposed to predict the probability of mobile sensors providing uninterrupted services.The simulation results show that the proposed algorithm improves the acceptance rate of virtual sensor networks(VSN)embedding requests and the long-term revenue of the infrastructure providers.展开更多
Non-Orthogonal Multiple Access(NOMA)assisted Unmanned Aerial Vehicle(UAV)communication is becoming a promising technique for future B5G/6G networks.However,the security of the NOMA-UAV networks remains critical challe...Non-Orthogonal Multiple Access(NOMA)assisted Unmanned Aerial Vehicle(UAV)communication is becoming a promising technique for future B5G/6G networks.However,the security of the NOMA-UAV networks remains critical challenges due to the shared wireless spectrum and Line-of-Sight(LoS)channel.This paper formulates a joint UAV trajectory design and power allocation problem with the aid of the ground jammer to maximize the sum secrecy rate.First,the joint optimization problem is modeled as a Markov Decision Process(MDP).Then,the Deep Reinforcement Learning(DRL)method is utilized to search the optimal policy from the continuous action space.In order to accelerate the sample accumulation,the Asynchronous Advantage Actor-Critic(A3C)scheme with multiple workers is proposed,which reformulates the action and reward to acquire complete update duration.Simulation results demonstrate that the A3C-based scheme outperforms the baseline schemes in term of the secrecy rate and stability.展开更多
Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectu...Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectural attention,routing protocols,location exploration,time exploration,etc.This research aims to optimize routing protocols and address the challenges arising from conflicting objectives in WSN environments,such as balancing energy consumption,ensuring routing reliability,distributing network load,and selecting the shortest path.Many optimization techniques have shown success in achieving one or two objectives but struggle to achieve the right balance between multiple conflicting objectives.To address this gap,this paper proposes an innovative approach that integrates Particle Swarm Optimization(PSO)with a fuzzy multi-objective framework.The proposed method uses fuzzy logic to effectively control multiple competing objectives to represent its major development beyond existing methods that only deal with one or two objectives.The search efficiency is improved by particle swarm optimization(PSO)which overcomes the large computational requirements that serve as a major drawback of existing methods.The PSO algorithm is adapted for WSNs to optimize routing paths based on fuzzy multi-objective fitness.The fuzzy logic framework uses predefined membership functions and rule-based reasoning to adjust routing decisions.These adjustments influence PSO’s velocity updates,ensuring continuous adaptation under varying network conditions.The proposed multi-objective PSO-fuzzy model is evaluated using NS-3 simulation.The results show that the proposed model is capable of improving the network lifetime by 15.2%–22.4%,increasing the stabilization time by 18.7%–25.5%,and increasing the residual energy by 8.9%–16.2% compared to the state-of-the-art techniques.The proposed model also achieves a 15%–24% reduction in load variance,demonstrating balanced routing and extended network lifetime.Furthermore,analysis using p-values obtained from multiple performance measures(p-values<0.05)showed that the proposed approach outperforms with a high level of confidence.The proposed multi-objective PSO-fuzzy model provides a robust and scalable solution to improve the performance of WSNs.It allows stable performance in networks with 100 to 300 nodes,under varying node densities,and across different base station placements.Computational complexity analysis has shown that the method fits well into large-scale WSNs and that the addition of fuzzy logic controls the power usage to make the system practical for real-world use.展开更多
As the economy grows, environmental issues are becoming increasingly severe, making the promotion of green behavior more urgent. Information dissemination and policy regulation play crucial roles in influencing and am...As the economy grows, environmental issues are becoming increasingly severe, making the promotion of green behavior more urgent. Information dissemination and policy regulation play crucial roles in influencing and amplifying the spread of green behavior across society. To this end, a novel three-layer model in multilayer networks is proposed. In the novel model, the information layer describes green information spreading, the physical contact layer depicts green behavior propagation, and policy regulation is symbolized by an isolated node beneath the two layers. Then, we deduce the green behavior threshold for the three-layer model using the microscopic Markov chain approach. Moreover, subject to some individuals who are more likely to influence others or become green nodes and the limitations of the capacity of policy regulation, an optimal scheme is given that could optimize policy interventions to most effectively prompt green behavior.Subsequently, simulations are performed to validate the preciseness and theoretical results of the new model. It reveals that policy regulation can prompt the prevalence and outbreak of green behavior. Then, the green behavior is more likely to spread and be prevalent in the SF network than in the ER network. Additionally, optimal allocation is highly successful in facilitating the dissemination of green behavior. In practice, the optimal allocation strategy could prioritize interventions at critical nodes or regions, such as highly connected urban areas, where the impact of green behavior promotion would be most significant.展开更多
Cyber-Physical Networks(CPN)are comprehensive systems that integrate information and physical domains,and are widely used in various fields such as online social networking,smart grids,and the Internet of Vehicles(IoV...Cyber-Physical Networks(CPN)are comprehensive systems that integrate information and physical domains,and are widely used in various fields such as online social networking,smart grids,and the Internet of Vehicles(IoV).With the increasing popularity of digital photography and Internet technology,more and more users are sharing images on CPN.However,many images are shared without any privacy processing,exposing hidden privacy risks and making sensitive content easily accessible to Artificial Intelligence(AI)algorithms.Existing image sharing methods lack fine-grained image sharing policies and cannot protect user privacy.To address this issue,we propose a social relationship-driven privacy customization protection model for publishers and co-photographers.We construct a heterogeneous social information network centered on social relationships,introduce a user intimacy evaluation method with time decay,and evaluate privacy levels considering user interest similarity.To protect user privacy while maintaining image appreciation,we design a lightweight face-swapping algorithm based on Generative Adversarial Network(GAN)to swap faces that need to be protected.Our proposed method minimizes the loss of image utility while satisfying privacy requirements,as shown by extensive theoretical and simulation analyses.展开更多
Symmetric encryption algorithms learned by the previous proposed end-to-end adversarial network encryption communication systems are deterministic.With the same key and same plaintext,the deterministic algorithm will ...Symmetric encryption algorithms learned by the previous proposed end-to-end adversarial network encryption communication systems are deterministic.With the same key and same plaintext,the deterministic algorithm will lead to the same ciphertext.This means that the key in the deterministic encryption algorithm can only be used once,thus the encryption is not practical.To solve this problem,a nondeterministic symmetric encryption end-to-end communication system based on generative adversarial networks is proposed.We design a nonce-based adversarial neural network model,where a“nonce”standing for“number used only once”is passed to communication participants,and does not need to be secret.Moreover,we optimize the network structure through adding Batch Normalization(BN)to the CNNs(Convolutional Neural Networks),selecting the appropriate activation functions,and setting appropriate CNNs parameters.Results of experiments and analysis show that our system can achieve non-deterministic symmetric encryption,where Alice encrypting the same plaintext with the key twice will generate different ciphertexts,and Bob can decrypt all these different ciphertexts of the same plaintext to the correct plaintext.And our proposed system has fast convergence and the correct rate of decryption when the plaintext length is 256 or even longer.展开更多
5G technology has endowed mobile communication terminals with features such as ultrawideband access,low latency,and high reliability transmission,which can complete the network access and interconnection of a large nu...5G technology has endowed mobile communication terminals with features such as ultrawideband access,low latency,and high reliability transmission,which can complete the network access and interconnection of a large number of devices,thus realizing richer application scenarios and constructing 5G-enabled vehicular networks.However,due to the vulnerability of wireless communication,vehicle privacy and communication security have become the key problems to be solved in vehicular networks.Moreover,the large-scale communication in the vehicular networks also makes the higher communication efficiency an inevitable requirement.In order to achieve efficient and secure communication while protecting vehicle privacy,this paper proposes a lightweight key agreement and key update scheme for 5G vehicular networks based on blockchain.Firstly,the key agreement is accomplished using certificateless public key cryptography,and based on the aggregate signature and the cooperation between the vehicle and the trusted authority,an efficient key updating method is proposed,which reduces the overhead and protects the privacy of the vehicle while ensuring the communication security.Secondly,by introducing blockchain and using smart contracts to load the vehicle public key table for key management,this meets the requirements of vehicle traceability and can dynamically track and revoke misbehaving vehicles.Finally,the formal security proof under the eck security model and the informal security analysis is conducted,it turns out that our scheme is more secure than other authentication schemes in the vehicular networks.Performance analysis shows that our scheme has lower overhead than existing schemes in terms of communication and computation.展开更多
Non-orthogonal multiple access (NOMA) technology has recently been widely integrated into multi-access edge computing (MEC) to support task offloading in industrial wireless networks (IWNs) with limited radio resource...Non-orthogonal multiple access (NOMA) technology has recently been widely integrated into multi-access edge computing (MEC) to support task offloading in industrial wireless networks (IWNs) with limited radio resources. This paper minimizes the system overhead regarding task processing delay and energy consumption for the IWN with hybrid NOMA and orthogonal multiple access (OMA) schemes. Specifically, we formulate the system overhead minimization (SOM) problem by considering the limited computation and communication resources and NOMA efficiency. To solve the complex mixed-integer nonconvex problem, we combine the multi-agent twin delayed deep deterministic policy gradient (MATD3) and convex optimization, namely MATD3-CO, for iterative optimization. Specifically, we first decouple SOM into two sub-problems, i.e., joint sub-channel allocation and task offloading sub-problem, and computation resource allocation sub-problem. Then, we propose MATD3 to optimize the sub-channel allocation and task offloading ratio, and employ the convex optimization to allocate the computation resource with a closed-form expression derived by the Karush-Kuhn-Tucker (KKT) conditions. The solution is obtained by iteratively solving these two sub-problems. The experimental results indicate that the MATD3-CO scheme, when compared to the benchmark schemes, significantly decreases system overhead with respect to both delay and energy consumption.展开更多
Research on wide area ad hoc networks is of great significance due to its application prospect in long-range networks such as aeronautical and maritime networks,etc.The design of MAC protocols is one of the most impor...Research on wide area ad hoc networks is of great significance due to its application prospect in long-range networks such as aeronautical and maritime networks,etc.The design of MAC protocols is one of the most important parts impacting the whole network performance.In this paper,we propose a dis-tributed TDMA-based MAC protocol called Dynamic Self Organizing TDMA(DSO-TDMA)for wide area ad hoc networks.DSO-TDMA includes three main features:(1)In a distributed way,nodes in the network select transmitting slots according to the congestion situation of the local air interface.(2)In a selforganization way,nodes dynamically adjust the resource occupancy ratio according to the queue length of neighbouring nodes within two-hop range.(3)In a piggyback way,the control information is transmitted together with the payload to reduce the overhead.We design the whole mechanisms,implement them in NS-3 and evaluate the performance of DSO-TDMA compared with another dynamic TDMA MAC protocol,EHR-TDMA.Results show that the end-to-end throughput of DSO-TDMA is at most 51.4%higher than that of EHR-TDMA,and the average access delay of DSO-TDMA is at most 66.05%lower than that of EHR-TDMA.展开更多
基金funded by the Deanship of Scientific Research(DSR)at King Abdulaziz University,Jeddah,Saudi Arabia,grant number RG-2-611-42(A.O.A.).
文摘Wi-Fi technology has evolved significantly since its introduction in 1997,advancing to Wi-Fi 6 as the latest standard,with Wi-Fi 7 currently under development.Despite these advancements,integrating machine learning into Wi-Fi networks remains challenging,especially in decentralized environments with multiple access points(mAPs).This paper is a short review that summarizes the potential applications of federated reinforcement learning(FRL)across eight key areas of Wi-Fi functionality,including channel access,link adaptation,beamforming,multi-user transmissions,channel bonding,multi-link operation,spatial reuse,and multi-basic servic set(multi-BSS)coordination.FRL is highlighted as a promising framework for enabling decentralized training and decision-making while preserving data privacy.To illustrate its role in practice,we present a case study on link activation in a multi-link operation(MLO)environment with multiple APs.Through theoretical discussion and simulation results,the study demonstrates how FRL can improve performance and reliability,paving the way for more adaptive and collaborative Wi-Fi networks in the era of Wi-Fi 7 and beyond.
基金supported by the National Natural Science Foundation of China(51677030).
文摘Fires and human casualties caused by single phase-to-ground faults in distribution networks are frequent.However,existing ground fault suppression methods are affected by ground fault resistance.Thus,an adaptive suppression method that seamlessly combines principles of current and voltage suppression is proposed,which has good adaptability to different ground fault resistance.Meanwhile,a multi-criteria ground fault suppression exit strategy matched to adaptive suppression method is proposed to avoid damage of device caused by power backflow,which provides the possibility for reliable and fast exit of the fault suppression device.Experimental results demonstrate effectiveness and advantages of the adaptive suppression method and its exit strategy.
基金supported in part by National Natural Science Foundation of China(under Grant 61902163)the Jiangsu“Qing Lan Project”,Natural Science Foundation of the Jiangsu Higher Education Institutions of China(Major Research Project:23KJA520007)Postgraduate Research&Practice Innovation Program of Jiangsu Province(No.SJCX25_1303).
文摘Unmanned Aerial Vehicles(UAVs)in Flying Ad-Hoc Networks(FANETs)are widely used in both civilian and military fields,but they face severe security,trust,and privacy vulnerabilities due to their high mobility,dynamic topology,and open wireless channels.Existing security protocols for Mobile Ad-Hoc Networks(MANETs)cannot be directly applied to FANETs,as FANETs require lightweight,high real-time performance,and strong anonymity.The current FANETs security protocol cannot simultaneously meet the requirements of strong anonymity,high security,and low overhead in high dynamic and resource-constrained scenarios.To address these challenges,this paper proposes an Anonymous Authentication and Key Exchange Protocol(AAKE-OWA)for UAVs in FANETs based on OneWay Accumulators(OWA).During the UAV registration phase,the Key Management Center(KMC)generates an identity ticket for each UAV using OWA and transmits it securely to the UAV’s on-board tamper-proof module.In the key exchange phase,UAVs generate temporary authentication tickets with random numbers and compute the same session key leveraging the quasi-commutativity of OWA.For mutual anonymous authentication,UAVs encrypt random numbers with the session key and verify identities by comparing computed values with authentication values.Formal analysis using the Scyther tool confirms that the protocol resists identity spoofing,man-in-the-middle,and replay attacks.Through Burrows Abadi Needham(BAN)logic proof,it achieves mutual anonymity,prevents simulation and physical capture attacks,and ensures secure connectivity of 1.Experimental comparisons with existing protocols prove that the AAKE-OWA protocol has lower computational overhead,communication overhead,and storage overhead,making it more suitable for resource-constrained FANET scenarios.Performance comparison experiments show that,compared with other schemes,this scheme only requires 8 one-way accumulator operations and 4 symmetric encryption/decryption operations,with a total computational overhead as low as 2.3504 ms,a communication overhead of merely 1216 bits,and a storage overhead of 768 bits.We have achieved a reduction in computational costs from 6.3%to 90.3%,communication costs from 5.0%to 69.1%,and overall storage costs from 33%to 68%compared to existing solutions.It can meet the performance requirements of lightweight,real-time,and anonymity for unmanned aerial vehicles(UAVs)networks.
基金The Open Access publication fee for this article was fully covered by Abu Dhabi University.
文摘In Wireless Sensor Networks(WSNs),survivability is a crucial issue that is greatly impacted by energy efficiency.Solutions that satisfy application objectives while extending network life are needed to address severe energy constraints inWSNs.This paper presents an Adaptive Enhanced GreyWolf Optimizer(AEGWO)for energy-efficient cluster head(CH)selection that mitigates the exploration–exploitation imbalance,preserves population diversity,and avoids premature convergence inherent in baseline GWO.The AEGWO combines adaptive control of the parameter of the search pressure to accelerate convergence without stagnation,a hybrid velocity-momentum update based on the dynamics of PSO,and an intelligent mutation operator to maintain the diversity of the population.The search is guided by a multi-objective fitness,which aims at maximizing the residual energy,equal distribution of CH,minimizing the intra-cluster distance,desirable proximity to sinks,and enhancing the coverage.Simulations on 100 nodes homogeneousWSN Tested the proposed AEGWO under the same conditions with LEACH,GWO,IGWO,PSO,WOA,and GA,AEGWO significantly increases stability and lifetime compared to LEACHand other tested algorithms;it has the best first,half,and last node dead,and higher residual energy and smaller communication overhead.The findings prove that AEGWO provides sustainable energy management and better lifetime extension,which makes it a robust,flexible clustering protocol of large-scaleWSNs.
基金supported by the National Natural Science Foundation of China(Grant Nos.12171217 and 12375003)the Zhejiang Provincial Natural Science Foundation of China(Grant No.LMS 25A010013)。
文摘In this paper,we investigate data-driven bright soliton solutions of the nonlocal reverse-time nonlinear Schrodinger(NLS)equation and the parameter identification using the physically informed neural networks(PINNs)algorithm.Accurate simulations and comparative analyses of relative and absolute errors are performed for two-soliton and four-soliton solutions including linear solitary waves and periodic waves.In the training process,the standard PINNs scheme is employed for linear solitary wave solutions,while the prior information is added at local sharp regions for periodic wave solutions due to the complicated collision behaviors.For the parameter identification,we accurately recognize the nonlinear coefficients of the nonlocal NLS equation from known solutions with different noises.These results reinforce the application of deep learning with the PINNs framework to successfully study nonlocal integrable systems.
基金supported by the Beijing Natural Science Foundation under Grant 9242003partially supported by the Natural Science Foundation of Chongqing,China under Grant CSTB2023NSCQ-MSX0391+3 种基金partially supported by the National Natural Science Foundation of China under Grant 62471493partially supported by the Natural Science Foundation of Shandong Province under Grants ZR2023LZH017,ZR2024MF066supported by the Key Laboratory of Public Opinion Governance and Computational Communication under Grant YQKFYB202501The Research Project on the Development of Social Sciences in Hebei Province in 2024(No.202403150).
文摘Next-GenerationNetworks(NGNs)demand high resilience,dynamic adaptability,and efficient resource utilization to enable ubiquitous connectivity.In this context,the Space-Air-Ground Integrated Network(SAGIN)architecture is uniquely positioned to meet these requirements.However,conventional NGN routing algorithms often fail to account for SAGIN’s intrinsic characteristics,such as its heterogeneous structure,dynamic topology,and constrained resources,leading to suboptimal performance under disruptions such as node failures or cyberattacks.To meet these demands for SAGIN,this study proposes a resilience-oriented routing optimization framework featuring dynamic weighting and multi-objective evaluation.Methodologically,we define three core routing performance metrics,quantified through a four-dimensionalmodel,encompassing robustness Rd,resilience Rr,adaptability Ra,and resource utilization efficiency Ru,and integrate them into a comprehensive evaluation metric.In simulated SAGIN environments,the proposed Multi-Indicator Weighted Resilience Evaluation Algorithm(MIW-REA)demonstrates significant improvements in resilience enhancement,recovery acceleration,and resource optimization.It maintains 82.3%service availability even with a 30%node failure rate,reduces Distributed Denial of Service(DDoS)attack recovery time by 43%,decreases bandwidth waste by 23.4%,and lowers energy consumption by 18.9%.By addressing challenges unique to the SAGIN network,this research provides a flexible real-time solution for NGN routing optimization that balances resilience,efficiency,and adaptability,advancing the field.
基金supported by the National Key Research and Development Program of China under Grant 2023YFB2903902in part by the Science and Technology Innovation Leading Talents Subsidy Project of Central Plains under Grant 244200510038.
文摘In the process of programmable networks simplifying network management and increasing network flexibility through custom packet behavior,security incidents caused by human logic errors are seriously threatening their safe operation,robust verificationmethods are required to ensure their correctness.As one of the formalmethods,symbolic execution offers a viable approach for verifying programmable networks by systematically exploring all possible paths within a program.However,its application in this field encounters scalability issues due to path explosion and complex constraint-solving.Therefore,in this paper,we propose NetVerifier,a scalable verification system for programmable networks.Tomitigate the path explosion issue,we developmultiple pruning strategies that strategically eliminate irrelevant execution paths while preserving verification integrity by precisely identifying the execution paths related to the verification purpose.To address the complex constraint-solving problem,we introduce an execution results reuse solution to avoid redundant computation of the same constraints.To apply these solutions intelligently,a matching algorithm is implemented to automatically select appropriate solutions based on the characteristics of the verification requirement.Moreover,Language Aided Verification(LAV),an assertion language,is designed to express verification intentions in a concise form.Experimental results on diverse open-source programs of varying scales demonstrate NetVerifier’s improvement in scalability and effectiveness in identifying potential network errors.In the best scenario,compared with ASSERT-P4,NetVerifier reduced the execution path,verification time,and memory occupation of the verification process by 99.92%,94.76%,and 65.19%,respectively.
基金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 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%.
基金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 in part by the National Natural Science Foundation of China under Grants U21B2005,62201105,62331017,U24B20134,62222103,and 62025105in part by the Chongqing Municipal Education Commission under Grants KJQN202400621,KJQN202100643,and KJZDK202400608+1 种基金in part by the China Postdoctoral Science Foundation under Grant 2021M700563in part by the Chongqing Postdoctoral Funding Project under Grant 2021XM3052。
文摘Multi-band optical networks are a potential technology for increasing network capacity.However,the strong interference and non-uniformity between wavelengths in multi-band optical networks have become a bottleneck restricting the transmission capacity of multi-band optical networks.To overcome these challenges,it is particularly important to implement optical power optimization targeting wavelength differences.Therefore,based on the generalized Gaussian noise model,we first formulate an optimization model for the problems of routing,modulation format,wavelength,and power allocation in C+L+S multi-band optical networks.Our objective function is to maximize the average link capacity of the network while ensuring that the Optical Signal-to-Noise(OSNR)threshold of the service request is not exceeded.Next,we propose a NonLinear Interferenceaware(NLI-aware)routing,modulation format,wavelength,and power allocation algorithm.Finally,we conduct simulations under different test conditions.The simulation results indicate that our algorithm can effectively reduce the blocking probability by 23.5%and improve the average link capacity by 3.78%in C+L+S multi-band optical networks.
基金supported by National Natural Science Foundation of China(61901071,61871062,61771082,U20A20157)Science and Natural Science Foundation of Chongqing,China(cstc2020jcyjzdxmX0024)+1 种基金University Innovation Research Group of Chongqing(CXQT20017)Scientific and Technological Research Program of Chongqing Municipal Education Commission(No.KJZD-K201901301).
文摘Network virtualization is the development trend and inevitable requirement of hybrid wireless sensor networks(HWSNs).Low mapping efficiency and service interruption caused by mobility seriously affect the reliability of sensing tasks and ultimately affect the long-term revenue of the infrastructure providers.In response to these problems,this paper proposes an efficient virtual network embedding algorithm with a reliable service guarantee.Based on the topological attributes of nodes,a method for evaluating the physical network resource importance degree is proposed,and the nodes with rich resources are selected to improve embedding efficiency.Then,a method for evaluating the physical network reliability degree is proposed to predict the probability of mobile sensors providing uninterrupted services.The simulation results show that the proposed algorithm improves the acceptance rate of virtual sensor networks(VSN)embedding requests and the long-term revenue of the infrastructure providers.
基金supported by the Fundamental Research Funds for the Central Universities,China(No.2024MS115).
文摘Non-Orthogonal Multiple Access(NOMA)assisted Unmanned Aerial Vehicle(UAV)communication is becoming a promising technique for future B5G/6G networks.However,the security of the NOMA-UAV networks remains critical challenges due to the shared wireless spectrum and Line-of-Sight(LoS)channel.This paper formulates a joint UAV trajectory design and power allocation problem with the aid of the ground jammer to maximize the sum secrecy rate.First,the joint optimization problem is modeled as a Markov Decision Process(MDP).Then,the Deep Reinforcement Learning(DRL)method is utilized to search the optimal policy from the continuous action space.In order to accelerate the sample accumulation,the Asynchronous Advantage Actor-Critic(A3C)scheme with multiple workers is proposed,which reformulates the action and reward to acquire complete update duration.Simulation results demonstrate that the A3C-based scheme outperforms the baseline schemes in term of the secrecy rate and stability.
基金funded by Deanship of Graduate studies and Scientific Research at Jouf University under grant No.(DGSSR-2023-2-02038).
文摘Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectural attention,routing protocols,location exploration,time exploration,etc.This research aims to optimize routing protocols and address the challenges arising from conflicting objectives in WSN environments,such as balancing energy consumption,ensuring routing reliability,distributing network load,and selecting the shortest path.Many optimization techniques have shown success in achieving one or two objectives but struggle to achieve the right balance between multiple conflicting objectives.To address this gap,this paper proposes an innovative approach that integrates Particle Swarm Optimization(PSO)with a fuzzy multi-objective framework.The proposed method uses fuzzy logic to effectively control multiple competing objectives to represent its major development beyond existing methods that only deal with one or two objectives.The search efficiency is improved by particle swarm optimization(PSO)which overcomes the large computational requirements that serve as a major drawback of existing methods.The PSO algorithm is adapted for WSNs to optimize routing paths based on fuzzy multi-objective fitness.The fuzzy logic framework uses predefined membership functions and rule-based reasoning to adjust routing decisions.These adjustments influence PSO’s velocity updates,ensuring continuous adaptation under varying network conditions.The proposed multi-objective PSO-fuzzy model is evaluated using NS-3 simulation.The results show that the proposed model is capable of improving the network lifetime by 15.2%–22.4%,increasing the stabilization time by 18.7%–25.5%,and increasing the residual energy by 8.9%–16.2% compared to the state-of-the-art techniques.The proposed model also achieves a 15%–24% reduction in load variance,demonstrating balanced routing and extended network lifetime.Furthermore,analysis using p-values obtained from multiple performance measures(p-values<0.05)showed that the proposed approach outperforms with a high level of confidence.The proposed multi-objective PSO-fuzzy model provides a robust and scalable solution to improve the performance of WSNs.It allows stable performance in networks with 100 to 300 nodes,under varying node densities,and across different base station placements.Computational complexity analysis has shown that the method fits well into large-scale WSNs and that the addition of fuzzy logic controls the power usage to make the system practical for real-world use.
基金Project supported by the National Natural Science Foundation of China (Grant No. 62371253)the Postgraduate Research and Practice Innovation Program of Jiangsu Province, China (Grant No. KYCX24_1179)。
文摘As the economy grows, environmental issues are becoming increasingly severe, making the promotion of green behavior more urgent. Information dissemination and policy regulation play crucial roles in influencing and amplifying the spread of green behavior across society. To this end, a novel three-layer model in multilayer networks is proposed. In the novel model, the information layer describes green information spreading, the physical contact layer depicts green behavior propagation, and policy regulation is symbolized by an isolated node beneath the two layers. Then, we deduce the green behavior threshold for the three-layer model using the microscopic Markov chain approach. Moreover, subject to some individuals who are more likely to influence others or become green nodes and the limitations of the capacity of policy regulation, an optimal scheme is given that could optimize policy interventions to most effectively prompt green behavior.Subsequently, simulations are performed to validate the preciseness and theoretical results of the new model. It reveals that policy regulation can prompt the prevalence and outbreak of green behavior. Then, the green behavior is more likely to spread and be prevalent in the SF network than in the ER network. Additionally, optimal allocation is highly successful in facilitating the dissemination of green behavior. In practice, the optimal allocation strategy could prioritize interventions at critical nodes or regions, such as highly connected urban areas, where the impact of green behavior promotion would be most significant.
基金supported in part by National Natural Science Foundation of China(62271096,U20A20157)Natural Science Foundation of Chongqing,China(cstc2020jcyj-zdxmX0024,CSTB2022NSCQMSX0600)+5 种基金University Innovation Research Group of Chongqing(CXQT20017)Program for Innovation Team Building at Institutions of Higher Education in Chongqing(CXTDX201601020)Science and Technology Research Program of Chongqing Municipal Education Commission(KJQN202000626)Youth Innovation Group Support Program of ICE Discipline of CQUPT(SCIE-QN-2022-04)the Science and Technology Research Program of Chongqing Municipal Education Commission under Grant KJQN202000626Chongqing Municipal Technology Innovation and Application Development Special Key Project(cstc2020jscx-dxwtBX0053)。
文摘Cyber-Physical Networks(CPN)are comprehensive systems that integrate information and physical domains,and are widely used in various fields such as online social networking,smart grids,and the Internet of Vehicles(IoV).With the increasing popularity of digital photography and Internet technology,more and more users are sharing images on CPN.However,many images are shared without any privacy processing,exposing hidden privacy risks and making sensitive content easily accessible to Artificial Intelligence(AI)algorithms.Existing image sharing methods lack fine-grained image sharing policies and cannot protect user privacy.To address this issue,we propose a social relationship-driven privacy customization protection model for publishers and co-photographers.We construct a heterogeneous social information network centered on social relationships,introduce a user intimacy evaluation method with time decay,and evaluate privacy levels considering user interest similarity.To protect user privacy while maintaining image appreciation,we design a lightweight face-swapping algorithm based on Generative Adversarial Network(GAN)to swap faces that need to be protected.Our proposed method minimizes the loss of image utility while satisfying privacy requirements,as shown by extensive theoretical and simulation analyses.
基金supported by The National Defense Innovation Project(No.ZZKY20222411)Natural Science Basic Research Plan in Shaanxi Province of China(No.2024JC-YBMS-546).
文摘Symmetric encryption algorithms learned by the previous proposed end-to-end adversarial network encryption communication systems are deterministic.With the same key and same plaintext,the deterministic algorithm will lead to the same ciphertext.This means that the key in the deterministic encryption algorithm can only be used once,thus the encryption is not practical.To solve this problem,a nondeterministic symmetric encryption end-to-end communication system based on generative adversarial networks is proposed.We design a nonce-based adversarial neural network model,where a“nonce”standing for“number used only once”is passed to communication participants,and does not need to be secret.Moreover,we optimize the network structure through adding Batch Normalization(BN)to the CNNs(Convolutional Neural Networks),selecting the appropriate activation functions,and setting appropriate CNNs parameters.Results of experiments and analysis show that our system can achieve non-deterministic symmetric encryption,where Alice encrypting the same plaintext with the key twice will generate different ciphertexts,and Bob can decrypt all these different ciphertexts of the same plaintext to the correct plaintext.And our proposed system has fast convergence and the correct rate of decryption when the plaintext length is 256 or even longer.
基金supported in part by the National Natural Science Foundation of China under Grant 61941113,Grant 61971033,and Grant 61671057by the Henan Provincial Department of Science and Technology Project(No.212102210408)by the Henan Provincial Key Scientific Research Project(No.22A520041).
文摘5G technology has endowed mobile communication terminals with features such as ultrawideband access,low latency,and high reliability transmission,which can complete the network access and interconnection of a large number of devices,thus realizing richer application scenarios and constructing 5G-enabled vehicular networks.However,due to the vulnerability of wireless communication,vehicle privacy and communication security have become the key problems to be solved in vehicular networks.Moreover,the large-scale communication in the vehicular networks also makes the higher communication efficiency an inevitable requirement.In order to achieve efficient and secure communication while protecting vehicle privacy,this paper proposes a lightweight key agreement and key update scheme for 5G vehicular networks based on blockchain.Firstly,the key agreement is accomplished using certificateless public key cryptography,and based on the aggregate signature and the cooperation between the vehicle and the trusted authority,an efficient key updating method is proposed,which reduces the overhead and protects the privacy of the vehicle while ensuring the communication security.Secondly,by introducing blockchain and using smart contracts to load the vehicle public key table for key management,this meets the requirements of vehicle traceability and can dynamically track and revoke misbehaving vehicles.Finally,the formal security proof under the eck security model and the informal security analysis is conducted,it turns out that our scheme is more secure than other authentication schemes in the vehicular networks.Performance analysis shows that our scheme has lower overhead than existing schemes in terms of communication and computation.
基金supported by the National Natural Science Foundation of China under Grants 92267108,62173322 and 61821005the Science and Technology Program of Liaoning Province under Grants 2023JH3/10200004 and 2022JH25/10100005.
文摘Non-orthogonal multiple access (NOMA) technology has recently been widely integrated into multi-access edge computing (MEC) to support task offloading in industrial wireless networks (IWNs) with limited radio resources. This paper minimizes the system overhead regarding task processing delay and energy consumption for the IWN with hybrid NOMA and orthogonal multiple access (OMA) schemes. Specifically, we formulate the system overhead minimization (SOM) problem by considering the limited computation and communication resources and NOMA efficiency. To solve the complex mixed-integer nonconvex problem, we combine the multi-agent twin delayed deep deterministic policy gradient (MATD3) and convex optimization, namely MATD3-CO, for iterative optimization. Specifically, we first decouple SOM into two sub-problems, i.e., joint sub-channel allocation and task offloading sub-problem, and computation resource allocation sub-problem. Then, we propose MATD3 to optimize the sub-channel allocation and task offloading ratio, and employ the convex optimization to allocate the computation resource with a closed-form expression derived by the Karush-Kuhn-Tucker (KKT) conditions. The solution is obtained by iteratively solving these two sub-problems. The experimental results indicate that the MATD3-CO scheme, when compared to the benchmark schemes, significantly decreases system overhead with respect to both delay and energy consumption.
文摘Research on wide area ad hoc networks is of great significance due to its application prospect in long-range networks such as aeronautical and maritime networks,etc.The design of MAC protocols is one of the most important parts impacting the whole network performance.In this paper,we propose a dis-tributed TDMA-based MAC protocol called Dynamic Self Organizing TDMA(DSO-TDMA)for wide area ad hoc networks.DSO-TDMA includes three main features:(1)In a distributed way,nodes in the network select transmitting slots according to the congestion situation of the local air interface.(2)In a selforganization way,nodes dynamically adjust the resource occupancy ratio according to the queue length of neighbouring nodes within two-hop range.(3)In a piggyback way,the control information is transmitted together with the payload to reduce the overhead.We design the whole mechanisms,implement them in NS-3 and evaluate the performance of DSO-TDMA compared with another dynamic TDMA MAC protocol,EHR-TDMA.Results show that the end-to-end throughput of DSO-TDMA is at most 51.4%higher than that of EHR-TDMA,and the average access delay of DSO-TDMA is at most 66.05%lower than that of EHR-TDMA.
