一种用于AODV建模、验证和分析的无线Mesh网络进程代数
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV
摘要：
我们提出了AWN（代数无线网络），一个过程代数量身定制的移动自组网（MANET）和无线网状网络（WMN）协议的建模。它结合了本地广播、条件单播和数据结构的新处理。在这个框架中，我们提出了一个严格的分析Ad hoc按需距离矢量（AODV）协议，一个流行的路由协议设计的移动自组网和无线网状网，和目前标准化的IETF MANET工作组的四个协议之一。我们给出了一个完整的和明确的规范，这个协议，从而正式的RFC AODV，事实标准规范，在英文散文。在这样做的时候，我们不得不做一些不明显的假设来解决规范中出现的歧义。我们的形式化模型AODV的核心功能，如路由维护和错误处理的确切细节，只省略了时间方面。进程代数使我们能够形式化和（反）证明网状网络路由协议，如循环自由和数据包传输的关键属性。我们是第一个提供了详细的AODV循环自由的证明。与使用模拟或模型检验的评估相比，我们的证明是通用的，并且适用于网络拓扑、节点移动性等方面的任何可能的网络场景。由于RFC规范的模糊性和矛盾，允许多种解释;我们显示了其中的5000多个是否是无环的，从而证明推理和证明如何能够相对容易地适用于协议变体。使用我们的正式和明确的规范，我们发现AODV的缺点，影响性能，例如，建立非最佳路线，和一些路线没有被发现在所有。我们在同一进程代数中正式改进;进行证明再次很容易。
英文摘要：
We propose AWN (Algebra for Wireless Networks), a process algebra tailored to the modelling of Mobile Ad hoc Network (MANET) and Wireless Mesh Network (WMN) protocols. It combines novel treatments of local broadcast, conditional unicast and data structures. In this framework we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET working group. We give a complete and unambiguous specification of this protocol, thereby formalising the RFC of AODV, the de facto standard specification, given in English prose. In doing so, we had to make non-evident assumptions to resolve ambiguities occurring in that specification. Our formalisation models the exact details of the core functionality of AODV, such as route maintenance and error handling, and only omits timing aspects. The process algebra allows us to formalise and (dis)prove crucial properties of mesh network routing protocols such as loop freedom and packet delivery. We are the first to provide a detailed proof of loop freedom of AODV. In contrast to evaluations using simulation or model checking, our proof is generic and holds for any possible network scenario in terms of network topology, node mobility, etc. Due to ambiguities and contradictions the RFC specification allows several interpretations; we show for more than 5000 of them whether they are loop free or not, thereby demonstrating how the reasoning and proofs can relatively easily be adapted to protocol variants. Using our formal and unambiguous specification, we find shortcomings of AODV that affect performance, e.g. the establishment of non-optimal routes, and some routes not being found at all. We formalise improvements in the same process algebra; carrying over the proofs is again easy.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
