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. In this paper we present a toke- based group k-mutual exclusion algorithm for mobile ad hoc networks. The Gk-ME problem is concerned with controlling the concurrent accesses of some resources by at most k nodes with the constraint that no two distinct resources can be accessed simultaneously. The proposed algorithm is adapted from the RL algorithm. The algorithm ensures the mutual exclusion, the bounded delay, and the k-concurrent entering property.
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: 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) (2001)
Malpani, N., Welch, J.L., Vaidya, N.H.: Leader Election Algorithms for Mobile Ad Hoc Networks. In: Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications(PODC 1999), pp. 96–103 (2000)
Tseng, Y.-C.: Detecting termination by Weight-Throwing in a Faulty Distributed System. Journal of Parallel and Distributed Computing 25, 7–15 (1995)
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)
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)
Bulgannawar, S., Vaidya, N.H.: A distributed k-mutual exclusion algorithm. In: Proc. of the 15th IEEE International Conference on Distributed Computing Systems, pp. 153–160 (1995)
Chang, Y.-I., Chen, B.-H.: A generalized grid quorum strategy for k-mutual exclusion algorithm. Information Processing Letters 80, 205–212 (2001)
Fisher, M., Lynch, N., Burns, J., Borodin, A.: Ressource allocation with immunity to limited process failure. In: Proc. 20th Annual Symposium on Foundations of Computer Science, pp. 234–254 (1979)
Hadzilacos, V.: A note on group mutual exclusion. In: Proc. of the 20th ACM SIGACT-SIGOPS Symposium on Principles on Distribued Computing (2001)
Hoare, C.A.R.: Communicating sequential processes. CACM 21(2), 222–228 (1997)
Jiang, J.-R.: A group mutual exclusion algorithm for ad hoc mobile networks. In: Proc. of the 6th International Conference on Computer Science and Informatics, pp. 266–270 (2002)
Joung, Y.-J.: Quorum-based algorithms for group mutual exclusion. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, p. 16. Springer, Heidelberg (2001)
Lamport, L.: Time, clocks and the ordering of events in a distributed system. CACM 21(7), 145–159 (1978)
Manabe, Y., Aoyagi, S.: A distributed k-mutual exclusion using k-coterie. IEICE Technical Report, 93–143 (1993)
Maekawa, M.: A \(\sqrt{n}\) algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2), 145–159 (1985)
Makki, K., Banta, P., Been, K., Pissinou, N., Park, E.: A token based distributed k mutual exclusion algorithm. In: Proc. of the IEEE Symposium on Parallel and distributed Processing, pp. 408–411 (1992)
Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion algorithm in computer networks. CACM 24(1), 9–17 (1981)
Vidyasankar, K.: A highly concurrent group l-mutual exclusion algorithm. In: Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2002) (2002)
Vidyasankar, K.: A simple group mutual l-exclusion algorithm. Information Process Letters 85(2), 79–85 (2003)
Jiang, J.-R., Huang, S.-T., Kuo, Y.-C.: Cohorts structures for fault-tolerant k entries to a critical section. IEEE Transactions on Computers 48(2), 222–228 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thiare, O., Naimi, M. (2009). A Group k-Mutual Exclusion Algorithm for Mobile Ad Hoc Networks. In: Omatu, S., et al. Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living. IWANN 2009. Lecture Notes in Computer Science, vol 5518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02481-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-02481-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02480-1
Online ISBN: 978-3-642-02481-8
eBook Packages: Computer ScienceComputer Science (R0)