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}
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.