Social-Aware Multicast in Disruption-Tolerant Networks

被引:96
作者
Gao, Wei [1 ]
Li, Qinghua [1 ]
Zhao, Bo [1 ]
Cao, Guohong [1 ]
机构
[1] Penn State Univ, Dept Comp Sci & Engn, University Pk, PA 16802 USA
关键词
Centrality; community; disruption-tolerant network (DTN); multicast; social network; DATA DISSEMINATION;
D O I
10.1109/TNET.2012.2183643
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Node mobility and end-to-end disconnections in disruption-tolerant networks (DTNs) greatly impair the effectiveness of data forwarding. Although social-based approaches can address the problem, most existing solutions only focus on forwarding data to a single destination. In this paper, we study multicast with single and multiple data items in DTNs from a social network perspective, develop analytical models for multicast relay selection, and furthermore investigate the essential difference between multicast and unicast in DTNs. The proposed approach selects relays according to their capabilities, measured by social-based metrics, for forwarding data to the destinations. The design of social-based metrics exploits social network concepts such as node centrality and social community, and the selected relays ensure achieving the required data delivery ratio within the given time constraint. Extensive trace-driven simulations show that the proposed approach has similar data delivery ratio and delay to that of Epidemic routing, but significantly reduces data forwarding cost, measured by the number of relays used.
引用
收藏
页码:1553 / 1566
页数:14
相关论文
共 44 条
  • [1] [Anonymous], P 1 SIMPL
  • [2] [Anonymous], 2007, P 1 INT ICST C AUT C, DOI DOI 10.4108/ICST.AUTONOMICS2007.2131
  • [3] [Anonymous], 2010, P 11 ACM INT S MOB A
  • [4] [Anonymous], 2000, HDB SYSTEMIC AUTOIMM
  • [5] [Anonymous], MOBICOM 2006
  • [6] DTN routing as a resource allocation problem
    Balasubramanian, Aruna
    Levine, Brian Neil
    Venkataramani, Arun
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (04) : 373 - 384
  • [7] BOLDRINI C., 2008, Proceedings of ACM Workshop on Challenged Networks (CHANTS), P89, DOI [DOI 10.1145/1409985.1410002, 10. 1145/1409985.1410002.]
  • [8] Boldrini C, 2008, ACM S MODEL ANAL SIM, P203
  • [9] Burgess J., 2006, INFOCOM, V6, P1
  • [10] Cai H, 2007, MOBICOM'07: PROCEEDINGS OF THE THIRTEENTH ACM INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, P159