Abstract
A mobile ad hoc network can be defined as a network that is spontaneously deployed and is independent of any static network. The network consist of mobile nodes1 with wireless interfaces and has an arbitrary dynamic topology. The networks suffers from frequent link formation and disruption due to the mobility of the nodes. In this paper we present a token based algorithm for Group Mutual Exclusion in ad hoc mobile networks. The proposed algorithm is adapted from the RL algorithm in [1]. The algorithm requires nodes to communicate with only their current neighbors. The algorithm ensures the mutual exclusion, the bounded delay, and the concurrent entering properties.
Keywords
- Mobile Node
- Critical Section
- Mutual Exclusion
- Outgoing Link
- Bounded Delay
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Walter, J. Welch, and N. Vaidya. ”A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks,” 1998 Dial M for Mobility Workshop, Dallas TX, 1998, 15 pgs.
J. Walter, G. Cao, and M. Mohanty. ‘’A k-Mutual Exclusion Algorithm for Ad Hoc Wireless Networks,” Proceedings of the first annual Workshop on Principle of Mobile Computing (POMC 2001), August, 2001.
K.-P. Wu and Y.-J. Joung. ‘’Asynchronous group mutual exclusion in ring networks,” 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP ’99), pages 539-543, 1999.
N. Malpani, J. L. Welch, and N. H. Vaidya. ‘’Leader Election Algorithms for Mobile Ad Hoc Networks,” Proc. Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications(PODC’99), pp. 96-103, 2000.
Y.-C. Tseng. ‘’Detectint termination by Weight-Throwing in a Faulty Distributed System,” Journal of Parallel and Distributed Computing, vol. 25, 1995, pp. 7-15.
P. Keane and M. Moir. ‘’A simple local-spin group mutual exclusion algorithm.,” 18th Annual ACM Symposium on Principles of Distributed Computing (PODC’99), pages 23-32. ACM Press, 1999.
Y.-J. Joung. ‘’The congenial talking philosophers problem in computer networks (extended abstract),” 13th International Symposium on Distributed Computing -DISC’99), 1999.
Y.-J. Joung. ‘’ Asynchronous group mutual exclusion (extended abstract), ‘’ 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 51-60, 1998.
E. Gafni and D. Bertsekas. ‘’Distributed algorithms for generating loop-free in networks with frequently changing topology.,” IEEE Transactions on Communication, C-29(1):11-18, 1981.
S. Cantarell and F. Petit. ‘’Self-Stabilizing Group Mutual Exclusion for Asynchronous Rings,” 4th International Conference on Principles of Distributed Systems (OPODIS 2000), pages. 71-90, 2000.
S. Cantarell, A. K. Datta, F. Petit, and V. Villain ‘’ Token based group mutual exclusion for asynchronous rings,” 21th International Conference on Distributed Computing Systems (ICDCS( 2001), pages 691-694, 2001.
J.E. Walter and S. Kini. ‘’Mutual exclusion on multihop wireless networks,” Texas A &M Univ., College Station, TX 77843-3112, TR97-014, Dec 9, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this paper
Cite this paper
Thiare, O., Naimi, M., Gueroui, M. (2007). A Group Mutual Exclusion Algorithm for Mobile Ad Hoc Networks. In: Sobh, T. (eds) Innovations and Advanced Techniques in Computer and Information Sciences and Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6268-1_67
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6268-1_67
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6267-4
Online ISBN: 978-1-4020-6268-1
eBook Packages: EngineeringEngineering (R0)