Abstract
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.
Similar content being viewed by others
References
Antunez-Veas A, Navarro-Arribas G (2016) Onion routing in deterministic delay tolerant networks. In: Foundations and practice of security. Springer, Berlin, pp 303–310 (no. 9482 in Lecture Notes in Computer Science)
Borah SJ, Dhurandher SK, Woungang I, Kumar V, Barolli L (2018) A multi-objectives based technique for optimized routing in opportunistic networks. J Ambient Intell Hum Comput 9(3):655–666
Borrego C, Borrell J, Robles S (2019) Efficient broadcast in opportunistic networks using optimal stopping theory. Ad Hoc Networks 88:5–17. https://doi.org/10.1016/j.adhoc.2019.01.001
Casteigts A, Flocchini P, Quattrociocchi W, Santoro N (2012) Time-varying graphs and dynamic networks. Int J Parallel Emerg Distrib Syst 27(5):387–408
Castillo-Perez S, Garcia-Alfaro J (2013) Onion routing circuit construction via latency graphs. Comput Secur 37:197–214. https://doi.org/10.1016/j.cose.2013.03.003
Chen D, Navarro-Arribas G, Borrell J (2017) On the applicability of onion routing on predictable delay-tolerant networks. In: 2017 IEEE 42nd conference on local computer networks (LCN), pp 575–578. https://doi.org/10.1109/LCN.2017.17
Diaz C, Seys S, Claessens J, Preneel B (2002) Towards measuring anonymity. Privacy enhancing technologies. Springer, Berlin, Heidelberg, pp 54–68 (Lecture Notes in Computer Science)
Fan L, Minsu H, Zhiyuan Y, Chao Z, Wang Y (2015) Reliable topology design in time-evolving delay-tolerant networks with unreliable links. IEEE Trans Mob Comput 14(6):1301–1314
Fraire J, Finochietto JM (2015) Routing-aware fair contact plan design for predictable delay tolerant networks. Ad Hoc Netw 25:303–313
Goldschlag DM, Reed MG, Syverson PF (1996) Hiding routing information. In: Anderson R (eds) Information hiding. IH 1996. Lecture notes in computer science, vol 1174. Springer, Berlin, pp 137–150
Holme P, Saramäki J (2012) Temporal networks. Phys Rep 519(3):97–125
Huang M, Chen S, Fan L, Yu W (2015) Topology design in time-evolving delay-tolerant networks with unreliable links. In: 2012 IEEE global communications conference (GLOBECOM), Anaheim, CA, 2012, pp 5296–5301. https://doi.org/10.1109/GLOCOM.2012.6503962
Jain S, Fall K, Patra R (2004) Routing in a delay tolerant network. In: Proceedings of the 2004 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM '04). ACM, New York, NY, USA, pp 145–158. https://doi.org/10.1145/1015467.1015484
Jetcheva JG, Hu YC, PalChaudhuri S, Saha AK, Johnson DB (2003) CRAWDAD dataset rice/ad\_hoc\_city (v. 2003-09-11). https://crawdad.org/rice/ad_hoc_city/20030911. 10.15783/C73K5B
Kate A, Zaverucha GM, Hengartner U (2007) Anonymity and security in delay tolerant networks. In: Third international conference on security and privacy in communications networks and the workshops, 2007. SecureComm 2007, IEEE, pp 504–513
Kostakos V (2009) Temporal graphs. Phys A Stat Mech Appl 388(6):1007–1023
Lu X, Hui P, Towsley D, Pu J, Xiong Z (2010) Anti-localization anonymous routing for delay tolerant network. Comput Netw 54(11):1099–1910
Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam M (2007) L-diversity: privacy beyond k-anonymity. ACM Trans Knowl Discov Data 1(1):3. https://doi.org/10.1145/1217299.1217302
Mota VF, Cunha FD, Macedo DF, Nogueira JM, Loureiro AA (2014) Protocols, mobility models and tools in opportunistic networks: a survey. Comput Commun 48:5–19. https://doi.org/10.1016/j.comcom.2014.03.019
Pan RK, Saramäki J (2011) Path lengths, correlations, and centrality in temporal networks. Phys Rev E 84(1):016105(10)
Rubin F (1978) Enumerating all simple paths in a graph. IEEE Trans Circ Syst 25(8):641–642. https://doi.org/10.1109/TCS.1978.1084515
Sakai K, Sun MT, Ku WS, Wu J, Alanazi FS (2016) An analysis of onion-based anonymous routing for delay tolerant networks. In: 2016 IEEE 36th international conference on distributed computing systems (ICDCS), IEEE, pp 609–618
Samarati P (2001) Protecting respondents identities in microdata release. IEEE Trans Knowl Data Eng 13(6):1010–1027. https://doi.org/10.1109/69.971193
Scott K, Burleigh S (2007) Bundle protocol specification. RFC 5050, Internet Request for Comments, RFC Editor, IETF. http://www.rfc-editor.org/rfc/rfc5050.txt
Serjantov A, Danezis G (2002) Towards an information theoretic metric for anonymity. Privacy enhancing technologies. Springer, Berlin, Heidelberg, pp 41–53 (Lecture Notes in Computer Science)
Sharma DK, Dhurandher SK, Agarwal D, Arora K (2019) krop: k-means clustering based routing protocol for opportunistic networks. J Ambient Intell Hum Comput 10(4):1289–1306
Shi C, Luo X, Traynor P, Ammar MH, Zegura EW (2012) Arden: anonymous networking in delay tolerant networks. Ad Hoc Netw 10(6):918–930
Song C, Qu Z, Blumm N (2010) Limits of predictability in human mobility. Science 327(5968):1018–1021
Torra V (2017) Data Privacy: foundations, new developments and the big data challenge. Studies in big data. Springer, Berlin
Vakde G, Bibikar R, Le Z, Wright M (2011) Enpassant: anonymous routing for disruption-tolerant networks with applications in assistive environments. Secur Commun Netw 4(11):1243–1256
van den Hooff J, Lazar D, Zaharia M, Zeldovich N (2015) Vuvuzela: scalable private messaging resistant to traffic analysis. In: Proceedings of the 25th symposium on operating systems principles. ACM, SOSP’15, pp 137–152
Xuan BB, Ferreira A, Jarry A (2003) Computing shortest, fastest, and foremost journeys in dynamic networks. Int J Found Comput Sci 14(02):267–285
Acknowledgements
This paper has been partially supported by Spanish Government under grants TIN2017-87211-R, RTI2018-095094-B-C22 “CONSENT”, and TIN2014-57364-C2-2-R “SMARTGLACIS”. Depeng Chen acknowledges the support from the China Scholarship Council, Grant No. 201606140138. C. Pérez-Solà was working at Universitat Rovira i Virgili when some of this work was done. Authors acknowledge Cristina Fernandez-Cordoba and Jordi Herrera-Joancomarti for insightful comments on some aspects related to the work described in this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Chen, D., Navarro-Arribas, G., Pérez-Solà, C. et al. Message anonymity on predictable opportunistic networks. J Ambient Intell Human Comput 14, 15059–15072 (2023). https://doi.org/10.1007/s12652-019-01393-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12652-019-01393-0