Geographical networks stochastically constructed by a self-similar tiling according to population

Abstract

In real communication and transportation networks, the geographical positions of nodes are very important for the efficiency and the tolerance of connectivity. Considering spatially inhomogeneous positions of nodes according to a population, we introduce a multi-scale quartered (MSQ) network that is stochastically constructed by recursive subdivision of polygonal faces as a self-similar tiling. It has several advantages: the robustness of connectivity, the bounded short path lengths, and the shortest distance routing algorithm in a distributive manner. Furthermore, we show that the MSQ network is more efficient with shorter link lengths and more suitable with lower load for avoiding traffic congestion than other geographical networks which have various topologies ranging from river to scale-free networks. These results will be useful for providing an insight into the future design of ad hoc network infrastructures.

9 pages, 11 figures, 3 tables

References in corpus (27)

• Emergence of scaling in random networks
• Error and attack tolerance of complex networks
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• Modeling the Internet's Large-Scale Topology
• Optimal network topologies for local search with congestion
• Pseudofractal Scale-free Web
• Geographical dispersal of mobile communication networks
• Structural Properties of Planar Graphs of Urban Street Patterns
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Fractal and Transfractal Recursive Scale-Free Nets
• Random planar graphs and the London street network
• Optimal design of spatial distribution networks
• Self-similar disk packings as model spatial scale-free networks
• Communication Bottlenecks in Scale-Free Networks
• Modulated Scale-free Network in the Euclidean Space
• Evolving networks with disadvantaged long-range connections
• Optimal Traffic Networks
• High dimensional random Apollonian networks
• Random Sierpinski network with scale-free small-world and modular structure
• Search in Complex Networks : a New Method of Naming
• Geographical networks evolving with optimal policy
• Clustering properties of a generalised critical Euclidean network
• Evolutionary Construction of Geographical Networks with Nearly Optimal Robustness and Efficient Routing Properties
• An optimal network for passenger traffic
• A transition from river networks to scale-free networks

Cited by in corpus (8)

• Scale-free networks embedded in fractal space
• Spatially self-organized resilient networks by a distributed cooperative mechanism
• An approximative calculation of the fractal structure in self-similar tilings
• Impact of mobility structure on the optimization of small-world networks of mobile agents
• Combinatorial and approximative analyses in a spatially random division process
• Simple Derivation of the Lifetime and the Distribution of Faces for a Binary Subdivision Model
• Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network
• Adaptive Fractal-like Network Structure for Efficient Search of Inhomogeneously Distributed Targets at Unknown Positions