Adaptive routing strategy on networks of mobile nodes

HX Yang, M Tang - Physica A: Statistical Mechanics and its Applications, 2014 - Elsevier
The design of routing strategies for networks of mobile nodes has received increasing
attention in recent years. In this paper, we propose an adaptive routing strategy that …

Optimal routing strategy based on the minimum information path

K Wang, Y Zhang, S Zhou, W Pei, S Wang… - Physica A: Statistical …, 2011 - Elsevier
In this paper, we propose a new routing strategy based on the minimum information path,
named the optimal routing (OR) strategy, to improve the transportation capacity of scale-free …

Hybrid routing on scale-free networks

F Tan, Y Xia - Physica A: Statistical Mechanics and its Applications, 2013 - Elsevier
We propose a novel routing algorithm to optimize traffic performance on complex networks. It
combines static structural properties and dynamic traffic conditions together and therefore …

Efficient routing strategy with memory information for complex networks

T Kimura, T Ikeguchi, KT Chi - American Journal of Operations …, 2012 - scholars.cityu.edu.hk
In this paper, we propose a new packet routing strategy that incorporates memory
information for reducing congestion in communication networks. First, we study the …

Enhancing traffic capacity of scale-free networks by employing hybrid routing strategy

ZY Jiang, JF Ma, X Jing - Physica A: Statistical Mechanics and its …, 2015 - Elsevier
Based on the consideration of easy implementation of new routing strategies on many real
complex networks such as the Internet, we propose a hybrid routing mechanism composed …

[PDF][PDF] Routing in a highly dynamic topology.

Y Ganjali, N McKeown - SECON, 2005 - Citeseer
Routing in mobile ad-hoc networks is hard because the topology can change very rapidly.
By the time new paths are discovered, the network can change again–and in extreme cases …

Optimal forwarding ratio on dynamical networks with heterogeneous mobility

Y Gan, M Tang, H Yang - The European Physical Journal B, 2013 - Springer
Since the discovery of non-Poisson statistics of human mobility trajectories, more attention
has been paid to understand the role of these patterns in different dynamics. In this study, we …

Mixing navigation on networks

T Zhou - Physica A: Statistical Mechanics and its Applications, 2008 - Elsevier
In this article, we propose a mixing navigation mechanism, which interpolates between
random-walk and shortest-path protocol. The navigation efficiency can be remarkably …

Incremental routing strategy on scale-free networks

ZY Jiang, MG Liang - Physica A: Statistical Mechanics and its Applications, 2013 - Elsevier
The most important function of a network is for transporting traffic. Due to the low traffic
capacity of network systems under the global shortest path routing, plenty of heuristic routing …

Efficient routing on complex networks

G Yan, T Zhou, B Hu, ZQ Fu, BH Wang - Physical Review E, 2006 - APS
We propose a routing strategy to improve the transportation efficiency on complex networks.
Instead of using the routing strategy for shortest path, we give a generalized routing …