Mixing navigation on networks
| dc.creator | Zhou, Tao | |
| dc.date | 2007-05-03 | |
| dc.date | 2007-05-26 | |
| dc.date.accessioned | 2026-07-07T09:29:46Z | |
| dc.date.available | 2026-07-07T09:29:46Z | |
| dc.description | 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. | |
| dc.description | 4 pages, and 7 figures | |
| dc.identifier | https://arxiv.org/abs/0705.0436 | |
| dc.identifier | http://arxiv.org/abs/0705.0436 | |
| dc.identifier | Physica A 387 (2008) 3025-3032 | |
| dc.identifier | doi:10.1016/j.physa.2008.01.056 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/157905 | |
| dc.subject | Physics and Society | |
| dc.subject | Data Analysis, Statistics and Probability | |
| dc.title | Mixing navigation on networks | |
| dc.type | text |