On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks

被引:86
|
作者
Gao, Wei [1 ]
Cao, Guohong [2 ]
La Porta, Tom [2 ]
Han, Jiawei [3 ]
机构
[1] Univ Tennessee Knoxville, Dept Elect Engn & Comp Sci, Knoxville, TN 37919 USA
[2] Penn State Univ, Dept Comp Sci & Engn, University Pk, PA 16802 USA
[3] Univ Illinois, Dept Comp Sci, Siebel Ctr Comp Sci, Urbana, IL 61801 USA
关键词
Forwarding; transient contact pattern; social network; delay-tolerant network; centrality; community; COMMUNITY STRUCTURE;
D O I
10.1109/TMC.2011.249
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:151 / 165
页数:15
相关论文
共 50 条
  • [31] The Impact of Cooperative Nodes on the Performance of Vehicular Delay-Tolerant Networks
    João A. F. F. Dias
    Joel J. P. C. Rodrigues
    João N. G. Isento
    Jianwei Niu
    Mobile Networks and Applications, 2013, 18 : 867 - 878
  • [32] Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations
    Spyropoulos, Thrasyvoulos
    Turletti, Thierry
    Obraczka, Katia
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2009, 8 (08) : 1132 - 1147
  • [33] On Social Delay-Tolerant Networking: Aggregation, Tie Detection, and Routing
    Wei, Kaimin
    Zeng, Deze
    Guo, Song
    Xu, Ke
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (06) : 1563 - 1573
  • [34] REPSYS: A Robust and Distributed Reputation System for Delay-Tolerant Networks
    Magaia, Naercio
    Pereira, Paulo
    Correia, Miguel
    PROCEEDINGS OF THE 20TH ACM INTERNATIONAL CONFERENCE ON MODELLING, ANALYSIS AND SIMULATION OF WIRELESS AND MOBILE SYSTEMS (MSWIM'17), 2017, : 289 - 293
  • [35] Efficient Photo Crowdsourcing in Delay-tolerant Networks with Evolving POIs
    Datta, Shudip
    Madria, Sanjay
    2019 20TH INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT (MDM 2019), 2019, : 150 - 159
  • [36] Memory Forwarding Algorithm in Multiple Communities Delay Tolerant Networks
    Qingshan Wang
    Qi Wang
    Wireless Personal Communications, 2014, 74 : 703 - 715
  • [37] Memory Forwarding Algorithm in Multiple Communities Delay Tolerant Networks
    Wang, Qingshan
    Wang, Qi
    WIRELESS PERSONAL COMMUNICATIONS, 2014, 74 (02) : 703 - 715
  • [38] An Adaptive Threshold Method to Address Routing Issues in Delay-Tolerant Networks
    Ng, Nicole
    Chang, Hwa
    Zou, Zhongjian
    Tang, Sai
    2011 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), 2011, : 1122 - 1126
  • [39] Multidimensional Routing Protocol in Human-Associated Delay-Tolerant Networks
    Gao, Longxiang
    Li, Ming
    Bonti, Alessio
    Zhou, Wanlei
    Yu, Shui
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2013, 12 (11) : 2132 - 2144
  • [40] TemsRoute: A temporally and socially aware routing framework for delay-tolerant networks
    Zhang, Tianming
    Zhang, Renbo
    Yang, Zhengyi
    Chen, Lu
    Gao, Yunjun
    Yang, Xiaochun
    AD HOC NETWORKS, 2025, 169