The Community for Technology Leaders
Green Image
Issue No. 01 - Jan. (2013 vol. 12)
ISSN: 1536-1233
pp: 151-165
Tom La Porta , The Pennsylvania State University, University Park
Guohong Cao , The Pennsylvania State University, University Park
Wei Gao , The Pennsylvania State University, University Park
Jiawei Han , University of Illinois at Urbana-Champaign, Urbana
ABSTRACT
Unpredictable node mobility, low node density, and lack of global information make it challenging to achieve effective data forwarding in Delay-Tolerant Networks (DTNs). Most of the current data forwarding schemes choose the nodes with the best cumulative capability of contacting others as relays to carry and forward data, but these nodes may not be the best relay choices within a short time period due to the heterogeneity of transient node contact characteristics. In this paper, we propose a novel approach to improve the performance of data forwarding with a short time constraint in DTNs by exploiting the transient social contact patterns. These patterns represent the transient characteristics of contact distribution, network connectivity and social community structure in DTNs, and we provide analytical formulations on these patterns based on experimental studies of realistic DTN traces. We then propose appropriate forwarding metrics based on these patterns to improve the effectiveness of data forwarding. When applied to various data forwarding strategies, our proposed forwarding metrics achieve much better performance compared to existing schemes with similar forwarding cost.
INDEX TERMS
Transient analysis, Measurement, Communities, Relays, Peer to peer computing, Mobile communication, Time factors, community, Forwarding, transient contact pattern, social network, delay-tolerant network, centrality
CITATION
Tom La Porta, Guohong Cao, Wei Gao, Jiawei Han, "On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks", IEEE Transactions on Mobile Computing, vol. 12, no. , pp. 151-165, Jan. 2013, doi:10.1109/TMC.2011.249
190 ms
(Ver 3.1 (10032016))