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

IF 1.5 0 ENGINEERING, MULTIDISCIPLINARY
M. Alrfaay, A. Ali, S. Chaoui, H. Lenando, S. Alanazi
{"title":"R-SOR: Ranked Social-based Routing Protocol in Opportunistic Mobile Social Networks","authors":"M. Alrfaay, A. Ali, S. Chaoui, H. Lenando, S. Alanazi","doi":"10.48084/etasr.4612","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":11826,"journal":{"name":"Engineering, Technology & Applied Science Research","volume":"37 1","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2022-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering, Technology & Applied Science Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48084/etasr.4612","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 2

Abstract

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.
R-SOR:机会移动社交网络中基于社交的排名路由协议
利用社交信息来提高路由性能是机会型移动社交网络(OMSNs)发展的趋势。根据用户的社会行为选择下一个消息的中继节点是实现高投递率的关键因素。因此,为了确定下一个中继的最有效选择,可以利用用户配置文件中日常社会活动与社会特征之间的相关性。在本文中,我们考虑了社交特征在一天中的特定时段对移动用户活动的影响,然后根据它们的相对重要性对这些特征进行排序,以便包含在路由协议中。这些过程巩固了所提出的基于排名社会路由(R-SOR)协议,为OMSN中的数据分发提供了一种有效的方式。我们使用真实数据集INFOCOM06对所提出的协议进行了评估。实验结果表明,该协议比基于洪水的协议(Epsoc和Epidemic)、基于预测的协议(PRoPHET)以及基于社交的协议(MSM和Bubble Rap)具有更高的路由效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Engineering, Technology & Applied Science Research
Engineering, Technology & Applied Science Research ENGINEERING, MULTIDISCIPLINARY-
CiteScore
3.00
自引率
46.70%
发文量
222
审稿时长
11 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信