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 条
  • [1] [Anonymous], 2004, P 13 C USENIX SEC S, DOI [DOI 10.1186/1476-0711-3-21, DOI 10.5555/1251375.1251396]
  • [2] [Anonymous], 2000, HDB SYSTEMIC AUTOIMM
  • [3] Backes M., 2017, J PRIVACY CONFIDENTI, V7
  • [4] 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
  • [5] Basagni S., 2001, MOBIHOC 2001. Proceedings of the 2001 ACM International Symposium on Mobile Ad Hoc Networking and Computing, P156, DOI 10.1145/501416.501438
  • [6] Díaz C, 2003, LECT NOTES COMPUT SC, V2482, P54
  • [7] Gao W, 2014, IEEE INFOCOM SER, P2301, DOI 10.1109/INFOCOM.2014.6848174
  • [8] Supporting Cooperative Caching in Disruption Tolerant Networks
    Gao, Wei
    Cao, Guohong
    Iyengar, Arun
    Srivatsa, Mudhakar
    [J]. 31ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2011), 2011, : 151 - 161
  • [9] Onion Routing for anonymous and private Internet connections
    Goldschlag, D
    Reed, M
    Syverson, P
    [J]. COMMUNICATIONS OF THE ACM, 1999, 42 (02) : 39 - 41
  • [10] Goldstein DG, 1996, PROCEEDINGS OF THE EIGHTEENTH ANNUAL CONFERENCE OF THE COGNITIVE SCIENCE SOCIETY, P137