Ad Hoc网络中的最小进程协调检查点方案
Minimum Process Coordinated Checkpointing Scheme for Ad Hoc Networks
摘要：
无线移动自组织网络（MANET）是一种由一组移动主机组成的网络结构，这些移动主机能够在没有基站的帮助下相互通信。这使得创建一个移动分布式计算环境成为可能，同时也给分布式协议设计带来了一些新的挑战。在本文中，我们研究了一个非常基本的问题，容错问题，在移动自组网环境中，并提出了一个最小的进程协调检查点计划。由于这种新环境的潜在问题是电力不足和存储容量有限，所提出的方案试图减少为恢复而保存的信息量。在我们的算法中使用的MANET结构是分层的。该方案是基于集群路由协议（CBRP），属于层次反应式路由协议的一类。我们提出的协议是一种适用于adhoc环境的非阻塞协调检查点算法。它产生一组一致的检查点;该算法确保集群中只需要最少数量的节点来获取检查点;它使用很少的控制消息。性能分析表明，该算法优于现有的相关工作，是该领域的一个新的想法。首先，我们描述了集群的组织。然后，我们提出了一个最小的进程协调检查点计划的簇为基础的adhoc路由协议。
英文摘要：
The wireless mobile ad hoc network (MANET) architecture is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. This has made possible creating a mobile distributed computing environment and has also brought several new challenges in distributed protocol design. In this paper, we study a very fundamental problem, the fault tolerance problem, in a MANET environment and propose a minimum process coordinated checkpointing scheme. Since potential problems of this new environment are insufficient power and limited storage capacity, the proposed scheme tries to reduce the amount of information saved for recovery. The MANET structure used in our algorithm is hierarchical based. The scheme is based for Cluster Based Routing Protocol (CBRP) which belongs to a class of Hierarchical Reactive routing protocols. The protocol proposed by us is nonblocking coordinated checkpointing algorithm suitable for ad hoc environments. It produces a consistent set of checkpoints; the algorithm makes sure that only minimum number of nodes in the cluster are required to take checkpoints; it uses very few control messages. Performance analysis shows that our algorithm outperforms the existing related works and is a novel idea in the field. Firstly, we describe an organization of the cluster. Then we propose a minimum process coordinated checkpointing scheme for cluster based ad hoc routing protocols.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
