移动社交网络通过朋友对朋友的机会主义内容传播

Kanchana Thilakarathna, A. C. Viana, A. Seneviratne, H. Petander
{"title":"移动社交网络通过朋友对朋友的机会主义内容传播","authors":"Kanchana Thilakarathna, A. C. Viana, A. Seneviratne, H. Petander","doi":"10.1145/2491288.2491319","DOIUrl":null,"url":null,"abstract":"We focus on dissemination of content for delay tolerant applications, (i.e. content sharing, advertisement propagation, etc.) where users are geographically clustered into communities. We propose a novel architecture that addresses the issues of lack of trust, delivery latency, loss of user control, and privacy-aware distributed mobile social networking by combining the advantages of decentralized storage and opportunistic communications. The content is to be replicated on friends' devices who are likely to consume the content. The fundamental challenge is to minimize the number of replicas whilst ensuring high and timely availability. We propose a greedy heuristic algorithm for computationally hard content replication problem to replicate content in well-selected users, to maximize the content dissemination with limited number of replication. Using both real world and synthetic traces, we show the viability of the proposed scheme.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":"{\"title\":\"Mobile social networking through friend-to-friend opportunistic content dissemination\",\"authors\":\"Kanchana Thilakarathna, A. C. Viana, A. Seneviratne, H. Petander\",\"doi\":\"10.1145/2491288.2491319\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We focus on dissemination of content for delay tolerant applications, (i.e. content sharing, advertisement propagation, etc.) where users are geographically clustered into communities. We propose a novel architecture that addresses the issues of lack of trust, delivery latency, loss of user control, and privacy-aware distributed mobile social networking by combining the advantages of decentralized storage and opportunistic communications. The content is to be replicated on friends' devices who are likely to consume the content. The fundamental challenge is to minimize the number of replicas whilst ensuring high and timely availability. We propose a greedy heuristic algorithm for computationally hard content replication problem to replicate content in well-selected users, to maximize the content dissemination with limited number of replication. Using both real world and synthetic traces, we show the viability of the proposed scheme.\",\"PeriodicalId\":234414,\"journal\":{\"name\":\"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"35\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2491288.2491319\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2491288.2491319","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35

摘要

我们专注于延迟容忍应用程序的内容传播(即内容共享,广告传播等),其中用户在地理上聚集到社区中。我们提出了一种新颖的架构,通过结合分散存储和机会通信的优势,解决了缺乏信任、交付延迟、失去用户控制和隐私敏感的分布式移动社交网络问题。这些内容将被复制到可能消费这些内容的朋友的设备上。最根本的挑战是最小化副本的数量,同时确保高和及时的可用性。针对难以计算的内容复制问题,提出了一种贪婪启发式算法,在精心选择的用户中复制内容,以有限的复制次数最大化内容传播。使用真实世界和合成轨迹,我们证明了所提出方案的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mobile social networking through friend-to-friend opportunistic content dissemination
We focus on dissemination of content for delay tolerant applications, (i.e. content sharing, advertisement propagation, etc.) where users are geographically clustered into communities. We propose a novel architecture that addresses the issues of lack of trust, delivery latency, loss of user control, and privacy-aware distributed mobile social networking by combining the advantages of decentralized storage and opportunistic communications. The content is to be replicated on friends' devices who are likely to consume the content. The fundamental challenge is to minimize the number of replicas whilst ensuring high and timely availability. We propose a greedy heuristic algorithm for computationally hard content replication problem to replicate content in well-selected users, to maximize the content dissemination with limited number of replication. Using both real world and synthetic traces, we show the viability of the proposed scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信