【摘要】：網(wǎng)絡(luò)編碼可顯著提高無(wú)線網(wǎng)絡(luò)系統(tǒng)性能,但是傳統(tǒng)網(wǎng)絡(luò)編碼中的信宿節(jié)點(diǎn)需收到足夠多的編碼信息才能譯碼,不能實(shí)現(xiàn)實(shí)時(shí)譯碼。即時(shí)譯碼的網(wǎng)絡(luò)編碼技術(shù)(Instantly Decodable Network Coding,IDNC)通過(guò)選擇相應(yīng)數(shù)據(jù)包進(jìn)行編碼,確保信宿節(jié)點(diǎn)可實(shí)時(shí)譯碼,因此受到了當(dāng)前學(xué)者的廣泛關(guān)注。當(dāng)前IDNC的研究大多基于理想的無(wú)線鏈路,但是現(xiàn)實(shí)環(huán)境中無(wú)線鏈路由于受到衰落、干擾等因素的影響,傳輸數(shù)據(jù)不可避免會(huì)出現(xiàn)差錯(cuò)。因此本論文將研究無(wú)線鏈路反饋丟失條件下的IDNC,主要做了如下幾方面工作:1、在反饋丟失條件下,建立一種將IDNC和隨機(jī)線性網(wǎng)絡(luò)編碼(Random Linear Network Coding,RLNC)相關(guān)聯(lián)的網(wǎng)絡(luò)編碼模型。依據(jù)建立的IDNC圖,提出最優(yōu)IDNC解決方案下子代的概念,在每個(gè)子代中應(yīng)用RLNC編碼模型。研究表明,子代大小介于1和IDNCC之間時(shí),系統(tǒng)性能介于IDNC和RLNC之間,且IDNC和RLNC只是該模型下具有特定子代大小的兩個(gè)極端例子。2、在反饋丟失的多組播網(wǎng)絡(luò)中,為了使IDNC的完成時(shí)延和譯碼時(shí)延最小化,提出一種最有可能狀態(tài)找尋(Most Likely State Searching,MLSS)策略。通過(guò)MLSS方法建立多組播條件下的IDNC圖,依據(jù)該模型得出平均完成時(shí)延和譯碼時(shí)延的表達(dá)式,采用最大權(quán)頂點(diǎn)找尋算法找出使兩者分別最小化的團(tuán)。仿真結(jié)果表明,相比于其他文獻(xiàn)利用盲IDNC圖更新法找尋最優(yōu)編碼包的算法,MLSS方法可獲得更優(yōu)的系統(tǒng)性能。3、為了權(quán)衡IDNC的完成時(shí)延和譯碼時(shí)延兩種性能,提出一種多組播網(wǎng)絡(luò)反饋丟失下的均衡完成時(shí)延和譯碼時(shí)延(Balance between Completion Time and Decoding Delay with Feedback Loss,BCD-FL)方案。首先用隨機(jī)最短路徑(Stochastic Shortest Path,SSP)分析IDNC在廣播網(wǎng)絡(luò)中的完成時(shí)延和譯碼時(shí)延均衡問(wèn)題,利用分析出的性能表達(dá)式得到多組播網(wǎng)絡(luò)下BCD-FL問(wèn)題的SSP描述,從而在IDNC圖中采用BCD-FL算法找出最大團(tuán)。研究表明,提出的BCD-FL方案可較好均衡完成時(shí)延和譯碼時(shí)延性能。
[Abstract]:Network coding can significantly improve the performance of wireless network systems, but the traditional network coding nodes need to receive enough coding information in order to decode, can not achieve real-time decoding. The real-time decoding network coding technology (Instantly Decodable Network Coding,IDNC) ensures that the host node can be decoded in real time by selecting the corresponding packets to encode, so it has been widely concerned by scholars. Most of the current research on IDNC is based on the ideal wireless link, but in the real environment, due to the influence of fading, interference and other factors, the transmission data will inevitably appear errors. Therefore, this paper will study the IDNC, under the condition of wireless link feedback loss as follows: 1. Under the condition of feedback loss, we establish a kind of IDNC and random linear network coding (Random Linear Network Coding,. RLNC) the associated network coding model. According to the established IDNC diagram, the concept of offspring under the optimal IDNC solution is proposed, and the RLNC coding model is applied in each generation. The results show that when the offspring size is between 1 and IDNCC, the system performance is between IDNC and RLNC, and IDNC and RLNC are only two extreme examples with specific offspring size in this model. In order to minimize the completion delay and decoding delay of IDNC, a most probable state finding (Most Likely State Searching,MLSS) strategy is proposed. The IDNC graph under the condition of multi-multicast is established by MLSS method. According to the model, the expressions of average completion delay and decoding delay are obtained, and the max-weight vertex finding algorithm is used to find out the clusters which minimize the two groups respectively. The simulation results show that compared with other algorithms using blind IDNC graph updating method to find the optimal coding packet, the MLSS method can achieve better system performance. 3. In order to balance the completion delay and decoding delay of IDNC, the proposed method can achieve better performance. This paper presents a scheme for equalizing completion delay and decoding delay (Balance between Completion Time and Decoding Delay with Feedback Loss,BCD-FL under feedback loss in multi-multicast networks. Firstly, the completion delay and decoding delay equalization problem of IDNC in broadcast network is analyzed by stochastic shortest path (Stochastic Shortest Path,SSP), and the SSP description of BCD-FL problem in multi-multicast network is obtained by using the performance expression. Thus, the BCD-FL algorithm is used to find out the largest cluster in the IDNC diagram. The results show that the proposed BCD-FL scheme can equalize the performance of delay and decoding delay.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：TN92

【參考文獻(xiàn)】

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

1 王遠(yuǎn);徐華;賈培發(fā);;Design and analysis of a network coding algorithm for ad hoc networks[J];Journal of Central South University;2015年04期

2 戴彬;曹志剛;楊軍;黃辰;王芙蓉;;基于匹配理論的無(wú)線廣播編碼重傳算法[J];軟件學(xué)報(bào);2011年11期

3 許胤龍;詹成;羅文;李沛;;Ad hoc網(wǎng)絡(luò)中基于網(wǎng)絡(luò)編碼的可靠組播[J];中國(guó)科學(xué)技術(shù)大學(xué)學(xué)報(bào);2008年07期

4 劉祖云;胡進(jìn)德;;分布式共享存儲(chǔ)研究[J];成都大學(xué)學(xué)報(bào)(自然科學(xué)版);2008年01期

相關(guān)博士學(xué)位論文 前1條

1 唐斌;面向無(wú)線網(wǎng)絡(luò)的高效網(wǎng)絡(luò)編碼方法研究[D];南京大學(xué);2014年

相關(guān)碩士學(xué)位論文 前1條

1 楊葉舒;無(wú)線網(wǎng)絡(luò)中網(wǎng)絡(luò)編碼子圖和網(wǎng)絡(luò)編碼方法的研究[D];南京郵電大學(xué);2014年

，

本文編號(hào)：2299512