Fair Routing in Delay Tolerant Networks

  title={Fair Routing in Delay Tolerant Networks},
  author={Josep M. Pujol and Alberto L{\'o}pez Toledo and Pablo Rodriguez},
  journal={IEEE INFOCOM 2009},
The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. The combination of these heuristics and the social network structure leads the routing to direct most of the traffic through a small subset of good users. For instance, in the SimBet algorithm, the top 10% of users carry out 54% of all the forwards and 85% of all the handovers. This unfair load distribution is not… CONTINUE READING
Highly Cited
This paper has 108 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 70 extracted citations

108 Citations

Citations per Year
Semantic Scholar estimates that this publication has 108 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 52 references

Barabási . Statistical mechanics of c mplex networks

  • A.-L.
  • Review of Modern Physics
  • 2008

Barabási . Statistical mechanics of complex networks

  • A.-L.
  • Review of Modern Physics
  • 2008

Delegation forwarding

  • Vijay Erramilli, Augustin Chaintreau, Mark Crovella, Christophe Diot
  • In Proceedings of the 9th ACM International…
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…