Message anonymity on predictable opportunistic networks

A Predictable Opportunistic Network (POppNet) is a network where end-to-end connectivity is not guaranteed, and node communication happens in an opportunistic manner, but the behavior of the network can be predicted in advance. The predictability of such networks can be exploited to simplify some mechanisms of more generic OppNets where there is no prior knowledge on the network behavior. In this paper, we propose some solutions to provide anonymity for messages on POppNets by using simple onion routing, and thus to increase the privacy of the nodes in communication.

[1]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[2]  Jari Saramäki,et al.  Path lengths, correlations, and centrality in temporal networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Minsu Huang,et al.  Topology design in time-evolving delay-tolerant networks with unreliable links , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[4]  Yih-Chun Hu,et al.  CRAWDAD dataset rice/ad_hoc_city (v.2003-09-11) , 2003 .

[5]  Albert-László Barabási,et al.  Limits of Predictability in Human Mobility , 2010, Science.

[6]  Siyuan Chen,et al.  Reliable Topology Design in Time-Evolving Delay-Tolerant Networks with Unreliable Links , 2015, IEEE Trans. Mob. Comput..

[7]  Pierangela Samarati,et al.  Protecting Respondents' Identities in Microdata Release , 2001, IEEE Trans. Knowl. Data Eng..

[8]  Guillermo Navarro-Arribas,et al.  Onion Routing in Deterministic Delay Tolerant Networks , 2015, FPS.

[9]  Paul F. Syverson,et al.  Hiding Routing Information , 1996, Information Hiding.

[10]  Leonard Barolli,et al.  A multi-objectives based technique for optimized routing in opportunistic networks , 2018, J. Ambient Intell. Humaniz. Comput..

[11]  Joaquín García,et al.  Onion routing circuit construction via latency graphs , 2013, Comput. Secur..

[12]  Scott C. Burleigh,et al.  Bundle Protocol Specification , 2007, RFC.

[13]  ASHWIN MACHANAVAJJHALA,et al.  L-diversity: privacy beyond k-anonymity , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[14]  Guillermo Navarro-Arribas,et al.  On the Applicability of Onion Routing on Predictable Delay-Tolerant Networks , 2017, 2017 IEEE 42nd Conference on Local Computer Networks (LCN).

[15]  Juan A. Fraire,et al.  Routing-aware fair contact plan design for predictable delay tolerant networks , 2015, Ad Hoc Networks.

[16]  Afonso Ferreira,et al.  Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..

[17]  Nickolai Zeldovich,et al.  Vuvuzela: scalable private messaging resistant to traffic analysis , 2015, SOSP.

[18]  Bart Preneel,et al.  Towards Measuring Anonymity , 2002, Privacy Enhancing Technologies.

[19]  Deepak Kumar Sharma,et al.  kROp: k-Means clustering based routing protocol for opportunistic networks , 2019, J. Ambient Intell. Humaniz. Comput..

[20]  Vassilis Kostakos.  Temporal Graphs , 2014, Encyclopedia of Social Network Analysis and Mining.

[21]  Donald F. Towsley,et al.  Anti-localization anonymous routing for Delay Tolerant Network , 2010, Comput. Networks.

[22]  Jie Wu,et al.  An Analysis of Onion-Based Anonymous Routing for Delay Tolerant Networks , 2016, 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS).

[23]  Zhengyi Le,et al.  EnPassant: anonymous routing for disruption-tolerant networks with applications in assistive environments , 2011, Secur. Commun. Networks.

[24]  Frank L. Rubin,et al.  Enumerating all simple paths in a graph , 1978 .

[25]  Aniket Kate,et al.  Anonymity and security in delay tolerant networks , 2007, 2007 Third International Conference on Security and Privacy in Communications Networks and the Workshops - SecureComm 2007.

[26]  Antonio Alfredo Ferreira Loureiro,et al.  Protocols, mobility models and tools in opportunistic networks: A survey , 2014, Comput. Commun..

[27]  Joan Borrell,et al.  Efficient broadcast in opportunistic networks using optimal stopping theory , 2019, Ad Hoc Networks.

[28]  George Danezis,et al.  Towards an Information Theoretic Metric for Anonymity , 2002, Privacy Enhancing Technologies.

[29]  Vicen Torra,et al.  Data Privacy: Foundations, New Developments and the Big Data Challenge , 2017 .

[30]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[31]  Ellen W. Zegura,et al.  ARDEN: Anonymous networking in delay tolerant networks , 2012, Ad Hoc Networks.