首页> 外文会议>Information Technology: Research and Education, 2005. ITRE 2005. 3rd International Conference on >A token-based h-out of-k distributed mutual exclusion algorithm for mobile ad hoc networks
【24h】

A token-based h-out of-k distributed mutual exclusion algorithm for mobile ad hoc networks

机译:Ad hoc网络中基于令牌的H-of-k分布式互斥算法

获取原文

摘要

Distributed mutual exclusion is a challenging problem in mobile ad hoc networks (MANETs). Due to the dynamic characteristics of MANETs, only a few algorithms have been proposed. Until recent years, these studies do not consider the more general h-out of-k mutual exclusion problem. In this paper we propose a distributed algorithm to solve the h-out of-k mutual exclusion problem in MANETs. The proposed algorithm has three benefits: (1) it improves the CS execution time by allowing at most k tokens to be concurrently dispatched; (2) it employs logical ring construction to adapt the token navigation to the system requirements; (3) it is designed with the consideration of the dynamical link formation characteristics in MANETs and is thus suitable for mobile environments. This paper shows its correctness. The proposed algorithm is also flexible for different token navigation policies to meet versatile MANET needs.
机译:分布式互斥是移动临时网络(船只)中有挑战性的问题。由于枪声的动态特性,只提出了一些算法。直到近年来,这些研究没有考虑更一般的H-out-out互斥问题。在本文中,我们提出了一种分布式算法来解决舰队中的H-Out-K互斥问题。该算法具有三个优势:(1)它通过允许大多数k令牌递分派来改善CS执行时间; (2)采用逻辑环结构,使令牌导航适应系统要求; (3)旨在考虑舰队中的动态连杆形成特性,因此适用于移动环境。本文显示了其正确性。建议的算法对于不同的令牌导航策略,也是灵活的,以满足多功能阵列需求。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号