本文選題：C-RAN + Markov轉(zhuǎn)移模型　； 參考：《重慶郵電大學(xué)》2016年碩士論文

【摘要】：移動(dòng)通信網(wǎng)絡(luò)具有典型的“潮汐效應(yīng)”,即網(wǎng)絡(luò)流量在一天中的不同時(shí)刻起伏較大�，F(xiàn)有通信網(wǎng)絡(luò)主要按照用戶的最大化需求來(lái)進(jìn)行設(shè)計(jì)和建設(shè),網(wǎng)絡(luò)資源利用率偏低。在C-RAN網(wǎng)絡(luò)中,通過(guò)基帶處理單元對(duì)各個(gè)小區(qū)進(jìn)行統(tǒng)一管理,為頻譜資源的集中化處理提供了條件,以此實(shí)現(xiàn)頻譜資源的動(dòng)態(tài)分配,提高頻譜資源使用效率。本文研究C-RAN網(wǎng)絡(luò)中的頻譜資源分配,主要工作如下:1.設(shè)計(jì)了一種基于Markov轉(zhuǎn)移模型的小區(qū)用戶數(shù)預(yù)測(cè)機(jī)制,命名為HCPTI。將復(fù)雜移動(dòng)模型進(jìn)行簡(jiǎn)化,利用排隊(duì)論,建立基于小區(qū)用戶數(shù)的Markov轉(zhuǎn)移模型。分析用戶到達(dá)率和離開率,并對(duì)其予以求解。求解排隊(duì)模型不同時(shí)刻的瞬態(tài)解,得出不同時(shí)刻小區(qū)用戶數(shù)的期望值。綜合考慮預(yù)測(cè)誤差和系統(tǒng)開銷,求出HCPTI預(yù)測(cè)機(jī)制的最佳預(yù)測(cè)周期,把最佳預(yù)測(cè)周期下求得的用戶數(shù)期望值作為預(yù)測(cè)結(jié)果。在最佳預(yù)測(cè)周期下把HCPTI預(yù)測(cè)機(jī)制與時(shí)間序列自回歸預(yù)測(cè)(AR)方案作進(jìn)行仿真性能比較,結(jié)果表明,HCPTI預(yù)測(cè)機(jī)制的預(yù)測(cè)性能更優(yōu)。2.基于小區(qū)用戶數(shù)預(yù)測(cè)機(jī)制,設(shè)計(jì)了頻譜資源初次分配方案(命名為FABDR)和相應(yīng)的調(diào)整分配方案(命名為INRA)。根據(jù)用戶日常使用網(wǎng)絡(luò)資源概率的變化情況,求出各個(gè)小區(qū)在不同時(shí)刻的帶寬需求。綜合考慮載波大小、頻譜資源利用率和分配次數(shù)這三個(gè)因素,確定頻譜資源分配的最小分配單元(MAU)。在分配周期的起始時(shí)刻對(duì)各小區(qū)進(jìn)行頻譜資源的初次預(yù)分配,當(dāng)頻譜資源供需不匹配時(shí),進(jìn)行頻譜資源分配的調(diào)整。綜合考察頻譜資源利用率、系統(tǒng)容量、系統(tǒng)阻塞率和能耗,把本文分配方案與固定分配方案和周期批處理動(dòng)態(tài)分配方案進(jìn)行仿真性能比較,結(jié)果表明,本文分配方案綜合性能更優(yōu)。
[Abstract]:Mobile communication network has typical tidal effect, that is, the network flow fluctuates greatly at different times of day. The existing communication network is mainly designed and constructed according to the maximum demand of users, and the utilization ratio of network resources is on the low side. In C-RAN network, each cell is managed uniformly by baseband processing unit, which provides the condition for the centralized processing of spectrum resources, so as to realize the dynamic allocation of spectrum resources and improve the efficiency of spectrum resources. In this paper, spectrum resource allocation in C-RAN networks is studied. The main work is as follows: 1. A cell user prediction mechanism based on Markov transfer model is designed and named HCPTI. The complex mobile model is simplified and the Markov transfer model based on the number of cell users is established by using queuing theory. The user arrival rate and departure rate are analyzed and solved. The transient solution of the queuing model at different times is solved, and the expected value of the number of cell users at different times is obtained. Considering the prediction error and system overhead, the optimal prediction period of HCPTI prediction mechanism is obtained, and the expected number of users under the optimal forecasting period is taken as the prediction result. The HCPTI prediction mechanism is compared with the time series autoregressive prediction scheme under the best forecasting period. The results show that the prediction performance of the HCPTI prediction mechanism is better than that of the time series autoregressive prediction scheme. Based on the cell user number prediction mechanism, a spectrum resource allocation scheme (named FABDR) and a corresponding adjusted allocation scheme (named INRAA) are designed. According to the change of the probability of users using network resources, the bandwidth requirements of each cell at different times are calculated. Considering the carrier size, spectrum resource efficiency and allocation times, the minimum allocation unit of spectrum resource allocation is determined. At the beginning of the allocation period, the spectrum resources of each cell are preallocated for the first time, and when the supply and demand of the spectrum resources are not matched, the spectrum resource allocation is adjusted. The spectrum resource efficiency, system capacity, system blocking rate and energy consumption are comprehensively investigated. The simulation performance of the proposed allocation scheme is compared with that of the fixed allocation scheme and the periodic batch dynamic allocation scheme. The results show that, The comprehensive performance of the allocation scheme in this paper is better.
【學(xué)位授予單位】：重慶郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類號(hào)】：TN929.5

