这篇文章描述在一个无线网孔网络分享系统的一个合作文件的一个新模型。作者的途径是开发基于机会主义的随机的线性网络编码分享机制的一个有效、合作的文件。在这机制以内,每个节点根据合作优先级播送它的包的随机的线性联合,它根据对它的邻居节点的节点可能的贡献以一种分布式的方式被计算。与这机制,一个节点越贡献其它,节点越有机会首先恢复全部文件。这里的兴趣的表演度量标准是:延期被送到直到在一个文件的所有包所有节点,和一种理想的包尺寸,由作者能得到最小的传播延期的使用。没有随机的线性网络编码,通过广泛的模拟,作者在一个无线网孔网络把他们的机制与当前的传播进程作比较。作者发现用他们的机制,节点能合作地与更少的传播时间分享全部文件并且没有随机的线性网络,比当前的传播进程推迟。
This article describes a new model of a cooperative file sharing system in a wireless Mesh network. The authors' approach is to develop an efficient and cooperative file sharing mechanism based on opportunistic random linear Network Coding. Within this mechanism, every node transmits random linear combination of its packets according to cooperative priority, which is computed in a distributed manner according to the node-possible contribution to its neighbor nodes. With this mechanism, the more a node contributes to others, the more the node has chances to recover the entire file first. The performance metrics of interest here are: the delay until all the packets in a file have been delivered to all nodes, and an ideal packet size, by the use of which the authors can get the minimum transmission delay. Through extensive simulation the authors compare their mechanism with the current transmission process in a wireless Mesh network without random linear Network Coding. The authors found that using their mechanism, the nodes can cooperatively share the entire file with less transmission time and delay than the current transmission process without random linear network.