The information exchange among satellites is crucial for the implementation of cluster satellite cooperative missions.However,achieving fast perception,rapid networking,and highprecision time synchronization among nod...The information exchange among satellites is crucial for the implementation of cluster satellite cooperative missions.However,achieving fast perception,rapid networking,and highprecision time synchronization among nodes without the support of the Global Navigation Satellite System(GNSS)and other prior information remains a formidable challenge to real-time wireless networks design.Therefore,a self-organizing network methodology based on multi-agent negotiation is proposed,which autonomously determines the master node through collaborative negotiation and competitive elections.On this basis,a real-time network protocol design is carried out and a high-precision time synchronization method with motion compensation is proposed.Simulation results demonstrate that the proposed method enables rapid networking with the capability of selfdiscovery,self-organization,and self-healing.For a cluster of 8 satellites,the networking time and the reorganization time are less than 4 s.The time synchronization accuracy exceeds 10-10s with motion compensation,demonstrating excellent real-time performance and stability.The research presented in this paper provides a valuable reference for the design and application of spacebased self-organizing networks for satellite cluster.展开更多
In the bearings-only target tracking, wireless sensor network （WSN） collects observations of the target direction at various nodes and uses an adaptive filter to combine them for target tracking. An efficient networ...In the bearings-only target tracking, wireless sensor network （WSN） collects observations of the target direction at various nodes and uses an adaptive filter to combine them for target tracking. An efficient network management is necessary to gain an optimal tradeoffbetween locating accuracy and energy consumption. This article proposes a self-organizing target tracking algorithm to select the most beneficial subset of nodes to track the target at every snapshot. Compared with traditional methods, this scheme avoids the need for keeping global position information of the network as in greedy selection. Each node judges its future usefulness depending on the knowledge of its own position and using simple mathematics computation. Simulations indicate that this scheme has locating accuracy comparable to the global greedy algorithm. Also, it has good robustness against node failure and autonomous adaptability to the change of the network scale. Furthermore, this algorithm consumes limited energy because only a portion of nodes partakes in the selection at every snapshot.展开更多
Decoupling of revenues with network traffic and extreme penetration of expenses in wireless network leads to the critical situation for wireless service providers (WSP), as more wireless network is complex due to its ...Decoupling of revenues with network traffic and extreme penetration of expenses in wireless network leads to the critical situation for wireless service providers (WSP), as more wireless network is complex due to its heterogeneity in the context of planning, software & hardware installation, radio parameters setting, drive testing, optimization, healing and maintenance. These operations are time-consuming, labor & budget-intensive and error-prone if activated manually. Hence new approaches have to be designed and applied to meet those demands in a cost-effective way, Self-organizing networks (SON), is a promising approach to handle manual tasks with autonomous manners. More specifically the self-directed functions (self-planning, self-deployment, self-configuration, self-optimization and self-healing) are aid to reduce capital expenditure (CAPEX), implementation expenditure (IMPEX) and operational expenditure (OPEX). In this study, first we investigate the aforementioned impact factors of cost combined with self-functions. Then, we analyze the relative cost benefits causing from deploying the SON functions, using the economical method to have more precise results concerning those potential benefits. At last, the result shows that there is a significant difference in expenses and revenues of WSP with and without SON after enabling self-functions in wireless network.展开更多
Wireless networks support numerous terminals,manage large data volumes,and provide diverse services,but the vulnerability to environmental changes leads to increased complexity and costs.Situational awareness has been...Wireless networks support numerous terminals,manage large data volumes,and provide diverse services,but the vulnerability to environmental changes leads to increased complexity and costs.Situational awareness has been widely applied in network management,but existing methods fail to find optimal solutions due to the high heterogeneity of base stations,numerous metrics,and complex intercell dependencies.To address this gap,this paper proposes a specialized framework for wireless networks,integrating an evaluation model and control approach.The framework expands the indicator set into four key areas,introduces an evaluation method,and proposes the indicator perturbation greedy(IPG)algorithm and the adjustment scheme selection method based on damping coefficient(DCSS)for effective network optimization.A case study in an urban area demonstrates the framework’s ability to balance and improve network performance,enhancing situational awareness and operational efficiency under dynamic conditions.展开更多
Due to the widespread use of the Internet,customer information is vulnerable to computer systems attack,which brings urgent need for the intrusion detection technology.Recently,network intrusion detection has been one...Due to the widespread use of the Internet,customer information is vulnerable to computer systems attack,which brings urgent need for the intrusion detection technology.Recently,network intrusion detection has been one of the most important technologies in network security detection.The accuracy of network intrusion detection has reached higher accuracy so far.However,these methods have very low efficiency in network intrusion detection,even the most popular SOM neural network method.In this paper,an efficient and fast network intrusion detection method was proposed.Firstly,the fundamental of the two different methods are introduced respectively.Then,the selforganizing feature map neural network based on K-means clustering(KSOM)algorithms was presented to improve the efficiency of network intrusion detection.Finally,the NSLKDD is used as network intrusion data set to demonstrate that the KSOM method can significantly reduce the number of clustering iteration than SOM method without substantially affecting the clustering results and the accuracy is much higher than Kmeans method.The Experimental results show that our method can relatively improve the accuracy of network intrusion and significantly reduce the number of clustering iteration.展开更多
To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SO...To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SON). In this paper, a novel CCO scheme is proposed to maximize utility function of the integrated coverage and capacity. It starts with the analysis on the throughput proportional fairness(PF) algorithm and then proposes the novel Coverage and Capacity Proportional Fairness(CCPF) allocation algorithm along with a proof of the algorithms convergence. This proposed algorithm is applied in a coverage capacity optimization scheme which can guarantee the reasonable network capacity by the coverage range accommodation. Next, we simulate the proposed CCO scheme based on telecom operators' real network data and compare with three typical resource allocation algorithms: round robin(RR), proportional fairness(PF) and max C/I. In comparison of the PF algorithm, the numerical results show that our algorithm increases the average throughput by 1.54 and 1.96 times with constructed theoretical data and derived real network data respectively.展开更多
In the context of the rapid iteration of information technology,the Internet of Things(IoT)has established itself as a pivotal hub connecting the digital world and the physical world.Wireless Sensor Networks(WSNs),dee...In the context of the rapid iteration of information technology,the Internet of Things(IoT)has established itself as a pivotal hub connecting the digital world and the physical world.Wireless Sensor Networks(WSNs),deeply embedded in the perception layer architecture of the IoT,play a crucial role as“tactile nerve endings.”A vast number of micro sensor nodes are widely distributed in monitoring areas according to preset deployment strategies,continuously and accurately perceiving and collecting real-time data on environmental parameters such as temperature,humidity,light intensity,air pressure,and pollutant concentration.These data are transmitted to the IoT cloud platform through stable and reliable communication links,forming a massive and detailed basic data resource pool.By using cutting-edge big data processing algorithms,machine learning models,and artificial intelligence analysis tools,in-depth mining and intelligent analysis of these multi-source heterogeneous data are conducted to generate high-value-added decision-making bases.This precisely empowers multiple fields,including agriculture,medical and health care,smart home,environmental science,and industrial manufacturing,driving intelligent transformation and catalyzing society to move towards a new stage of high-quality development.This paper comprehensively analyzes the technical cores of the IoT and WSNs,systematically sorts out the advanced key technologies of WSNs and the evolution of their strategic significance in the IoT system,deeply explores the innovative application scenarios and practical effects of the two in specific vertical fields,and looks forward to the technological evolution trends.It provides a detailed and highly practical guiding reference for researchers,technical engineers,and industrial decision-makers.展开更多
In 6th Generation Mobile Networks(6G),the Space-Integrated-Ground(SIG)Radio Access Network(RAN)promises seamless coverage and exceptionally high Quality of Service(QoS)for diverse services.However,achieving this neces...In 6th Generation Mobile Networks(6G),the Space-Integrated-Ground(SIG)Radio Access Network(RAN)promises seamless coverage and exceptionally high Quality of Service(QoS)for diverse services.However,achieving this necessitates effective management of computation and wireless resources tailored to the requirements of various services.The heterogeneity of computation resources and interference among shared wireless resources pose significant coordination and management challenges.To solve these problems,this work provides an overview of multi-dimensional resource management in 6G SIG RAN,including computation and wireless resource.Firstly it provides with a review of current investigations on computation and wireless resource management and an analysis of existing deficiencies and challenges.Then focusing on the provided challenges,the work proposes an MEC-based computation resource management scheme and a mixed numerology-based wireless resource management scheme.Furthermore,it outlines promising future technologies,including joint model-driven and data-driven resource management technology,and blockchain-based resource management technology within the 6G SIG network.The work also highlights remaining challenges,such as reducing communication costs associated with unstable ground-to-satellite links and overcoming barriers posed by spectrum isolation.Overall,this comprehensive approach aims to pave the way for efficient and effective resource management in future 6G networks.展开更多
It is difficult to improve both energy consumption and detection accuracy simultaneously,and even to obtain the trade-off between them,when detecting and tracking moving targets,especially for Underwater Wireless Sens...It is difficult to improve both energy consumption and detection accuracy simultaneously,and even to obtain the trade-off between them,when detecting and tracking moving targets,especially for Underwater Wireless Sensor Networks(UWSNs).To this end,this paper investigates the relationship between the Degree of Target Change(DoTC)and the detection period,as well as the impact of individual nodes.A Hierarchical Detection and Tracking Approach(HDTA)is proposed.Firstly,the network detection period is determined according to DoTC,which reflects the variation of target motion.Secondly,during the network detection period,each detection node calculates its own node detection period based on the detection mutual information.Taking DoTC as pheromone,an ant colony algorithm is proposed to adaptively adjust the network detection period.The simulation results show that the proposed HDTA with the optimizations of network level and node level significantly improves the detection accuracy by 25%and the network energy consumption by 10%simultaneously,compared to the traditional adaptive period detection schemes.展开更多
Due to rapid urbanization, waterlogging induced by torrential rainfall has become a global concern and a potential risk affecting urban habitant's safety. Widespread waterlogging disasters haveoccurred almost annu...Due to rapid urbanization, waterlogging induced by torrential rainfall has become a global concern and a potential risk affecting urban habitant's safety. Widespread waterlogging disasters haveoccurred almost annuallyinthe urban area of Beijing, the capital of China. Based on a selforganizing map(SOM) artificial neural network(ANN), a graded waterlogging risk assessment was conducted on 56 low-lying points in Beijing, China. Social risk factors, such as Gross domestic product(GDP), population density, and traffic congestion, were utilized as input datasets in this study. The results indicate that SOM-ANNis suitable for automatically and quantitatively assessing risks associated with waterlogging. The greatest advantage of SOM-ANN in the assessment of waterlogging risk is that a priori knowledge about classification categories and assessment indicator weights is not needed. As a result, SOM-ANN can effectively overcome interference from subjective factors,producing classification results that are more objective and accurate. In this paper, the risk level of waterlogging in Beijing was divided into five grades. The points that were assigned risk grades of IV or Vwere located mainly in the districts of Chaoyang, Haidian, Xicheng, and Dongcheng.展开更多
Internet of things and network densification bring significant challenges to uplink management.Only depending on optimization algorithm enhancements is not enough for uplink transmission.To control intercell interfere...Internet of things and network densification bring significant challenges to uplink management.Only depending on optimization algorithm enhancements is not enough for uplink transmission.To control intercell interference,Fractional Uplink Power Control(FUPC)should be optimized from network-wide perspective,which has to find a better traffic distribution model.Conventionally,traffic distribution is geographic-based,and ineffective due to tricky locating efforts.This paper proposes a novel uplink power management framework for Self-Organizing Networks(SON),which firstly builds up pathloss-based traffic distribution model and then makes the decision of FUPC based on the model.PathLoss-based Traffic Distribution(PLTD)aggregates traffic based on the propagation condition of traffic that is defined as the pathloss between the position generating the traffic and surrounding cells.Simulations show that the improvement in optimization efficiency of FUPC with PLTD can be up to 40%compared to conventional GeoGraphic-based Traffic Distribution(GGTD).展开更多
Traveling salesman problem(TSP)is a classic non-deterministic polynomial-hard optimization prob-lem.Based on the characteristics of self-organizing mapping(SOM)network,this paper proposes an improved SOM network from ...Traveling salesman problem(TSP)is a classic non-deterministic polynomial-hard optimization prob-lem.Based on the characteristics of self-organizing mapping(SOM)network,this paper proposes an improved SOM network from the perspectives of network update strategy,initialization method,and parameter selection.This paper compares the performance of the proposed algorithms with the performance of existing SOM network algorithms on the TSP and compares them with several heuristic algorithms.Simulations show that compared with existing SOM networks,the improved SOM network proposed in this paper improves the convergence rate and algorithm accuracy.Compared with iterated local search and heuristic algorithms,the improved SOM net-work algorithms proposed in this paper have the advantage of fast calculation speed on medium-scale TSP.展开更多
Wireless Sensor Network(WSN)comprises a set of interconnected,compact,autonomous,and resource-constrained sensor nodes that are wirelessly linked to monitor and gather data from the physical environment.WSNs are commo...Wireless Sensor Network(WSN)comprises a set of interconnected,compact,autonomous,and resource-constrained sensor nodes that are wirelessly linked to monitor and gather data from the physical environment.WSNs are commonly used in various applications such as environmental monitoring,surveillance,healthcare,agriculture,and industrial automation.Despite the benefits of WSN,energy efficiency remains a challenging problem that needs to be addressed.Clustering and routing can be considered effective solutions to accomplish energy efficiency in WSNs.Recent studies have reported that metaheuristic algorithms can be applied to optimize cluster formation and routing decisions.This study introduces a new Northern Goshawk Optimization with boosted coati optimization algorithm for cluster-based routing(NGOBCO-CBR)method for WSN.The proposed NGOBCO-CBR method resolves the hot spot problem,uneven load balancing,and energy consumption in WSN.The NGOBCO-CBR technique comprises two major processes such as NGO based clustering and BCO-based routing.In the initial phase,the NGObased clustering method is designed for cluster head(CH)selection and cluster construction using five input variables such as residual energy(RE),node proximity,load balancing,network average energy,and distance to BS(DBS).Besides,the NGOBCO-CBR technique applies the BCO algorithm for the optimum selection of routes to BS.The experimental results of the NGOBCOCBR technique are studied under different scenarios,and the obtained results showcased the improved efficiency of the NGOBCO-CBR technique over recent approaches in terms of different measures.展开更多
In order to solve the problems of short network lifetime and high data transmission delay in data gathering for wireless sensor network(WSN)caused by uneven energy consumption among nodes,a hybrid energy efficient clu...In order to solve the problems of short network lifetime and high data transmission delay in data gathering for wireless sensor network(WSN)caused by uneven energy consumption among nodes,a hybrid energy efficient clustering routing base on firefly and pigeon-inspired algorithm(FF-PIA)is proposed to optimise the data transmission path.After having obtained the optimal number of cluster head node(CH),its result might be taken as the basis of producing the initial population of FF-PIA algorithm.The L′evy flight mechanism and adaptive inertia weighting are employed in the algorithm iteration to balance the contradiction between the global search and the local search.Moreover,a Gaussian perturbation strategy is applied to update the optimal solution,ensuring the algorithm can jump out of the local optimal solution.And,in the WSN data gathering,a onedimensional signal reconstruction algorithm model is developed by dilated convolution and residual neural networks(DCRNN).We conducted experiments on the National Oceanic and Atmospheric Administration(NOAA)dataset.It shows that the DCRNN modeldriven data reconstruction algorithm improves the reconstruction accuracy as well as the reconstruction time performance.FF-PIA and DCRNN clustering routing co-simulation reveals that the proposed algorithm can effectively improve the performance in extending the network lifetime and reducing data transmission delay.展开更多
This paper studies the problem of jamming decision-making for dynamic multiple communication links in wireless communication networks(WCNs).We propose a novel jamming channel allocation and power decision-making(JCAPD...This paper studies the problem of jamming decision-making for dynamic multiple communication links in wireless communication networks(WCNs).We propose a novel jamming channel allocation and power decision-making(JCAPD)approach based on multi-agent deep reinforcement learning(MADRL).In high-dynamic and multi-target aviation communication environments,the rapid changes in channels make it difficult for sensors to accurately capture instantaneous channel state information.This poses a challenge to make centralized jamming decisions with single-agent deep reinforcement learning(DRL)approaches.In response,we design a distributed multi-agent decision architecture(DMADA).We formulate multi-jammer resource allocation as a multiagent Markov decision process(MDP)and propose a fingerprint-based double deep Q-Network(FBDDQN)algorithm for solving it.Each jammer functions as an agent that interacts with the environment in this framework.Through the design of a reasonable reward and training mechanism,our approach enables jammers to achieve distributed cooperation,significantly improving the jamming success rate while considering jamming power cost,and reducing the transmission rate of links.Our experimental results show the FBDDQN algorithm is superior to the baseline methods.展开更多
Wireless Sensor Networks(WSN)have gained significant attention over recent years due to their extensive applications in various domains such as environmentalmonitoring,healthcare systems,industrial automation,and smar...Wireless Sensor Networks(WSN)have gained significant attention over recent years due to their extensive applications in various domains such as environmentalmonitoring,healthcare systems,industrial automation,and smart cities.However,such networks are inherently vulnerable to different types of attacks because they operate in open environments with limited resources and constrained communication capabilities.Thepaper addresses challenges related to modeling and analysis of wireless sensor networks and their susceptibility to attacks.Its objective is to create versatile modeling tools capable of detecting attacks against network devices and identifying anomalies caused either by legitimate user errors or malicious activities.A proposed integrated approach for data collection,preprocessing,and analysis in WSN outlines a series of steps applicable throughout both the design phase and operation stage.This ensures effective detection of attacks and anomalies within WSNs.An introduced attackmodel specifies potential types of unauthorized network layer attacks targeting network nodes,transmitted data,and services offered by the WSN.Furthermore,a graph-based analytical framework was designed to detect attacks by evaluating real-time events from network nodes and determining if an attack is underway.Additionally,a simulation model based on sequences of imperative rules defining behaviors of both regular and compromised nodes is presented.Overall,this technique was experimentally verified using a segment of a WSN embedded in a smart city infrastructure,simulating a wormhole attack.Results demonstrate the viability and practical significance of the technique for enhancing future information security measures.Validation tests confirmed high levels of accuracy and efficiency when applied specifically to detecting wormhole attacks targeting routing protocols in WSNs.Precision and recall rates averaged above the benchmark value of 0.95,thus validating the broad applicability of the proposed models across varied scenarios.展开更多
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.展开更多
A Wireless Sensor Network(WSN)comprises a series of spatially distributed autonomous devices,each equipped with sophisticated sensors.These sensors play a crucial role in monitoring diverse environmental conditions su...A Wireless Sensor Network(WSN)comprises a series of spatially distributed autonomous devices,each equipped with sophisticated sensors.These sensors play a crucial role in monitoring diverse environmental conditions such as light intensity,air pressure,temperature,humidity,wind,etc.These sensors are generally deployed in harsh and hostile conditions;hence they suffer from different kinds of faults.However,identifying faults in WSN data remains a complex task,as existing fault detection methods,including centralized,distributed,and hybrid approaches,rely on the spatio⁃temporal correlation among sensor nodes.Moreover,existing techniques predominantly leverage classification⁃based machine learning methods to discern the fault state within WSN.In this paper,we propose a regression⁃based bagging method to detect the faults in the network.The proposed bagging method is consisted of GRU(Gated Recurrent Unit)and Prophet model.Bagging allows weak learners to combine efforts to outperform a strong learner,hence it is appropriate to use in WSN.The proposed bagging method was first trained at the base station,then they were deployed at each SN(Sensor Node).Most of the common faults in WSN,such as transient,intermittent and permanent faults,were considered.The validity of the proposed scheme was tested using a trusted online published dataset.Using experimental studies,compared to the latest state⁃of⁃the⁃art machine learning models,the effectiveness of the proposed model is shown for fault detection.Performance evaluation in terms of false positive rate,accuracy,and false alarm rate shows the efficiency of the proposed algorithm.展开更多
Wireless Sensor Networks(WSNs)play a critical role in automated border surveillance systems,where continuous monitoring is essential.However,limited energy resources in sensor nodes lead to frequent network failures a...Wireless Sensor Networks(WSNs)play a critical role in automated border surveillance systems,where continuous monitoring is essential.However,limited energy resources in sensor nodes lead to frequent network failures and reduced coverage over time.To address this issue,this paper presents an innovative energy-efficient protocol based on deep Q-learning(DQN),specifically developed to prolong the operational lifespan of WSNs used in border surveillance.By harnessing the adaptive power of DQN,the proposed protocol dynamically adjusts node activity and communication patterns.This approach ensures optimal energy usage while maintaining high coverage,connectivity,and data accuracy.The proposed system is modeled with 100 sensor nodes deployed over a 1000 m×1000 m area,featuring a strategically positioned sink node.Our method outperforms traditional approaches,achieving significant enhancements in network lifetime and energy utilization.Through extensive simulations,it is observed that the network lifetime increases by 9.75%,throughput increases by 8.85%and average delay decreases by 9.45%in comparison to the similar recent protocols.It demonstrates the robustness and efficiency of our protocol in real-world scenarios,highlighting its potential to revolutionize border surveillance operations.展开更多
Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic ...Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic models,and there is a significant gap between the research results and actual wireless sensor networks.Some scholars have now modeled data fusion networks to make them more suitable for practical applications.This paper will explore the deployment problem of a stochastic data fusion wireless sensor network(SDFWSN),a model that reflects the randomness of environmental monitoring and uses data fusion techniques widely used in actual sensor networks for information collection.The deployment problem of SDFWSN is modeled as a multi-objective optimization problem.The network life cycle,spatiotemporal coverage,detection rate,and false alarm rate of SDFWSN are used as optimization objectives to optimize the deployment of network nodes.This paper proposes an enhanced multi-objective mongoose optimization algorithm(EMODMOA)to solve the deployment problem of SDFWSN.First,to overcome the shortcomings of the DMOA algorithm,such as its low convergence and tendency to get stuck in a local optimum,an encircling and hunting strategy is introduced into the original algorithm to propose the EDMOA algorithm.The EDMOA algorithm is designed as the EMODMOA algorithm by selecting reference points using the K-Nearest Neighbor(KNN)algorithm.To verify the effectiveness of the proposed algorithm,the EMODMOA algorithm was tested at CEC 2020 and achieved good results.In the SDFWSN deployment problem,the algorithm was compared with the Non-dominated Sorting Genetic Algorithm II(NSGAII),Multiple Objective Particle Swarm Optimization(MOPSO),Multi-Objective Evolutionary Algorithm based on Decomposition(MOEA/D),and Multi-Objective Grey Wolf Optimizer(MOGWO).By comparing and analyzing the performance evaluation metrics and optimization results of the objective functions of the multi-objective algorithms,the algorithm outperforms the other algorithms in the SDFWSN deployment results.To better demonstrate the superiority of the algorithm,simulations of diverse test cases were also performed,and good results were obtained.展开更多
基金supported by the National Natural Science Foundation of China(No.62401597)the Natural Science Foundation of Hunan Province,China(No.2024JJ6469)the Scientific Research Project of National University of Defense Technology,China(No.ZK22-02)。
文摘The information exchange among satellites is crucial for the implementation of cluster satellite cooperative missions.However,achieving fast perception,rapid networking,and highprecision time synchronization among nodes without the support of the Global Navigation Satellite System(GNSS)and other prior information remains a formidable challenge to real-time wireless networks design.Therefore,a self-organizing network methodology based on multi-agent negotiation is proposed,which autonomously determines the master node through collaborative negotiation and competitive elections.On this basis,a real-time network protocol design is carried out and a high-precision time synchronization method with motion compensation is proposed.Simulation results demonstrate that the proposed method enables rapid networking with the capability of selfdiscovery,self-organization,and self-healing.For a cluster of 8 satellites,the networking time and the reorganization time are less than 4 s.The time synchronization accuracy exceeds 10-10s with motion compensation,demonstrating excellent real-time performance and stability.The research presented in this paper provides a valuable reference for the design and application of spacebased self-organizing networks for satellite cluster.
基金National Natural Science Foundation of China （60532030） National Science Fund for Distinguished Young Scholars （60625102） Ph.D. Programs Foundation of Ministry of Education of China （200802240）
文摘In the bearings-only target tracking, wireless sensor network （WSN） collects observations of the target direction at various nodes and uses an adaptive filter to combine them for target tracking. An efficient network management is necessary to gain an optimal tradeoffbetween locating accuracy and energy consumption. This article proposes a self-organizing target tracking algorithm to select the most beneficial subset of nodes to track the target at every snapshot. Compared with traditional methods, this scheme avoids the need for keeping global position information of the network as in greedy selection. Each node judges its future usefulness depending on the knowledge of its own position and using simple mathematics computation. Simulations indicate that this scheme has locating accuracy comparable to the global greedy algorithm. Also, it has good robustness against node failure and autonomous adaptability to the change of the network scale. Furthermore, this algorithm consumes limited energy because only a portion of nodes partakes in the selection at every snapshot.
文摘Decoupling of revenues with network traffic and extreme penetration of expenses in wireless network leads to the critical situation for wireless service providers (WSP), as more wireless network is complex due to its heterogeneity in the context of planning, software & hardware installation, radio parameters setting, drive testing, optimization, healing and maintenance. These operations are time-consuming, labor & budget-intensive and error-prone if activated manually. Hence new approaches have to be designed and applied to meet those demands in a cost-effective way, Self-organizing networks (SON), is a promising approach to handle manual tasks with autonomous manners. More specifically the self-directed functions (self-planning, self-deployment, self-configuration, self-optimization and self-healing) are aid to reduce capital expenditure (CAPEX), implementation expenditure (IMPEX) and operational expenditure (OPEX). In this study, first we investigate the aforementioned impact factors of cost combined with self-functions. Then, we analyze the relative cost benefits causing from deploying the SON functions, using the economical method to have more precise results concerning those potential benefits. At last, the result shows that there is a significant difference in expenses and revenues of WSP with and without SON after enabling self-functions in wireless network.
文摘Wireless networks support numerous terminals,manage large data volumes,and provide diverse services,but the vulnerability to environmental changes leads to increased complexity and costs.Situational awareness has been widely applied in network management,but existing methods fail to find optimal solutions due to the high heterogeneity of base stations,numerous metrics,and complex intercell dependencies.To address this gap,this paper proposes a specialized framework for wireless networks,integrating an evaluation model and control approach.The framework expands the indicator set into four key areas,introduces an evaluation method,and proposes the indicator perturbation greedy(IPG)algorithm and the adjustment scheme selection method based on damping coefficient(DCSS)for effective network optimization.A case study in an urban area demonstrates the framework’s ability to balance and improve network performance,enhancing situational awareness and operational efficiency under dynamic conditions.
文摘Due to the widespread use of the Internet,customer information is vulnerable to computer systems attack,which brings urgent need for the intrusion detection technology.Recently,network intrusion detection has been one of the most important technologies in network security detection.The accuracy of network intrusion detection has reached higher accuracy so far.However,these methods have very low efficiency in network intrusion detection,even the most popular SOM neural network method.In this paper,an efficient and fast network intrusion detection method was proposed.Firstly,the fundamental of the two different methods are introduced respectively.Then,the selforganizing feature map neural network based on K-means clustering(KSOM)algorithms was presented to improve the efficiency of network intrusion detection.Finally,the NSLKDD is used as network intrusion data set to demonstrate that the KSOM method can significantly reduce the number of clustering iteration than SOM method without substantially affecting the clustering results and the accuracy is much higher than Kmeans method.The Experimental results show that our method can relatively improve the accuracy of network intrusion and significantly reduce the number of clustering iteration.
基金supported by the 863 Program (2015AA01A705)NSFC (61271187)
文摘To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SON). In this paper, a novel CCO scheme is proposed to maximize utility function of the integrated coverage and capacity. It starts with the analysis on the throughput proportional fairness(PF) algorithm and then proposes the novel Coverage and Capacity Proportional Fairness(CCPF) allocation algorithm along with a proof of the algorithms convergence. This proposed algorithm is applied in a coverage capacity optimization scheme which can guarantee the reasonable network capacity by the coverage range accommodation. Next, we simulate the proposed CCO scheme based on telecom operators' real network data and compare with three typical resource allocation algorithms: round robin(RR), proportional fairness(PF) and max C/I. In comparison of the PF algorithm, the numerical results show that our algorithm increases the average throughput by 1.54 and 1.96 times with constructed theoretical data and derived real network data respectively.
文摘In the context of the rapid iteration of information technology,the Internet of Things(IoT)has established itself as a pivotal hub connecting the digital world and the physical world.Wireless Sensor Networks(WSNs),deeply embedded in the perception layer architecture of the IoT,play a crucial role as“tactile nerve endings.”A vast number of micro sensor nodes are widely distributed in monitoring areas according to preset deployment strategies,continuously and accurately perceiving and collecting real-time data on environmental parameters such as temperature,humidity,light intensity,air pressure,and pollutant concentration.These data are transmitted to the IoT cloud platform through stable and reliable communication links,forming a massive and detailed basic data resource pool.By using cutting-edge big data processing algorithms,machine learning models,and artificial intelligence analysis tools,in-depth mining and intelligent analysis of these multi-source heterogeneous data are conducted to generate high-value-added decision-making bases.This precisely empowers multiple fields,including agriculture,medical and health care,smart home,environmental science,and industrial manufacturing,driving intelligent transformation and catalyzing society to move towards a new stage of high-quality development.This paper comprehensively analyzes the technical cores of the IoT and WSNs,systematically sorts out the advanced key technologies of WSNs and the evolution of their strategic significance in the IoT system,deeply explores the innovative application scenarios and practical effects of the two in specific vertical fields,and looks forward to the technological evolution trends.It provides a detailed and highly practical guiding reference for researchers,technical engineers,and industrial decision-makers.
基金supported by the National Key Research and Development Program of China(No.2021YFB2900504).
文摘In 6th Generation Mobile Networks(6G),the Space-Integrated-Ground(SIG)Radio Access Network(RAN)promises seamless coverage and exceptionally high Quality of Service(QoS)for diverse services.However,achieving this necessitates effective management of computation and wireless resources tailored to the requirements of various services.The heterogeneity of computation resources and interference among shared wireless resources pose significant coordination and management challenges.To solve these problems,this work provides an overview of multi-dimensional resource management in 6G SIG RAN,including computation and wireless resource.Firstly it provides with a review of current investigations on computation and wireless resource management and an analysis of existing deficiencies and challenges.Then focusing on the provided challenges,the work proposes an MEC-based computation resource management scheme and a mixed numerology-based wireless resource management scheme.Furthermore,it outlines promising future technologies,including joint model-driven and data-driven resource management technology,and blockchain-based resource management technology within the 6G SIG network.The work also highlights remaining challenges,such as reducing communication costs associated with unstable ground-to-satellite links and overcoming barriers posed by spectrum isolation.Overall,this comprehensive approach aims to pave the way for efficient and effective resource management in future 6G networks.
文摘It is difficult to improve both energy consumption and detection accuracy simultaneously,and even to obtain the trade-off between them,when detecting and tracking moving targets,especially for Underwater Wireless Sensor Networks(UWSNs).To this end,this paper investigates the relationship between the Degree of Target Change(DoTC)and the detection period,as well as the impact of individual nodes.A Hierarchical Detection and Tracking Approach(HDTA)is proposed.Firstly,the network detection period is determined according to DoTC,which reflects the variation of target motion.Secondly,during the network detection period,each detection node calculates its own node detection period based on the detection mutual information.Taking DoTC as pheromone,an ant colony algorithm is proposed to adaptively adjust the network detection period.The simulation results show that the proposed HDTA with the optimizations of network level and node level significantly improves the detection accuracy by 25%and the network energy consumption by 10%simultaneously,compared to the traditional adaptive period detection schemes.
基金supported by the National Key R&D Program of China (GrantN o.2016YFC0401407)National Natural Science Foundation of China (Grant Nos. 51479003 and 51279006)
文摘Due to rapid urbanization, waterlogging induced by torrential rainfall has become a global concern and a potential risk affecting urban habitant's safety. Widespread waterlogging disasters haveoccurred almost annuallyinthe urban area of Beijing, the capital of China. Based on a selforganizing map(SOM) artificial neural network(ANN), a graded waterlogging risk assessment was conducted on 56 low-lying points in Beijing, China. Social risk factors, such as Gross domestic product(GDP), population density, and traffic congestion, were utilized as input datasets in this study. The results indicate that SOM-ANNis suitable for automatically and quantitatively assessing risks associated with waterlogging. The greatest advantage of SOM-ANN in the assessment of waterlogging risk is that a priori knowledge about classification categories and assessment indicator weights is not needed. As a result, SOM-ANN can effectively overcome interference from subjective factors,producing classification results that are more objective and accurate. In this paper, the risk level of waterlogging in Beijing was divided into five grades. The points that were assigned risk grades of IV or Vwere located mainly in the districts of Chaoyang, Haidian, Xicheng, and Dongcheng.
文摘Internet of things and network densification bring significant challenges to uplink management.Only depending on optimization algorithm enhancements is not enough for uplink transmission.To control intercell interference,Fractional Uplink Power Control(FUPC)should be optimized from network-wide perspective,which has to find a better traffic distribution model.Conventionally,traffic distribution is geographic-based,and ineffective due to tricky locating efforts.This paper proposes a novel uplink power management framework for Self-Organizing Networks(SON),which firstly builds up pathloss-based traffic distribution model and then makes the decision of FUPC based on the model.PathLoss-based Traffic Distribution(PLTD)aggregates traffic based on the propagation condition of traffic that is defined as the pathloss between the position generating the traffic and surrounding cells.Simulations show that the improvement in optimization efficiency of FUPC with PLTD can be up to 40%compared to conventional GeoGraphic-based Traffic Distribution(GGTD).
基金the National Natural Science Foundation of China (No.61627810)the National Science and Technology Major Program of China (No.2018YFB1305003)the National Defense Science and Technology Outstanding Youth Science Foundation (No.2017-JCJQ-ZQ-031)。
文摘Traveling salesman problem(TSP)is a classic non-deterministic polynomial-hard optimization prob-lem.Based on the characteristics of self-organizing mapping(SOM)network,this paper proposes an improved SOM network from the perspectives of network update strategy,initialization method,and parameter selection.This paper compares the performance of the proposed algorithms with the performance of existing SOM network algorithms on the TSP and compares them with several heuristic algorithms.Simulations show that compared with existing SOM networks,the improved SOM network proposed in this paper improves the convergence rate and algorithm accuracy.Compared with iterated local search and heuristic algorithms,the improved SOM net-work algorithms proposed in this paper have the advantage of fast calculation speed on medium-scale TSP.
文摘Wireless Sensor Network(WSN)comprises a set of interconnected,compact,autonomous,and resource-constrained sensor nodes that are wirelessly linked to monitor and gather data from the physical environment.WSNs are commonly used in various applications such as environmental monitoring,surveillance,healthcare,agriculture,and industrial automation.Despite the benefits of WSN,energy efficiency remains a challenging problem that needs to be addressed.Clustering and routing can be considered effective solutions to accomplish energy efficiency in WSNs.Recent studies have reported that metaheuristic algorithms can be applied to optimize cluster formation and routing decisions.This study introduces a new Northern Goshawk Optimization with boosted coati optimization algorithm for cluster-based routing(NGOBCO-CBR)method for WSN.The proposed NGOBCO-CBR method resolves the hot spot problem,uneven load balancing,and energy consumption in WSN.The NGOBCO-CBR technique comprises two major processes such as NGO based clustering and BCO-based routing.In the initial phase,the NGObased clustering method is designed for cluster head(CH)selection and cluster construction using five input variables such as residual energy(RE),node proximity,load balancing,network average energy,and distance to BS(DBS).Besides,the NGOBCO-CBR technique applies the BCO algorithm for the optimum selection of routes to BS.The experimental results of the NGOBCOCBR technique are studied under different scenarios,and the obtained results showcased the improved efficiency of the NGOBCO-CBR technique over recent approaches in terms of different measures.
基金partially supported by the National Natural Science Foundation of China(62161016)the Key Research and Development Project of Lanzhou Jiaotong University(ZDYF2304)+1 种基金the Beijing Engineering Research Center of Highvelocity Railway Broadband Mobile Communications(BHRC-2022-1)Beijing Jiaotong University。
文摘In order to solve the problems of short network lifetime and high data transmission delay in data gathering for wireless sensor network(WSN)caused by uneven energy consumption among nodes,a hybrid energy efficient clustering routing base on firefly and pigeon-inspired algorithm(FF-PIA)is proposed to optimise the data transmission path.After having obtained the optimal number of cluster head node(CH),its result might be taken as the basis of producing the initial population of FF-PIA algorithm.The L′evy flight mechanism and adaptive inertia weighting are employed in the algorithm iteration to balance the contradiction between the global search and the local search.Moreover,a Gaussian perturbation strategy is applied to update the optimal solution,ensuring the algorithm can jump out of the local optimal solution.And,in the WSN data gathering,a onedimensional signal reconstruction algorithm model is developed by dilated convolution and residual neural networks(DCRNN).We conducted experiments on the National Oceanic and Atmospheric Administration(NOAA)dataset.It shows that the DCRNN modeldriven data reconstruction algorithm improves the reconstruction accuracy as well as the reconstruction time performance.FF-PIA and DCRNN clustering routing co-simulation reveals that the proposed algorithm can effectively improve the performance in extending the network lifetime and reducing data transmission delay.
基金supported in part by the National Natural Science Foundation of China(No.61906156).
文摘This paper studies the problem of jamming decision-making for dynamic multiple communication links in wireless communication networks(WCNs).We propose a novel jamming channel allocation and power decision-making(JCAPD)approach based on multi-agent deep reinforcement learning(MADRL).In high-dynamic and multi-target aviation communication environments,the rapid changes in channels make it difficult for sensors to accurately capture instantaneous channel state information.This poses a challenge to make centralized jamming decisions with single-agent deep reinforcement learning(DRL)approaches.In response,we design a distributed multi-agent decision architecture(DMADA).We formulate multi-jammer resource allocation as a multiagent Markov decision process(MDP)and propose a fingerprint-based double deep Q-Network(FBDDQN)algorithm for solving it.Each jammer functions as an agent that interacts with the environment in this framework.Through the design of a reasonable reward and training mechanism,our approach enables jammers to achieve distributed cooperation,significantly improving the jamming success rate while considering jamming power cost,and reducing the transmission rate of links.Our experimental results show the FBDDQN algorithm is superior to the baseline methods.
基金the International Scientific Complex“Astana”was funded by the Committee of Science of the Ministry of Science and Higher Education of the Republic of Kazakhstan(Grant No.AP19680345).
文摘Wireless Sensor Networks(WSN)have gained significant attention over recent years due to their extensive applications in various domains such as environmentalmonitoring,healthcare systems,industrial automation,and smart cities.However,such networks are inherently vulnerable to different types of attacks because they operate in open environments with limited resources and constrained communication capabilities.Thepaper addresses challenges related to modeling and analysis of wireless sensor networks and their susceptibility to attacks.Its objective is to create versatile modeling tools capable of detecting attacks against network devices and identifying anomalies caused either by legitimate user errors or malicious activities.A proposed integrated approach for data collection,preprocessing,and analysis in WSN outlines a series of steps applicable throughout both the design phase and operation stage.This ensures effective detection of attacks and anomalies within WSNs.An introduced attackmodel specifies potential types of unauthorized network layer attacks targeting network nodes,transmitted data,and services offered by the WSN.Furthermore,a graph-based analytical framework was designed to detect attacks by evaluating real-time events from network nodes and determining if an attack is underway.Additionally,a simulation model based on sequences of imperative rules defining behaviors of both regular and compromised nodes is presented.Overall,this technique was experimentally verified using a segment of a WSN embedded in a smart city infrastructure,simulating a wormhole attack.Results demonstrate the viability and practical significance of the technique for enhancing future information security measures.Validation tests confirmed high levels of accuracy and efficiency when applied specifically to detecting wormhole attacks targeting routing protocols in WSNs.Precision and recall rates averaged above the benchmark value of 0.95,thus validating the broad applicability of the proposed models across varied scenarios.
基金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.
文摘A Wireless Sensor Network(WSN)comprises a series of spatially distributed autonomous devices,each equipped with sophisticated sensors.These sensors play a crucial role in monitoring diverse environmental conditions such as light intensity,air pressure,temperature,humidity,wind,etc.These sensors are generally deployed in harsh and hostile conditions;hence they suffer from different kinds of faults.However,identifying faults in WSN data remains a complex task,as existing fault detection methods,including centralized,distributed,and hybrid approaches,rely on the spatio⁃temporal correlation among sensor nodes.Moreover,existing techniques predominantly leverage classification⁃based machine learning methods to discern the fault state within WSN.In this paper,we propose a regression⁃based bagging method to detect the faults in the network.The proposed bagging method is consisted of GRU(Gated Recurrent Unit)and Prophet model.Bagging allows weak learners to combine efforts to outperform a strong learner,hence it is appropriate to use in WSN.The proposed bagging method was first trained at the base station,then they were deployed at each SN(Sensor Node).Most of the common faults in WSN,such as transient,intermittent and permanent faults,were considered.The validity of the proposed scheme was tested using a trusted online published dataset.Using experimental studies,compared to the latest state⁃of⁃the⁃art machine learning models,the effectiveness of the proposed model is shown for fault detection.Performance evaluation in terms of false positive rate,accuracy,and false alarm rate shows the efficiency of the proposed algorithm.
基金funded by Sardar Vallabhbhai National Institute of Technology through SEED grant No.Dean(R&C)/SEED Money/2021-22/11153Date:08/02/2022supported by Business Finland EWARE-6G project under 6G Bridge program,and in part by theHorizon Europe(Smart Networks and Services Joint Under taking)program under Grant Agreement No.101096838(6G-XR project).
文摘Wireless Sensor Networks(WSNs)play a critical role in automated border surveillance systems,where continuous monitoring is essential.However,limited energy resources in sensor nodes lead to frequent network failures and reduced coverage over time.To address this issue,this paper presents an innovative energy-efficient protocol based on deep Q-learning(DQN),specifically developed to prolong the operational lifespan of WSNs used in border surveillance.By harnessing the adaptive power of DQN,the proposed protocol dynamically adjusts node activity and communication patterns.This approach ensures optimal energy usage while maintaining high coverage,connectivity,and data accuracy.The proposed system is modeled with 100 sensor nodes deployed over a 1000 m×1000 m area,featuring a strategically positioned sink node.Our method outperforms traditional approaches,achieving significant enhancements in network lifetime and energy utilization.Through extensive simulations,it is observed that the network lifetime increases by 9.75%,throughput increases by 8.85%and average delay decreases by 9.45%in comparison to the similar recent protocols.It demonstrates the robustness and efficiency of our protocol in real-world scenarios,highlighting its potential to revolutionize border surveillance operations.
基金supported by the National Natural Science Foundation of China under Grant Nos.U21A20464,62066005Innovation Project of Guangxi Graduate Education under Grant No.YCSW2024313.
文摘Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic models,and there is a significant gap between the research results and actual wireless sensor networks.Some scholars have now modeled data fusion networks to make them more suitable for practical applications.This paper will explore the deployment problem of a stochastic data fusion wireless sensor network(SDFWSN),a model that reflects the randomness of environmental monitoring and uses data fusion techniques widely used in actual sensor networks for information collection.The deployment problem of SDFWSN is modeled as a multi-objective optimization problem.The network life cycle,spatiotemporal coverage,detection rate,and false alarm rate of SDFWSN are used as optimization objectives to optimize the deployment of network nodes.This paper proposes an enhanced multi-objective mongoose optimization algorithm(EMODMOA)to solve the deployment problem of SDFWSN.First,to overcome the shortcomings of the DMOA algorithm,such as its low convergence and tendency to get stuck in a local optimum,an encircling and hunting strategy is introduced into the original algorithm to propose the EDMOA algorithm.The EDMOA algorithm is designed as the EMODMOA algorithm by selecting reference points using the K-Nearest Neighbor(KNN)algorithm.To verify the effectiveness of the proposed algorithm,the EMODMOA algorithm was tested at CEC 2020 and achieved good results.In the SDFWSN deployment problem,the algorithm was compared with the Non-dominated Sorting Genetic Algorithm II(NSGAII),Multiple Objective Particle Swarm Optimization(MOPSO),Multi-Objective Evolutionary Algorithm based on Decomposition(MOEA/D),and Multi-Objective Grey Wolf Optimizer(MOGWO).By comparing and analyzing the performance evaluation metrics and optimization results of the objective functions of the multi-objective algorithms,the algorithm outperforms the other algorithms in the SDFWSN deployment results.To better demonstrate the superiority of the algorithm,simulations of diverse test cases were also performed,and good results were obtained.
