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