Securing and Facilitating Communication Within Opportunistic Networks: A Holistic Survey

Avoussoukpo, Cossi Blaise; Ogunseyi, Taiwo Blessing; Tchenagnon, Marius

doi:10.1109/access.2021.3071309

Cited by 16 publications

(6 citation statements)

References 119 publications

(119 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Privacy in opportunistic networks can be broadly classified into the following four categories [15,16]: ID privacy [11,12], location privacy [17][18][19], message content privacy [20][21][22], and relationships privacy [23][24][25].…”

Section: Related Workmentioning

confidence: 99%

A Privacy-Preserving Exchange-Based Routing Protocol for Opportunistic Networks

Jiang

2022

Security and Communication Networks

View full text Add to dashboard Cite

In opportunistic networks, nodes forward messages according to routing utility deduced from encounter information. When nodes simply communicate with real IDs, private information such as encounter time and location will be leaked. The private information can be preserved by anonymizing node real IDs, but ID anonymity will also prevent nodes from collecting real ID-based encounter information to compute routing utility. To address this problem, a privacy-preserving exchange-based routing protocol (PPERP) for opportunistic networks is proposed in this paper. In PPERP, nodes are classified into delivery nodes and nondelivery nodes. Two encountering nondelivery nodes exchange approximately equivalent anonymous encounter records. Then, when the exchanged encounter records are sent to a delivery node, it will compute the routing utilities to nondelivery nodes without knowing their real IDs. In PPERP, a node can directly compute its routing utility without relying on any trusted third party, so PPERP is suitable for opportunistic networks in which nodes usually are sparsely distributed and encounter opportunistically. Bilinear mapping technique is adopted to ensure the confidentiality, integrity, and nonrepudiation of encounter records. The security analysis and performance evaluation show that the proposed protocol is secure, efficient, and practical.

show abstract

Section: Related Workmentioning

confidence: 99%

A Privacy-Preserving Exchange-Based Routing Protocol for Opportunistic Networks

Jiang

2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…We assume that if χ i has fewer than two common members (OD < 2), or if the cluster head has fewer than five members (Mi < 5), the cluster head will increase its transmission range by the amount of ∆, where ∆ represents the minimum distance between a cluster head and its members. We expand the transmission range of the cluster head by integrating the value of ∆ until it fulfills one of the conditions specified in Equation (8). Put simply, if the cluster head fails to meet the specified constraints, it should augment its transmission range (β χ i ) by adding ∆ to it (β χ i = β χ i + ∆).…”

Section: Proposed Methodsmentioning

confidence: 99%

“…Opportunistic Networks (OppNets), a subset of DTNs, emphasize the sporadic nature of communication, where nodes exploit encounters with other nodes to exchange data. OppNet protocols commonly employ store-carry-forward techniques, where nodes store messages in their buffers and relay them to other nodes when suitable opportunities arise [8] (see Figure 1). However, the limitations of supporting TCP/IP routing protocols in DTNs due to frequent disconnections and network fragmentation pose significant challenges.…”

Section: Introductionmentioning

confidence: 99%

Optimizing Energy Efficiency in Opportunistic Networks: A Heuristic Approach to Adaptive Cluster-Based Routing Protocol

Sharifi Sani,

Iranmanesh,

Salarian

et al. 2024

Information

View full text Add to dashboard Cite

Opportunistic Networks (OppNets) are characterized by intermittently connected nodes with fluctuating performance. Their dynamic topology, caused by node movement, activation, and deactivation, often relies on controlled flooding for routing, leading to significant resource consumption and network congestion. To address this challenge, we propose the Adaptive Clustering-based Routing Protocol (ACRP). This ACRP protocol uses the common member-based adaptive dynamic clustering approach to produce optimal clusters, and the OppNet is converted into a TCP/IP network. This protocol adaptively creates dynamic clusters in order to facilitate the routing by converting the network from a disjointed to a connected network. This strategy creates a persistent connection between nodes, resulting in more effective routing and enhanced network performance. It should be noted that ACRP is scalable and applicable to a variety of applications and scenarios, including smart cities, disaster management, military networks, and distant places with inadequate infrastructure. Simulation findings demonstrate that the ACRP protocol outperforms alternative clustering approaches such as kRop, QoS-OLSR, LBC, and CBVRP. The analysis of the ACRP approach reveals that it can boost packet delivery by 28% and improve average end-to-end, throughput, hop count, and reachability metrics by 42%, 45%, 44%, and 80%, respectively.

show abstract

“…An opportunistic network [1,2] is a type of mobile self-organized network in which the source node is not directly connected to the target node, and the communication between the two nodes is realized by encounters through nodes' movement, and the data is transmitted by way of "store-carry-forward". Opportunistic networks have been used in many fields [3], such as socially oriented services, personal and environmental services, intelligent transportation systems, earthquake prediction [4], and so on. The goal of link prediction is to predict the future network topology based on historical information.…”

Section: Introductionmentioning

confidence: 99%

Spatial-Temporal Attention TCN-Based Link Prediction for Opportunistic Network

Shu,

Liao,

2024

Electronics

View full text Add to dashboard Cite

Link prediction for opportunistic networks faces the challenges of frequent changes in topology and complex and variable spatial-temporal information. Most existing studies focus on temporal or spatial features, ignoring ample potential information. In order to better capture the spatial-temporal correlations in the evolution of networks and explore their potential information, a link prediction method based on spatial-temporal attention and temporal convolution network (STA-TCN) is proposed. It slices opportunistic networks into discrete network snapshots. A state matrix based on topology information and attribute information is constructed to represent snapshots. Time convolutional networks and spatial-temporal attention mechanisms are employed to learn spatial-temporal information. Furthermore, to better improve link prediction performance, the proposed method converts the auto-correlation error into non-correlation error. On three real opportunistic network datasets, ITC, MIT, and Infocom06, experimental results demonstrate the superior predictive performance of the proposed method compared to baseline models, as shown by improved AUC and F1-score metrics.

show abstract

Securing and Facilitating Communication Within Opportunistic Networks: A Holistic Survey

Cited by 16 publications

References 119 publications

A Privacy-Preserving Exchange-Based Routing Protocol for Opportunistic Networks

A Privacy-Preserving Exchange-Based Routing Protocol for Opportunistic Networks

Optimizing Energy Efficiency in Opportunistic Networks: A Heuristic Approach to Adaptive Cluster-Based Routing Protocol

Spatial-Temporal Attention TCN-Based Link Prediction for Opportunistic Network

Contact Info

Product

Resources

About