设备到设备覆盖网络中社会感知的多文件传播

Zijie Zheng, Tianyu Wang, Lingyang Song, Zhu Han, Jianjun Wu
{"title":"设备到设备覆盖网络中社会感知的多文件传播","authors":"Zijie Zheng, Tianyu Wang, Lingyang Song, Zhu Han, Jianjun Wu","doi":"10.1109/INFCOMW.2014.6849234","DOIUrl":null,"url":null,"abstract":"Multi-File dissemination through wireless communication has attracted considerable attentions in recent years, especially when Device-to-Device (D2D) communication is developed to support peer-to-peer file transmission. To decrease the total delay, the authors in proposed a cluster-based D2D network in which files are transmitted from the BS to several cluster-heads, and then shared inside each cluster through D2D communication. Distributed caching is another option to enhance the transmission rate by precaching files to users, with which mobile users with the same interest can share files directly through D2D communication. However, most of the current studies on D2D-based file sharing schemes typically assume that all users are separated in non-overlapping communities that each user can only select one sort of files, and ignore the social relations among mobile users. When considering heterogeneous but overlapping interests of users, how to utilize social ties for multi-file sharing with minimum delay is still a challenging problem. To this end, we propose a graph based social aware algorithm in which cellular links and D2D links are established according to social ties and social contributions of users for efficient multi-file dissemination.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"219-220"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":"{\"title\":\"Social-aware multi-file dissemination in Device-to-Device overlay networks\",\"authors\":\"Zijie Zheng, Tianyu Wang, Lingyang Song, Zhu Han, Jianjun Wu\",\"doi\":\"10.1109/INFCOMW.2014.6849234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multi-File dissemination through wireless communication has attracted considerable attentions in recent years, especially when Device-to-Device (D2D) communication is developed to support peer-to-peer file transmission. To decrease the total delay, the authors in proposed a cluster-based D2D network in which files are transmitted from the BS to several cluster-heads, and then shared inside each cluster through D2D communication. Distributed caching is another option to enhance the transmission rate by precaching files to users, with which mobile users with the same interest can share files directly through D2D communication. However, most of the current studies on D2D-based file sharing schemes typically assume that all users are separated in non-overlapping communities that each user can only select one sort of files, and ignore the social relations among mobile users. When considering heterogeneous but overlapping interests of users, how to utilize social ties for multi-file sharing with minimum delay is still a challenging problem. To this end, we propose a graph based social aware algorithm in which cellular links and D2D links are established according to social ties and social contributions of users for efficient multi-file dissemination.\",\"PeriodicalId\":6468,\"journal\":{\"name\":\"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"1 1\",\"pages\":\"219-220\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"32\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOMW.2014.6849234\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2014.6849234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32

摘要

近年来,通过无线通信进行多文件传播引起了人们的广泛关注,特别是随着设备对设备(Device-to-Device, D2D)通信的发展,支持点对点文件传输。为了减少总延迟,作者提出了一种基于簇的D2D网络,该网络将文件从BS传输到多个簇头,然后通过D2D通信在每个簇内共享。分布式缓存是通过向用户预压缩文件来提高传输速率的另一种选择,具有相同兴趣的移动用户可以通过D2D通信直接共享文件。然而,目前大多数基于d2d的文件共享方案的研究通常假设所有用户都被隔离在非重叠的社区中,每个用户只能选择一种文件,而忽略了移动用户之间的社会关系。在考虑用户兴趣异构但又相互重叠的情况下,如何利用社交关系实现多文件共享,并使延迟最小化仍然是一个具有挑战性的问题。为此,我们提出了一种基于图的社会感知算法,该算法根据用户的社会关系和社会贡献建立蜂窝链接和D2D链接,实现高效的多文件传播。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Social-aware multi-file dissemination in Device-to-Device overlay networks
Multi-File dissemination through wireless communication has attracted considerable attentions in recent years, especially when Device-to-Device (D2D) communication is developed to support peer-to-peer file transmission. To decrease the total delay, the authors in proposed a cluster-based D2D network in which files are transmitted from the BS to several cluster-heads, and then shared inside each cluster through D2D communication. Distributed caching is another option to enhance the transmission rate by precaching files to users, with which mobile users with the same interest can share files directly through D2D communication. However, most of the current studies on D2D-based file sharing schemes typically assume that all users are separated in non-overlapping communities that each user can only select one sort of files, and ignore the social relations among mobile users. When considering heterogeneous but overlapping interests of users, how to utilize social ties for multi-file sharing with minimum delay is still a challenging problem. To this end, we propose a graph based social aware algorithm in which cellular links and D2D links are established according to social ties and social contributions of users for efficient multi-file dissemination.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信