發(fā)布時間：2018-11-09 11:14

【摘要】：針對在無線廣播網(wǎng)絡(luò)鏈路狀態(tài)不同和丟包率較高的情況下,WONCR(Weighted opportunistic network coding retransmission)等重傳方法存在計算復(fù)雜度高的問題,提出了一種經(jīng)過改進(jìn)的基于機會網(wǎng)絡(luò)編碼的加權(quán)廣播重傳方法.該方法先根據(jù)接收端的反饋信息構(gòu)建加權(quán)數(shù)據(jù)包狀態(tài)矩陣,然后根據(jù)狀態(tài)矩陣創(chuàng)建丟包的Hash表,最后通過Hash鄰域最大值搜索和接收端緩存優(yōu)化快速選擇滿足一定編碼條件的丟包組合通過異或生成編碼包進(jìn)行重傳,從而在保持較高重傳性能的同時,有效降低了重傳方法的時間復(fù)雜度和接收端所需的緩存容量.仿真結(jié)果表明相比已有算法有較低的時間復(fù)雜度,能有效地減少計算開銷和接收端的緩存壓力,大大提高實用性.
[Abstract]:In the case of different link states and high packet loss rate in wireless broadcast networks, retransmission methods such as, WONCR (Weighted opportunistic network coding retransmission) have high computational complexity. An improved weighted broadcast retransmission method based on opportunistic network coding is proposed. The method first constructs the weighted packet state matrix according to the feedback information from the receiver, and then creates the Hash table of packet loss according to the state matrix. Finally, by searching the maximum value of the Hash neighborhood and optimizing the buffer at the receiving end, the packet loss combination that meets certain coding conditions is quickly selected for retransmission through the XOR generation of the encoding packet, so that the performance of the retransmission can be maintained at the same time. The time complexity of the retransmission method and the buffer capacity required by the receiver are reduced effectively. The simulation results show that compared with the existing algorithms, the proposed algorithm has lower time complexity, can effectively reduce the computational overhead and the buffer pressure on the receiver, and greatly improves the practicability.
【作者單位】： 浙江工業(yè)大學(xué)信息工程學(xué)院;
【基金】：國家自然科學(xué)基金資助項目(61372087) 浙江省科技廳公益社發(fā)項目(2016C33166)
【分類號】：TN92

【相似文獻(xiàn)】

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

1 許思源;;兩種鏈路層重傳機制的比較[J];信息與電腦(理論版);2012年02期

2 李屹;紀(jì)紅;馬書惠;;無線Ad hoc網(wǎng)絡(luò)中協(xié)作重傳機制的改進(jìn)[J];北京郵電大學(xué)學(xué)報;2007年04期

3 王雪;錢志鴻;李冰;李悅;;藍(lán)牙自適應(yīng)分組選擇策略與選擇重傳算法研究[J];通信學(xué)報;2011年01期

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

5 張小龍;李宗輝;;航空測控數(shù)據(jù)鏈自動請求重傳技術(shù)研究[J];計算機與網(wǎng)絡(luò);2012年11期

6 楊喬禮;朱翼雋;魏艷偉;;隨機丟棄機制下分組丟失重傳的緩存性能分析[J];高技術(shù)通訊;2008年07期

7 張足生;袁華強;于峰崎;;無線傳感器網(wǎng)絡(luò)動態(tài)重傳算法[J];傳感技術(shù)學(xué)報;2013年07期

8 楊家珍;章韻;;無線網(wǎng)絡(luò)中改進(jìn)TCP性能的兩種方法[J];軟件導(dǎo)刊;2008年09期

9 王正海;田茂;胡樹楷;王玉v，

本文編號：2320237