北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2017, Vol. 40 ›› Issue (3): 85-90.doi: 10.13190/j.jbupt.2017.03.012

• 研究报告 • 上一篇    下一篇

车联网场景中时延受限内容传输方案

侯蓉晖, 郭素霞   

  1. 西安电子科技大学 通信工程学院, 西安 710071
  • 收稿日期:2017-01-13 出版日期:2017-06-28 发布日期:2017-06-28
  • 作者简介:侯蓉晖(1980-),女,教授,博士生导师;郭素霞(1991-),女,硕士研究生,E-mail:suxiaguo436@163.com.
  • 基金资助:
    国家自然科学基金面上项目(61571351);陕西省自然科学基础研究计划项目(2016JM6028);国家科技重大专项项目(2015ZX03002006-003)

Latency-Constrained Content Dissemination Scheme in Vehicular Networks

HOU Rong-hui, GUO Su-xia   

  1. Institute of Communication Engineering, Xidian University, Xi'an 710071, China
  • Received:2017-01-13 Online:2017-06-28 Published:2017-06-28

摘要: 在路侧基础设施密集部署的车联网场景中,针对车载终端时延受限内容的下载需求,提出了一种调度算法.该算法基于李雅普诺夫优化方法,利用分组的等待时延建立李雅普诺夫方程,通过传输和丢包决策可以保证用户的时延需求,并保证系统稳定.仿真结果表明,相比于最早过期优先算法,提出的方法在满足用户时延需求的同时,进一步提升了系统的吞吐量.

关键词: 时延受限, 调度, 车联网, 李雅普诺夫优化方法

Abstract: A scheduling algorithm for the latency-constrained content dissemination in vehicular networks with dense deployment of Roadside Units was proposed based on Lyapunov optimization, which uses the explicit delay information from the head-of-line packet at each vehicle to stabilize the network. By proper scheduling and dropping packet, the network throughput is maximized while ensuring the delay requirement. Simulations show that the proposed algorithm can guarantee the demand of delay and improve the system throughput compared with the earliest expiration priority algorithm.

Key words: latency-constrained, scheduling, vehicular network, Lyapunov optimization

中图分类号: