Ethereum, currently the most widely utilized smart contracts platform, anchors the security of myriad smartcontracts upon its own robustness. Its foundational peer-to-peer network facilitates a dependable node connect...Ethereum, currently the most widely utilized smart contracts platform, anchors the security of myriad smartcontracts upon its own robustness. Its foundational peer-to-peer network facilitates a dependable node connectionmechanism, whereas an efficient data-sharing protocol constitutes as the bedrock of Blockchain network security.In this paper, we propose NodeHunter, an Ethereum network detector implemented through the application ofsimulation technology, which is capable of aggregating all node records within the network and the interconnectednessbetween them. Utilizing this connection information, NodeHunter can procure more comprehensive insightsfor network status analysis compared to preceding detection methodologies. Throughout a three-month period ofunbroken surveillance of the Ethereum network, we obtained an excess of two million node records along with overone hundred million node acquaintances. Analysis of the gathered data revealed that an alarming 49% or more ofthese node records were maliciously forged.展开更多
As industrialization and informatization becomemore deeply intertwined,industrial control networks have entered an era of intelligence.The connection between industrial control networks and the external internet is be...As industrialization and informatization becomemore deeply intertwined,industrial control networks have entered an era of intelligence.The connection between industrial control networks and the external internet is becoming increasingly close,which leads to frequent security accidents.This paper proposes a model for the industrial control network.It includes a malware containment strategy that integrates intrusion detection,quarantine,and monitoring.Basedonthismodel,the role of keynodes in the spreadofmalware is studied,a comparisonexperiment is conducted to validate the impact of the containment strategy.In addition,the dynamic behavior of the model is analyzed,the basic reproduction number is computed,and the disease-free and endemic equilibrium of the model is also obtained by the basic reproduction number.Moreover,through simulation experiments,the effectiveness of the containment strategy is validated,the influence of the relevant parameters is analyzed,and the containment strategy is optimized.In otherwords,selective immunity to key nodes can effectively suppress the spread ofmalware andmaintain the stability of industrial control systems.The earlier the immunization of key nodes,the better.Once the time exceeds the threshold,immunizing key nodes is almost ineffective.The analysis provides a better way to contain the malware in the industrial control network.展开更多
In many engineering networks, only a part of target state variables are required to be estimated.On the other hand,multi-layer complex network exists widely in practical situations.In this paper, the state estimation ...In many engineering networks, only a part of target state variables are required to be estimated.On the other hand,multi-layer complex network exists widely in practical situations.In this paper, the state estimation of target state variables in multi-layer complex dynamical networks with nonlinear node dynamics is studied.A suitable functional state observer is constructed with the limited measurement.The parameters of the designed functional observer are obtained from the algebraic method and the stability of the functional observer is proven by the Lyapunov theorem.Some necessary conditions that need to be satisfied for the design of the functional state observer are obtained.Different from previous studies, in the multi-layer complex dynamical network with nonlinear node dynamics, the proposed method can estimate the state of target variables on some layers directly instead of estimating all the individual states.Thus, it can greatly reduce the placement of observers and computational cost.Numerical simulations with the three-layer complex dynamical network composed of three-dimensional nonlinear dynamical nodes are developed to verify the effectiveness of the method.展开更多
In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the node degree and the average path length of China aviation network in 1988,1994,2001...In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the node degree and the average path length of China aviation network in 1988,1994,2001,2008 and 2015 was studied.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network.On the basis of the statistical data,the node average path length of China aviation network in 1988,1994,2001,2008 and 2015 was calculated.Through regression analysis,it was found that the node degree had a logarithmic relationship with the average length of node path,and the two parameters of the logarithmic relationship had linear evolutionary trace.Key word:China aviation network,complex network,node degree,average length of node path,logarithmic relationship,evolutionary trace.展开更多
The types and functions of social networking sites are becoming more abundant with the prevalence of self-media culture,and the number of daily active users of social networking sites represented by Weibo and Zhihu co...The types and functions of social networking sites are becoming more abundant with the prevalence of self-media culture,and the number of daily active users of social networking sites represented by Weibo and Zhihu continues to expand.There are key node users in social networks.Compared with ordinary users,their influence is greater,their radiation range is wider,and their information transmission capabilities are better.The key node users playimportant roles in public opinion monitoring and hot event prediction when evaluating the criticality of nodes in social networking sites.In order to solve the problems of incomplete evaluation factors,poor recognition rate and low accuracy of key nodes of social networking sites,this paper establishes a social networking site key node recognition algorithm(SNSKNIS)based on PageRank(PR)algorithm,and evaluates the importance of social networking site nodes in combination with the influence of nodes and the structure of nodes in social networks.This article takes the Sina Weibo platform as an example,uses the key node identification algorithm system of social networking sites to discover the key nodes in the social network,analyzes its importance in the social network,and displays it visually.展开更多
Many networks in the real world have spatial attributes, such as location of nodes and length of edges, called spatial networks. When these networks are subject to some random or deliberate attacks, some nodes in the ...Many networks in the real world have spatial attributes, such as location of nodes and length of edges, called spatial networks. When these networks are subject to some random or deliberate attacks, some nodes in the network fail, which causes a decline in the network performance. In order to make the network run normally, some of the failed nodes must be recovered. In the case of limited recovery resources, an effective key node identification method can find the key recovering node in the failed nodes, by which the network performance can be recovered most of the failed nodes. We propose two key recovering node identification methods for spatial networks, which are the Euclidean-distance recovery method and the route-length recovery method. Simulations on homogeneous and heterogeneous spatial networks show that the proposed methods can significantly recover the network performance.展开更多
The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significan...The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significantly.To protect the network efficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information,this paper develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realistic two-dimensional scenario.After that,we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks.展开更多
Identifying influential nodes in complex networks and ranking their importance plays an important role in many fields such as public opinion analysis, marketing, epidemic prevention and control. To solve the issue of ...Identifying influential nodes in complex networks and ranking their importance plays an important role in many fields such as public opinion analysis, marketing, epidemic prevention and control. To solve the issue of the existing node centrality measure only considering the specific statistical feature of a single dimension, a SLGC model is proposed that combines a node’s self-influence, its local neighborhood influence, and global influence to identify influential nodes in the network. The exponential function of e is introduced to measure the node’s self-influence;in the local neighborhood,the node’s one-hop neighboring nodes and two-hop neighboring nodes are considered, while the information entropy is introduced to measure the node’s local influence;the topological position of the node in the network and the shortest path between nodes are considered to measure the node’s global influence. To demonstrate the effectiveness of the proposed model, extensive comparison experiments are conducted with eight existing node centrality measures on six real network data sets using node differentiation ability experiments, susceptible–infected–recovered(SIR) model and network efficiency as evaluation criteria. The experimental results show that the method can identify influential nodes in complex networks more accurately.展开更多
In recent times,real time wireless networks have found their applicability in several practical applications such as smart city,healthcare,surveillance,environmental monitoring,etc.At the same time,proper localization...In recent times,real time wireless networks have found their applicability in several practical applications such as smart city,healthcare,surveillance,environmental monitoring,etc.At the same time,proper localization of nodes in real time wireless networks helps to improve the overall functioning of networks.This study presents an Improved Metaheuristics based Energy Efficient Clustering with Node Localization(IM-EECNL)approach for real-time wireless networks.The proposed IM-EECNL technique involves two major processes namely node localization and clustering.Firstly,Chaotic Water Strider Algorithm based Node Localization(CWSANL)technique to determine the unknown position of the nodes.Secondly,an Oppositional Archimedes Optimization Algorithm based Clustering(OAOAC)technique is applied to accomplish energy efficiency in the network.Besides,the OAOAC technique derives afitness function comprising residual energy,distance to cluster heads(CHs),distance to base station(BS),and load.The performance validation of the IM-EECNL technique is carried out under several aspects such as localization and energy efficiency.A wide ranging comparative outcomes analysis highlighted the improved performance of the IM-EECNL approach on the recent approaches with the maximum packet delivery ratio(PDR)of 0.985.展开更多
This paper studies the target controllability of multilayer complex networked systems,in which the nodes are highdimensional linear time invariant(LTI)dynamical systems,and the network topology is directed and weighte...This paper studies the target controllability of multilayer complex networked systems,in which the nodes are highdimensional linear time invariant(LTI)dynamical systems,and the network topology is directed and weighted.The influence of inter-layer couplings on the target controllability of multi-layer networks is discussed.It is found that even if there exists a layer which is not target controllable,the entire multi-layer network can still be target controllable due to the inter-layer couplings.For the multi-layer networks with general structure,a necessary and sufficient condition for target controllability is given by establishing the relationship between uncontrollable subspace and output matrix.By the derived condition,it can be found that the system may be target controllable even if it is not state controllable.On this basis,two corollaries are derived,which clarify the relationship between target controllability,state controllability and output controllability.For the multi-layer networks where the inter-layer couplings are directed chains and directed stars,sufficient conditions for target controllability of networked systems are given,respectively.These conditions are easier to verify than the classic criterion.展开更多
The globalization of hardware designs and supply chains,as well as the integration of third-party intellectual property(IP)cores,has led to an increased focus from malicious attackers on computing hardware.However,exi...The globalization of hardware designs and supply chains,as well as the integration of third-party intellectual property(IP)cores,has led to an increased focus from malicious attackers on computing hardware.However,existing defense or detection approaches often require additional circuitry to perform security verification,and are thus constrained by time and resource limitations.Considering the scale of actual engineering tasks and tight project schedules,it is usually difficult to implement designs for all modules in field programmable gate array(FPGA)circuits.Some studies have pointed out that the failure of key modules tends to cause greater damage to the network.Therefore,under limited conditions,priority protection designs need to be made on key modules to improve protection efficiency.We have conducted research on FPGA designs including single FPGA systems and multi-FPGA systems,to identify key modules in FPGA systems.For the single FPGA designs,considering the topological structure,network characteristics,and directionality of FPGA designs,we propose a node importance evaluationmethod based on the technique for order preference by similarity to an ideal solution(TOPSIS)method.Then,for the multi-FPGA designs,considering the influence of nodes in intra-layer and inter-layers,they are constructed into the interdependent network,and we propose a method based on connection strength to identify the important modules.Finally,we conduct empirical research using actual FPGA designs as examples.The results indicate that compared to other traditional indexes,node importance indexes proposed for different designs can better characterize the importance of nodes.展开更多
Enhancing the security of Wireless Sensor Networks(WSNs)improves the usability of their applications.Therefore,finding solutions to various attacks,such as the blackhole attack,is crucial for the success of WSN applic...Enhancing the security of Wireless Sensor Networks(WSNs)improves the usability of their applications.Therefore,finding solutions to various attacks,such as the blackhole attack,is crucial for the success of WSN applications.This paper proposes an enhanced version of the AODV(Ad Hoc On-Demand Distance Vector)protocol capable of detecting blackholes and malfunctioning benign nodes in WSNs,thereby avoiding them when delivering packets.The proposed version employs a network-based reputation system to select the best and most secure path to a destination.To achieve this goal,the proposed version utilizes the Watchdogs/Pathrater mechanisms in AODV to gather and broadcast reputations to all network nodes to build the network-based reputation system.To minimize the network overhead of the proposed approach,the paper uses reputation aggregator nodes only for forwarding reputation tables.Moreover,to reduce the overhead of updating reputation tables,the paper proposes three mechanisms,which are the prompt broadcast,the regular broadcast,and the light broadcast approaches.The proposed enhanced version has been designed to perform effectively in dynamic environments such as mobile WSNs where nodes,including blackholes,move continuously,which is considered a challenge for other protocols.Using the proposed enhanced protocol,a node evaluates the security of different routes to a destination and can select the most secure routing path.The paper provides an algorithm that explains the proposed protocol in detail and demonstrates a case study that shows the operations of calculating and updating reputation values when nodes move across different zones.Furthermore,the paper discusses the proposed approach’s overhead analysis to prove the proposed enhancement’s correctness and applicability.展开更多
Wireless Sensor Network(WSN)is a distributed sensor network composed a large number of nodes with low cost,low performance and self-management.The special structure of WSN brings both convenience and vulnerability.For...Wireless Sensor Network(WSN)is a distributed sensor network composed a large number of nodes with low cost,low performance and self-management.The special structure of WSN brings both convenience and vulnerability.For example,a malicious participant can launch attacks by capturing a physical device.Therefore,node authentication that can resist malicious attacks is very important to network security.Recently,blockchain technology has shown the potential to enhance the security of the Internet of Things(IoT).In this paper,we propose a Blockchain-empowered Authentication Scheme(BAS)for WSN.In our scheme,all nodes are managed by utilizing the identity information stored on the blockchain.Besides,the simulation experiment about worm detection is executed on BAS,and the security is evaluated from detection and infection rate.The experiment results indicate that the proposed scheme can effectively inhibit the spread and infection of worms in the network.展开更多
In order to reveal the complex network characteristics and evolution principle of China aviation network, the relationship between the node degree and the nearest neighbor average degree and its evolution trace of Chi...In order to reveal the complex network characteristics and evolution principle of China aviation network, the relationship between the node degree and the nearest neighbor average degree and its evolution trace of China aviation network in 1988, 1994, 2001, 2008 and 2015 were studied. According to the theory and method of complex network, the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network. According to the statistical data, the node nearest neighbor average degree of China aviation network in 1988, 1994, 2001, 2008 and 2015 was calculated. Through regression analysis, it was found that the node degree had a negative exponential relationship with the nearest neighbor average degree, and the two parameters of the negative exponential relationship had linear evolution trace.展开更多
Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand...Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand allocates the acquired location information to unknown devices. The metaheuristic approach is one of themost advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditionalmethods that often suffer from computational time problems and small network deployment scale. This studyproposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on thesiege mechanism (SWOA) for node localization inWSN. The objective function is modeled while communicatingon localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localizationapproach also assigns the discovered location data to unidentified devices with the modeled objective functionby applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of thedesigned localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executedtime. Compared experimental-result shows that theSWOA offers the applicability of the developed model forWSNto perform the localization scheme with excellent quality. Significantly, the error and convergence values achievedby the SWOA are less location error, faster in convergence and executed time than the others compared to at least areduced 1.5% to 4.7% error rate, and quicker by at least 4%and 2% in convergence and executed time, respectivelyfor the experimental scenarios.展开更多
Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many scholars.Inspired by the self-nonself disc...Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many scholars.Inspired by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network privacy.Therefore,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called AttNetNRI.Specifically,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept private.Moreover,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social networks.To evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social networks.The experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding parts.The experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.展开更多
Node of network has lots of information, such as topology, text and label information. Therefore, node classification is an open issue. Recently, one vector of node is directly connected at the end of another vector. ...Node of network has lots of information, such as topology, text and label information. Therefore, node classification is an open issue. Recently, one vector of node is directly connected at the end of another vector. However, this method actually obtains the performance by extending dimensions and considering that the text and structural information are one-to-one, which is obviously unreasonable. Regarding this issue, a method by weighting vectors is proposed in this paper. Three methods, negative logarithm, modulus and sigmoid function are used to weight-trained vectors, then recombine the weighted vectors and put them into the SVM classifier for evaluation output. By comparing three different weighting methods, the results showed that using negative logarithm weighting achieved better results than the other two using modulus and sigmoid function weighting, and was superior to directly concatenating vectors in the same dimension.展开更多
In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network (WSN), sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y ...In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network (WSN), sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y different from other types of WSNs, in which the sensor nodes are deployed along elongated geographic areas and form a chain-type network topo-logy structure. This paper investigates the node scheduling prob-lem in the chain-type WSN. Firstly, a node dormant scheduling mode is analyzed theoretical y from geographic coverage, and then three neighboring nodes scheduling criteria are proposed. Sec-ondly, a hybrid coverage scheduling algorithm and dead areas are presented. Final y, node scheduling in mine tunnel WSN with uniform deployment (UD), non-uniform deployment (NUD) and op-timal distribution point spacing (ODS) is simulated. The results show that the node scheduling with UD and NUD, especial y NUD, can effectively extend the network survival time. Therefore, a strat-egy of adding a few mobile nodes which activate the network in dead areas is proposed, which can further extend the network survival time by balancing the energy consumption of nodes.展开更多
Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective funct...Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.展开更多
基金the National Key Research and Development Program of China(No.2020YFB1005805)Peng Cheng Laboratory Project(Grant No.PCL2021A02)+2 种基金Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies(2022B1212010005)Shenzhen Basic Research(General Project)(No.JCYJ20190806142601687)Shenzhen Stable Supporting Program(General Project)(No.GXWD20201230155427003-20200821160539001).
文摘Ethereum, currently the most widely utilized smart contracts platform, anchors the security of myriad smartcontracts upon its own robustness. Its foundational peer-to-peer network facilitates a dependable node connectionmechanism, whereas an efficient data-sharing protocol constitutes as the bedrock of Blockchain network security.In this paper, we propose NodeHunter, an Ethereum network detector implemented through the application ofsimulation technology, which is capable of aggregating all node records within the network and the interconnectednessbetween them. Utilizing this connection information, NodeHunter can procure more comprehensive insightsfor network status analysis compared to preceding detection methodologies. Throughout a three-month period ofunbroken surveillance of the Ethereum network, we obtained an excess of two million node records along with overone hundred million node acquaintances. Analysis of the gathered data revealed that an alarming 49% or more ofthese node records were maliciously forged.
基金Scientific Research Project of Liaoning Province Education Department,Code:LJKQZ20222457&LJKMZ20220781Liaoning Province Nature Fund Project,Code:No.2022-MS-291.
文摘As industrialization and informatization becomemore deeply intertwined,industrial control networks have entered an era of intelligence.The connection between industrial control networks and the external internet is becoming increasingly close,which leads to frequent security accidents.This paper proposes a model for the industrial control network.It includes a malware containment strategy that integrates intrusion detection,quarantine,and monitoring.Basedonthismodel,the role of keynodes in the spreadofmalware is studied,a comparisonexperiment is conducted to validate the impact of the containment strategy.In addition,the dynamic behavior of the model is analyzed,the basic reproduction number is computed,and the disease-free and endemic equilibrium of the model is also obtained by the basic reproduction number.Moreover,through simulation experiments,the effectiveness of the containment strategy is validated,the influence of the relevant parameters is analyzed,and the containment strategy is optimized.In otherwords,selective immunity to key nodes can effectively suppress the spread ofmalware andmaintain the stability of industrial control systems.The earlier the immunization of key nodes,the better.Once the time exceeds the threshold,immunizing key nodes is almost ineffective.The analysis provides a better way to contain the malware in the industrial control network.
基金Project supported by the National Natural Science Foundation of China (Grant Nos.62373197 and 61873326)。
文摘In many engineering networks, only a part of target state variables are required to be estimated.On the other hand,multi-layer complex network exists widely in practical situations.In this paper, the state estimation of target state variables in multi-layer complex dynamical networks with nonlinear node dynamics is studied.A suitable functional state observer is constructed with the limited measurement.The parameters of the designed functional observer are obtained from the algebraic method and the stability of the functional observer is proven by the Lyapunov theorem.Some necessary conditions that need to be satisfied for the design of the functional state observer are obtained.Different from previous studies, in the multi-layer complex dynamical network with nonlinear node dynamics, the proposed method can estimate the state of target variables on some layers directly instead of estimating all the individual states.Thus, it can greatly reduce the placement of observers and computational cost.Numerical simulations with the three-layer complex dynamical network composed of three-dimensional nonlinear dynamical nodes are developed to verify the effectiveness of the method.
文摘In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the node degree and the average path length of China aviation network in 1988,1994,2001,2008 and 2015 was studied.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network.On the basis of the statistical data,the node average path length of China aviation network in 1988,1994,2001,2008 and 2015 was calculated.Through regression analysis,it was found that the node degree had a logarithmic relationship with the average length of node path,and the two parameters of the logarithmic relationship had linear evolutionary trace.Key word:China aviation network,complex network,node degree,average length of node path,logarithmic relationship,evolutionary trace.
基金supported by Jiangsu Social Science Foundation Project(Grant No:20TQC005)Philosophy Social Science Research Project Fund of Jiangsu University(Grant No:2020SJA0500)+2 种基金The National Natural Science Foundation of China(GrantNo.61802155)The Innovation and Entrepreneurship Project Fund for College Students of Jiangsu Police Academy(Grant No.202110329028Y)The“qinglan Project”of Jiangsu Universities.
文摘The types and functions of social networking sites are becoming more abundant with the prevalence of self-media culture,and the number of daily active users of social networking sites represented by Weibo and Zhihu continues to expand.There are key node users in social networks.Compared with ordinary users,their influence is greater,their radiation range is wider,and their information transmission capabilities are better.The key node users playimportant roles in public opinion monitoring and hot event prediction when evaluating the criticality of nodes in social networking sites.In order to solve the problems of incomplete evaluation factors,poor recognition rate and low accuracy of key nodes of social networking sites,this paper establishes a social networking site key node recognition algorithm(SNSKNIS)based on PageRank(PR)algorithm,and evaluates the importance of social networking site nodes in combination with the influence of nodes and the structure of nodes in social networks.This article takes the Sina Weibo platform as an example,uses the key node identification algorithm system of social networking sites to discover the key nodes in the social network,analyzes its importance in the social network,and displays it visually.
基金Project supported by Zhejiang Provincial Natural Science Foundation of China (Grant No. LQ23F030012)the Fundamental Research Funds for the Provincial Universities of Zhejiang (Grant No. GK229909299001-018)。
文摘Many networks in the real world have spatial attributes, such as location of nodes and length of edges, called spatial networks. When these networks are subject to some random or deliberate attacks, some nodes in the network fail, which causes a decline in the network performance. In order to make the network run normally, some of the failed nodes must be recovered. In the case of limited recovery resources, an effective key node identification method can find the key recovering node in the failed nodes, by which the network performance can be recovered most of the failed nodes. We propose two key recovering node identification methods for spatial networks, which are the Euclidean-distance recovery method and the route-length recovery method. Simulations on homogeneous and heterogeneous spatial networks show that the proposed methods can significantly recover the network performance.
基金supported by the National Natural Science Foundation of China(62231020)the Youth Innovation Team of Shaanxi Universities。
文摘The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significantly.To protect the network efficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information,this paper develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realistic two-dimensional scenario.After that,we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks.
基金Project supported by the Natural Science Basic Research Program of Shaanxi Province of China (Grant No. 2022JQ675)the Youth Innovation Team of Shaanxi Universities。
文摘Identifying influential nodes in complex networks and ranking their importance plays an important role in many fields such as public opinion analysis, marketing, epidemic prevention and control. To solve the issue of the existing node centrality measure only considering the specific statistical feature of a single dimension, a SLGC model is proposed that combines a node’s self-influence, its local neighborhood influence, and global influence to identify influential nodes in the network. The exponential function of e is introduced to measure the node’s self-influence;in the local neighborhood,the node’s one-hop neighboring nodes and two-hop neighboring nodes are considered, while the information entropy is introduced to measure the node’s local influence;the topological position of the node in the network and the shortest path between nodes are considered to measure the node’s global influence. To demonstrate the effectiveness of the proposed model, extensive comparison experiments are conducted with eight existing node centrality measures on six real network data sets using node differentiation ability experiments, susceptible–infected–recovered(SIR) model and network efficiency as evaluation criteria. The experimental results show that the method can identify influential nodes in complex networks more accurately.
基金supported by Ulsan Metropolitan City-ETRI joint cooperation project[21AS1600,Development of intelligent technology for key industriesautonomous human-mobile-space autonomous collaboration intelligence technology].
文摘In recent times,real time wireless networks have found their applicability in several practical applications such as smart city,healthcare,surveillance,environmental monitoring,etc.At the same time,proper localization of nodes in real time wireless networks helps to improve the overall functioning of networks.This study presents an Improved Metaheuristics based Energy Efficient Clustering with Node Localization(IM-EECNL)approach for real-time wireless networks.The proposed IM-EECNL technique involves two major processes namely node localization and clustering.Firstly,Chaotic Water Strider Algorithm based Node Localization(CWSANL)technique to determine the unknown position of the nodes.Secondly,an Oppositional Archimedes Optimization Algorithm based Clustering(OAOAC)technique is applied to accomplish energy efficiency in the network.Besides,the OAOAC technique derives afitness function comprising residual energy,distance to cluster heads(CHs),distance to base station(BS),and load.The performance validation of the IM-EECNL technique is carried out under several aspects such as localization and energy efficiency.A wide ranging comparative outcomes analysis highlighted the improved performance of the IM-EECNL approach on the recent approaches with the maximum packet delivery ratio(PDR)of 0.985.
基金supported by the National Natural Science Foundation of China (U1808205)Hebei Natural Science Foundation (F2000501005)。
文摘This paper studies the target controllability of multilayer complex networked systems,in which the nodes are highdimensional linear time invariant(LTI)dynamical systems,and the network topology is directed and weighted.The influence of inter-layer couplings on the target controllability of multi-layer networks is discussed.It is found that even if there exists a layer which is not target controllable,the entire multi-layer network can still be target controllable due to the inter-layer couplings.For the multi-layer networks with general structure,a necessary and sufficient condition for target controllability is given by establishing the relationship between uncontrollable subspace and output matrix.By the derived condition,it can be found that the system may be target controllable even if it is not state controllable.On this basis,two corollaries are derived,which clarify the relationship between target controllability,state controllability and output controllability.For the multi-layer networks where the inter-layer couplings are directed chains and directed stars,sufficient conditions for target controllability of networked systems are given,respectively.These conditions are easier to verify than the classic criterion.
基金supported by the Natural Science Foundation of China under Grant Nos.62362008,61973163,61972345,U1911401.
文摘The globalization of hardware designs and supply chains,as well as the integration of third-party intellectual property(IP)cores,has led to an increased focus from malicious attackers on computing hardware.However,existing defense or detection approaches often require additional circuitry to perform security verification,and are thus constrained by time and resource limitations.Considering the scale of actual engineering tasks and tight project schedules,it is usually difficult to implement designs for all modules in field programmable gate array(FPGA)circuits.Some studies have pointed out that the failure of key modules tends to cause greater damage to the network.Therefore,under limited conditions,priority protection designs need to be made on key modules to improve protection efficiency.We have conducted research on FPGA designs including single FPGA systems and multi-FPGA systems,to identify key modules in FPGA systems.For the single FPGA designs,considering the topological structure,network characteristics,and directionality of FPGA designs,we propose a node importance evaluationmethod based on the technique for order preference by similarity to an ideal solution(TOPSIS)method.Then,for the multi-FPGA designs,considering the influence of nodes in intra-layer and inter-layers,they are constructed into the interdependent network,and we propose a method based on connection strength to identify the important modules.Finally,we conduct empirical research using actual FPGA designs as examples.The results indicate that compared to other traditional indexes,node importance indexes proposed for different designs can better characterize the importance of nodes.
文摘Enhancing the security of Wireless Sensor Networks(WSNs)improves the usability of their applications.Therefore,finding solutions to various attacks,such as the blackhole attack,is crucial for the success of WSN applications.This paper proposes an enhanced version of the AODV(Ad Hoc On-Demand Distance Vector)protocol capable of detecting blackholes and malfunctioning benign nodes in WSNs,thereby avoiding them when delivering packets.The proposed version employs a network-based reputation system to select the best and most secure path to a destination.To achieve this goal,the proposed version utilizes the Watchdogs/Pathrater mechanisms in AODV to gather and broadcast reputations to all network nodes to build the network-based reputation system.To minimize the network overhead of the proposed approach,the paper uses reputation aggregator nodes only for forwarding reputation tables.Moreover,to reduce the overhead of updating reputation tables,the paper proposes three mechanisms,which are the prompt broadcast,the regular broadcast,and the light broadcast approaches.The proposed enhanced version has been designed to perform effectively in dynamic environments such as mobile WSNs where nodes,including blackholes,move continuously,which is considered a challenge for other protocols.Using the proposed enhanced protocol,a node evaluates the security of different routes to a destination and can select the most secure routing path.The paper provides an algorithm that explains the proposed protocol in detail and demonstrates a case study that shows the operations of calculating and updating reputation values when nodes move across different zones.Furthermore,the paper discusses the proposed approach’s overhead analysis to prove the proposed enhancement’s correctness and applicability.
基金supported by the Natural Science Foundation under Grant No.61962009Major Scientific and Technological Special Project of Guizhou Province under Grant No.20183001Foundation of Guizhou Provincial Key Laboratory of Public Big Data under Grant No.2018BDKFJJ003,2018BDKFJJ005 and 2019BDKFJJ009.
文摘Wireless Sensor Network(WSN)is a distributed sensor network composed a large number of nodes with low cost,low performance and self-management.The special structure of WSN brings both convenience and vulnerability.For example,a malicious participant can launch attacks by capturing a physical device.Therefore,node authentication that can resist malicious attacks is very important to network security.Recently,blockchain technology has shown the potential to enhance the security of the Internet of Things(IoT).In this paper,we propose a Blockchain-empowered Authentication Scheme(BAS)for WSN.In our scheme,all nodes are managed by utilizing the identity information stored on the blockchain.Besides,the simulation experiment about worm detection is executed on BAS,and the security is evaluated from detection and infection rate.The experiment results indicate that the proposed scheme can effectively inhibit the spread and infection of worms in the network.
文摘In order to reveal the complex network characteristics and evolution principle of China aviation network, the relationship between the node degree and the nearest neighbor average degree and its evolution trace of China aviation network in 1988, 1994, 2001, 2008 and 2015 were studied. According to the theory and method of complex network, the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network. According to the statistical data, the node nearest neighbor average degree of China aviation network in 1988, 1994, 2001, 2008 and 2015 was calculated. Through regression analysis, it was found that the node degree had a negative exponential relationship with the nearest neighbor average degree, and the two parameters of the negative exponential relationship had linear evolution trace.
基金the VNUHCM-University of Information Technology’s Scientific Research Support Fund.
文摘Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand allocates the acquired location information to unknown devices. The metaheuristic approach is one of themost advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditionalmethods that often suffer from computational time problems and small network deployment scale. This studyproposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on thesiege mechanism (SWOA) for node localization inWSN. The objective function is modeled while communicatingon localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localizationapproach also assigns the discovered location data to unidentified devices with the modeled objective functionby applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of thedesigned localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executedtime. Compared experimental-result shows that theSWOA offers the applicability of the developed model forWSNto perform the localization scheme with excellent quality. Significantly, the error and convergence values achievedby the SWOA are less location error, faster in convergence and executed time than the others compared to at least areduced 1.5% to 4.7% error rate, and quicker by at least 4%and 2% in convergence and executed time, respectivelyfor the experimental scenarios.
基金supported by the National Natural Science Foundation of China(Nos.62006001,62372001)the Natural Science Foundation of Chongqing City(Grant No.CSTC2021JCYJ-MSXMX0002).
文摘Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many scholars.Inspired by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network privacy.Therefore,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called AttNetNRI.Specifically,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept private.Moreover,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social networks.To evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social networks.The experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding parts.The experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.
文摘Node of network has lots of information, such as topology, text and label information. Therefore, node classification is an open issue. Recently, one vector of node is directly connected at the end of another vector. However, this method actually obtains the performance by extending dimensions and considering that the text and structural information are one-to-one, which is obviously unreasonable. Regarding this issue, a method by weighting vectors is proposed in this paper. Three methods, negative logarithm, modulus and sigmoid function are used to weight-trained vectors, then recombine the weighted vectors and put them into the SVM classifier for evaluation output. By comparing three different weighting methods, the results showed that using negative logarithm weighting achieved better results than the other two using modulus and sigmoid function weighting, and was superior to directly concatenating vectors in the same dimension.
基金supported by the China Doctoral Discipline New Teacher Foundation(200802901507)the Sichuan Province Basic Research Plan Project(2013JY0165)the Cultivating Programme of Excellent Innovation Team of Chengdu University of Technology(KYTD201301)
文摘In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network (WSN), sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y different from other types of WSNs, in which the sensor nodes are deployed along elongated geographic areas and form a chain-type network topo-logy structure. This paper investigates the node scheduling prob-lem in the chain-type WSN. Firstly, a node dormant scheduling mode is analyzed theoretical y from geographic coverage, and then three neighboring nodes scheduling criteria are proposed. Sec-ondly, a hybrid coverage scheduling algorithm and dead areas are presented. Final y, node scheduling in mine tunnel WSN with uniform deployment (UD), non-uniform deployment (NUD) and op-timal distribution point spacing (ODS) is simulated. The results show that the node scheduling with UD and NUD, especial y NUD, can effectively extend the network survival time. Therefore, a strat-egy of adding a few mobile nodes which activate the network in dead areas is proposed, which can further extend the network survival time by balancing the energy consumption of nodes.
基金supported by the the Youth Science and Technology Innovation Fund (Science)(Nos.NS2014070, NS2014070)
文摘Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.