scholarly journals Network topology optimization by turning non-scale-free networks into scale-free networks using nonlinear preferential rewiring method

2018 ◽  
Vol 14 (11) ◽  
pp. 155014771878447 ◽  
Author(s):  
Feng Su ◽  
Peijiang Yuan ◽  
Yuanwei Liu ◽  
Shuangqian Cao
Keyword(s):  
Topology Optimization ◽  
Network Topology ◽  
Random Networks ◽  
Practical Application ◽  
Performance Simulation ◽  
Scale Free ◽  
Scale Free Networks ◽  
Network Topologies ◽  
Network Topology Optimization ◽  
Rigorous Mathematical Model

In practical application, the generation and evolution of many real networks always do not follow rigorous mathematical model, making network topology optimization a great challenge in the field of complex networks. In this research, we optimize the topology of non-scale-free networks by turning it into scale-free networks using a nonlinear preferential rewiring method. For different kinds of original networks generated by Watts and Strogatz model, we systematically demonstrate the optimization process and the modified networks to verify the performance of nonlinear preferential rewiring. We conduct further researches to explore the effect of nonlinear preferential rewiring’s parameters on performance. Simulation results show that various non-scale-free networks with different network topologies generated by WS model, including random networks and various networks between regular and random, are turned into scale-free networks perfectly by nonlinear preferential rewiring method.

scholarly journals SURVIVING OPINIONS IN SZNAJD MODELS ON COMPLEX NETWORKS

2005 ◽  
Vol 16 (11) ◽  
pp. 1785-1792 ◽  
Author(s):  
F. A. RODRIGUES ◽  
L. DA F. COSTA
Keyword(s):  
Complex Networks ◽  
Scaling Law ◽  
Network Size ◽  
Random Networks ◽  
Scale Free ◽  
Scale Free Networks ◽  
Network Topologies

The Sznajd model has been largely applied to simulate many sociophysical phenomena. In this paper, we applied the Sznajd model with more than two opinions on three different network topologies and observed the evolution of surviving opinions after many interactions among the nodes. As result, we obtained a scaling law which depends of the network size and the number of possible opinions. We also observed that this scaling law is not the same for all network topologies, being quite similar between scale-free networks and Sznajd networks but different for random networks.

scholarly journals UAV-Based Collaborative Electronic Reconnaissance Network for 6G

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Fucheng Yang ◽  
Jie Song ◽  
Wei Xiong ◽  
Xutao Cui
Keyword(s):  
Topology Optimization ◽  
Unmanned Aerial Vehicle ◽  
Network Topology ◽  
Cooperative Network ◽  
Performance Simulation ◽  
Aerial Vehicle ◽  
Simulation Results ◽  
Novel Strategy ◽  
Network Topology Optimization ◽  
Command Center

In unmanned aerial vehicle (UAV) collaborative electronic reconnaissance network, single UAV is always restricted by flyability and sensing capacity; hence, a cooperative network is built to realize the electronic reconnaissance. In this paper, a three-level electronic reconnaissance network is proposed, including the radiation target, UAV-based electronic reconnaissance equipment, and the command center. Each of the UAVs is capable of monitoring several radiation targets at the same time. Since the topology of the UAV network influences the effect of electronic reconnaissance, in this contribution, optimization is achieved based on the improvement of radiation coverage. If there is no radiation target within the sensing scope, the corresponding UAV will remove according to our novel strategy. Iterate operations are carried out for the relative optimum performance. Simulation results show that the UAV network topology optimization is capable of improving the coverage of radiation targets effectively.

scholarly journals Dynamics analysis of an online gambling spreading model on scale-free networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yu Kong ◽  
Tao Li ◽  
Yuanmei Wang ◽  
Xinming Cheng ◽  
He Wang ◽  
...  
Keyword(s):  
Network Topology ◽  
Negative Impact ◽  
Online Gambling ◽  
Basic Reproductive Number ◽  
Reproductive Number ◽  
Scale Free ◽  
Spreading Model ◽  
Spreading Dynamics ◽  
Scale Free Networks ◽  
Gambling Policy

AbstractNowadays, online gambling has a great negative impact on the society. In order to study the effect of people’s psychological factors, anti-gambling policy, and social network topology on online gambling dynamics, a new SHGD (susceptible–hesitator–gambler–disclaimer) online gambling spreading model is proposed on scale-free networks. The spreading dynamics of online gambling is studied. The basic reproductive number $R_{0}$ R 0 is got and analyzed. The basic reproductive number $R_{0}$ R 0 is related to anti-gambling policy and the network topology. Then, gambling-free equilibrium $E_{0}$ E 0 and gambling-prevailing equilibrium $E_{ +} $ E + are obtained. The global stability of $E_{0}$ E 0 is analyzed. The global attractivity of $E_{ +} $ E + and the persistence of online gambling phenomenon are studied. Finally, the theoretical results are verified by some simulations.

Toward Online Control of Local Bifurcation in Power Systems via Network Topology Optimization

