Skip to Main Content
Obtaining a hierarchical organization of a network is a well-known and studied problem of distributed computing. It has been proved effective in the solution of several problems such as, minimizing the amount of storage for communication information. In this paper, we derive a clustering token-based mutual exclusion algorithm for multi-hop mobile ad hoc networks which needs O(n) broadcast rounds. Moreover our approach yields a fault-tolerant protocol.