通信学报 ›› 2020, Vol. 41 ›› Issue (11): 64-73.doi: 10.11959/j.issn.1000-436x.2020221

• 学术论文 • 上一篇    下一篇

基于D2D多播通信的合作内容下载机制

杨莲新,吴丹(),袁峰,乐超,富勤学   

  1. 陆军工程大学通信工程学院,江苏 南京 210007
  • 修回日期:2020-09-20 出版日期:2020-11-25 发布日期:2020-12-19
  • 作者简介:杨莲新(1993- ),女,河南淮阳人,陆军工程大学博士生,主要研究方向为D2D通信、跨模态通信、机器学习等|吴丹(1983– ),女,四川成都人,陆军工程大学副教授、博士生导师,主要研究方向为移动通信、无线资源管理等|袁峰(1982- ),男,江苏盐城人,博士,陆军工程大学讲师,主要研究方向为卫星通信等|乐超(1977- ),男,江苏宝应人,陆军工程大学讲师,主要研究方向为无线资源管理、电子设计和无线通信等|富勤学(1980- ),男,内蒙古乌兰察布人,陆军工程大学博士生,主要研究方向为社交-感知 D2D 通信、D2D 资源管理、博弈论等
  • 基金资助:
    江苏省杰出青年基金资助项目(BK20180028);国家自然科学基金资助项目(61671474);江苏省优秀青年基金资助项目(BK20170089)

Cooperative content downloading scheme based on D2D multicast communications

Lianxin YANG,Dan WU(),Feng YUAN,Chao YUE,Qinxue FU   

  1. College of Communications Engineering,Army Engineering University,Nanjing 210007,China
  • Revised:2020-09-20 Online:2020-11-25 Published:2020-12-19
  • Supported by:
    The Jiangsu Provincial Natural Science Fund for Outstanding Young Scholars(BK20180028);The National Natural Science Foundation of China(61671474);The Jiangsu Provincial Natural Science Fund for Excellent Young Scholars(BK20170089)

摘要:

针对蜂窝网、车联网等网络中用户的内容下载场景,提出了一种基于终端直通(D2D)多播通信的合作内容下载机制改善下载性能。该机制充分利用内容请求者位置的邻近特性,将其分成不相交的簇。簇内的内容请求者合作从基站处下载一份完整的内容,并轮流向簇内其他内容请求者共享所下载的内容。这种下载方式下,内容共享额外消耗的资源由簇内内容请求者共同承担。在此过程中,提出了一种定价方法来激励内容请求者间的合作。该方法仅需要基站维持一个内容下载的价格。基于此,为最小化内容请求者的下载代价,研究了用户分簇、链路调度和功率分配的联合优化问题。为以较低的复杂度得到较优的解,基于联盟形成博弈设计了一个联合优化算法。仿真结果表明,相较于传统非合作机制,内容请求者在所提机制下的下载代价降低了约37.15%;在不同数目的内容请求者和蜂窝用户下,所提机制均优于其他基准机制。

关键词: 内容下载, 用户分簇, 链路调度, 功率分配, 联盟形成

Abstract:

Aiming at the content downloading scenario in the network such as cellular network and vehicular network,a cooperative content downloading scheme based on device-to-device multicast communications was proposed to improve the content downloading performance.Such a scheme took advantage of the proximity feature of the content requesters and groups them into disjoint clusters.Firstly,the base station delivered the entire content to a cluster,and each content requester in a cluster downloaded a proportion of the entire content.Then,the content requesters took turns sharing their downloaded content with other content requesters in the same cluster.In this way,the additional resource consumption of content sharing in a cluster was shared by the content requesters in the cluster together.During this process,a pricing-based approach was proposed to motivate these content requesters to cooperate with each other.Such an approach only required the base station to maintain a content downloading price.Based on this,the joint issue of user clustering,link scheduling and power allocation was studied to minimize the total cost of content requesters.To obtain a superior solution with reductive complexity,a joint optimization algorithm was designed based on the coalition formation game.Numerical results show that compared with the traditional non-cooperative scheme,the total cost of content requesters was reduced by 37.15%.Under different numbers of content requesters and cellular users,the proposed scheme is both superior to other benchmark schemes.

Key words: content downloading, user clustering, link scheduling, power allocation, coalition formation

中图分类号: 

No Suggested Reading articles found!