Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

A Cross-Sectional Study on Distributed Mutual Exclusion Algorithms for Ad Hoc Networks

  • Conference paper
  • First Online:
Pattern Recognition and Data Analysis with Applications

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 888))

  • 981 Accesses

  • 11 Citations

Abstract

The mutual exclusion problem has been substantially studied in the distributed systems. Various solutions have been proposed to achieve distributed mutual exclusion till date. These solutions are exposed to different network topologies as static and dynamic ones. On a broader categorical note, ad hoc networks are the best-suited representation of dynamic networks in which node mobility is highly unpredictable. Nowadays, wireless communication is everywhere; hence, the adaptability of ad hoc networks is getting increased day by day. Through this research article, we present a cross-sectional study on various existing distributed mutual exclusion algorithms imposed on ad hoc networks and their associated network variants including their performance metrics and fault-tolerant capabilities.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Kshemkalyani, Singhal, M.: Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press (2008)

    Google Scholar 

  2. Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8, 569 (1965). https://doi.org/10.1145/365559.365617

    Article  Google Scholar 

  3. Parihar, A.S., Chakraborty, S.K.: Token-based approach in distributed mutual exclusion algorithms: a review and direction to future research. J. Supercomput. 77, 14305–14355 (2021). https://doi.org/10.1007/s11227-021-03802-8

    Article  Google Scholar 

  4. Khanna, A., Rodrigues, J.J.P.C., Gupta, N., Swaroop, A., Gupta, D., Saleem, K., de Albuquerque, V.H.C.: A mutual exclusion algorithm for flying Ad Hoc networks. Comput. Electr. Eng. 76, 82–93 (2019). https://doi.org/10.1016/j.compeleceng.2019.03.005

    Article  Google Scholar 

  5. Khanna, A., Rodrigues, J.J.P.C., Gupta, N., Swaroop, A., Gupta, D.: Local mutual exclusion algorithm using fuzzy logic for flying Ad hoc networks. Comput. Commun. 156, 101–111 (2020). https://doi.org/10.1016/j.comcom.2020.03.036

    Article  Google Scholar 

  6. Saxena, P.C., Rai, J.: A survey of permission-based distributed mutual exclusion algorithms. Comput. Stand. Interfaces 25(2), 159–181 (2003). https://doi.org/10.1016/S0920-5489(02)00105-8

    Article  Google Scholar 

  7. Benchaïba, M., Bouabdallah, A., Badache, N., Ahmed-Nacer, M.: Distributed mutual exclusion algorithms in mobile ad hoc networks. ACM SIGOPS Operating Syst. Rev. 38(1), 74–89 (2004). https://doi.org/10.1145/974104.974111

    Article  Google Scholar 

  8. Ismail, D.P.I.I., Ja’afar, M.H.F.: Mobile ad hoc network overview. Asia-Pac. Conf. Appl. Electromagnet. (2007). https://doi.org/10.1109/apace.2007.4603864

  9. Jain, M., Saxena, R.: Overview of VANET: Requirements and its routing protocols. In: 2017 International Conference on Communication and Signal Processing (ICCSP) (2017). https://doi.org/10.1109/iccsp.2017.8286742

  10. Bekmezci, İ, Sahingoz, O.K., Temel, Ş: Flying Ad-Hoc networks (FANETs): a survey. Ad Hoc Netw. 11(3), 1254–1270 (2013). https://doi.org/10.1016/j.adhoc.2012.12.004

    Article  Google Scholar 

  11. Srivastava, A., Prakash, J.: Future FANET with application and enabling techniques: Anatomization and sustainability issues. Comput. Sci. Rev. 39:100359. https://doi.org/10.1016/j.cosrev.2020.100359, ISSN 1574-0137

  12. Cevik, P., Kocaman, I., Akgul, A.S., et al.: The small and silent force multiplier: a swarm UAV electronic attack. J. Intell. Robot. Syst. 70(1–4), 595–608 (2013). https://doi.org/10.1007/s10846-012-9698-1

    Article  Google Scholar 

  13. Kerr, S.: UAE to develop fleet of drones to deliver public services. The Financ. Times World News. Retrieved 12 (2014)

    Google Scholar 

  14. Barrado, C., Messeguer, R., L´opez, J., Pastor, E., Santamaria, E., Royo, P.: Wildfire monitoring using a mixed air-ground mobile network. IEEE Pervasive Comput. 9(4), 24–32 (2010), https://doi.org/10.1109/MPRV.2010.54

  15. Sang, Q., Wu, H., Xing, L., Xie, P.: Review and comparison of emerging routing protocols in flying Ad Hoc networks. Symmetry 12, 971 (2020). https://doi.org/10.3390/sym12060971

    Article  Google Scholar 

  16. Walter, J.E., Welch, J.L., Vaidya, N.H.: A mutual exclusion algorithm for Ad Hoc mobile networks. Wireless Netw. 7, 585–600 (2001). https://doi.org/10.1023/A:1012363200403

    Article  MATH  Google Scholar 

  17. Dijkstra, E.: Self stabilization in spite of distributed control. Comm. ACM 17, 643–644 (1974). https://doi.org/10.1145/361179.361202

    Article  MATH  Google Scholar 

  18. Chen, Y., Welch, J.L.: Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks. In: Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications—DIALM ’02 (2002). https://doi.org/10.1145/570810.570815

  19. Baala, H., Flauzac, O., Gaber, J., Bui, M., El-Ghazawi, T.: A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks. J. Parallel Distrib. Comput. 63(1), 97–104 (2003). ISSN 0743-7315, https://doi.org/10.1016/S0743-7315(02)00028-X

  20. Wu, W., Cao, J., Yang, J.: A fault tolerant mutual exclusion algorithm for mobile ad hoc networks. Pervasive Mob. Comput. 4(1), 139–160 (2008). ISSN 1574-1192, https://doi.org/10.1016/j.pmcj.2007.08.001

  21. Singhal, M., Manivannan, D.: A distributed mutual exclusion algorithm for mobile computing environments. In: Proceeding of ICIIS’97, IEEE Computer Society, pp. 557–561 (1997)

    Google Scholar 

  22. Sharma, B., Bhatia, R.S., Singh, A.K.: An O(1/n) protocol for supporting distributed mutual exclusion in vehicular Ad Hoc networks. In: Nagamalai, D., Renault, E., Dhanuskodi, M. (eds.) Advances in Parallel Distributed Computing. PDCTA 2011. Communications in Computer and Information Science, vol 203. Springer, Berlin. /https://doi.org/10.1007/978-3-642-24037-9_14

  23. Wu, W., Zhang, J., Luo, A., Cao, J.: Distributed mutual exclusion algorithms for intersection traffic control. IEEE Trans. Parallel Distrib. Syst. 26(1), 65–74 (2015). https://doi.org/10.1109/TPDS.2013.2297097

    Article  Google Scholar 

  24. Lim, J., Jeong, Y.S., Park, D.S., et al.: An efficient distributed mutual exclusion algorithm for intersection traffic control. J. Supercomput. 74, 1090–1107 (2018). https://doi.org/10.1007/s11227-016-1799-3

    Article  Google Scholar 

  25. Shehu, H.A., Sharif, M.H., Ramadan, R.A.: Distributed mutual exclusion algorithms for intersection traffic problems. IEEE Access 8, 138277–138296 (2020). https://doi.org/10.1109/ACCESS.2020.3012573

    Article  Google Scholar 

  26. Joung, Y.-J.: Asynchronous group mutual exclusion. Distrib. Comput. 13, 189–206 (2000)

    Article  Google Scholar 

  27. Parihar, A.S., Prasad, D., Gautam, A.S., Chakraborty, S.K.: Proposed end-to-end automated E-voting through blockchain technology to increase voter’s turnout. In: Prateek, M., Singh, T.P., Choudhury, T., Pandey, H.M., Gia, Nhu N. (eds.) Proceedings of International Conference on Machine Intelligence and Data Science Applications. Algorithms for Intelligent Systems. Springer, Singapore (2021). https://doi.org/10.1007/978-981-33-4087-9_5

  28. Parihar, A.S., Chakraborty, S.K.: Handling of resource allocation in flying ad hoc network through dynamic graph modeling. Multimedia Tools Appl. (2022). https://doi.org/10.1007/s11042-022-11950-z

    Article  Google Scholar 

  29. Parihar, A.S., Chakraborty, S.K.: A simple R-UAV permission-based distributed mutual exclusion in FANET. Wireless Netw. (2022). https://doi.org/10.1007/s11276-022-02889-y

    Article  Google Scholar 

  30. Parihar, A.S., Chakraborty, S.K.: A new resource-sharing protocol in the light of a token-based strategy for distributed systems. Int. J. Comput. Sci. Eng. In Press (2022)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, National Institute of Technology (NIT), Jote, Arunachal Pradesh, India

    Ashish Singh Parihar & Swarnendu Kumar Chakraborty

  2. Department of Computer Science, KIET Group of Institutions, Delhi-NCR, Ghaziabad, Uttar Pradesh, India

    Ashish Singh Parihar

