Blossom: Cluster-Based Routing for Preserving Privacy in Opportunistic Networks
Open Access
- 16 November 2022
- journal article
- research article
- Published by MDPI AG in Journal of Sensor and Actuator Networks
- Vol. 11 (4), 75
- https://doi.org/10.3390/jsan11040075
Abstract
Opportunistic networks are an enabler technology for typologies without centralized infrastructure. Portable devices, such as wearable and embedded mobile systems, send relay messages to the communication range devices. One of the most critical challenges is to find the optimal route in these networks while at the same time preserving privacy for the participants of the network. Addressing this challenge, we presented a novel routing algorithm based on device clusters, reducing the overall message load and increasing network performance. At the same time, possibly identifying information of network nodes is eliminated by cloaking to meet privacy requirements. We evaluated our routing algorithm in terms of efficiency and privacy in opportunistic networks of traditional and structured cities, i.e., Venice and San Francisco by comparing our approach against the PRoPHET, First Contact, and Epidemic routing algorithms. In the San Francisco and Venice scenarios, Blossom improves messages delivery probability and outperforms PRoPHET, First Contact, and Epidemic by , , and and by , , and , respectively. In addition, the dropped messages probability in Blossom decreased compared to PRoPHET and Epidemic in San Francisco and compared to PRoPHET and Epidemic in Venice. Due to the small number of messages generated, the network overhead in this algorithm is close to zero. The network overhead can be significantly reduced by clustering while maintaining a reliable message delivery.
Keywords
Funding Information
- University of Muenster
This publication has 36 references indexed in Scilit:
- Neighbor Discovery for Opportunistic Networking in Internet of Things Scenarios: A SurveyIEEE Access, 2015
- A Comprehensive Survey of Clustering AlgorithmsAnnals of Data Science, 2015
- A privacy‐preserving distance‐based incentive scheme in opportunistic VANETsSecurity and Communication Networks, 2015
- PIDGINPublished by Association for Computing Machinery (ACM) ,2014
- Transmission of multimedia contents in opportunistic networks with social selfish nodesMultimedia Systems, 2013
- Opportunistic IoT: Exploring the harmonious interaction between human and the internet of thingsJournal of Network and Computer Applications, 2013
- The ONE simulator for DTN protocol evaluationPublished by European Alliance for Innovation n.o. ,2009
- Routing in a delay tolerant networkPublished by Association for Computing Machinery (ACM) ,2004
- Probabilistic Routing in Intermittently Connected NetworksLecture Notes in Computer Science, 2004
- Anonymous Usage of Location-Based Services Through Spatial and Temporal CloakingPublished by Association for Computing Machinery (ACM) ,2003