摘要
随着信息时代的高速发展,用户对于数据的请求日益增多。为了应对当今用户庞大的流量需求,学术界提出了超密集网络的概念。超密集网络(UDN)通过增加单位面积接入节点及通信链路的密度,使接入节点尽可能靠近用户,有效减少用户获取数据的时延,改善网络拥塞等现象。设备到设备(D2D)是5G超密集网络中一项关键技术。D2D使各个设备直接通信,能够有效提高资源利用率和多媒体数据吞吐量,减少对于基站的依赖。并且,D2D在视频流方面也得到了广泛的应用。使用D2D通信能够有效实现多媒体数据共享,针对这一方面设计了新颖的调度机制。将D2D场景下的实时和点播视频流公式化,并根据这两种视频流的特征设计各自的调度机制。仿真结果表明,这两种调度机制不仅能够实现视频流畅播放,而且能提高直播环境下视频流的实时性,减少点播环境下的视频停滞现象。
With the rapid development of information age,more and more users request for data.In order to meet the huge traffic demand of current users,the concept of ultra-dense network has been put forward in academic circles.Ultra-dense network (UDN) makes access nodes as close to users as possible by increasing the density of access nodes and communication links per unit area,which can effectively reduce the time delay of data acquisition by users and improve network congestion and other phenomena.Device-to-Device (D2D),as a key technology in 5G UDN,enables each device to communicate directly,which can effectively improve the resource utilization and multimedia data throughput,and reduce the dependence on the base station. Moreover,D2D is also widely used in video streaming.Based on these,we propose two novel scheduling algorithms for effectively sharing the multimedia content using D2D communication.The problem of live and on-demand streaming in D2D scenarios are formulated and the scheduling algorithms are proposed respectively according to the characteristics of these two video streams.The simulation shows that the proposed approaches not only can ensure the smooth playback of videos,but also can improve the liveness for live streaming while reducing the stall events for on-demand streaming.
作者
夏雪
杨龙祥
XIA Xue;YANG Long-xiang(School of Communication and Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)
出处
《计算机技术与发展》
2019年第4期169-174,共6页
Computer Technology and Development
基金
国家自然科学基金(61372124)
国家"973"重点基础研究发展计划项目(2013CB329104)
关键词
5G超密集网络
计算机应用
D2D
多媒体流
调度机制
5G ultra-dense network
computer applications
D2D
multimedia streaming
scheduling mechanism
