【摘要】：針對(duì)高速移動(dòng)環(huán)境下多業(yè)務(wù)多用戶正交頻分多址(OFDMA)系統(tǒng)下行鏈路提出一種動(dòng)態(tài)資源分配方案。針對(duì)具有不同時(shí)延要求的多種類型數(shù)據(jù)包的數(shù)據(jù)流,提出了一種考慮多種時(shí)延服務(wù)質(zhì)量(QoS)要求的動(dòng)態(tài)資源分配算法。通過應(yīng)用排隊(duì)論原理,將用戶的時(shí)延要求轉(zhuǎn)化為速率約束,結(jié)合多普勒頻移產(chǎn)生的中斷概率的約束,形成一個(gè)高速移動(dòng)環(huán)境下考慮用戶不同QoS要求的最優(yōu)化問題。該優(yōu)化問題為混合整數(shù)非線性規(guī)劃,直接求解的復(fù)雜度非常高。為了解決原問題,提出了次優(yōu)方法。仿真結(jié)果表明,在高速移動(dòng)環(huán)境下,提出的方法在保障用戶各種QoS時(shí)延要求的同時(shí),有效地提高了系統(tǒng)的容量。
[Abstract]:A dynamic resource allocation scheme is proposed for the downlink of multi-service multi-user orthogonal frequency division multiple access (OFDMA) systems in high-speed mobile environment. In this paper, a dynamic resource allocation algorithm considering the (QoS) requirements of multiple delay quality of service (QoS) is proposed for the data flow of various types of data packets with different delay requirements. By applying the queuing theory, the delay requirement of the user is transformed into the rate constraint, and the constraint of the interrupt probability generated by the Doppler shift is combined to form an optimization problem considering the different QoS requirements of the user in a high-speed mobile environment. The optimization problem is a mixed integer nonlinear programming, and the complexity of direct solution is very high. In order to solve the original problem, a suboptimal method is proposed. The simulation results show that the proposed method can effectively improve the capacity of the system while ensuring various QoS delay requirements in the high-speed mobile environment.
【作者單位】： 北京交通大學(xué)電子信息工程學(xué)院;
【基金】：國(guó)家自然科學(xué)基金(61101138) 國(guó)家科技重大專項(xiàng)(2012ZX03003013-003) 北京市自然科學(xué)基金(4132041) 中央高�；究蒲袠I(yè)務(wù)費(fèi)(2012JBM007)
【分類號(hào)】：TN929.5

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 徐國(guó)鑫,紀(jì)陽(yáng),田輝,張平;用于OFDMA系統(tǒng)的延遲公平資源調(diào)度方法[J];計(jì)算機(jī)工程與應(yīng)用;2005年05期

2 盧光躍;邵朝;;一種OFDMA系統(tǒng)資源分配方案[J];西安郵電學(xué)院學(xué)報(bào);2006年01期

3 孫治水;尹長(zhǎng)川;樂光新;;多小區(qū)OFDMA系統(tǒng)的分布式資源分配方案[J];電子與信息學(xué)報(bào);2007年06期

4 程鵬;張朝陽(yáng);周s，

本文編號(hào)：2148291