PolyU Institutional Repository >
COMP Conference Papers & Presentations >
Please use this identifier to cite or link to this item:
|Title: ||A scalable mutual exclusion algorithm for mobile ad hoc networks|
|Authors: ||Wu, Weigang|
Mobile ad hoc network
|Issue Date: ||2005 |
|Citation: ||ICCCN 2005 : 14th International Conference on Computer Communications and Networks : 17-19 October 2005, San Diego, California USA : proceedings, p. 165-170.|
|Abstract: ||Mobile ad hoc networks (MANETs) introduce new challenges to designing algorithms for solving the distributed mutual exclusion (MUTEX) problem. In this paper we propose the first permission-based MUTEX algorithm for MANETs. In order to reduce the messages cost, the algorithm uses the so called "look-ahead" technique, which enforces MUTEX only among the hosts currently competing for the critical section (CS). We propose mechanisms to handle the "doze" mode and "disconnection" of mobile hosts. The constraint of FIFO channel, which is not feasible in MANETs, is also relaxed. Using timeout, a fault tolerance mechanism is introduced to tolerate transient link and host failures. The simulation results show that the proposed algorithm works well under various mobility levels, load levels and system scales, especially when the mobility is high or load level is low. It is also shown that the algorithm has good scalability, especially when most of the requests come from a few active hosts.|
|Rights: ||© 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Type: ||Conference Paper|
|Appears in Collections:||COMP Conference Papers & Presentations|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.