The week's pick
Random Articles
Reseach Article
A Novel Token based DME Algorithm in MANET
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 120 - Number 5 |
| Year of Publication: 2015 |
| Authors: Mandeep Kaur, Shabnam Sharma, Aditya Prakash |
10.5120/21225-3958
|
Mandeep Kaur, Shabnam Sharma, Aditya Prakash . A Novel Token based DME Algorithm in MANET. International Journal of Computer Applications. 120, 5 ( June 2015), 25-27. DOI=10.5120/21225-3958
Abstract
Mutual exclusion among the nodes waiting for critical resources is considered as one of the major area of research in MANET. Mutual Exclusion allows mobile nodes to share resources among them. Formation of quorum is required for delivery of data with common intermediate node in between them. While communication, data transmission between quorums, is carried out using an arbitrator that is common to both regions. The main function of arbitrator is to grant the permission to incoming requests so as to enter the CS, by forwarding incoming requests to node, that is having the the primary token, which in turn will reduce the response time, synchronization delay and message complexity.
References
- A. Derhab and N. Badache, "A distributed mutual exclusion algorithm over multi-routing protocol for mobile ad hoc networks," International Journal of Parallel, Emergent and Distributed Systems, Vol 23 no 3, June 2008, pp 197-218
- B. A. Sanders. "The Information Structure of Distributed Mutual Exclusion Algorithms". ACM Transactions on Computer Systems, 5(3):284-299, August 1987.
- G. Ricart and A. K. Agrawala, "An optimal algorithm for mutual exclusion in computer networks," Communication ACM, vol. 24, no. 1, pp. 9–17, Jan. 1981. [Online]. Available: http://doi. acm. org/10. 1145/358527. 358537
- Ichiro Suzuki and Tadao Kasami, "A distributed mutual exclusion algorithm," ACM Transactions on Computer Systems, vol. 3, no. 4, pp. 344–349, Nov. 1985
- K. Raymond, "A tree-based algorithm for distributed mutual exclusion," ACM Trans. Comput. Syst. , vol. 7, no. 1, pp. 61–77, Jan. 1989. [Online]. Available: http://doi. acm. org/10. 1145/58564. 59295
- L. Lamport, "Time, clocks, and the ordering of events in a distributed system," Communications of the ACM, Vol. 21, N°7, July 1978, pp. 558-565.
- M. Maekawa, "A n algorithm for mutual exclusion in decentralized systems," ACM Trans. Comput. Syst. , vol. 3, no. 2, pp. 145–159, May1985. [Online].
- M. Singhal and D. Manivannan, "A distributed mutual exclusion algorithm for mobile computing environments," in Intelligent Information Systems, 1997. IIS '97. Proceedings, 8-10 1997, pp. 557 –561.
- M. Singhal, "A heuristically-aided algorithm for mutual exclusion in distributed systems," IEEE Trans. On Computers Vol. 38 5, may 1989, pp. 651-662
- Y. Chang, M. Singhal, and M. Liu, " A fault tolerant algorithm for distributed mutual exclusion," In Proc. of 9th IEEE Symp. On Reliable Dist. Systems, pp. 146-154, 1990.
- Murali Parameswaran, Chittaranjan Hota, "A Novel Permission-based Reliable Distributed Mutual Exclusion Algorithm for MANETs", 978-1-4244-7202-4/10/$26. 00 ©2010 IEEE.
- W. Wu, J. Cao, and J. Yang, "A fault tolerant mutual exclusion algorithm for mobile ad hoc networks," Pervasive and Mobile Computing, Vol. 4, No 1, February 2008, pp 139-160, doi:10. 1016/j. pmcj. 2007. 08. 001.
Index Terms
Keywords