基于努力的移动相遇网络社会扩散方法

Bernhard Klein, H. Hlavacs
{"title":"基于努力的移动相遇网络社会扩散方法","authors":"Bernhard Klein, H. Hlavacs","doi":"10.1109/CASON.2011.6085935","DOIUrl":null,"url":null,"abstract":"Mobile information systems use publish-subscribe mechanisms to distribute content between users. Unfortunately, content that is close to the user is not necessarily accessible unless users have specified so earlier. Mobile encounter networks (MENs) represent an alternative, which spread content in a spatial diffusion process. A drawback of MENs is their high resource usage. Some researchers have proposed diffusion methods that utilize knowledge about the social network behind the user community. Such approaches work well in the wired Internet since robust bandwidths exist. This, however, cannot be assumed for MENs where the bandwidth is determined by the encounter duration. We use an effort based knowledge diffusion approach to solve this problem. Effort based diffusion mechanisms differentiate between simple and complex content types and adapt content exchanges to the capabilities of involved peers. We emulate content diffusion between humans with an urban simulator. During the simulation we obtain data about content exchanges and cached contents. Results show that the least effort theory outperforms traditional approaches. Being aware of content transfer efforts, such routing approaches increase the overall transparency of large scale urban communities and to the same time enable richer content exchanges within friend networks.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An effort based social diffusion approach for mobile encounter networks\",\"authors\":\"Bernhard Klein, H. Hlavacs\",\"doi\":\"10.1109/CASON.2011.6085935\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile information systems use publish-subscribe mechanisms to distribute content between users. Unfortunately, content that is close to the user is not necessarily accessible unless users have specified so earlier. Mobile encounter networks (MENs) represent an alternative, which spread content in a spatial diffusion process. A drawback of MENs is their high resource usage. Some researchers have proposed diffusion methods that utilize knowledge about the social network behind the user community. Such approaches work well in the wired Internet since robust bandwidths exist. This, however, cannot be assumed for MENs where the bandwidth is determined by the encounter duration. We use an effort based knowledge diffusion approach to solve this problem. Effort based diffusion mechanisms differentiate between simple and complex content types and adapt content exchanges to the capabilities of involved peers. We emulate content diffusion between humans with an urban simulator. During the simulation we obtain data about content exchanges and cached contents. Results show that the least effort theory outperforms traditional approaches. Being aware of content transfer efforts, such routing approaches increase the overall transparency of large scale urban communities and to the same time enable richer content exchanges within friend networks.\",\"PeriodicalId\":342597,\"journal\":{\"name\":\"2011 International Conference on Computational Aspects of Social Networks (CASoN)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Computational Aspects of Social Networks (CASoN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CASON.2011.6085935\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASON.2011.6085935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

移动信息系统使用发布-订阅机制在用户之间分发内容。不幸的是,除非用户事先指定,否则接近用户的内容不一定可以访问。移动相遇网络(MENs)代表了一种替代方案,它在空间扩散过程中传播内容。MENs的一个缺点是它们的高资源占用。一些研究人员提出了利用用户社区背后的社交网络知识的扩散方法。这种方法在有线互联网上运行良好,因为存在强大的带宽。然而,对于MENs来说,这是不可能的,因为带宽是由相遇持续时间决定的。我们使用基于努力的知识扩散方法来解决这个问题。基于努力的扩散机制区分简单和复杂的内容类型,并根据相关对等体的能力调整内容交换。我们用城市模拟器模拟人类之间的内容传播。在模拟过程中,我们获得了关于内容交换和缓存内容的数据。结果表明,最小努力理论优于传统方法。意识到内容传输的努力,这种路由方法增加了大规模城市社区的整体透明度,同时在朋友网络中实现了更丰富的内容交换。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An effort based social diffusion approach for mobile encounter networks
Mobile information systems use publish-subscribe mechanisms to distribute content between users. Unfortunately, content that is close to the user is not necessarily accessible unless users have specified so earlier. Mobile encounter networks (MENs) represent an alternative, which spread content in a spatial diffusion process. A drawback of MENs is their high resource usage. Some researchers have proposed diffusion methods that utilize knowledge about the social network behind the user community. Such approaches work well in the wired Internet since robust bandwidths exist. This, however, cannot be assumed for MENs where the bandwidth is determined by the encounter duration. We use an effort based knowledge diffusion approach to solve this problem. Effort based diffusion mechanisms differentiate between simple and complex content types and adapt content exchanges to the capabilities of involved peers. We emulate content diffusion between humans with an urban simulator. During the simulation we obtain data about content exchanges and cached contents. Results show that the least effort theory outperforms traditional approaches. Being aware of content transfer efforts, such routing approaches increase the overall transparency of large scale urban communities and to the same time enable richer content exchanges within friend networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信