Social Cognitive Heuristics for adaptive data dissemination in Opportunistic Networks

M. Mordacchini, A. Passarella, M. Conti
{"title":"Social Cognitive Heuristics for adaptive data dissemination in Opportunistic Networks","authors":"M. Mordacchini, A. Passarella, M. Conti","doi":"10.1109/WoWMoM.2015.7158159","DOIUrl":null,"url":null,"abstract":"In typical Opportunistic Networking (OppNets) scenarios, mobile devices collaborate to cooperatively disseminate data toward interested nodes. However, the limited resources and knowledge available at each node, compared to possibly vast amounts of data to be delivered, makes it difficult to devise efficient dissemination schemes. Recent solutions propose to use data dissemination algorithms built on human information processing schemes, modelled in cognitive sciences as Cognitive Heuristics. In general, they are methods used by the human brain to quickly assess relevance of information so to drop what is irrelevant. Recent solutions for data dissemination in OppNets based on these heuristics proved to be effective and efficient in terms of network overhead. However, to the best of our knowledge, none takes into consideration the structure of users' social relationships, which is known to determine movement patterns and thus contact opportunities between nodes. In this paper we propose a social-based data dissemination scheme, built on the Social Circle Heuristic (SCH). SCH exploits the structure of the social environment of users to infer the relevance of discovered information for the individual and their social communities. We compare the proposed scheme against state-of-the-art solutions based on non-social cognitive heuristics, both in terms of effectiveness (i.e., bringing messages to users that request it) and efficiency (i.e., doing so minimising the network traffic). We show that the scheme based on SCH significantly outperforms non-social cognitive schemes along both dimensions. In particular, the difference becomes more and more evident as scenarios becomes more and more dynamic. We finally show that in scenarios where new content is generated over time, the scheme based on SCH is the only one able to bring content to the interested users, while non-social schemes fail to do so while at the same time generating significant higher network traffic.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WoWMoM.2015.7158159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In typical Opportunistic Networking (OppNets) scenarios, mobile devices collaborate to cooperatively disseminate data toward interested nodes. However, the limited resources and knowledge available at each node, compared to possibly vast amounts of data to be delivered, makes it difficult to devise efficient dissemination schemes. Recent solutions propose to use data dissemination algorithms built on human information processing schemes, modelled in cognitive sciences as Cognitive Heuristics. In general, they are methods used by the human brain to quickly assess relevance of information so to drop what is irrelevant. Recent solutions for data dissemination in OppNets based on these heuristics proved to be effective and efficient in terms of network overhead. However, to the best of our knowledge, none takes into consideration the structure of users' social relationships, which is known to determine movement patterns and thus contact opportunities between nodes. In this paper we propose a social-based data dissemination scheme, built on the Social Circle Heuristic (SCH). SCH exploits the structure of the social environment of users to infer the relevance of discovered information for the individual and their social communities. We compare the proposed scheme against state-of-the-art solutions based on non-social cognitive heuristics, both in terms of effectiveness (i.e., bringing messages to users that request it) and efficiency (i.e., doing so minimising the network traffic). We show that the scheme based on SCH significantly outperforms non-social cognitive schemes along both dimensions. In particular, the difference becomes more and more evident as scenarios becomes more and more dynamic. We finally show that in scenarios where new content is generated over time, the scheme based on SCH is the only one able to bring content to the interested users, while non-social schemes fail to do so while at the same time generating significant higher network traffic.
机会主义网络中自适应数据传播的社会认知启发式
在典型的OppNets (Opportunistic Networking)场景中,移动设备相互协作,共同向感兴趣的节点传播数据。然而,与可能交付的大量数据相比,每个节点可用的资源和知识有限,因此很难制定有效的传播方案。最近的解决方案建议使用基于人类信息处理方案的数据传播算法,在认知科学中建模为认知启发式。一般来说,它们是人类大脑用来快速评估信息相关性的方法,从而忽略不相关的信息。基于这些启发式算法的OppNets数据分发解决方案在网络开销方面被证明是有效和高效的。然而,据我们所知,没有一个考虑到用户的社会关系结构,这是已知的决定移动模式,从而节点之间的接触机会。本文提出了一种基于社交圈启发式(Social Circle Heuristic, SCH)的基于社交的数据传播方案。SCH利用用户的社会环境结构来推断发现的信息与个人及其社会群体的相关性。我们将所提出的方案与基于非社会认知启发式的最先进解决方案进行比较,无论是在有效性(即向请求它的用户提供消息)还是效率(即这样做可以最大限度地减少网络流量)方面。我们表明,基于SCH的方案在两个维度上都显著优于非社会认知方案。特别是,随着场景变得越来越动态,这种差异变得越来越明显。我们最后表明,在随着时间的推移产生新内容的情况下,基于SCH的方案是唯一能够将内容带给感兴趣的用户的方案,而非社交方案在产生显著更高的网络流量的同时却无法做到这一点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信