论文标题
TreeExplorer：一种针对无线和临时路由应用的生根树的编码算法
TreeExplorer: a coding algorithm for rooted trees with application to wireless and ad hoc routing
论文作者
论文摘要
可以使用扎根树表示临时和无线路由协议中的路由表。在路由协议中这些树的通信和存储的不断需求需要有效的根树编码算法。该效率是根据平均代码长度来定义的，并且该算法的最优性是通过将平均代码长度与源熵进行比较来衡量的。在这项工作中，将TreeExplorer作为一种易于实现和几乎最佳的算法引入了编码生根的树结构。此方法利用树的叶子数量作为选择最佳编码方法的指标。我们展示了TreeExplorer如何改善临时和无线系统的现有路由协议，这通常需要大量的通信开销。
Routing tables in ad hoc and wireless routing protocols can be represented using rooted trees. The constant need for communication and storage of these trees in routing protocols demands an efficient rooted tree coding algorithm. This efficiency is defined in terms of the average code length, and the optimality of the algorithm is measured by comparing the average code length with the entropy of the source. In this work, TreeExplorer is introduced as an easy-to-implement and nearly optimal algorithm for coding rooted tree structures. This method utilizes the number of leaves of the tree as an indicator for choosing the best method of coding. We show how TreeExplorer can improve existing routing protocols for ad hoc and wireless systems, which normally entails a significant communication overhead.