【參考文獻(xiàn)】

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

1 賈亞男;岳殿武;;博弈論框架下認(rèn)知小蜂窩網(wǎng)絡(luò)的動(dòng)態(tài)資源分配算法[J];電子學(xué)報(bào);2015年10期

2 馬旗超;劉占軍;朱志超;于中華;;C-RAN架構(gòu)中下行組播與單播業(yè)務(wù)資源分配算法[J];計(jì)算機(jī)工程與設(shè)計(jì);2015年08期

3 盧小鵬;葉慶衛(wèi);呂翠蘭;;基于稀疏AR模型的潮流信號(hào)建模與預(yù)報(bào)[J];海洋學(xué)研究;2015年02期

4 馬旗超;劉占軍;彭霞;沈悅;;C-RAN無(wú)線網(wǎng)絡(luò)中業(yè)務(wù)預(yù)測(cè)的馬爾科夫模型[J];電視技術(shù);2015年03期

5 雷秋燕;張治中;程方;胡昊南;;基于C-RAN的5G無(wú)線接入網(wǎng)架構(gòu)[J];電信科學(xué);2015年01期

6 劉占軍;陳玲瓏;沈悅;呂宗琦;陳前斌;;C-RAN架構(gòu)網(wǎng)絡(luò)中基于分組調(diào)度的直接通信機(jī)制[J];重慶郵電大學(xué)學(xué)報(bào)(自然科學(xué)版);2014年04期

7 黃海峰;;C-RAN從試點(diǎn)走向應(yīng)用 商用設(shè)備有望兩年內(nèi)推出[J];通信世界;2012年31期

8 滕志軍;韓雪;楊旭;;認(rèn)知無(wú)線電中基于博弈論的頻譜分配算法[J];計(jì)算機(jī)應(yīng)用研究;2011年07期

9 劉琪;袁堅(jiān);山秀明;蘇偉;張宏科;;3G/WLAN網(wǎng)絡(luò)中基于終端移動(dòng)與業(yè)務(wù)認(rèn)知的動(dòng)態(tài)負(fù)載均衡機(jī)制[J];計(jì)算機(jī)學(xué)報(bào);2010年09期

，

本文編號(hào)：1813014