首页> 外文会议>International Conference on Mobile Ad-hoc and Sensor Networks(MSN 2007); 20071212-14; Beijing(CN) >A Dual-Token-Based Fault Tolerant Mutual Exclusion Algorithm for MANETs
【24h】

A Dual-Token-Based Fault Tolerant Mutual Exclusion Algorithm for MANETs

机译:基于双令牌的MANET容错互斥算法

获取原文
获取原文并翻译 | 示例

摘要

Most existing mutual exclusion algorithms for mobile ad hoc networks (MANETs) adopt a token-based approach. In traditional wired networks, timeout-based mechanisms are commonly used to detect token losses. However, in MANETs, it is difficult to set a proper timeout value due to the network dynamics. In this paper, we propose a dual-token-based mutual exclusion algorithm, which can tolerate token losses without using timeout. Two tokens are concurrently circulated in the system to monitor each other by using sequence numbers. If one token is lost, the other token can detect the loss and regenerate a new token. Simulations have been carried out to evaluate the effectiveness and performance of the proposed algorithm in comparison with the timeout-based approach. The results show that the timeout-based algorithm may falsely claim the loss of a token, thus cannot guarantee the correctness of mutual exclusion algorithms. On the contrary, our proposed algorithm can avoid false detection of token losses and satisfy all the correctness requirements of mutual exclusion, though it costs a bit more messages and longer time.
机译:用于移动自组织网络(MANET)的大多数现有互斥算法都采用基于令牌的方法。在传统的有线网络中,基于超时的机制通常用于检测令牌丢失。但是,在MANET中,由于网络动态,很难设置适当的超时值。在本文中,我们提出了一种基于双令牌的互斥算法,该算法可以在不使用超时的情况下容忍令牌丢失。两个令牌同时在系统中循环,以使用序列号相互监视。如果一个令牌丢失,则另一个令牌可以检测到丢失并重新生成新令牌。与基于超时的方法相比,已经进行了仿真以评估所提出算法的有效性和性能。结果表明,基于超时的算法可能会错误地声称丢失令牌,从而不能保证互斥算法的正确性。相反,我们提出的算法可以避免令牌丢失的错误检测,并满足互斥的所有正确性要求,尽管它会花费更多的消息和更长的时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号