Advertisement

Token-based Group Local Mutual Exclusion Algorithm in MANETs

  • Ashish Khanna
  • Awadhesh Kumar Singh
  • Abhishek Swaroop
Chapter
Part of the Signals and Communication Technology book series (SCT)

Abstract

In this paper, a generalization of the group mutual exclusion 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. The proof of correctness has also been included in the present paper. 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 dissertation, NIT, Kurukshetra, India (2009)Google Scholar
  2. 2.
    Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica. 1(2), 115–138 (1971) Google 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. 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. J. Inf. Eng. (JISE) (To appear) Taiwan (2014)Google Scholar
  9. 9.
    Luo, A., Wu, W., Cao, J., Raynal, M.: A generalized mutual exclusion problem and its algorithm. 42nd International Conference on Parallel Processing, 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. Proc. Model. Optim. Mob. Ad Hoc Wirel. Netw. 11, 380–387 (2013)Google Scholar
  13. 13.
    Wu, W., Cao, J., Yang, J.: Fault tolerant mutual exclusion algorithm for mobile ad hoc networks. Pervasive Mob. Comput. 4, 139–160 (2008)CrossRefGoogle Scholar
  14. 14.
    Tamhane, S.A., Kumar, M.: A token based distributed algorithm for supporting mutual exclusion in opportunistic networks. Pervasive Mob. Comput. 8(5), 795–809 (2012)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