2015 ◽  
Vol 25 (12) ◽  
pp. 1550167
Author(s):  
Lei Wang ◽  
Hsiao-Dong Chiang
Keyword(s):  
Topology Optimization ◽  
Power Systems ◽  
Transmission Line ◽  
Network Topology ◽  
Online Control ◽  
Power Grids ◽  
Local Bifurcations ◽  
Network Topology Optimization ◽  
Online Methods ◽  
The Impact

This paper presents online methods for controlling local bifurcations of power grids with the goal of increasing bifurcation values (i.e. increasing load margins) via network topology optimization, a low-cost control. In other words, this paper presents online methods for increasing power transfer capability subject to static stability limit via switching transmission line out/in (i.e. disconnecting a transmission line or connecting a transmission line). To illustrate the impact of network topology on local bifurcations, two common local bifurcations, i.e. saddle-node bifurcation and structure-induced bifurcation on small power grids with different network topologies are shown. A three-stage online control methodology of local bifurcations via network topology optimization is presented to delay local bifurcations of power grids. Online methods must meet the challenging requirements of online applications such as the speed requirement (in the order of minutes), accuracy requirement and robustness requirement. The effectiveness of the three-stage methodology for online applications is demonstrated on the IEEE 118-bus and a 1648-bus practical power systems.

scholarly journals Fast Nondominated Sorting Genetic Algorithm II with Lévy Distribution for Network Topology Optimization

2020 ◽  
Vol 2020 ◽  
pp. 1-12 ◽  
Author(s):  
Maoqing Zhang ◽  
Lei Wang ◽  
Zhihua Cui ◽  
Jiangshan Liu ◽  
Dong Du ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Topology Optimization ◽  
Network Topology ◽  
Optimization Problems ◽  
Selection Strategy ◽  
Nsga Ii ◽  
Comparison Results ◽  
Practical Engineering ◽  
Network Topology Optimization ◽  
Nondominated Sorting

Fast nondominated sorting genetic algorithm II (NSGA-II) is a classical method for multiobjective optimization problems and has exhibited outstanding performance in many practical engineering problems. However, the tournament selection strategy used for the reproduction in NSGA-II may generate a large amount of repetitive individuals, resulting in the decrease of population diversity. To alleviate this issue, Lévy distribution, which is famous for excellent search ability in the cuckoo search algorithm, is incorporated into NSGA-II. To verify the proposed algorithm, this paper employs three different test sets, including ZDT, DTLZ, and MaF test suits. Experimental results demonstrate that the proposed algorithm is more promising compared with the state-of-the-art algorithms. Parameter sensitivity analysis further confirms the robustness of the proposed algorithm. In addition, a two-objective network topology optimization model is then used to further verify the proposed algorithm. The practical comparison results demonstrate that the proposed algorithm is more effective in dealing with practical engineering optimization problems.

scholarly journals EPIDEMIC DYNAMICS ON RANDOM AND SCALE-FREE NETWORKS

2012 ◽  
Vol 54 (1-2) ◽  
pp. 3-22 ◽  
Author(s):  
J. BARTLETT ◽  
M. J. PLANK
Keyword(s):  
Random Network ◽  
Infectious Agent ◽  
Mixed Population ◽  
Random Networks ◽  
Scale Free Network ◽  
Final Size ◽  
Scale Free ◽  
Epidemic Dynamics ◽  
Scale Free Networks ◽  
Free Network

AbstractRandom networks were first used to model epidemic dynamics in the 1950s, but in the last decade it has been realized that scale-free networks more accurately represent the network structure of many real-world situations. Here we give an analytical and a Monte Carlo method for approximating the basic reproduction number ${R}_{0} $ of an infectious agent on a network. We investigate how final epidemic size depends on ${R}_{0} $ and on network density in random networks and in scale-free networks with a Pareto exponent of 3. Our results show that: (i) an epidemic on a random network has the same average final size as an epidemic in a well-mixed population with the same value of ${R}_{0} $; (ii) an epidemic on a scale-free network has a larger average final size than in an equivalent well-mixed population if ${R}_{0} \lt 1$, and a smaller average final size than in a well-mixed population if ${R}_{0} \gt 1$; (iii) an epidemic on a scale-free network spreads more rapidly than an epidemic on a random network or in a well-mixed population.

scholarly journals The use of the power law for designing wireless networks

2018 ◽  
Vol 21 ◽  
pp. 00012
Author(s):  
Andrzej Paszkiewicz
Keyword(s):  
Wireless Networks ◽  
Power Law ◽  
Degree Distribution ◽  
Limited Resources ◽  
Random Networks ◽  
New Approach ◽  
Available Bandwidth ◽  
Scale Free ◽  
Scale Free Networks ◽  
Node Removal

The paper concerns the use of the scale-free networks theory and the power law in designing wireless networks. An approach based on generating random networks as well as on the classic Barabási-Albert algorithm were presented. The paper presents a new approach taking the limited resources for wireless networks into account, such as available bandwidth. In addition, thanks to the introduction of opportunities for dynamic node removal it was possible to realign processes occurring in wireless networks. After introduction of these modifications, the obtained results were analyzed in terms of a power law and the degree distribution of each node.

Sign in / Sign up

Export Citation Format

Share Document