Social-tie-based information dissemination in mobile opportunistic social networks

Yunsheng Wang, Jie Wu
{"title":"Social-tie-based information dissemination in mobile opportunistic social networks","authors":"Yunsheng Wang, Jie Wu","doi":"10.1109/WoWMoM.2013.6583411","DOIUrl":null,"url":null,"abstract":"A mobile opportunistic social network (MOSN) is a new type of delay tolerant network (DTN), in which the mobile users contact each other opportunistically. Information dissemination is a challenging problem in MOSNs, due to uncertainty and intermittent connectivity. In this paper, we propose a distributed social tie strength calculation mechanism to identify the relationship between each set of pairwise mobile nodes. Following arguments originally proposed by Mark Granovetter's seminal 1973 paper, The Strength of Weak Ties, the majority of the novel information dissemination is generated by weak ties. We first evaluate the strength of weak ties in MIT reality mining data. Then, a social-tie-based information dissemination protocol is presented, which is a token-based information dissemination scheme, including two phases: weak tie-driven forwarding and strong tie-driven forwarding. In the weak tie-driven forwarding phase, the susceptible nodes with more weak ties will receive more tokens for future forwarding. The number of forwarding tokens is related to the number of weak ties of two encountered nodes. After a while, the information will have been spread to multiple communities. Our scheme switches to a strong tie driven forwarding phase, in which the influential nodes are more important. The number of forwarding tokens is proportional to the number of strong ties of two encountered nodes. Extensive simulations are conducted in comparison to several approaches in real world mobile traces.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WoWMoM.2013.6583411","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

A mobile opportunistic social network (MOSN) is a new type of delay tolerant network (DTN), in which the mobile users contact each other opportunistically. Information dissemination is a challenging problem in MOSNs, due to uncertainty and intermittent connectivity. In this paper, we propose a distributed social tie strength calculation mechanism to identify the relationship between each set of pairwise mobile nodes. Following arguments originally proposed by Mark Granovetter's seminal 1973 paper, The Strength of Weak Ties, the majority of the novel information dissemination is generated by weak ties. We first evaluate the strength of weak ties in MIT reality mining data. Then, a social-tie-based information dissemination protocol is presented, which is a token-based information dissemination scheme, including two phases: weak tie-driven forwarding and strong tie-driven forwarding. In the weak tie-driven forwarding phase, the susceptible nodes with more weak ties will receive more tokens for future forwarding. The number of forwarding tokens is related to the number of weak ties of two encountered nodes. After a while, the information will have been spread to multiple communities. Our scheme switches to a strong tie driven forwarding phase, in which the influential nodes are more important. The number of forwarding tokens is proportional to the number of strong ties of two encountered nodes. Extensive simulations are conducted in comparison to several approaches in real world mobile traces.
基于社交关系的移动机会性社交网络信息传播
移动机会主义社交网络(MOSN)是一种新型的容忍延迟网络(DTN),在这种网络中,移动用户之间的联系是机会主义的。由于不确定性和间歇性连接,在mosn中信息传播是一个具有挑战性的问题。在本文中,我们提出了一种分布式社会联系强度计算机制来识别每组成对移动节点之间的关系。根据Mark Granovetter 1973年开创性论文《弱联系的强度》(The Strength of Weak Ties)最初提出的论点,大多数新信息传播是由弱联系产生的。我们首先评估MIT现实挖掘数据中弱联系的强度。然后,提出了一种基于社会联系的信息传播协议,即基于令牌的信息传播方案,包括弱联系驱动转发和强联系驱动转发两个阶段。在弱联系驱动的转发阶段,弱联系越多的敏感节点将获得更多的令牌用于未来的转发。转发令牌的数量与两个遇到的节点的弱连接的数量有关。一段时间后,这些信息就会传播到多个社区。我们的方案切换到强联系驱动的转发阶段,其中有影响力的节点更加重要。转发令牌的数量与两个遇到的节点的强连接数量成正比。广泛的模拟进行了比较,几种方法在现实世界的移动轨迹。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信