Greedy routing on networks of mobile agents
Networking and Internet Architecture
2011-12-21 v1 Data Analysis, Statistics and Probability
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 is delivered to the agent whose distance from the destination is shortest among searched neighbors of agent . 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.
Keywords
Cite
@article{arxiv.1112.4773,
title = {Greedy routing on networks of mobile agents},
author = {Han-Xin Yang and Wen-Xu Wang and Ying-Cheng Lai and Bing-Hong Wang},
journal= {arXiv preprint arXiv:1112.4773},
year = {2011}
}