一种新的基于网络编码的碰撞解决算法

文中提出一种叫做网络编码树算法的新的碰撞解决算法,该算法在树算法的基础上结合了网络编码技术.树算法没有充分利用碰撞的数据包,对于碰撞数据包的处理往往采用丢弃的方式.通过引入网络编码技术,可以利用碰撞的数据包带来的信息,从而提高树算法的效率和性能.通过仿真,将网络编码分裂树算法与现有的其他碰撞解决算法进行了性能比较,证实网络编码树算法大幅度地提高网络的吞吐量并降低了平均延时.

A newly proposed collision resolution algorithm based on network coding

This paper proposed a new multiple-access solving algorithm called network coding tree algorithm.It is a combination of network coding and tree algorithm.Tree algorithm does not make full use of the collision packets and these packets are often discarded.By introduction of network coding,we can effectively utilize information from the collision packets,which ultimately improve the efficiency and performance of tree algorithm.Through the simulation,it compares the performance of the network coding tree algorithm and other collision resolution algorithms.It shows that the network coding tree algorithm can achieve better throughput and reduce the delay performance.