發(fā)布時(shí)間：2018-03-13 23:14

  本文選題：時(shí)延受限　切入點(diǎn)：調(diào)度　出處：《北京郵電大學(xué)學(xué)報(bào)》2017年03期 　論文類型：期刊論文

【摘要】：在路側(cè)基礎(chǔ)設(shè)施密集部署的車聯(lián)網(wǎng)場景中,針對車載終端時(shí)延受限內(nèi)容的下載需求,提出了一種調(diào)度算法.該算法基于李雅普諾夫優(yōu)化方法,利用分組的等待時(shí)延建立李雅普諾夫方程,通過傳輸和丟包決策可以保證用戶的時(shí)延需求,并保證系統(tǒng)穩(wěn)定.仿真結(jié)果表明,相比于最早過期優(yōu)先算法,提出的方法在滿足用戶時(shí)延需求的同時(shí),進(jìn)一步提升了系統(tǒng)的吞吐量.
[Abstract]:Based on Lyapunov optimization method, a scheduling algorithm is proposed in the vehicle networking scenario with dense deployment of road-side infrastructure, aiming at the download requirements of the vehicle terminal delay limited content, which is based on the Lyapunov optimization method. The Lyapunov equation is established by using the waiting delay of the packet. The delay requirement of the user can be guaranteed by transmission and packet loss decision, and the system stability can be guaranteed. The simulation results show that compared with the earliest expired priority algorithm, The proposed method not only meets the needs of user delay, but also improves the throughput of the system.
【作者單位】： 西安電子科技大學(xué)通信工程學(xué)院;
【基金】：國家自然科學(xué)基金面上項(xiàng)目(61571351) 陜西省自然科學(xué)基礎(chǔ)研究計(jì)劃項(xiàng)目(2016JM6028) 國家科技重大專項(xiàng)項(xiàng)目(2015ZX03002006-003)
【分類號】：TN929.5;U495
，

本文編號：1608569