Friendship paradox states that individuals are likely to have fewer friends than their friends do,on average.Despite of its wide existence and appealing applications in real social networks,the mathematical understand...Friendship paradox states that individuals are likely to have fewer friends than their friends do,on average.Despite of its wide existence and appealing applications in real social networks,the mathematical understanding of friendship paradox is very limited.Only few works provide theoretical evidence of single-step and multi-step friendship paradoxes,given that the neighbors of interest are onehop and multi-hop away from the target node.However,they consider non-evolving networks,as opposed to the topology of real social networks that are constantly growing over time.We are thus motivated to present a first look into friendship paradox in evolving networks,where newly added nodes preferentially attach themselves to those with higher degrees.Our analytical verification of both single-step and multistep friendship paradoxes in evolving networks,along with comparison to the non-evolving counterparts,discloses that“friendship paradox is even more paradoxical in evolving networks”,primarily from three aspects:1)we demonstrate a strengthened effect of single-step friendship paradox in evolving networks,with a larger probability(more than 0.8)of a random node’s neighbors having higher average degree than the random node itself;2)we unravel higher effectiveness of multi-step friendship paradox in seeking for influential nodes in evolving networks,as the rate of reaching the max degree node can be improved by a factor of at least Θ(t^(2/3))with t being the network size;3)we empirically verify our findings through both synthetic and real datasets,which suggest high agreements of results and consolidate the reasonability of evolving model for real social networks.展开更多
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.展开更多
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.展开更多
Maximize the resource utilization efficiency and guarantee the quality of service(QoS)of users by selecting the network are the key issues for heterogeneous network operators,but the resources occupied by users in dif...Maximize the resource utilization efficiency and guarantee the quality of service(QoS)of users by selecting the network are the key issues for heterogeneous network operators,but the resources occupied by users in different networks cannot be compared directly.This paper proposes a network selection algorithm for heterogeneous network.Firstly,the concept of equivalent bandwidth is proposed,through which the actual resources occupied by users with certain QoS requirements in different networks can be compared directly.Then the concept of network applicability is defined to express the abilities of networks to support different services.The proposed network selection algorithm first evaluates whether the network has enough equivalent bandwidth required by the user and then prioritizes network with poor applicability to avoid the situation that there are still residual resources in entire network,but advanced services can not be admitted.The simulation results show that the proposed algorithm obtained better performance than the baselines in terms of reducing call blocking probability and improving network resource utilization efficiency.展开更多
With the coming of digital era,profound changes are happening in communication field.Within these,non-terrestrial network(NTN)is considered as a leading-edge technology.NTN not only represents an innovation,but also s...With the coming of digital era,profound changes are happening in communication field.Within these,non-terrestrial network(NTN)is considered as a leading-edge technology.NTN not only represents an innovation,but also signifies the main development trend of future global communication.As a layered heterogeneous network,NTN will integrate multiple communication platforms,including satellites,high altitude platform systems(HAPS),and unmanned aerial systems(UAS),these provide flexible and composable solutions for achieving ubiquitous global communication coverage.展开更多
The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has bec...The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has become an essential supplement to the terrestrial network.However,the dynamic changes and uneven distribution of satellite network traffic inevitably bring challenges to multipath routing.Even worse,the harsh space environment often leads to incomplete collection of network state data for routing decision-making,which further complicates this challenge.To address this problem,this paper proposes a state-incomplete intelligent dynamic multipath routing algorithm(SIDMRA)to maximize network efficiency even with incomplete state data as input.Specifically,we model the multipath routing problem as a markov decision process(MDP)and then combine the deep deterministic policy gradient(DDPG)and the K shortest paths(KSP)algorithm to solve the optimal multipath routing policy.We use the temporal correlation of the satellite network state to fit the incomplete state data and then use the message passing neuron network(MPNN)for data enhancement.Simulation results show that the proposed algorithm outperforms baseline algorithms regarding average end-to-end delay and packet loss rate and performs stably under certain missing rates of state data.展开更多
Research on the self-similarity of multilayer networks is scarce, when compared to the extensive research conducted on the dynamics of these networks. In this paper, we use entropy to determine the edge weights in eac...Research on the self-similarity of multilayer networks is scarce, when compared to the extensive research conducted on the dynamics of these networks. In this paper, we use entropy to determine the edge weights in each sub-network,and apply the degree–degree distance to unify the weight values of connecting edges between different sub-networks, and unify the edges with different meanings in the multilayer network numerically. At this time, the multilayer network is compressed into a single-layer network, also known as the aggregated network. Furthermore, the self-similarity of the multilayer network is represented by analyzing the self-similarity of the aggregate network. The study of self-similarity was conducted on two classical fractal networks and a real-world multilayer network. The results show that multilayer networks exhibit more pronounced self-similarity, and the intensity of self-similarity in multilayer networks can vary with the connection mode of sub-networks.展开更多
Using complex network methods,we construct undirected and directed heatwave networks to systematically analyze heatwave events over China from 1961 to 2023,exploring their spatiotemporal evolution patterns in differen...Using complex network methods,we construct undirected and directed heatwave networks to systematically analyze heatwave events over China from 1961 to 2023,exploring their spatiotemporal evolution patterns in different regions.The findings reveal a significant increase in heatwaves since the 2000s,with the average occurrence rising from approximately 3 to 5 times,and their duration increasing from 15 to around 30 days,nearly doubling.An increasing trend of“early onset and late withdrawal”of heatwaves has become more pronounced each year.In particular,eastern regions experience heatwaves that typically start earlier and tend to persist into September,exhibiting greater interannual variability compared to western areas.The middle and lower reaches of the Yangtze River and Xinjiang are identified as high-frequency heatwave areas.Complex network analysis reveals the dynamics of heatwave propagation,with degree centrality and synchronization distance indicating that the middle and lower reaches of the Yangtze River,Northeast China,and Xinjiang are key nodes in heatwave spread.Additionally,network divergence analysis shows that Xinjiang acts as a“source”area for heatwaves,exporting heat to surrounding regions,while the central region functions as a major“sink,”receiving more heatwave events.Further analysis from 1994 to 2023 indicates that heatwave events exhibit stronger network centrality and more complex synchronization patterns.These results suggest that complex networks provide a refined framework for depicting the spatiotemporal dynamics of heatwave propagation,offering new avenues for studying their occurrence and development patterns.展开更多
Low Earth orbit(LEO)satellite networks have the advantages of low transmission delay and low deployment cost,playing an important role in providing reliable services to ground users.This paper studies an efficient int...Low Earth orbit(LEO)satellite networks have the advantages of low transmission delay and low deployment cost,playing an important role in providing reliable services to ground users.This paper studies an efficient inter-satellite cooperative computation offloading(ICCO)algorithm for LEO satellite networks.Specifically,an ICCO system model is constructed,which considers using neighboring satellites in the LEO satellite networks to collaboratively process tasks generated by ground user terminals,effectively improving resource utilization efficiency.Additionally,the optimization objective of minimizing the system task computation offloading delay and energy consumption is established,which is decoupled into two sub-problems.In terms of computational resource allocation,the convexity of the problem is proved through theoretical derivation,and the Lagrange multiplier method is used to obtain the optimal solution of computational resources.To deal with the task offloading decision,a dynamic sticky binary particle swarm optimization algorithm is designed to obtain the offloading decision by iteration.Simulation results show that the ICCO algorithm can effectively reduce the delay and energy consumption.展开更多
This paper introduces a lightweight remote sensing image dehazing network called multidimensional weight regulation network(MDWR-Net), which addresses the high computational cost of existing methods. Previous works, o...This paper introduces a lightweight remote sensing image dehazing network called multidimensional weight regulation network(MDWR-Net), which addresses the high computational cost of existing methods. Previous works, often based on the encoder-decoder structure and utilizing multiple upsampling and downsampling layers, are computationally expensive. To improve efficiency, the paper proposes two modules: the efficient spatial resolution recovery module(ESRR) for upsampling and the efficient depth information augmentation module(EDIA) for downsampling.These modules not only reduce model complexity but also enhance performance. Additionally, the partial feature weight learning module(PFWL) is introduced to reduce the computational burden by applying weight learning across partial dimensions, rather than using full-channel convolution.To overcome the limitations of convolutional neural networks(CNN)-based networks, the haze distribution index transformer(HDIT) is integrated into the decoder. We also propose the physicalbased non-adjacent feature fusion module(PNFF), which leverages the atmospheric scattering model to improve generalization of our MDWR-Net. The MDWR-Net achieves superior dehazing performance with a computational cost of just 2.98×10^(9) multiply-accumulate operations(MACs),which is less than one-tenth of previous methods. Experimental results validate its effectiveness in balancing performance and computational efficiency.展开更多
Nuclearβ-decay,a typical decay process for unstable nuclei,is a key mechanism for producing heavy elements in the Universe.In this study,neural networks were employed to predictβ-decay half-lives and,for the first t...Nuclearβ-decay,a typical decay process for unstable nuclei,is a key mechanism for producing heavy elements in the Universe.In this study,neural networks were employed to predictβ-decay half-lives and,for the first time,to identify abnormal trends in nuclearβ-decay half-lives based on deviations between experimental values and the predictions of neural networks.Nuclei exhibiting anomalous increases,abrupt peaks,sharp decreases,abnormal odd-even oscillations,and excessively large experimental errors in theirβ-decay half-lives,which deviate from systematic patterns,were identified through deviations.These anomalous phenomena may be associated with shell effects,shape coexistence,or discrepancies in the experimental data.The discovery and analysis of these abnormal nuclei provide a valuable reference for further investigations using sophisticated microscopic theories,potentially offering insights into new physics through studies of nuclearβ-decay half-lives.展开更多
To support ubiquitous communication and enhance other 6G applications,the Space-Air-Ground Integrated Network(SAGIN)has become a research hotspot.Traditionally,satellite-ground fusion technologies integrate network en...To support ubiquitous communication and enhance other 6G applications,the Space-Air-Ground Integrated Network(SAGIN)has become a research hotspot.Traditionally,satellite-ground fusion technologies integrate network entities from space,aerial,and terrestrial domains.However,they face challenges such as spectrum scarcity and inefficient satellite handover.This paper explores the Channel-Aware Handover Management(CAHM)strategy in SAGIN for data allocation.Specifically,CAHM utilizes the data receiving capability of Low Earth Orbit(LEO)satellites,considering satellite-ground distance,free-space path loss,and channel gain.Furthermore,CAHM assesses LEO satellite data forwarding capability using signal-to-noise ratio,link duration and buffer queue length.Then,CAHM applies historical data on LEO satellite transmission successes and failures to effectively reduce overall interruption ratio.Simulation results show that CAHM outperforms baseline algorithms in terms of delivery ratio,latency,and interruption ratio.展开更多
As the first stage of the quantum Internet,quantum key distribution(QKD)networks hold the promise of providing long-term security for diverse users.Most existing QKD networks have been constructed based on independent...As the first stage of the quantum Internet,quantum key distribution(QKD)networks hold the promise of providing long-term security for diverse users.Most existing QKD networks have been constructed based on independent QKD protocols,and they commonly rely on the deployment of single-protocol trusted relay chains for long reach.Driven by the evolution of QKD protocols,large-scale QKD networking is expected to migrate from a single-protocol to a multi-protocol paradigm,during which some useful evolutionary elements for the later stages of the quantum Internet may be incorporated.In this work,we delve into a pivotal technique for large-scale QKD networking,namely,multi-protocol relay chaining.A multi-protocol relay chain is established by connecting a set of trusted/untrusted relays relying on multiple QKD protocols between a pair of QKD nodes.The structures of diverse multi-protocol relay chains are described,based on which the associated model is formulated and the policies are defined for the deployment of multi-protocol relay chains.Furthermore,we propose three multi-protocol relay chaining heuristics.Numerical simulations indicate that the designed heuristics can effectively reduce the number of trusted relays deployed and enhance the average security level versus the commonly used single-protocol trusted relay chaining methods on backbone network topologies.展开更多
As a key mode of transportation, urban metro networks have significantly enhanced urban traffic environments and travel efficiency, making the identification of critical stations within these networks increasingly ess...As a key mode of transportation, urban metro networks have significantly enhanced urban traffic environments and travel efficiency, making the identification of critical stations within these networks increasingly essential. This study presents a novel integrated topological-functional(ITF) algorithm for identifying critical nodes, combining topological metrics such as K-shell decomposition, node information entropy, and neighbor overlapping interaction with the functional attributes of passenger flow operations, while also considering the coupling effects between metro and bus networks. Using the Chengdu metro network as a case study, the effectiveness of the algorithm under different conditions is validated.The results indicate significant differences in passenger flow patterns between working and non-working days, leading to varying sets of critical nodes across these scenarios. Moreover, the ITF algorithm demonstrates a marked improvement in the accuracy of critical node identification compared to existing methods. This conclusion is supported by the analysis of changes in the overall network structure and relative global operational efficiency following targeted attacks on the identified critical nodes. The findings provide valuable insight into urban transportation planning, offering theoretical and practical guidance for improving metro network safety and resilience.展开更多
Livestock transportation is a key factor that contributes to the spatial spread of brucellosis.To analyze the impact of sheep transportation on brucellosis transmission,we develop a human–sheep coupled brucellosis mo...Livestock transportation is a key factor that contributes to the spatial spread of brucellosis.To analyze the impact of sheep transportation on brucellosis transmission,we develop a human–sheep coupled brucellosis model within a metapopulation network framework.Theoretically,we examine the positively invariant set,the basic reproduction number,the existence,uniqueness,and stability of disease-free equilibrium and the existence of the endemic equilibrium of the model.For practical application,using Heilongjiang province as a case study,we simulate brucellosis transmission across 12 cities based on data using three network types:the BA network,the ER network,and homogeneous mixing network.The simulation results indicate that the network's average degree plays a role in the spread of brucellosis.For BA and ER networks,the basic reproduction number and cumulative incidence of brucellosis stabilize when the network's average degree reaches 4 or 5.In contrast,sheep transport in a homogeneous mixing network accelerates the cross-regional spread of brucellosis,whereas transportation in a BA network helps to control it effectively.Furthermore,the findings suggest that the movement of sheep is not always detrimental to controlling the spread of brucellosis.For cities with smaller sheep populations,such as Shuangyashan and Qitaihe,increasing the transport of sheep outward amplifies the spatial spread of the disease.In contrast,in cities with larger sheep populations,such as Qiqihar,Daqing,and Suihua,moderate sheep outflow can help reduce the spread.In addition,cities with large livestock populations play a dominant role in the overall transmission dynamics,underscoring the need for stricter supervision in these areas.展开更多
We study the influence of conformity on the evolution of cooperative behavior in games under the learning method of sampling on networks.A strategy update rule based on sampling is introduced into the stag hunt game,w...We study the influence of conformity on the evolution of cooperative behavior in games under the learning method of sampling on networks.A strategy update rule based on sampling is introduced into the stag hunt game,where agents draw samples from their neighbors and then update their strategies based on conformity or inference according to the situation in the sample.Based on these assumptions,we present the state transition equations in the dynamic evolution of population cooperation,conduct simulation analysis on lattice networks and scale-free networks,and discuss how this mechanism affects the evolution of cooperation and how cooperation evolves under different levels of conformity in the network.Our simulation results show that blindly imitating the strategies of neighbors does not necessarily lead to rapid consensus in the population.Instead,rational inference through samples can better promote the evolution of the same strategy among all agents in the population.Moreover,the simulation results also show that a smaller sample size cannot reflect the true situation of the neighbors,which has a large randomness,and the size of the benefits obtained in cooperation determines the direction of the entire population towards cooperation or defection.This work incorporates the conforming behavior of agents into the game,uses the method of sampling for strategy updates and enriches the theory of evolutionary games with a more realistic significance.展开更多
Frequent extreme disasters have led to frequent large-scale power outages in recent years.To quickly restore power,it is necessary to understand the damage information of the distribution network accurately.However,th...Frequent extreme disasters have led to frequent large-scale power outages in recent years.To quickly restore power,it is necessary to understand the damage information of the distribution network accurately.However,the public network communication system is easily damaged after disasters,causing the operation center to lose control of the distribution network.In this paper,we considered using satellites to transmit the distribution network data and focus on the resource scheduling problem of the satellite emergency communication system for the distribution network.Specifically,this paper first formulates the satellite beam-pointing problem and the accesschannel joint resource allocation problem.Then,this paper proposes the Priority-based Beam-pointing and Access-Channel joint optimization algorithm(PBAC),which uses convex optimization theory to solve the satellite beam pointing problem,and adopts the block coordinate descent method,Lagrangian dual method,and a greedy algorithm to solve the access-channel joint resource allocation problem,thereby obtaining the optimal resource scheduling scheme for the satellite network.Finally,this paper conducts comparative experiments with existing methods to verify the effec-tiveness of the proposed methods.The results show that the total weighted transmitted data of the proposed algorithm is increased by about 19.29∼26.29%compared with other algorithms.展开更多
The unique structure of signed networks,characterized by positive and negative edges,poses significant challenges for analyzing network topology.In recent years,various statistical algorithms have been developed to ad...The unique structure of signed networks,characterized by positive and negative edges,poses significant challenges for analyzing network topology.In recent years,various statistical algorithms have been developed to address this issue.However,there remains a lack of a unified framework to uncover the nontrivial properties inherent in signed network structures.To support developers,researchers,and practitioners in this field,we introduce a Python library named SNSAlib(Signed Network Structure Analysis),specifically designed to meet these analytical requirements.This library encompasses empirical signed network datasets,signed null model algorithms,signed statistics algorithms,and evaluation indicators.The primary objective of SNSAlib is to facilitate the systematic analysis of micro-and meso-structure features within signed networks,including node popularity,clustering,assortativity,embeddedness,and community structure by employing more accurate signed null models.Ultimately,it provides a robust paradigm for structure analysis of signed networks that enhances our understanding and application of signed networks.展开更多
Information spreading has been investigated for many years,but the mechanism of why the information explosively catches on overnight is still under debate.This explosive spreading phenomenon was usually considered dri...Information spreading has been investigated for many years,but the mechanism of why the information explosively catches on overnight is still under debate.This explosive spreading phenomenon was usually considered driven separately by social reinforcement or higher-order interactions.However,due to the limitations of empirical data and theoretical analysis,how the higher-order network structure affects the explosive information spreading under the role of social reinforcement has not been fully explored.In this work,we propose an information-spreading model by considering the social reinforcement in real and synthetic higher-order networks,describable as hypergraphs.Depending on the average group size(hyperedge cardinality)and node membership(hyperdegree),we observe two different spreading behaviors:(i)The spreading progress is not sensitive to social reinforcement,resulting in the information localized in a small part of nodes;(ii)a strong social reinforcement will promote the large-scale spread of information and induce an explosive transition.Moreover,a large average group size and membership would be beneficial to the appearance of the explosive transition.Further,we display that the heterogeneity of the node membership and group size distributions benefit the information spreading.Finally,we extend the group-based approximate master equations to verify the simulation results.Our findings may help us to comprehend the rapidly information-spreading phenomenon in modern society.展开更多
Independent cascade(IC)models,by simulating how one node can activate another,are important tools for studying the dynamics of information spreading in complex networks.However,traditional algorithms for the IC model ...Independent cascade(IC)models,by simulating how one node can activate another,are important tools for studying the dynamics of information spreading in complex networks.However,traditional algorithms for the IC model implementation face significant efficiency bottlenecks when dealing with large-scale networks and multi-round simulations.To settle this problem,this study introduces a GPU-based parallel independent cascade(GPIC)algorithm,featuring an optimized representation of the network data structure and parallel task scheduling strategies.Specifically,for this GPIC algorithm,we propose a network data structure tailored for GPU processing,thereby enhancing the computational efficiency and the scalability of the IC model.In addition,we design a parallel framework that utilizes the full potential of GPU's parallel processing capabilities,thereby augmenting the computational efficiency.The results from our simulation experiments demonstrate that GPIC not only preserves accuracy but also significantly boosts efficiency,achieving a speedup factor of 129 when compared to the baseline IC method.Our experiments also reveal that when using GPIC for the independent cascade simulation,100-200 simulation rounds are sufficient for higher-cost studies,while high precision studies benefit from 500 rounds to ensure reliable results,providing empirical guidance for applying this new algorithm to practical research.展开更多
基金supported by NSF China(No.61960206002,62020106005,42050105,62061146002)Shanghai Pilot Program for Basic Research–Shanghai Jiao Tong University.
文摘Friendship paradox states that individuals are likely to have fewer friends than their friends do,on average.Despite of its wide existence and appealing applications in real social networks,the mathematical understanding of friendship paradox is very limited.Only few works provide theoretical evidence of single-step and multi-step friendship paradoxes,given that the neighbors of interest are onehop and multi-hop away from the target node.However,they consider non-evolving networks,as opposed to the topology of real social networks that are constantly growing over time.We are thus motivated to present a first look into friendship paradox in evolving networks,where newly added nodes preferentially attach themselves to those with higher degrees.Our analytical verification of both single-step and multistep friendship paradoxes in evolving networks,along with comparison to the non-evolving counterparts,discloses that“friendship paradox is even more paradoxical in evolving networks”,primarily from three aspects:1)we demonstrate a strengthened effect of single-step friendship paradox in evolving networks,with a larger probability(more than 0.8)of a random node’s neighbors having higher average degree than the random node itself;2)we unravel higher effectiveness of multi-step friendship paradox in seeking for influential nodes in evolving networks,as the rate of reaching the max degree node can be improved by a factor of at least Θ(t^(2/3))with t being the network size;3)we empirically verify our findings through both synthetic and real datasets,which suggest high agreements of results and consolidate the reasonability of evolving model for real social networks.
基金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.
文摘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.
文摘Maximize the resource utilization efficiency and guarantee the quality of service(QoS)of users by selecting the network are the key issues for heterogeneous network operators,but the resources occupied by users in different networks cannot be compared directly.This paper proposes a network selection algorithm for heterogeneous network.Firstly,the concept of equivalent bandwidth is proposed,through which the actual resources occupied by users with certain QoS requirements in different networks can be compared directly.Then the concept of network applicability is defined to express the abilities of networks to support different services.The proposed network selection algorithm first evaluates whether the network has enough equivalent bandwidth required by the user and then prioritizes network with poor applicability to avoid the situation that there are still residual resources in entire network,but advanced services can not be admitted.The simulation results show that the proposed algorithm obtained better performance than the baselines in terms of reducing call blocking probability and improving network resource utilization efficiency.
文摘With the coming of digital era,profound changes are happening in communication field.Within these,non-terrestrial network(NTN)is considered as a leading-edge technology.NTN not only represents an innovation,but also signifies the main development trend of future global communication.As a layered heterogeneous network,NTN will integrate multiple communication platforms,including satellites,high altitude platform systems(HAPS),and unmanned aerial systems(UAS),these provide flexible and composable solutions for achieving ubiquitous global communication coverage.
文摘The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has become an essential supplement to the terrestrial network.However,the dynamic changes and uneven distribution of satellite network traffic inevitably bring challenges to multipath routing.Even worse,the harsh space environment often leads to incomplete collection of network state data for routing decision-making,which further complicates this challenge.To address this problem,this paper proposes a state-incomplete intelligent dynamic multipath routing algorithm(SIDMRA)to maximize network efficiency even with incomplete state data as input.Specifically,we model the multipath routing problem as a markov decision process(MDP)and then combine the deep deterministic policy gradient(DDPG)and the K shortest paths(KSP)algorithm to solve the optimal multipath routing policy.We use the temporal correlation of the satellite network state to fit the incomplete state data and then use the message passing neuron network(MPNN)for data enhancement.Simulation results show that the proposed algorithm outperforms baseline algorithms regarding average end-to-end delay and packet loss rate and performs stably under certain missing rates of state data.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 61763009 and 72172025)。
文摘Research on the self-similarity of multilayer networks is scarce, when compared to the extensive research conducted on the dynamics of these networks. In this paper, we use entropy to determine the edge weights in each sub-network,and apply the degree–degree distance to unify the weight values of connecting edges between different sub-networks, and unify the edges with different meanings in the multilayer network numerically. At this time, the multilayer network is compressed into a single-layer network, also known as the aggregated network. Furthermore, the self-similarity of the multilayer network is represented by analyzing the self-similarity of the aggregate network. The study of self-similarity was conducted on two classical fractal networks and a real-world multilayer network. The results show that multilayer networks exhibit more pronounced self-similarity, and the intensity of self-similarity in multilayer networks can vary with the connection mode of sub-networks.
基金Project supported by the National Key Research and Development Program of China(Grant Nos.2022YFE0136000 and 2024YFC3013100)the Joint Meteorological Fund(Grant No.U2342211)+1 种基金the Joint Research Project for Meteorological Capacity Improvement(Grant No.22NLTSZ004)the National Meteorological Information Center(Grant No.NMICJY202301)。
文摘Using complex network methods,we construct undirected and directed heatwave networks to systematically analyze heatwave events over China from 1961 to 2023,exploring their spatiotemporal evolution patterns in different regions.The findings reveal a significant increase in heatwaves since the 2000s,with the average occurrence rising from approximately 3 to 5 times,and their duration increasing from 15 to around 30 days,nearly doubling.An increasing trend of“early onset and late withdrawal”of heatwaves has become more pronounced each year.In particular,eastern regions experience heatwaves that typically start earlier and tend to persist into September,exhibiting greater interannual variability compared to western areas.The middle and lower reaches of the Yangtze River and Xinjiang are identified as high-frequency heatwave areas.Complex network analysis reveals the dynamics of heatwave propagation,with degree centrality and synchronization distance indicating that the middle and lower reaches of the Yangtze River,Northeast China,and Xinjiang are key nodes in heatwave spread.Additionally,network divergence analysis shows that Xinjiang acts as a“source”area for heatwaves,exporting heat to surrounding regions,while the central region functions as a major“sink,”receiving more heatwave events.Further analysis from 1994 to 2023 indicates that heatwave events exhibit stronger network centrality and more complex synchronization patterns.These results suggest that complex networks provide a refined framework for depicting the spatiotemporal dynamics of heatwave propagation,offering new avenues for studying their occurrence and development patterns.
基金supported in part by Sub Project of National Key Research and Development plan in 2020 NO.2020YFC1511704Beijing Information Science and Technology University NO.2020KYNH212,NO.2021CGZH302+1 种基金Beijing Science and Technology Project(Grant No.Z211100004421009)in part by the National Natural Science Foundation of China(Grant No.62301058).
文摘Low Earth orbit(LEO)satellite networks have the advantages of low transmission delay and low deployment cost,playing an important role in providing reliable services to ground users.This paper studies an efficient inter-satellite cooperative computation offloading(ICCO)algorithm for LEO satellite networks.Specifically,an ICCO system model is constructed,which considers using neighboring satellites in the LEO satellite networks to collaboratively process tasks generated by ground user terminals,effectively improving resource utilization efficiency.Additionally,the optimization objective of minimizing the system task computation offloading delay and energy consumption is established,which is decoupled into two sub-problems.In terms of computational resource allocation,the convexity of the problem is proved through theoretical derivation,and the Lagrange multiplier method is used to obtain the optimal solution of computational resources.To deal with the task offloading decision,a dynamic sticky binary particle swarm optimization algorithm is designed to obtain the offloading decision by iteration.Simulation results show that the ICCO algorithm can effectively reduce the delay and energy consumption.
文摘This paper introduces a lightweight remote sensing image dehazing network called multidimensional weight regulation network(MDWR-Net), which addresses the high computational cost of existing methods. Previous works, often based on the encoder-decoder structure and utilizing multiple upsampling and downsampling layers, are computationally expensive. To improve efficiency, the paper proposes two modules: the efficient spatial resolution recovery module(ESRR) for upsampling and the efficient depth information augmentation module(EDIA) for downsampling.These modules not only reduce model complexity but also enhance performance. Additionally, the partial feature weight learning module(PFWL) is introduced to reduce the computational burden by applying weight learning across partial dimensions, rather than using full-channel convolution.To overcome the limitations of convolutional neural networks(CNN)-based networks, the haze distribution index transformer(HDIT) is integrated into the decoder. We also propose the physicalbased non-adjacent feature fusion module(PNFF), which leverages the atmospheric scattering model to improve generalization of our MDWR-Net. The MDWR-Net achieves superior dehazing performance with a computational cost of just 2.98×10^(9) multiply-accumulate operations(MACs),which is less than one-tenth of previous methods. Experimental results validate its effectiveness in balancing performance and computational efficiency.
基金supported by the‘Young Scientist Scheme’of the National Key R&D Program of China(No.2021YFA1601500)National Natural Science Foundation of China(Nos.12075104,12375109,11875070,and 11935001)+1 种基金Anhui Project(Z010118169)Key Research Foundation of the Education Ministry of Anhui Province(No.2023AH050095)。
文摘Nuclearβ-decay,a typical decay process for unstable nuclei,is a key mechanism for producing heavy elements in the Universe.In this study,neural networks were employed to predictβ-decay half-lives and,for the first time,to identify abnormal trends in nuclearβ-decay half-lives based on deviations between experimental values and the predictions of neural networks.Nuclei exhibiting anomalous increases,abrupt peaks,sharp decreases,abnormal odd-even oscillations,and excessively large experimental errors in theirβ-decay half-lives,which deviate from systematic patterns,were identified through deviations.These anomalous phenomena may be associated with shell effects,shape coexistence,or discrepancies in the experimental data.The discovery and analysis of these abnormal nuclei provide a valuable reference for further investigations using sophisticated microscopic theories,potentially offering insights into new physics through studies of nuclearβ-decay half-lives.
基金National Key Research and Development Program of China(2022YFE0139300)Hubei Province Key Research and Development Program(2024BAB051)+1 种基金Guangdong Basic and Applied Basic Research Foundation(2022B1515120067)Wuhan Key Research and Development Program(2024050702030136).
文摘To support ubiquitous communication and enhance other 6G applications,the Space-Air-Ground Integrated Network(SAGIN)has become a research hotspot.Traditionally,satellite-ground fusion technologies integrate network entities from space,aerial,and terrestrial domains.However,they face challenges such as spectrum scarcity and inefficient satellite handover.This paper explores the Channel-Aware Handover Management(CAHM)strategy in SAGIN for data allocation.Specifically,CAHM utilizes the data receiving capability of Low Earth Orbit(LEO)satellites,considering satellite-ground distance,free-space path loss,and channel gain.Furthermore,CAHM assesses LEO satellite data forwarding capability using signal-to-noise ratio,link duration and buffer queue length.Then,CAHM applies historical data on LEO satellite transmission successes and failures to effectively reduce overall interruption ratio.Simulation results show that CAHM outperforms baseline algorithms in terms of delivery ratio,latency,and interruption ratio.
基金supported in part by the National Natural Science Foundation of China(Grant Nos.62201276,62350001,U22B2026,and 62471248)Innovation Program for Quantum Science and Technology(Grant No.2021ZD0300701)+1 种基金the Key R&D Program(Industry Foresight and Key Core Technologies)of Jiangsu Province(Grant No.BE2022071)Natural Science Research of Jiangsu Higher Education Institutions of China(Grant No.22KJB510007)。
文摘As the first stage of the quantum Internet,quantum key distribution(QKD)networks hold the promise of providing long-term security for diverse users.Most existing QKD networks have been constructed based on independent QKD protocols,and they commonly rely on the deployment of single-protocol trusted relay chains for long reach.Driven by the evolution of QKD protocols,large-scale QKD networking is expected to migrate from a single-protocol to a multi-protocol paradigm,during which some useful evolutionary elements for the later stages of the quantum Internet may be incorporated.In this work,we delve into a pivotal technique for large-scale QKD networking,namely,multi-protocol relay chaining.A multi-protocol relay chain is established by connecting a set of trusted/untrusted relays relying on multiple QKD protocols between a pair of QKD nodes.The structures of diverse multi-protocol relay chains are described,based on which the associated model is formulated and the policies are defined for the deployment of multi-protocol relay chains.Furthermore,we propose three multi-protocol relay chaining heuristics.Numerical simulations indicate that the designed heuristics can effectively reduce the number of trusted relays deployed and enhance the average security level versus the commonly used single-protocol trusted relay chaining methods on backbone network topologies.
基金Project supported by the National Natural Science Foundation of China (Grant No. 71971150)the Project of Research Center for System Sciences and Enterprise Development (Grant No. Xq16B05)the Fundamental Research Funds for the Central Universities of China (Grant No. SXYPY202313)。
文摘As a key mode of transportation, urban metro networks have significantly enhanced urban traffic environments and travel efficiency, making the identification of critical stations within these networks increasingly essential. This study presents a novel integrated topological-functional(ITF) algorithm for identifying critical nodes, combining topological metrics such as K-shell decomposition, node information entropy, and neighbor overlapping interaction with the functional attributes of passenger flow operations, while also considering the coupling effects between metro and bus networks. Using the Chengdu metro network as a case study, the effectiveness of the algorithm under different conditions is validated.The results indicate significant differences in passenger flow patterns between working and non-working days, leading to varying sets of critical nodes across these scenarios. Moreover, the ITF algorithm demonstrates a marked improvement in the accuracy of critical node identification compared to existing methods. This conclusion is supported by the analysis of changes in the overall network structure and relative global operational efficiency following targeted attacks on the identified critical nodes. The findings provide valuable insight into urban transportation planning, offering theoretical and practical guidance for improving metro network safety and resilience.
基金Project supported by the National Natural Science Foundation of China(Grant No.12101443,12371493)the Natural Science Foundation of Shanxi Province(Grant Nos.20210302124260 and 202303021221024)。
文摘Livestock transportation is a key factor that contributes to the spatial spread of brucellosis.To analyze the impact of sheep transportation on brucellosis transmission,we develop a human–sheep coupled brucellosis model within a metapopulation network framework.Theoretically,we examine the positively invariant set,the basic reproduction number,the existence,uniqueness,and stability of disease-free equilibrium and the existence of the endemic equilibrium of the model.For practical application,using Heilongjiang province as a case study,we simulate brucellosis transmission across 12 cities based on data using three network types:the BA network,the ER network,and homogeneous mixing network.The simulation results indicate that the network's average degree plays a role in the spread of brucellosis.For BA and ER networks,the basic reproduction number and cumulative incidence of brucellosis stabilize when the network's average degree reaches 4 or 5.In contrast,sheep transport in a homogeneous mixing network accelerates the cross-regional spread of brucellosis,whereas transportation in a BA network helps to control it effectively.Furthermore,the findings suggest that the movement of sheep is not always detrimental to controlling the spread of brucellosis.For cities with smaller sheep populations,such as Shuangyashan and Qitaihe,increasing the transport of sheep outward amplifies the spatial spread of the disease.In contrast,in cities with larger sheep populations,such as Qiqihar,Daqing,and Suihua,moderate sheep outflow can help reduce the spread.In addition,cities with large livestock populations play a dominant role in the overall transmission dynamics,underscoring the need for stricter supervision in these areas.
基金Project supported by the National Natural Science Foundation of China(Grant No.72031009)the National Social Science Foundation of China(Grant No.20&ZD058)。
文摘We study the influence of conformity on the evolution of cooperative behavior in games under the learning method of sampling on networks.A strategy update rule based on sampling is introduced into the stag hunt game,where agents draw samples from their neighbors and then update their strategies based on conformity or inference according to the situation in the sample.Based on these assumptions,we present the state transition equations in the dynamic evolution of population cooperation,conduct simulation analysis on lattice networks and scale-free networks,and discuss how this mechanism affects the evolution of cooperation and how cooperation evolves under different levels of conformity in the network.Our simulation results show that blindly imitating the strategies of neighbors does not necessarily lead to rapid consensus in the population.Instead,rational inference through samples can better promote the evolution of the same strategy among all agents in the population.Moreover,the simulation results also show that a smaller sample size cannot reflect the true situation of the neighbors,which has a large randomness,and the size of the benefits obtained in cooperation determines the direction of the entire population towards cooperation or defection.This work incorporates the conforming behavior of agents into the game,uses the method of sampling for strategy updates and enriches the theory of evolutionary games with a more realistic significance.
基金supported by the Science and Technology Project of the State Grid Corporation of China(5400-202255158A-1-1-ZN).
文摘Frequent extreme disasters have led to frequent large-scale power outages in recent years.To quickly restore power,it is necessary to understand the damage information of the distribution network accurately.However,the public network communication system is easily damaged after disasters,causing the operation center to lose control of the distribution network.In this paper,we considered using satellites to transmit the distribution network data and focus on the resource scheduling problem of the satellite emergency communication system for the distribution network.Specifically,this paper first formulates the satellite beam-pointing problem and the accesschannel joint resource allocation problem.Then,this paper proposes the Priority-based Beam-pointing and Access-Channel joint optimization algorithm(PBAC),which uses convex optimization theory to solve the satellite beam pointing problem,and adopts the block coordinate descent method,Lagrangian dual method,and a greedy algorithm to solve the access-channel joint resource allocation problem,thereby obtaining the optimal resource scheduling scheme for the satellite network.Finally,this paper conducts comparative experiments with existing methods to verify the effec-tiveness of the proposed methods.The results show that the total weighted transmitted data of the proposed algorithm is increased by about 19.29∼26.29%compared with other algorithms.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.72371031,62173065,62476045)Fundamental Research Funds for the Central Universities(Grant No.124330008)。
文摘The unique structure of signed networks,characterized by positive and negative edges,poses significant challenges for analyzing network topology.In recent years,various statistical algorithms have been developed to address this issue.However,there remains a lack of a unified framework to uncover the nontrivial properties inherent in signed network structures.To support developers,researchers,and practitioners in this field,we introduce a Python library named SNSAlib(Signed Network Structure Analysis),specifically designed to meet these analytical requirements.This library encompasses empirical signed network datasets,signed null model algorithms,signed statistics algorithms,and evaluation indicators.The primary objective of SNSAlib is to facilitate the systematic analysis of micro-and meso-structure features within signed networks,including node popularity,clustering,assortativity,embeddedness,and community structure by employing more accurate signed null models.Ultimately,it provides a robust paradigm for structure analysis of signed networks that enhances our understanding and application of signed networks.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.12305043 and 12165016)the Natural Science Foundation of Jiangsu Province(Grant No.BK20220511)+1 种基金the Project of Undergraduate Scientific Research(Grant No.22A684)the support from the Jiangsu Specially-Appointed Professor Program。
文摘Information spreading has been investigated for many years,but the mechanism of why the information explosively catches on overnight is still under debate.This explosive spreading phenomenon was usually considered driven separately by social reinforcement or higher-order interactions.However,due to the limitations of empirical data and theoretical analysis,how the higher-order network structure affects the explosive information spreading under the role of social reinforcement has not been fully explored.In this work,we propose an information-spreading model by considering the social reinforcement in real and synthetic higher-order networks,describable as hypergraphs.Depending on the average group size(hyperedge cardinality)and node membership(hyperdegree),we observe two different spreading behaviors:(i)The spreading progress is not sensitive to social reinforcement,resulting in the information localized in a small part of nodes;(ii)a strong social reinforcement will promote the large-scale spread of information and induce an explosive transition.Moreover,a large average group size and membership would be beneficial to the appearance of the explosive transition.Further,we display that the heterogeneity of the node membership and group size distributions benefit the information spreading.Finally,we extend the group-based approximate master equations to verify the simulation results.Our findings may help us to comprehend the rapidly information-spreading phenomenon in modern society.
基金support from the National Natural Science Foundation of China(Grant No.T2293771)the STI 2030-Major Projects(Grant No.2022ZD0211400)the Sichuan Province Outstanding Young Scientists Foundation(Grant No.2023NSFSC1919)。
文摘Independent cascade(IC)models,by simulating how one node can activate another,are important tools for studying the dynamics of information spreading in complex networks.However,traditional algorithms for the IC model implementation face significant efficiency bottlenecks when dealing with large-scale networks and multi-round simulations.To settle this problem,this study introduces a GPU-based parallel independent cascade(GPIC)algorithm,featuring an optimized representation of the network data structure and parallel task scheduling strategies.Specifically,for this GPIC algorithm,we propose a network data structure tailored for GPU processing,thereby enhancing the computational efficiency and the scalability of the IC model.In addition,we design a parallel framework that utilizes the full potential of GPU's parallel processing capabilities,thereby augmenting the computational efficiency.The results from our simulation experiments demonstrate that GPIC not only preserves accuracy but also significantly boosts efficiency,achieving a speedup factor of 129 when compared to the baseline IC method.Our experiments also reveal that when using GPIC for the independent cascade simulation,100-200 simulation rounds are sufficient for higher-cost studies,while high precision studies benefit from 500 rounds to ensure reliable results,providing empirical guidance for applying this new algorithm to practical research.