Authors
  1. Ashish Singh Parihar
    View author publications

    Search author on:PubMed Google Scholar

  2. Swarnendu Kumar Chakraborty
    View author publications

    Search author on:PubMed Google Scholar

Corresponding author

Correspondence to Ashish Singh Parihar .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, National Institute of Technology Arunachal Pradesh, Jote, Arunachal Pradesh, India

    Deepak Gupta

  2. Department of Computer Science and Engineering, National Institute of Technology Arunachal Pradesh, Jote, Arunachal Pradesh, India

    Rajat Subhra Goswami

  3. Department of Computer Science and Engineering, National Institute of Technology Arunachal Pradesh, Jote, Arunachal Pradesh, India

    Subhasish Banerjee

  4. Department of Mathematics, Indian Institute of Technology Indore, Indore, Madhya Pradesh, India

    M. Tanveer

  5. Department of Electrical Engineering, Indian Institute of Technology Indore, Indore, Madhya Pradesh, India

    Ram Bilas Pachori

Appendix 1

Appendix 1

N = Number of nodes in network.

€r = arrival rate of Poisson process.

µ = Maximum delay in between node-to-node communication.

ub = Upper bound limit of messages generated by a node.

T = Propagation time of a message.

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Parihar, A.S., Chakraborty, S.K. (2022). A Cross-Sectional Study on Distributed Mutual Exclusion Algorithms for Ad Hoc Networks. In: Gupta, D., Goswami, R.S., Banerjee, S., Tanveer, M., Pachori, R.B. (eds) Pattern Recognition and Data Analysis with Applications. Lecture Notes in Electrical Engineering, vol 888. Springer, Singapore. https://doi.org/10.1007/978-981-19-1520-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-1520-8_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-1519-2

  • Online ISBN: 978-981-19-1520-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics