Optimization Model Research on WSNs Intrusion Tolerance with Scale-Free Topology

2014 ◽  
Vol 1049-1050 ◽  
pp. 2059-2062
Author(s):  
Xun Li Fan ◽  
Fei Fei Du ◽  
Jun Guo ◽  
Jie Zhang
Keyword(s):  
Scale Free Network ◽  
Intrusion Tolerance ◽  
Scale Free ◽  
And Topology ◽  
Model Research ◽  
Optimal Network ◽  
Free Network ◽  
Improved Model ◽  
Power Law Index ◽  
Random Failures

This paper proposes a new scale-free network BA Improved Model (BAIM) for the scale-free topology of WSNs intrusion tolerance issues. Through analyzing the power law index of the network invulnerability and topology of fault tolerance, the results of BAIM in the topology of the network survivability maximize the optimal network topology. Simulation results show that BAIM can not only keep the scale-free network robust to random failures, and but also improve the scale-free network vulnerability against intentional attacks and prolong the network lifetime.

URBAN TRANSIT SYSTEM AS A SCALE-FREE NETWORK

2004 ◽  
Vol 18 (19n20) ◽  
pp. 1043-1049 ◽  
Author(s):  
JIANJUN WU ◽  
ZIYOU GAO ◽  
HUIJUN SUN ◽  
HAIJUN HUANG
Keyword(s):  
Traffic Congestion ◽  
Traffic Accidents ◽  
Scale Free Network ◽  
Urban Transit ◽  
Transit System ◽  
Transit Network ◽  
Scale Free ◽  
Free Network ◽  
System Data ◽  
Random Failures

Many systems can be represented by networks as a set of nodes joined together by links indicating interaction. Recently studies have suggested that a lot of real networks are scale-free, such as the WWW, social networks, etc. In this paper, discoveries of scale-free characteristics are reported on the network constructed from the real urban transit system data in Beijing. It is shown that the connectivity distribution of the transit network decays as a power-law, and the exponent λ is about equal to 2.24 from the simulation graph. Based on the scale-free network topology structure of the transit network, if only transit "hub nodes" are controlled well, the transit network can resist random failures (such as traffic congestion, traffic accidents, etc.) successfully.

scholarly journals OPTIMIZATION OF ROBUSTNESS OF SCALE-FREE NETWORK TO RANDOM AND TARGETED ATTACKS

2005 ◽  
Vol 19 (16) ◽  
pp. 785-792 ◽  
Author(s):  
JIAN-GUO LIU ◽  
ZHONG-TUO WANG ◽  
YAN-ZHONG DANG
Keyword(s):  
Network Design ◽  
Scale Free Network ◽  
Design Guideline ◽  
Scale Free ◽  
Targeted Attacks ◽  
Maximum Value ◽  
Scale Free Networks ◽  
Free Network ◽  
Random Failures ◽  
Connectivity Distribution

Scale-free networks, having connectivity distribution P(k)~k-α (where k is the site connectivity), are very resilient to random failures but are fragile to intentional attacks. The purpose of this paper is to find the network design guideline which can make the robustness of the network to both random failures and intentional attacks maximum while keeping the average connectivity <k> per node constant. We find that when <k> = 3 the robustness of the scale-free networks reach its maximum value if the minimal connectivity m = 1, but when <k> is larger than four, the networks will become more robust to random failures and targeted attacks as the minimal connectivity m gets larger.

scholarly journals OPTIMIZATION OF SCALE-FREE NETWORK FOR RANDOM FAILURES

2006 ◽  
Vol 20 (14) ◽  
pp. 815-820 ◽  
Author(s):  
JIAN-GUO LIU ◽  
ZHONG-TUO WANG ◽  
YAN-ZHONG DANG
Keyword(s):  
Network Design ◽  
Degree Distribution ◽  
Design Guidelines ◽  
Network Robustness ◽  
Optimization Strategy ◽  
Scale Free Network ◽  
Scale Free ◽  
Optimal Value ◽  
Free Network ◽  
Random Failures

It has been found that the networks with scale-free degree distribution are very resilient for random failures. The purpose of this work is to determine the network design guidelines which maximize the network robustness for random failures when the average number of links per node of the network is constant. The optimal value of the degree distribution exponent and the minimum connectivity to different network sizes are given in this paper. Finally, the optimization strategy on how to improve the evolving network robustness is given.

Research on new evolution model of scale-free network

2009 ◽  
Vol 29 (5) ◽  
pp. 1230-1232
Author(s):  
Hao RAO ◽  
Chun YANG ◽  
Shao-hua TAO
Keyword(s):  
Evolution Model ◽  
Scale Free Network ◽  
Scale Free ◽  
Free Network

scholarly journals Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Xiuwen Fu ◽  
Yongsheng Yang ◽  
Haiqing Yao
Keyword(s):  
Random Network ◽  
Small World ◽  
Coupled Map Lattice ◽  
Wireless Sensor ◽  
Cascading Failures ◽  
Scale Free Network ◽  
Scale Free ◽  
Network Topologies ◽  
Free Network ◽  
Entire Network

Previous research of wireless sensor networks (WSNs) invulnerability mainly focuses on the static topology, while ignoring the cascading process of the network caused by the dynamic changes of load. Therefore, given the realistic features of WSNs, in this paper we research the invulnerability of WSNs with respect to cascading failures based on the coupled map lattice (CML). The invulnerability and the cascading process of four types of network topologies (i.e., random network, small-world network, homogenous scale-free network, and heterogeneous scale-free network) under various attack schemes (i.e., random attack, max-degree attack, and max-status attack) are investigated, respectively. The simulation results demonstrate that the rise of interference R and coupling coefficient ε will increase the risks of cascading failures. Cascading threshold values Rc and εc exist, where cascading failures will spread to the entire network when R>Rc or ε>εc. When facing a random attack or max-status attack, the network with higher heterogeneity tends to have a stronger invulnerability towards cascading failures. Conversely, when facing a max-degree attack, the network with higher uniformity tends to have a better performance. Besides that, we have also proved that the spreading speed of cascading failures is inversely proportional to the average path length of the network and the increase of average degree k can improve the network invulnerability.

Sign in / Sign up

Export Citation Format

Share Document