A survey on routing algorithms for opportunistic mobile social networks

Cai, Ying; Zhang, Haochen; Fan, Yanfang; Xia, Hongke

doi:10.23919/jcc.2021.02.007

Cited by 17 publications

(13 citation statements)

References 56 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, it is reasonable to state the impact of each battery range on the delivery probability of messages. These results also support the authors' findings in [14], which evaluated the impact of low cooperation on network performance.…”

Section: Anova-delivery Probability Of Messages-reality Scenariosupporting

confidence: 90%

“…Recently, Ying et al [14] researched opportunistic routing algorithms that use social features to stimulate the performance of message forwarding. The authors conducted comparative research on these algorithms, analyzing three social characteristics, namely centrality, similarity, and tie strength, in addition to simulation experiments, demonstrating the impact of these algorithms on the network.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An Energy-Saving Forwarding Mechanism Based on Clustering for Opportunistic Networks

Santos

Soares

Carvalho

et al. 2021

Sensors

View full text Add to dashboard Cite

In Opportunistic Networks (OppNets), mobility of and contact between nodes are explored to create communication opportunities and exchange messages and information. A basic premise for a better performance of these networks is a collaboration of the nodes during communication. However, due to energy restriction factors, nodes may eventually fail to collaborate with message exchanges. In this work, we propose a routing mechanism called eGPDMI to improve message probability of delivery while optimizing nodes’ energy consumption. Unlike other algorithms proposed in OppNets literature, eGPDMI groups nodes by energy level and nodes interests using clustering techniques. Our major assumption is that retaining messages in nodes with the highest energy levels can improve network performance, thus overcoming the problem of nodes’ disconnection due to unwillingness to cooperate due to low energy values. Through questionnaire application and factorial design experiments, we characterize the impacts of energy levels in OppNets. Further, we apply performance evaluation of the eGPDMI mechanism in terms of effectiveness using mobility from real-world scenarios. The results show that our mechanism effectively reduces the degradation of the probability of delivery when the minimum energy level used for nodes to cooperate with communication increases.

show abstract

Section: Anova-delivery Probability Of Messages-reality Scenariosupporting

confidence: 90%

Section: Related Workmentioning

confidence: 99%

An Energy-Saving Forwarding Mechanism Based on Clustering for Opportunistic Networks

Santos

Soares

Carvalho

et al. 2021

Sensors

View full text Add to dashboard Cite

show abstract

“…Finally, we discuss works related to improving urban mobility and networking design [31,33,42]. Concerning these efforts, our proposal can be seen as an initial attempt towards planning and designing applications inherent to effective routing in opportunistic networks, which offers a range of applications in smart cities such as dissemination/collection of information, location, vehicular communication, among others [8,25].…”

Section: Related Workmentioning

confidence: 99%

Understanding mobility in networks: A node embedding approach

Barros¹,

Ferreira²,

Santos³

et al. 2021

Preprint

View full text Add to dashboard Cite

Motivated by the growing number of mobile devices capable of connecting and exchanging messages, we propose a methodology aiming to model and analyze node mobility in networks. We note that many existing solutions in the literature rely on topological measurements calculated directly on the graph of node contacts, aiming to capture the notion of the node's importance in terms of connectivity and mobility patterns beneficial for prototyping, design, and deployment of mobile networks. However, each measure has its specificity and fails to generalize the node importance notions that ultimately change over time. Unlike previous approaches, our methodology is based on a node embedding method that models and unveils the nodes' importance in mobility and connectivity patterns while preserving their spatial and temporal characteristics. We focus on a case study based on a trace of group meetings. The results show that our methodology provides a rich representation for extracting different mobility and connectivity patterns, which can be helpful for various applications and services in mobile networks.

show abstract

“…Routing in mobile networks is a challenging issue [11], networks such as the Vehicular Ad-hoc Network (VANET) and the Wireless Sensor Network (WSN) require efficient routing protocols due to their dynamic topology [12,13]. Exploiting long-term social features in a disruptive and varied network environment for routing is a fruitful approach [14][15][16]. Several social aware routing protocols have been proposed [17][18][19].…”

Section: Introductionmentioning

confidence: 99%

R-SOR: Ranked Social-based Routing Protocol in Opportunistic Mobile Social Networks

Alrfaay

Ali

Chaoui

et al. 2022

Eng. Technol. Appl. Sci. Res.

View full text Add to dashboard Cite

Exploiting social information to improve routing performance is an increasing trend in Opportunistic Mobile Social Networks (OMSNs). Selecting the next message’s relay node based on the user’s social behavior is a critical factor in attaining a high delivery rate. So, to ascertain the most efficient selection of the next relay, the correlation between daily social activities and the social characteristics in the user profiles can be exploited. In this paper, we consider the impact of the social characteristics on mobile user activities during certain periods of the day and then rank these characteristics based on their relative importance in order to be included in the routing protocol. These processes consolidate the proposed Ranked Social-based Routing (R-SOR) protocol to provide an effective way for data dissemination in OMSN. We use the real data set INFOCOM06 to evaluate the proposed protocol. The experimental results show that the proposed protocol has higher routing efficiency than flooding-based protocols such as Epsoc and Epidemic, prediction-based protocols such as PRoPHET, and social-based protocols such as MSM and Bubble Rap.

show abstract

A survey on routing algorithms for opportunistic mobile social networks

Cited by 17 publications

References 56 publications

An Energy-Saving Forwarding Mechanism Based on Clustering for Opportunistic Networks

An Energy-Saving Forwarding Mechanism Based on Clustering for Opportunistic Networks

Understanding mobility in networks: A node embedding approach

R-SOR: Ranked Social-based Routing Protocol in Opportunistic Mobile Social Networks

Contact Info

Product

Resources

About