SMART: Utilizing Distributed Social Map for Lightweight Routing in Delay-Tolerant Networks

  title={SMART: Utilizing Distributed Social Map for Lightweight Routing in Delay-Tolerant Networks},
  author={Kang Chen and Haiying Shen},
  journal={IEEE/ACM Transactions on Networking},
Previous delay-tolerant network (DTN) routing algorithms exploit either past encounter records or social network properties to derive a node's probability of delivering packets to their destinations. However, they only have a local view of the network, which limits the routing efficiency. Also, when two nodes meet, they have to exchange the delivery abilities to the destinations of all packets in the two nodes, which incurs high resource consumption. In this paper, we propose SMART, which… CONTINUE READING


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

Distributed anonymous computation of social distance

2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC) • 2016
View 1 Excerpt

Efficient File Search in Delay Tolerant Networks with Social Content and Contact Awareness

IEEE Transactions on Parallel and Distributed Systems • 2016
View 1 Excerpt


Publications referenced by this paper.
Showing 1-7 of 7 references

MOPS: Providing Content-Based Service in Disruption-Tolerant Networks

2009 29th IEEE International Conference on Distributed Computing Systems • 2009
View 6 Excerpts
Highly Influenced

A note on two problems in connexion with graphs

E. W. Dijkstra
Numer. Math., vol. 1, no. 1, pp. 269–271, 1959. • 1959
View 14 Excerpts
Highly Influenced

Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks

2010 Proceedings IEEE INFOCOM • 2010
View 5 Excerpts
Highly Influenced

Scheln, “Probabilistic routing in intermittently connected networks,”Mobile

A. Lindgren, A. Doria
Comput. Commun, Rev., • 2003
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…