期刊文献+

Global optimum encoding packet selection mechanism based on opportunistic network coding for wireless network retransmission

Global optimum encoding packet selection mechanism based on opportunistic network coding for wireless network retransmission
原文传递
导出
摘要 Packet loss cannot be avoided in wireless network due to wireless transmission medium particularity, therefore improving retransmission efficiency is meaningful to wireless transmission. The current retransmission packet selection mechanisms based on oppornistic network coding (ONC) face low retransmission efficiency and high computational complexity problems. To these problems, an optimized encoding packet selection mechanism based on ONC in wireless network retransmission (OONCR) is proposed. This mechanism is based on mutual exclusion packets and decoding gain concepts, and makes full use of ONC advantages. The main contributions of this scheme are to control the algorithm eomplexity of the maximum encoding packets selection effectively, avoid the redundancy encoding packets due to the overlapping among encoding packets, and take the encoding packet local and global optimization problem into consideration. Retransmission efficiency is evaluated according to the computational complexity, the throughput, the retransmission redundancy ratio, and the number of average retransmission. Under the various conditions, the number of average retransmission of OONCR is mainly lower than that of other typical retransmission packet selection schemes. The average retransmission redundancy ratios of OONCR are lower about 5%-40% compared with other typical schemes. Simultaneously the computational complexity of OONCR is comparatively lower than that of other typical schemes. Packet loss cannot be avoided in wireless network due to wireless transmission medium particularity, therefore improving retransmission efficiency is meaningful to wireless transmission. The current retransmission packet selection mechanisms based on oppornistic network coding (ONC) face low retransmission efficiency and high computational complexity problems. To these problems, an optimized encoding packet selection mechanism based on ONC in wireless network retransmission (OONCR) is proposed. This mechanism is based on mutual exclusion packets and decoding gain concepts, and makes full use of ONC advantages. The main contributions of this scheme are to control the algorithm eomplexity of the maximum encoding packets selection effectively, avoid the redundancy encoding packets due to the overlapping among encoding packets, and take the encoding packet local and global optimization problem into consideration. Retransmission efficiency is evaluated according to the computational complexity, the throughput, the retransmission redundancy ratio, and the number of average retransmission. Under the various conditions, the number of average retransmission of OONCR is mainly lower than that of other typical retransmission packet selection schemes. The average retransmission redundancy ratios of OONCR are lower about 5%-40% compared with other typical schemes. Simultaneously the computational complexity of OONCR is comparatively lower than that of other typical schemes.
出处 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2017年第1期47-59,共13页 中国邮电高校学报(英文版)
基金 supported by the National Natural Science Foundation of China(61571375) the Hi-Tech Research and Development Program of China(2015AA01A705)
关键词 wireless network RETRANSMISSION network coding THROUGHPUT wireless network, retransmission, network coding, throughput
  • 相关文献

参考文献2

二级参考文献15

  • 1王丽爱,周旭东,陈崚.最大团问题研究进展及算法测试标准[J].计算机应用研究,2007,24(7):69-70. 被引量:13
  • 2Chen Ping, Liu Zhen, Qiao Xiuquan, et al. The parallel algo- rithm of clique and its application on data mining grid sys- tem[C]//Proceedings of the 2009 IEEE International Confer- ence on Network Infrastructure and Digital Content (NIDC 2009), Beijing, 2009. Washington, DC, USA: IEEE Com- puter Society, 2009: 340-343.
  • 3Jiao Qingju, Shen Hongbin. Maximum-clique algorithm: an effective method to mine large-scale co-expressed genes in arabidopsis anther[C]//Proceedings of the 30th Chinese Control Conference (CCC 2011), Yantai, China, 2011: 5650-5655.
  • 4Balaji S, Swaminathan V. A simple algorithm for maximum clique and matching protein structures[J]. International Jour- nal of Combinatorial Optimization Problems and Informatics, 2010, 1(2): 2-11.
  • 5Katayama K, Hamamoto A, Narihisa H. Solving the maximum clique problem by k-opt local search[C]//Proceedings of the 2004 ACM Symposium on Applied Computing (SAC '04), Nicosia, Cyprus, 2004. Now York, NY, USA: ACM, 2004: 1021-1025.
  • 6Regin J. Using constraint programming to solve the maximum clique problem[C]//LNCS 2833: Proceedings of the 9th Inter- national Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland, 2003. Berlin, Heidelberg: Springer-Verlag, 2003: 634-648.
  • 7Taillon P J. A new approach for solving the maximum clique problem[C]//LNCS 4041: Proceedings of the 2nd lnternational Conference on Algorithmic Aspects in Information and Management (AAIM 2006), Hong Kong, China, 2006. Ber- lin, Heidelberg: Springer-Verlag, 2006: 279-290.
  • 8Gendron B, Hertz A, St-Louis P. A sequential elimination algorithm for computing bounds on the clique number of a graph[J]. Discrete Optimization, 2008, 5(3): 615-628.
  • 9Martins E Cliques with maximum/minimum edge neighbor- hood and neighborhood density[J]. Computers and Operations Research, 2012, 39(3): 594-608.
  • 10Tomita E, Kameda T. An efficient branch-and-bound algorithm for finding a maximum clique with computational experi- ments[J]. Journal of Global Optimization, 2009, 44(2): 311-327.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部