Mixing navigation on networks
arXiv:0705.0436 · doi:10.1016/j.physa.2008.01.056
Abstract
In this Letter, we proposed a mixing navigation mechanism, which interpolates between random-walk and shortest-path protocol. The navigation efficiency can be remarkably enhanced via a few routers. Some advanced strategies are also designed: For non-geographical scale-free networks, the targeted strategy with a tiny fraction of routers can guarantee an efficient navigation with low and stable delivery time almost independent of network size. For geographical localized networks, the clustering strategy can simultaneously increase the efficiency and reduce the communication cost. The present mixing navigation mechanism is of significance especially for information organization of wireless sensor networks and distributed autonomous robotic systems.
4 pages, and 7 figures
References in corpus (15)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Novel type of phase transition in a system of self-driven particles
- Error and attack tolerance of complex networks
- Random graphs with arbitrary degree distributions and their applications
- Network robustness and fragility: Percolation on random graphs
- Breakdown of the Internet under intentional attack
- Immunization of complex networks
- Search in Power-Law Networks
- Efficient routing on complex networks
- Path finding strategies in scale-free networks
- Transport on Complex Networks: Flow, Jamming and Optimization
- Information Horizons in Networks
- Search in weighted complex networks
- Modeling Dynamics of Information Networks