基于时间复杂度无线网络编码数据包传输优化分析  

Optimization analysis of average transmission times of coded packets in wireless network based on time complexity

作　　者：郑君[1] ZHENG Jun(School of transportation information,Shanxi College of Communication Technology,Xi’an,Shanxi 710018,China)

机构地区：[1]陕西交通职业技术学院交通信息学院,陕西西安710018

出　　处：《微型电脑应用》2020年第7期158-160,共3页Microcomputer Applications

摘　　要：为了提高无线网络中节点反馈信息丢失导致真实反馈的问题,提出了一种基于时间复杂度无线网络编码数据包传输优化方法。在进行时间复杂度分析的基础上,分析了数据包平均传输次数。开展仿真分析得到:形成更多的目的节点数后,数据包发生了更多次的传输,使数据包更易发生丢失,降低了编码的机会。保持其它各项条件恒定时,各方案性能都表现为当原始数据包数量上升后持续了下降,NCIF方案能够达到比CLIF方案更优的效果。当丢包率增大后,NCIF与CLIF方案都出现了性能降低的情况,使更多数据包需通过源节点来完成重传恢复过程。In order to improve the problem of real feedback caused by the loss of feedback information of nodes in wireless network,an optimization method of packet transmission in wireless network coding based on time complexity is proposed.On the basis of time complexity analysis,the average transmission times of data packets are analyzed.The simulation analysis shows that after the formation of more destination nodes,the packet is transmitted more times,which makes the packet more likely to be lost and reduces the chance of coding.When other conditions are kept constant,the performance of each scheme is shown as a continuous decline after the increase in the number of original packets,and the NCIF scheme can achieve better results than CLIF scheme.When packet loss rate increases,both NCIF and CLIF schemes suffer performance degradation,so that more packets need to complete the retransmission and recovery process through the source node.

关 键 词：时间复杂度 无线网络 数据包 传输优化 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]