Advertisement

Token Based Group Local Mutual Exclusion Algorithm in MANETs

  • Ashish Khanna
  • Awadhesh Kumar Singh
  • Abhishek Swaroop
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 309)

Abstract

In this paper, a generalization of the group mutual exclusion (GME) problem based upon the concept of neighborhood has been proposed and named as group local mutual exclusion (GLME). The neighborhood is defined based upon the location of shared resources, and no synchronization is required between nodes in two different neighborhoods. A token-based solution of the GLME has also been proposed. The algorithm satisfies safety, starvation freedom, and concurrent occupancy properties. To the best of our knowledge, it is the first token-based algorithm to solve GLME problem in MANETs.

Keywords

Ad hoc network Local mutual exclusion Neighborhood Resource allocation 

References

  1. 1.
    Swaroop, A.: Efficient Group Mutual Exclusion Protocols for Message Passing Distributed Computing System doctoral diss. NIT, Kurukshetra (2009)Google Scholar
  2. 2.
    Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1(2), 115–138 (1971)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Kshemkalyani, A.D., Singhal, M.: Distributed Computing Principles, Algorithms, Systems. Cambridge University Press, Cambridge (2009)Google Scholar
  4. 4.
    Joung, Y.J.: Asynchronous group mutual exclusion. Distrib. Comput. 13(4), 189–206 (2000)CrossRefGoogle Scholar
  5. 5.
    Joung, Y.J.: The congenial talking philosopher’s problem in computer networks. Distrib. Comput. 15(3), 155–175 (2002)CrossRefGoogle Scholar
  6. 6.
    Attiya, H., Kogan, A., Welch, J.L.: Efficient and robust local mutual exclusion in mobile ad hoc networks. IEEE Trans. Mob. Comput. 9(3), 361–375 (2010)CrossRefGoogle Scholar
  7. 7.
    Kogan, A.: Efficient and Robust Local Mutual Exclusion in Mobile Adhoc Networks. In: Masters Research thesis, Technion-Israel Institute of Technology, Israel (2008)Google Scholar
  8. 8.
    Khanna, A., Singh, A.K., Swaroop, A.: A leader-based k-local mutual exclusion algorithm using token for MANETs. (Accepted) J. Inf. Eng. (JISE) Taiwan (2014)Google Scholar
  9. 9.
    Wu, A.W., Cao, J., Raynal, M.: A Generalized Mutual Exclusion Problem and Its Algorithm. In: AoxueLuo, Weigang Wu, International Conference on Parallel Processing (42), pp. 300–309 (2013)Google Scholar
  10. 10.
    Sharma, B., Bhatia, R.S., Singh. A.K.: DMX in MANETs: Major Research Trends Since 2004. In: Proceedings of the International Conference on Advances in Computing and Artificial Intelligence ACAI’11, pp. 50–55 (2011)Google Scholar
  11. 11.
    Hosseinabadi, G., Vaidya, N.H.: Exploiting Opportunistic Overhearing to Improve Performance of Mutual exclusion in Wireless Ad Hoc Networks. In: Proceeding of International Conference on Wired/Wireless Internet Communications (WWIC), pp. 162–173 (2012)Google Scholar
  12. 12.
    Parameswaran M., Hota, C.: Arbitration-based reliable distributed mutual exclusion for mobile ad hoc networks. In: Proceedings of Modelling and Optimization in Mobile, Ad Hoc & Wireless Networks, vol. 11, pp. 380–387 (2013)Google Scholar
  13. 13.
    Wu, W., Cao, J., Yang, J.: Fault tolerant mutual exclusion algorithm for mobile ad hoc networks. Pervasive Mobile Comput. 4, 139–160 (2008)CrossRefGoogle Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  • Ashish Khanna
    • 1
  • Awadhesh Kumar Singh
    • 2
  • Abhishek Swaroop
    • 3
  1. 1.MAITDelhiIndia
  2. 2.NITKurukshetraIndia
  3. 3.Galgotias UniversityGreater NoidaIndia

Personalised recommendations