Tunable Network Generation Model for Small-World and Scale-Free Network

2017 ◽  
Vol 42 (7) ◽  
pp. 1392-1401
Author(s):  
Kang-won Lee ◽  
Hee-kwan Uhm ◽  
Hye-jin Choe
Keyword(s):  
Small World ◽  
Generation Model ◽  
Scale Free Network ◽  
Network Generation ◽  
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.

EXPRESS PASSENGER TRANSPORT SYSTEM AS A SCALE-FREE NETWORK

2006 ◽  
Vol 20 (27) ◽  
pp. 1755-1761 ◽  
Author(s):  
BAIBAI FU ◽  
ZIYOU GAO ◽  
FASHENG LIU ◽  
XIANJUAN KONG
Keyword(s):  
Transport System ◽  
Network Topology ◽  
Small World ◽  
Power Exponent ◽  
Scale Free Network ◽  
Passenger Transport ◽  
Scale Free ◽  
Scale Free Networks ◽  
Highway Network ◽  
Free Network

An express highway itself is not a scale-free network, while the Express Passenger Transport System (EPTS) on the express highway network has the properties of a small-world and scale-free network. Data analysis based on the observation of the EPTS in Shandong province, China, shows that the EPTS has the properties of scale-free networks and the power exponent λ of the distribution is equal to about 2.1. Based on the scale-free network topology structure of the EPTS network, the construction of the EPTS network will be more efficient and robust.

scholarly journals The Evolution of Price Competition Game on Complex Networks

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-13
Author(s):  
Feng Jie Xie ◽  
Jing Shi
Keyword(s):  
Complex Networks ◽  
Real World ◽  
Price Competition ◽  
Small World ◽  
Square Lattice ◽  
Small World Network ◽  
Scale Free Network ◽  
The Real ◽  
Scale Free ◽  
Free Network

The well-known “Bertrand paradox” describes a price competition game in which two competing firms reach an outcome where both charge a price equal to the marginal cost. The fact that the Bertrand paradox often goes against empirical evidences has intrigued many researchers. In this work, we study the game from a new theoretical perspective—an evolutionary game on complex networks. Three classic network models, square lattice, WS small-world network, and BA scale-free network, are used to describe the competitive relations among the firms which are bounded rational. The analysis result shows that full price keeping is one of the evolutionary equilibriums in a well-mixed interaction situation. Detailed experiment results indicate that the price-keeping phenomenon emerges in a square lattice, small-world network and scale-free network much more frequently than in a complete network which represents the well-mixed interaction situation. While the square lattice has little advantage in achieving full price keeping, the small-world network and the scale-free network exhibit a stronger capability in full price keeping than the complete network. This means that a complex competitive relation is a crucial factor for maintaining the price in the real world. Moreover, competition scale, original price, degree of cutting price, and demand sensitivity to price show a significant influence on price evolution on a complex network. The payoff scheme, which describes how each firm’s payoff is calculated in each round game, only influences the price evolution on the scale-free network. These results provide new and important insights for understanding price competition in the real world.

scholarly journals Evolution of Scale-Free Wireless Sensor Networks with Feature of Small-World Networks

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-15 ◽  
Author(s):  
Ying Duan ◽  
Xiuwen Fu ◽  
Wenfeng Li ◽  
Yu Zhang ◽  
Giancarlo Fortino
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Scale Free Network ◽  
Theoretical Derivation ◽  
Scale Free ◽  
Cluster Heads ◽  
Free Network

Scale-free network and small-world network are the most impacting discoveries in the complex networks theories and have already been successfully proved to be highly effective in improving topology structures of wireless sensor networks. However, currently both theories are not jointly applied to have further improvements in the generation of WSN topologies. Therefore, this paper proposes a cluster-structured evolution model of WSNs considering the characteristics of both networks. With introduction of energy sensitivity and maximum limitation of degrees that a cluster head could have, the performance of our model can be ensured. In order to give an overall assessment of lifting effects of shortcuts, four placement schemes of shortcuts are analyzed. The characteristics of small-world network and scale-free network of our model are proved via theoretical derivation and simulations. Besides, we find that, by introducing shortcuts into scale-free wireless sensor network, the performance of the network can be improved concerning energy-saving and invulnerability, and we discover that the schemes constructing shortcuts between cluster heads and the sink node have better promoted effects than the scheme building shortcuts between pairs of cluster heads, and the schemes based on the preferential principle are superior to the schemes based on the random principle.

A SMALL-WORLD AND SCALE-FREE NETWORK GENERATED BY SIERPINSKI TETRAHEDRON

Fractals ◽  
2016 ◽  
Vol 24 (01) ◽  
pp. 1650001 ◽  
Author(s):  
JIN CHEN ◽  
FEI GAO ◽  
ANBO LE ◽  
LIFENG XI ◽  
SHUHUA YIN
Keyword(s):  
Small World ◽  
Scale Free Network ◽  
Fractal Scaling ◽  
Scale Free ◽  
Evolving Networks ◽  
Free Network

The Sierpinski tetrahedron is used to construct evolving networks, whose vertexes are all solid regular tetrahedra in the construction of the Sierpinski tetrahedron up to the stage [Formula: see text] and any two vertexes are neighbors if and only if the corresponding tetrahedra are in contact with each other on boundary. We show that such networks have the small-world and scale-free effects, but are not fractal scaling.

scholarly journals The Operating Room: It’s a Small World (and Scale Free Network) After All

Connections ◽  
2014 ◽  
Vol 34 (1) ◽  
Author(s):  
Patrick J. Tighe ◽  
◽  
Sephalie Stephanie Patel ◽  
Nikolaus Gravenstein ◽  
Laurie Davies ◽  
...  
Keyword(s):  
Operating Room ◽  
Small World ◽  
Scale Free Network ◽  
Scale Free ◽  
Free Network
Sign in / Sign up

Export Citation Format

Share Document