Greedy routing on networks of mobile agents


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… (More)


9 Figures and Tables

Slides referencing similar topics