Greedy routing on networks of mobile agents

TL;DR

This paper introduces a greedy routing algorithm for mobile agent networks, analyzing how communication radius and agent speed affect traffic capacity and epidemic spread, providing insights for controlling congestion and epidemics.

Contribution

It presents a novel greedy routing method for mobile agents and studies its impact on traffic and epidemic dynamics, highlighting the effects of communication radius and agent speed.

Findings

Transportation capacity increases with communication radius.

Epidemic threshold rises as communication radius increases.

Optimal moving speed maximizes network capacity.

Abstract

In this paper, we design a greedy routing on networks of mobile agents. In the greedy routing algorithm, every time step a packet in agent $i$ is delivered to the agent $j$ whose distance from the destination is shortest among searched neighbors of agent $i$. Based on the greedy routing, we study the traffic dynamics and traffic-driven epidemic spreading on networks of mobile agents. We find that the transportation capacity of networks and the epidemic threshold increase as the communication radius increases. For moderate moving speed, the transportation capacity of networks is the highest and the epidemic threshold maintains a large value. These results can help controlling the traffic congestion and epidemic spreading on mobile networks.