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 nodes 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]. We utilizes also the concept used in [6] to detect that all the nodes concurrently accessing the same resource have terminated their tasks (concurrent entering). The algorithm ensures the mutual exclusion, the bounded delay, and the concurrent entering properties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Walter, J., Welch, J., Vaidya, N.: A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks. In: 1998 Dial M for Mobility Workshop, Dallas TX, 15 p. (1998)
Walter, J., Cao, G., Mohanty, M.: A k-Mutual Exclusion Algorithm for Ad Hoc Wireless Networks. In: Proceedings of the First Annual Workshop on Principle of Mobile Computing, POMC 2001 (August 2001)
Wu, K.-P., Joung, Y.-J.: Asynchronous group mutual exclusion in ring networks. In: 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP 1999), pp. 539–543 (1999)
Malpani, N., Welch, J.L., Vaidya, N.H.: Leader Election Algorithms for Mobile Ad Hoc Networks. In: Proc. Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (PODC 1999), pp. 96–103 (2000)
Tseng, Y.-C.: Detectint termination by Weight-Throwing in a Faulty Distributed System. Journal of Parallel and Distributed Computing 25, 7–15 (1995)
Keane, P., Moir, M.: A simple local-spin group mutual exclusion algorithm. In: 18th Annual ACM Symposium on Principles of Distributed Computing (PODC 1999), pp. 23–32. ACM Press (1999)
Joung, Y.-J.: The Congenial Talking Philosophers Problem in Computer Networks (Extended Abstract). In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 195–211. Springer, Heidelberg (1999)
Joung, Y.-J.: Asynchronous group mutual exclusion (extended abstract). In: 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 51–60 (1998)
Gafni, E., Bertsekas, D.: Distributed algorithms for generating loop-free in networks with frequently changing topology. IEEE Transactions on Communication C-29(1), 11–18 (1981)
Cantarell, S., Petit, F.: Self-Stabilizing Group Mutual Exclusion for Asynchronous Rings. In: 4th International Conference on Principles of Distributed Systems (OPODIS 2000), pp. 71–90 (2000)
Cantarell, S., Datta, A.K., Petit, F., Villain, V.: Token based group mutual exclusion for asynchronous rings. In: 21th International Conference on Distributed Computing Systems (ICDCS 2001), pp. 691–694 (2001)
Walter, J.E., Kini, S.: Mutual exclusion on multihop wireless networks, Texas A&M Univ., College Station, TX 77843-3112, TR97-014 (December 9, 1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thiare, O. (2012). A Token-Based Group Mutual Exclusion Algorithm for MANETs. In: Kim, Th., Ko, Ds., Vasilakos, T., Stoica, A., Abawajy, J. (eds) Computer Applications for Communication, Networking, and Digital Contents. FGCN 2012. Communications in Computer and Information Science, vol 350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35594-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-35594-3_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35593-6
Online ISBN: 978-3-642-35594-3
eBook Packages: Computer ScienceComputer Science (R0)