In this paper, we focus on the multi-copy routing in Vehicle Delay Tolerant Networks
(VDTNs). In current multi-copy routing, the different copies of each packet search the
destination node independently, which leads to a low utilization of copies since they may
search through the same path repeatedly without cooperation. To solve this problem, we
propose a fractal Social community based efficient multi-coPy routing in VDTNs, namely
SPread. First, we measure social network features in Vehicle NETworks (VNETs). Then, by …

In this paper, we focus on the multi-copy routing in Vehicle Delay Tolerant Networks
(VDTNs) consisted of taxis. Multi-copy routing can balance the network congestion caused
by broadcasting and the efficiency limitation in single-copy routing. However, current multi-
copy routing algorithms often let different copies of each packet search the destination node
independently, which leads to a low utilization of copies. To solve this problem, we propose
a fractal Social community based efficient multi-coPy routing algorithm in VDTNs, namely …