Effective Gravitation Path Routing Strategy on Scale-Free Networks
Open Access
- 5 July 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 96031-96038
Abstract
Information routing strategy is a hot issue in the study of complex network traffic dynamics. In this paper, we define a new gravitational centrality and introduce parameter α 1 to control the centrality of nodes. When α 1 is appropriate value, the gravitational centrality has the function of dividing the centrality of the same degree nodes. According to the gravitational centrality, we propose an effective gravitation path routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates gravitational centrality of nodes in paths. The purpose of this strategy is to improve network traffic capacity. The simulation results on the scale-free networks show that our routing strategy is more effective than the efficient routing strategy proposed by Yan et al. [Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top. 73, 046108 (2006)].Keywords
Funding Information
- Innovative Capability Improvement Program of Hebei Province (21557693D)
- 2020 Military-Civilian Integration Development Research Program of Hebei Province (HB20JMRH008)
This publication has 41 references indexed in Scilit:
- Effective strategy of adding nodes and links for maximizing the traffic capacity of scale-free networkChaos: An Interdisciplinary Journal of Nonlinear Science, 2010
- Enhancing traffic capacity for scale-free networks by the one-way linksJournal of Physics A: Mathematical and Theoretical, 2010
- Improved routing strategies for data traffic in scale-free networksJournal of Statistical Mechanics: Theory and Experiment, 2008
- Method to enhance traffic capacity for scale-free networksPhysical Review E, 2007
- Enhancing the transmission efficiency by edge deletion in scale-free networksPhysical Review E, 2007
- Optimal transport on complex networksPhysical Review E, 2006
- Complex networks: Structure and dynamicsPhysics Reports, 2006
- Onset of traffic congestion in complex networksPhysical Review E, 2005
- Attack vulnerability of complex networksPhysical Review E, 2002
- Communication in Networks with Hierarchical BranchingPhysical Review Letters, 2001