Mixing navigation on networks
- Zhou, Tao Department of Modern Physics, University of Science and Technology of China, Hefei Anhui, China - Department of Physics, University of Fribourg, Switzerland
-
15.01.2008
Published in:
- Physica A: Statistical Mechanics and its Applications. - 2008, vol. 387, no. 12, p. 3025-3032
English
In this article, we propose 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 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.
- Faculty
- Faculté des sciences et de médecine
- Department
- Département de Physique
- Language
-
- English
- Classification
- Computer science
- License
- License undefined
- Identifiers
-
- RERO DOC 9353
- DOI 10.1016/j.physa.2008.01.056
- Persistent URL
- https://folia.unifr.ch/unifr/documents/300737
Statistics
Document views: 22
File downloads:
- zhou_mnn.pdf: 11