Efficient routing for spatial networks

Abstract

In many complex networks, the main task is to transfer load from sources to destinations. Therefore, the network throughput is a very important indicator to measure the network performance. In order to improve the network throughput, researchers have proposed many effective routing strategies. Spatial networks, as a class of complex networks, exist widely in the real-world. However, the existing routing strategies in complex networks cannot achieve good results when applied in spatial networks. Therefore, in this paper, we propose a new degree-location ([Formula: see text]) routing strategy to improve the throughput of spatial networks. In this routing strategy, the load transmitted from sources to destinations will bypass the nodes with high degrees and the nodes located close to the center of region. Simulations on homogeneous and heterogeneous spatial networks show that the [Formula: see text] routing strategy proposed in this paper can effectively improve the throughput of the network. The result of this paper can help the routing design of spatial networks and may find applications in many real-world spatial networks to improve the transmission performance.

A routing strategy for spatial networks based on harmonic centrality

“…However, in the spatial network, this relationship is not that obvious. Lin et al [33] investigated the influence of network topology on load transmission. They found that the nodes with larger links and closer to the regional center usually process more loads.…”

“…For example, in the topological networks, the node degrees often exhibit an obvious power-law relationship with the loads when adopting the SP routing strategy. However, Lin et al [33] found that this power-law relationship is not obvious in spatial networks. Most of the existing routing strategies cannot achieve great results in spatial networks.…”