Greedy routing on networks of mobile agents

Details Greedy routing on networks of mobile agents Greedy routing on networks of mobile agents

2011-12-20

arxiv.org/abs/1112.4773v1

Computer Science

Networking and Internet Architecture

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Greedy routing on networks of mobile agents does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Greedy routing on networks of mobile agents, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedy routing on networks of mobile agents will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-58718