NECESSARY BACKBONE OF SUPERHIGHWAYS FOR TRANSPORT ON GEOGRAPHICAL COMPLEX NETWORKS

Many real networks have a common topological structure called scale-free (SF) that follows a power law degree distribution, and are embedded on an almost planar space which is suitable for wireless communication. However, the geographical constraints on local cycles cause more vulnerable connectivity against node removals, whose tolerance is reduced from the theoretical prediction under the assumption of uncorrelated locally tree-like structure. We consider a realistic generation of geographical networks with the SF property, and show the significant improvement of the robustness by adding a small fraction of shortcuts between randomly chosen nodes. Moreover, we quantitatively investigate the contribution of shortcuts to transport many packets on the shortest path for the spatially different amount of communication requests. Such a shortcut strategy preserves topological properties and a backbone naturally emerges bridging isolated clusters.