Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Mutual Exclusion in MANETs Using Quorum Agreements

  • Research Article
  • Published:
Proceedings of the National Academy of Sciences, India Section A: Physical Sciences Aims and scope Submit manuscript

Abstract

The quorum agreement has been used in static distributed systems for numerous applications like mutual exclusion, distributed commit, and replication. The article proposes a framework to use quorum agreement in mobile ad hoc networks. The correctness proof, complexity analysis, and simulation measurements have also been presented.

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

Access this article

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Kshemkalyani AD, Singhal M (2008) Distributed computing: principles, algorithms, and systems. Cambridge University Press, NY, pp 327–336

    Book  MATH  Google Scholar 

  2. Benchaiba M et al (2004) Distributed mutual exclusion algorithms in mobile ad hoc networks: an overview. ACM SIGOPS Oper Syst Rev 38(1):74–89

    Article  Google Scholar 

  3. Sharma B, et al. (2011) DMX in MANETs: major research trends since 2004. ACM ACAI’11, pp 50–55

  4. Park VD, Corson MS (1997) A highly adaptive distributed routing algorithm for mobile wireless networks. IEEE INFOCOM’97, pp 1405–1413

  5. Barbara D, Garcia-Molina H (1986) Mutual exclusion in partitioned distributed systems. Distrib Comput 1(2):119–132

    Article  Google Scholar 

  6. Junqueira F, Marzullo K (2005) Coterie availability in sites. In: 19th international symposium on distributed computing DISC’05, LNCS, 3724:3–17

  7. Mizuno M, Neilsen ML, Rao R (1991) A token based distributed mutual exclusion algorithm based on quorum agreements. In: 11th international conference on distributed computing systems, pp 361–368

  8. Okabe A et al (2000) Spatial tessellations: concepts and applications of Voronoi diagrams. Wiley, Chichester

    Book  MATH  Google Scholar 

  9. Shamos MI, Hoey D (1975) Closest-point problems. In: 16th Annu IEEE Sympos Found Comput Sci, pp 151-162

  10. Bentley JL, Ottmann TA (1979) Algorithms for reporting and counting geometric intersections. IEEE Trans Comput 28(9):643–647

    Article  MATH  Google Scholar 

  11. Fortune SJ (1987) A sweepline algorithm for Voronoi diagrams. Algorithmica 2:153–174

    Article  MathSciNet  MATH  Google Scholar 

  12. Steenstrup M (2001) Cluster based networks, Chapter 4. In: Perkins CE (ed) Ad hoc networking. Addison-Wesley Longman Publishing Inc., Boston

    Google Scholar 

  13. Perkins CE, Belding-Royer EM, Das S (2003) Ad hoc on demand distance vector (AODV) routing. RFC 3561

  14. Naor M, Wieder U (2003) Scalable and dynamic quorum systems. In: ACM PODC, pp 114–122

  15. Ratnasamy S, et al. (2001) A scalable content-addressable network. ACM SIGCOMM, pp 161–172

  16. Ghiasi S, Srivastava A, Yang X, Sarrafzadeh M (2002) Optimal energy aware clustering in sensor networks. Sensors 2(7):258–269

    Article  Google Scholar 

  17. Jardosh A, Belding-Royer E, Almeroth K, Suri S (2003) Towards realistic mobility models for mobile ad hoc networks. In: ACM annual international conference on mobile computing and networking, MobiCom’03, pp 217–229

  18. de Berg M, van Kreveld M, Overmars M, Schwarzkopf O (2000) Computational geometry: algorithms and applications. Springer, Berlin

    Book  MATH  Google Scholar 

  19. Shamos M, Preparata F (1985) Computational geometry. Springer, Berlin

    MATH  Google Scholar 

  20. Cao M, Hadjicostis C (2003) Distributed algorithms for Voronoi diagrams and applications in ad-hoc networks. In: Technical report, UILU-ENG-03-2222-DC-210-UIUC, Coordinated Science Laboratory

  21. Thorup M, Zwick U (2001) Compact routing schemes. In: ACM symposium on parallelism in algorithms and architectures, SPAA’01, pp 1–10

  22. Honiden S, Houle M, Sommer C (2009) Balancing graph voronoi diagrams. In: 6th IEEE international symposium on Voronoi diagrams, pp 183–191

  23. Dang H, Wu H (2009) Mobility models for delay-tolerant mobile networks. In: 3rd IEEE international conference on sensor technologies and applications, SENSORCOMM ‘09, pp 55–60

  24. Doci A, Samakovitis G, Raju V (2009) Impact of mobility in ad hoc protocol design. In: 2009 WRI world congress on computer science and information engineering, 1:38–43

  25. Ghosh J, Ngo H, Qiao C (2006) Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN). In: ACM international conference on wireless communications and mobile computing, IWCMC’06, Vancouver, British Columbia, Canada, pp 551–556

  26. Kim M, Kotz D, Kim S (2006) Extracting a mobility model from real user traces. In: 25th IEEE INFOCOM, pp 1–13

  27. Lee J-K, Hou JC (2006) Modeling steady-state and transient behaviors of user mobility: formulation, analysis, and application. ACM MobiHoc’06, pp 85–96

  28. Liu G, Maguire G Jr (1995) A predictive mobility management algorithm for wireless mobile computing and communications. In: IEEE international conference on universal personal communications (ICUPC’95), Tokyo, Japan, pp 268–272

  29. Marlevi A, Danne A, Liu G (1994) Method and apparatus for detecting and predicting of mobile terminals. In: Ericsson patent No. 027500–969

  30. Prasad PS, Agrawal P (2010) Movement prediction in wireless networks using mobility traces. In: 7th IEEE consumer communications and networking conference (CCNC), pp 1–5

  31. Resta G, Santi P (2008) WiQoSM: an integrated QoS-aware mobility and user behavior model for wireless data networks. IEEE Trans Mobile Comput 7(2):187–198

    Article  Google Scholar 

  32. Su J, Chin A, Popivanova A, Goel A, de Lara E (2004) User mobility for opportunistic ad-hoc networking. In: 6th IEEE workshop on mobile computing systems and applications (WMCSA), Lake District, England, pp 41–50

  33. Tuduce C, Gross T (2005) A mobility model based on WLAN traces and its validation. In: 24th annual joint conference of the IEEE computer and communications societies, INFCOM, 1:664–674

  34. Erbas F, Garcia J-E, Jobmann K (2004) Position-based QoS routing in mobile ad hoc networks: problem statement and a novel approach. In: 23rd IEEE international performance computing and communication conference, pp 619–624

  35. Punde J, Pissinou N, Makki K (2003) On quality of service routing in ad-hoc networks. In: Proceedings of the 28th annual IEEE international conference on local computer networks (LCN’03), pp 276–278

  36. Chen I-R, Verma N (2003) Simulation study of a class of autonomous host-centric mobility prediction algorithms for wireless cellular and ad hoc networks. In: 36th Annual Simulation Symposium (ANSS’03), pp. 65–72

  37. Vetriselvi V, Parthasarathi R (2007) Trace based mobility model for ad hoc networks. In: 3rd IEEE international conference on wireless and mobile computing, networking and communications (WiMob’07), pp 1–8

  38. Dabek F, Cox R, Kaashoek F, Morris R (2004) Vivaldi: a decentralized network coordinate system. In: ACM conference on applications, technologies, architectures, and protocols for computer communications, SIGCOMM’04, Portland, Oregon, USA. pp 15–26

  39. Das S, Nandan A, Parker M, Pau G, Gerla M (2005) Grido—an architecture for a grid-based overlay network. In: 2nd IEEE international conference on quality of service in heterogeneous wired/wireless networks (QShine’05), pp 8–27

  40. Ng TSE, Zhang H (2002) Predicting Internet network distance with coordinates-based approaches. IEEE INFOCOM, pp 170–179

  41. Zhuo C, Kai L, Jun Z (2006) A novel location-based routing algorithm for mobile ad hoc networks. In: IEEE international conference on wireless communications, networking and mobile computing, WiCOM’06, pp 1–4

  42. Al-Karaki J, Kamal A (2008) Efficient virtual-backbone routing in mobile ad hoc networks. Comput Netw Int J Comput Telecommun Netw 52(2):327–350

    MATH  Google Scholar 

  43. Suzuki I, Kasami T (1985) A distributed mutual exclusion algorithm. ACM Trans Comput Syst 3(4):344–349

    Article  Google Scholar 

  44. Raynal M (1991) A simple taxonomy for distributed mutual exclusion algorithms. ACM SIGOPS 25(2):47–50

    Article  Google Scholar 

  45. Raymond K (1989) A tree-based algorithm for distributed mutual exclusion. ACM Trans Comput Syst 7(1):61–77

    Article  MathSciNet  Google Scholar 

  46. Trehel M, Naimi M (1987) A distributed algorithm for mutual exclusion based on data structures and fault tolerance. In: 6th IEEE international conference on computers and communications, pp 35–39

  47. Lamport L (1978) Time, clocks, and the ordering of events in a distributed system. Commun ACM 21(7):558–565

    Article  MATH  Google Scholar 

  48. Ricart G, Agrawala AK (1981) An optimal algorithm for mutual exclusion in computer networks. Commun ACM 24(1):9–17

    Article  MathSciNet  Google Scholar 

  49. Maekawa M (1985) A √N algorithm for mutual exclusion in decentralized systems. ACM Trans Comput Syst 3(2):145–159

    Article  Google Scholar 

  50. Makki K et al (2000) Using logical rings to solve the distributed mutual exclusion problem with fault tolerance issues. J Supercomput 16(1–2):117–132

    Article  Google Scholar 

  51. Eugster P et al (2003) The many faces of publish/subscribe. ACM Comput Surv 35(2):114–131

    Article  Google Scholar 

  52. Wang G et al (2005) Sensor relocation in mobile sensor networks. IEEE INFOCOM 4:2302–2312

    Google Scholar 

  53. Pei Y (2009) Hopping sensor relocation in rugged terrains. In: The 2009 IEEE/RSJ international conference on intelligent robots and systems, pp 3856–3861

  54. Jiang J-R (1996) A framework for fault-tolerant distributed mutual exclusion and replica control using grid structures. In: 8th international conference on parallel and distributed systems, pp 311–315

  55. Chinara S, Rath SK (2009) A survey on one-hop clustering algorithms in mobile ad hoc networks. J Netw Syst Manage 17(1–2):183–207

    Article  Google Scholar 

  56. Choi W, Woo M (2006) A distributed weighted clustering algorithm for mobile ad hoc networks. In: Advanced international conference on telecommunications and international conference on internet and web applications and services (AICT/ICIW), pp 7378

  57. Janakiraman TN, Thilak AS (2011) Design and analysis of SD_DWCA—a mobility based clustering of homogeneous MANETs. Int J Comput Netw Commun (IJCNC) 3(3):94–111

    Article  Google Scholar 

  58. Konstantopoulos C, Gavalas D, Pantziou G (2008) Clustering in mobile ad hoc networks through neighborhood stability-based mobility prediction. Comput Netw 52(9):1797–1824

    Article  MATH  Google Scholar 

  59. Xing Z, Gruenwald L, Phang KK (2008) A robust clustering algorithm for mobile ad hoc networks. In: Pierre S (ed) Handbook of research on next generation networks and ubiquitous computing, pp 1–18

  60. Yu JY, Chong PHJ (2005) A survey of clustering schemes for mobile ad hoc networks. IEEE Commun Surv Tutor First Q 7(1):32–48

    Article  Google Scholar 

  61. Chatterjee M, Das SK, Turgut D (2002) WCA: a weighted clustering algorithm for mobile ad hoc networks. Clust Comput 5(2):193–204

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIMT Kurukshetra, Kurukshetra, India

    Bharti Sharma

  2. NIT Kurukshetra, Kurukshetra, India

    Ravinder Singh Bhatia & Awadhesh Kumar Singh

Authors
  1. Bharti Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ravinder Singh Bhatia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Awadhesh Kumar Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Awadhesh Kumar Singh.

Appendices

Appendix 1

See Fig. 16.

Fig. 16
figure 16

The ‘active’ nodes have been represented by entry “1” in its location in the grid array

Full size image

Appendix 2

figure a
figure b

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sharma, B., Bhatia, R.S. & Singh, A.K. Mutual Exclusion in MANETs Using Quorum Agreements. Proc. Natl. Acad. Sci., India, Sect. A Phys. Sci. 86, 169–186 (2016). https://doi.org/10.1007/s40010-015-0246-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40010-015-0246-9

Keywords

Search

Navigation