D2D網(wǎng)絡(luò)中基于立即可解網(wǎng)絡(luò)編碼的時(shí)延最小化重傳方案
doi: 10.11999/JEIT170976 cstr: 32379.14.JEIT170976
-
(重慶郵電大學(xué)計(jì)算機(jī)科學(xué)與技術(shù)學(xué)院 重慶 400065)
基金項(xiàng)目:
重慶市教委科學(xué)技術(shù)研究(KJ1704103)
Delay Minimization Retransmission Scheme Based on Instantly Decodable Network Coding for D2D Communications
-
WANG Lian WANG Meng REN Zhihao BAI Jiajie
Funds:
The Research on Science and Technology of Chongqing Education Commission (KJ1704103)
-
摘要: 該文針對(duì)D2D無(wú)線網(wǎng)絡(luò)中多終端并發(fā)協(xié)作重傳沖突避免問(wèn)題,提出一種基于立即可解網(wǎng)絡(luò)編碼的時(shí)延最小化重傳方案。在重傳階段,充分利用D2D無(wú)線網(wǎng)絡(luò)終端協(xié)作傳輸數(shù)據(jù)的優(yōu)勢(shì),結(jié)合各終端數(shù)據(jù)包接收狀態(tài),綜合考慮時(shí)延的影響因素,選取單次重傳時(shí)延增量較小的數(shù)據(jù)包生成編碼包,最小化重傳時(shí)延。同時(shí),構(gòu)建終端沖突圖,在圖中搜索極大獨(dú)立集,根據(jù)各終端的編碼包權(quán)重值,選擇最大加權(quán)獨(dú)立集中的終端作為并發(fā)協(xié)作重傳終端,從而降低重傳次數(shù)。仿真結(jié)果表明,所提方案能夠進(jìn)一步改善D2D無(wú)線網(wǎng)絡(luò)的重傳效率。
-
關(guān)鍵詞:
- 網(wǎng)絡(luò)編碼 /
- 重傳 /
- 時(shí)延 /
- 終端直通
Abstract: A delay minimization retransmission scheme based on an instantly decodable network coding is proposed to solve the conflict problem when multiple devices cooperatively retransmit in Device-to-Device (D2D) wireless networks concurrently. In retransmission stage, making full use of multiple devices cooperative transmission advantages in D2D wireless network, combined with the packet receiving state of each devices, taking all of the influence factors of delay into account, and then the packets with smaller incremental delay for each retransmission are selected to generate encoding packets to minimize the retransmission delay. At the same time, the devices conflict graph is constructed and the maximal independent set is searched in the graph. According to the encoding package weight value of each device, the maximum weighted independent set are selected as the concurrent cooperative retransmission devices to reduce the number of retransmission. Simulation results show that the proposed scheme can further improve the retransmission efficiency of D2D wireless network. -
[2] BOCCARDI F, HEATH R W, LOZANO A, et al. Five disruptive technology directions for 5G[J]. IEEE Communications Magazine, 2014, 52(2): 74-80. doi: 10.1109 /MCOM.2014.6736746. AAADI A, WANG Q, and MANCUSO V. A survey on Device-to-Device communication in cellular networks[J]. Journal of Guilin University of Electronic Technology, 2014, 16(4): 1801-1819. doi: 10.1109/COMST.2014.2319555. [3] AHLSWEDER, 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. [4] 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. [5] KATTI S, RAHUL H, HU W, et al. XORs in the air: Practical wireless network coding[J]. IEEE/ACM Transactions on Networking, 2008, 16(3): 497-510. doi: 10.1109/TNET.2008. 923722. 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. [7] TRASKOV D, MEDARD M, SADEGHI P, et al. Joint scheduling and instantaneously decodable network coding[C]. IEEE Conference on Global Telecommunications. Honolulu, USA, 2009: 3835-3840. doi: 10.1109/GLOCOM.2009. 5425315. [8] SOROUR S and VALAEE S. Completion delay minimization for instantly decodable network codes[J]. IEEE/ACM Transactions on Networking, 2015, 23(5): 1553-1567. doi: 10.1109/TNET.2014.2338053. [9] GOU L, ZHANG G, BIAN Z, et al. Minimizing completion time for relay-assisted multicast with instantly decodable network coding[J]. IEEE Communications Letters, 2016, 20(3): 434-437. doi: 10.1109/LCOMM.2016.2518163. [10] ZHAN C and XIAO F. Coding based wireless broadcast scheduling in real time applications[J]. Journal of Network and Computer Applications, 2016, 64: 194-203. doi: 10.1016/ j.jnca.2016.02.004. [11] YAN Y, ZHANG B, and LI C. Opportunistic network coding based cooperative retransmissions in D2D communications[J]. Computer Networks, 2017, 113: 72-83. doi: 10.1016/j.comnet. 2016.12.004. [12] TAJBAKHSH S E, SADEGHI P, and ABOUTORAB N. Instantly Decodable Network Codes for Cooperative Index Coding Problem over General Topologies[M]. AUSCTW, Sydney, Australia, 2014: 84-89. doi: 10.1109/AusCTW.2014. 6766433. [13] ABOUTORAB N, SADEGHI P, and TAJBAKHSH S E. Instantly decodable network coding for delay reduction in cooperative data exchange systems[C]. IEEE International Symposium on Information Theory Proceedings. Istanbul, Turkey, 2013: 3095-3099. doi: 10.1109/ISIT.2013.6620795. [14] ABOUTORAB N and SADEGHI P. Instantly decodable network coding for completion time or decoding delay reduction in cooperative data exchange systems[J]. IEEE Transactions on Vehicular Technology, 2016, 65(3): 1212-1228. doi: 10.1109/TVT.2015.2405917. [15] DOUIK A, SOROUR S, TEMBINE H, et al. A game theoretic approach to minimize the completion time of network coded cooperative data exchange[C]. Global Communications Conference. Austin, USA, 2014: 1583-1589. doi: 10.1109/GLOCOM.2014.7037034. [16] DOUIK A, SOROUR S, Al-NAFFOURI T Y, et al. Delay reduction in multi-hop device-to-device communication using network coding[C]. International Symposium on Network Coding. Sydney, Australia, 2015: 6-10. doi: 10.1109/ NETCOD.2015.7176779. [17] DOUIK A and SOROUR S. Data dissemination using instantly decodable binary codes in fog-radio access networks [C]. Wireless Communications and Mobile Computing Conference. Valencia, Spain, 2017: 604-609. doi: 10.1109/ IWCMC.2017.7986354. -
計(jì)量
- 文章訪問(wèn)數(shù): 1472
- HTML全文瀏覽量: 178
- PDF下載量: 49
- 被引次數(shù): 0