多源多中繼無(wú)線網(wǎng)絡(luò)中基于隨機(jī)線性網(wǎng)絡(luò)編碼的調(diào)度方案
doi: 10.11999/JEIT160454 cstr: 32379.14.JEIT160454
-
2.
(重慶郵電大學(xué)計(jì)算機(jī)科學(xué)與技術(shù)學(xué)院 重慶 400065) ②(西南交通大學(xué)信息科學(xué)與技術(shù)學(xué)院 成都 611756)
國(guó)家高技術(shù)研究發(fā)展計(jì)劃(2015AA01A705),國(guó)家自然科學(xué)基金(61571375)
Scheduling Scheme for Multi-source Multi-relay Wireless Network Based on Random Linear Network Coding
-
2.
(School of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China)
The National High-Technology Research and Development Program of China (2015AA01A705), The National Natural Science Foundation of China (61571375)
-
摘要: 現(xiàn)有多中繼無(wú)線網(wǎng)絡(luò)中傳輸調(diào)度方案主要針對(duì)單信源且轉(zhuǎn)發(fā)鏈路狀態(tài)相同的情況,多采用順序轉(zhuǎn)發(fā)的調(diào)度方式,傳輸效率較低。針對(duì)此問(wèn)題,該文提出一種基于隨機(jī)線性網(wǎng)絡(luò)編碼的優(yōu)先級(jí)調(diào)度方案。該方案在不同的傳輸階段,利用信息包接收狀態(tài)或編碼向量之間的線性關(guān)系生成反饋信息,計(jì)算中繼節(jié)點(diǎn)的有效信息包數(shù)。在轉(zhuǎn)發(fā)鏈路狀態(tài)不同的情況下,綜合考慮各中繼節(jié)點(diǎn)的有效信息與鏈路傳輸可靠性,確定優(yōu)先級(jí),從而完成調(diào)度。該方案實(shí)現(xiàn)了多中繼對(duì)多信源信息的協(xié)同轉(zhuǎn)發(fā),在轉(zhuǎn)發(fā)鏈路狀態(tài)差異較大時(shí),能自適應(yīng)地選擇最優(yōu)轉(zhuǎn)發(fā)節(jié)點(diǎn)和路徑,提高信息包的傳輸成功率。仿真結(jié)果表明,相比傳統(tǒng)基于單信源或順序調(diào)度的方案,該方案能有效提高網(wǎng)絡(luò)吞吐量,減少重傳次數(shù)。
-
關(guān)鍵詞:
- 無(wú)線網(wǎng)絡(luò) /
- 隨機(jī)線性網(wǎng)絡(luò)編碼 /
- 調(diào)度 /
- 多源多中繼
Abstract: Current scheduling schemes in multi-relay wireless network mainly focuse on single source wireless network with the same link status. Furthermore, the sequential-forward scheduling scheme is used usually, and the transmission efficiency is comparatively low. To solve this problem, a priority scheduling scheme based on random linear network coding is proposed. In different transmission stages, the feedback information is generated according to the packets accepting state or the linear relation among the encoding vectors. The number of the effective packets of the corresponding relay node is calculated. In the condition of different link status, the effective information of each relay node and the link transmission reliability is taken into consideration comprehensively to generate the priority index and complete scheduling. This scheme can realize cooperation transmission in multi-relays for multi-sources information. When the link status difference is obvious, the optimal forwarding node and the path can be adaptively chosen to improve the information transmission efficiency. According to the simulation results, this scheme can effectively improve network throughput and reduce the number of retransmission compared with the traditional scheduling schemes for single source wireless network. -
AHLSWEDE R, CAI N, LI S Y R, et al. Network information flow[J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1216. doi: 10.1109/18.850663. NGUYEN D, TRAN T, NGUYEN T, et al. Wireless broadcast using network coding[J]. IEEE Transactions on Vehicular Technology, 2009, 58(2): 914-925. doi: 10.1109/ TVT.2008.927729. 周志恒, 周亮. 多播網(wǎng)絡(luò)中基于網(wǎng)絡(luò)編碼的高效丟失恢復(fù)機(jī)制[J]. 電子與信息學(xué)報(bào), 2012, 34(8): 1962-1967. doi: 10.3724/SP.J.1146.2011.01233. ZHOU Zhiheng and ZHOU Liang. Efficient loss recovery based on network coding in multicast networks[J]. Journal of Electronics Information Technology, 2012, 34(8): 1962-1967. doi: 10.3724/SP.J.1146.2011.01233. 茍亮, 張更新, 孫偉, 等. 無(wú)線網(wǎng)絡(luò)中基于機(jī)會(huì)網(wǎng)絡(luò)編碼的加權(quán)廣播重傳[J]. 電子與信息學(xué)報(bào), 2014, 36(3): 749-753. doi: 10.3724/SP.J.1146.2013.00598. GOU Liang, ZHANG Gengxin, SUN Wei, et al. Weighted broadcasting retransmission based on opportunistic network coding in wireless networks[J]. Journal of Electronics Information Technology, 2014, 36(3): 749-753. doi: 10.3724/ SP.J.1146.2013.00598. KRAMER G, GASTPAR M, and GUPTA P. Cooperative strategies and capacity theorems for relay networks[J]. IEEE Transactions on Information Theory, 2005, 51(9): 3037-3063. doi: 10.1109/TIT.2005.853304. LIANG Y and VEERAVALLI V V. Cooperative relay broadcast channels[J]. IEEE Transactions on Information Theory, 2007, 53(3): 900-928. doi: 10.1109/TIT.2006.890726. FAN P, ZHI C, WEI C, et al. Reliable relay assisted wireless multicast using network coding[J]. IEEE Journal on Selected Areas in Communications, 2009, 27(5): 749-762. doi: 10.1109/JSAC.2009.090615. LU L, XIAO M, RASMUSSEN L K, et al. Efficient scheduling for relay-aided broadcasting with random network codes[C]. 2011 IEEE 22nd International Symposium on Personal Indoor and Mobile Radio Communications, Toronto, Canada, 2011: 1815-1819. doi: 10.1109/PIMRC.2011. 6139821. LU L, SUN F, XIAO M, et al. Relay-aided multi-cell broadcasting with random network coding[C]. IEEE International Symposium on Information Theory and its Applications, Taichung, China, 2010: 957-962. doi: 10.1109/ ISITA. 2010.5649536. HUANG L and SUNG C W. Scheduling and network coding for relay-aided wireless broadcast: Optimality and heuristic[J]. IEEE Transactions on Vehicular Technology, 2014, 63(2): 674-687. doi: 10.1109/TVT.2013.2281392. AMERIMEHR M H and ASHTANI F. Delay and throughput analysis of a two-way opportunistic network coding-based relay network[J]. IEEE Transactions on Wireless Communications, 2014, 13(5): 2863-2873. doi: 10.1109/TWC. 2014.040914.121461. WEI L and CHEN W. Compute-and-forward network coding design over multi-source multi-relay channels[J]. IEEE Transactions on Wireless Communications, 2012, 11(9): 3348-3357. doi: 10.1109/TWC.2012.070912.111948. DING L, Bi Y, SUN D, et al. Efficient scheduling with random network coding in multi-relay wireless network[J]. Journal of Shanghai Jiaotong University (Science), 2014, 19(1): 59-64. doi: 10.1007/s12204-014-1475-9. ASLAM M A and HASSAN S A. Analysis of multi-source multi-hop cooperative networks employing network coding [C]. IEEE 81st Vehicular Technology Conference, Glasgow, United Kingdom, 2015: 1-5. doi: 10.1109/VTCSpring. 2015.7145700. HO T, MEDARD M, KOETTER R, et al. A random linear network coding approach to multicast[J]. IEEE Transactions on Information Theory, 2006, 52(10): 4413-4430. doi: 10.1109/TIT.2006.881746. -
計(jì)量
- 文章訪問(wèn)數(shù): 1424
- HTML全文瀏覽量: 107
- PDF下載量: 567
- 被引次數(shù): 0