On Anonymous Routing in Delay Tolerant Networks

被引:12
作者
Sakai, Kazuya [1 ]
Sun, Min-Te [2 ]
Ku, Wei-Shinn [3 ]
Wu, Jie [4 ]
机构
[1] Tokyo Metropolitan Univ, Dept Elect Engn & Comp Sci, 6-6 Asahigaoka, Hino, Tokyo 1910065, Japan
[2] Natl Cent Univ, Dept Comp Sci & Informat Engn, Taoyuan 320, Taiwan
[3] Auburn Univ, Dept Comp Sci & Software Engn, Auburn, AL 36849 USA
[4] Temple Univ, Dept Comp & Informat Sci, 1925 N 12th St, Philadelphia, PA 19122 USA
基金
美国国家科学基金会;
关键词
Routing; Routing protocols; Privacy; Ad hoc networks; Security; Monitoring; Delay tolerant networks; DTNs; anonymous routing;
D O I
10.1109/TMC.2018.2886349
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Due to instability of links in the network, the model of delay tolerant networks (DTNs) is often adopted in many emerging mobile applications. To organizations and individuals using these mobile applications, security and privacy are considered to be two of the most significant concerns. This research seeks to address anonymous communications in DTNs. While many different anonymous routing protocols have been proposed for ad hoc networks, to the best of our knowledge, only variants of onion-based routing have been tailored for DTNs. Since each type of anonymous routing protocol has its pros and cons, there is no single anonymous routing protocol for DTNs that can adapt to the different levels of security requirements. In this paper, we first design a set of anonymous routing protocols for DTNs, called anonymous Epidemic and zone-based anonymous routing, based on the original anonymous routing protocols for ad hoc networks. Then, we propose a framework of anonymous routing (FAR) for DTNs, which subsumes all the aforementioned protocols. By tuning its parameters, the proposed FAR is able to outperform onion-based, anonymous Epidemic, and zone-based routing. In addition, numerical analyses for the traceable rate, node anonymity, and path anonymity models are built. Extensive simulations using randomly generated graphs as well as real traces demonstrate that the proposed framework for DTNs successfully achieves its design goals.
引用
收藏
页码:2926 / 2940
页数:15
相关论文
共 24 条
  • [11] Routing in a delay tolerant network
    Jain, S
    Fall, K
    Patra, R
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (04) : 145 - 157
  • [12] Toward Anonymity in Delay Tolerant Networks: Threshold Pivot Scheme
    Jansen, Rob
    Beverly, Robert
    [J]. MILITARY COMMUNICATIONS CONFERENCE, 2010 (MILCOM 2010), 2010, : 587 - 592
  • [13] Kong Jiejun., 2003, P ACM MOBIHOC, P291
  • [14] Liu C, 2009, MOBIHOC'09 PROCEEDINGS OF THE TENTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P105
  • [15] Anti-localization anonymous routing for Delay Tolerant Network
    Lu, Xiaofeng
    Hui, Pan
    Towsley, Don
    Pu, Juahua
    Xiong, Zhang
    [J]. COMPUTER NETWORKS, 2010, 54 (11) : 1899 - 1910
  • [16] Back to the Drawing Board: Revisiting the Design of Optimal Location Privacy-preserving Mechanisms
    Oya, Simon
    Troncoso, Carmela
    Perez-Gonzalez, Fernando
    [J]. CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, : 1959 - 1972
  • [17] An Analysis of Onion-Based Anonymous Routing for Delay Tolerant Networks
    Sakai, Kazuya
    Sun, Min-Te
    Ku, Wei-Shinn
    Wu, Jie
    Alanazi, Faisal S.
    [J]. PROCEEDINGS 2016 IEEE 36TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS ICDCS 2016, 2016, : 609 - 618
  • [18] HOW TO SHARE A SECRET
    SHAMIR, A
    [J]. COMMUNICATIONS OF THE ACM, 1979, 22 (11) : 612 - 613
  • [19] ARDEN: Anonymous networking in delay tolerant networks
    Shi, Cong
    Luo, Xiapu
    Traynor, Patrick
    Ammar, Mostafa H.
    Zegura, Ellen W.
    [J]. AD HOC NETWORKS, 2012, 10 (06) : 918 - 930
  • [20] Spyropoulos T., 2005, P 2005 ACM SIGCOMM W, P252