Skip to main content
SpringerLink
Log in

Proposal and comparative analysis of a voting-based election algorithm for managing service replication in MANETs

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Novel approaches are needed to better facilitate dynamic service replication management in mobile ad-hoc networks (MANETs) and to use and apply them within current and emerging autonomous intelligent systems and the Internet of Things (IoT) paradigm. Such approaches should address the context-awareness and self-adaptation of service replication, while paying special attention to quality attributes (e.g. availability, reliability, etc.) under specific runtime changes and adverse conditions with unstable communications and network partitions. The dynamic election for a node to host a service replica in MANETs can be based on the use of leader election (LE) algorithms. In this research work, a new voting-based election algorithm for managing dynamic service replication in MANETs (namely, VOELA) is proposed. This algorithm is based upon a utility function to score node resources and features (i.e., battery level and topology position) to decide where the service replica will be activated. VOELA is compared to a previously proposed consensus-based algorithm and three other well-known leader election algorithms in terms of service availability, election algorithm reliability, coordination message usage, and network lifetime. For this comparative analysis, the ns-3 network simulator is used together with three different mobility models, namely Manhattan Grid Mobility (MGM), Random Walk Mobility (RWM) and Reference Point Group Mobility (RPGM). The VOELA algorithm demonstrates in balance the most promising results.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

Data Availability

The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.

Notes

  1. https://www.nsnam.org/

References

  1. Alavi AH, Jiao P, Buttlar WG et al (2018) Internet of Things-enabled smart cities: State-of-the-art and future trends. Measurement 129:589–606

    Article  Google Scholar 

  2. Alitappeh RJ, Jeddisaravi K (2022) Multi-robot exploration in task allocation problem. Appl Intell 52(2):2189–2211

    Article  Google Scholar 

  3. Bhalla R, Pears R, Naeem MA et al (2022) Novel method for optimizing performance in resource constrained distributed data streams. Applied Intelligence :1–19

  4. Biswas A, Maurya AK, Tripathi AK et al (2021) Frlle: a failure rate and load-based leader election algorithm for a bidirectional ring in distributed systems. J Supercomput 77(1):751–779

    Article  Google Scholar 

  5. Biswas T, Bhardwaj R, Ray AK et al (2018) A novel leader election algorithm based on resources for ring networks. Int J Commun Syst 31(10):e3583

    Article  Google Scholar 

  6. Bruzgiene R, Narbutaite L, Adomkus T (2017) MANET network in internet of things system. Ad Hoc Networks :89–114

  7. Bujari A, Palazzi CE, Ronzani D (2018) A comparison of stateless position-based packet routing algorithms for fanets. IEEE Trans Mob Comput 17(11):2468–2482

    Article  Google Scholar 

  8. Camp T, Boleng J, Davies V (2002) A survey of mobility models for ad hoc network research. Special Issue: Mobile Ad Hoc Networking – Research, Trends and Applications 2:483–502

    Google Scholar 

  9. Cerny T (2019) Aspect-oriented challenges in system integration with microservices, SOA and IoT. Enterp Inf Syst 13(4):467–489

    Article  Google Scholar 

  10. Choudhury B, Choudhury S, Dutta A (2019) A Proactive Context-Aware Service Replication Scheme for Adhoc IoT Scenarios. IEEE Trans Netw Serv Manag 16(4):1797–1811

    Article  Google Scholar 

  11. Coulouris G, Dollimore J, Kindberg T et al (2011) Distributed Systems: Concepts and Design, 5th. Addison-Wesley Publishing Company, USA

    MATH  Google Scholar 

  12. Datta AK, Larmore LL, Vemula P (2011) Self-stabilizing leader election in optimal space under an arbitrary scheduler. Theor Comput Sci 412(40):5541–5561

    Article  MathSciNet  MATH  Google Scholar 

  13. Elazhary H (2019) Internet of Things (IoT), mobile cloud, cloudlet, mobile IoT, IoT cloud, fog, mobile edge, and edge emerging computing paradigms: Disambiguation and research directions. J Netw Comput Appl 128:105–140

    Article  Google Scholar 

  14. Farrag SG, Outay F, Yasar AUH et al (2021) Toward the improvement of traffic incident management systems using car2x technologies. Pers Ubiquit Comput 25(1):163–176

    Article  Google Scholar 

  15. Fischer MJ, Lynch NA, Paterson MS (1985) Impossibility of distributed consensus with one faulty process. J ACM (JACM) 32(2):374–382

    Article  MathSciNet  MATH  Google Scholar 

  16. Garcia-Molina H (1982) Elections in a Distributed Computing System. IEEE Trans Comput C-31(1):48–59

    Article  Google Scholar 

  17. Gilbert S, Lynch N (2002) Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. Acm Sigact News 33(2):51–59

    Article  Google Scholar 

  18. Gómez-Calzado C, Lafuente A, Larrea M et al (2013) Fault-tolerant leader election in mobile dynamic distributed systems. In: 2013 IEEE 19th pacific rim international symposium on dependable computing, IEEE, pp 78–87

  19. Guerrero-Contreras G, Garrido JL, Balderas-Díaz S et al (2017a) A context-aware architecture supporting service availability in mobile cloud computing. IEEE Trans Serv Comput 10(6):956–968

    Article  Google Scholar 

  20. Guerrero-Contreras G, Garrido JL, Fórtiz MJR et al (2017b) Impact of Transmission Communication Protocol on a Self-adaptive Architecture for Dynamic Network Environments. In: Recent advances in information systems and technologies. Springer International Publishing, pp 115–124

  21. Haddar MA (2022) Sealea: Scalable and energy aware k-leaders election algorithm in iot wireless sensor networks. Wireless Personal Communications: 1–21

  22. Hong X, Gerla M, Pei G et al (1999) A Group Mobility Model for Ad Hoc Wireless Networks. In: Proceedings of the 2Nd ACM international workshop on modeling, analysis and simulation of wireless and mobile systems. ACM, MSWiM ’99, pp 53–60

  23. Jacquet P, Muhlethaler P, Clausen T et al (2001) Optimized link state routing protocol for ad hoc networks. In: Proceedings. IEEE international multi topic conference, 2001. IEEE INMIC 2001. Technology for the 21st Century., IEEE, pp 62–68

  24. Kadjouh N, Bounceur A, Bezoui M et al (2020) A dominating tree based leader election algorithm for smart cities IoT infrastructure. Mobile Networks and Applications :1–14

  25. Kordafshari MS, Gholipour M, Mosakhani M et al (2005) Modified bully election algorithm in distributed systems. In: Proceedings of the 9th wseas international conference on computers. world scientific and engineering academy and society (WSEAS), ICCOMP’05, pp 10:1–10:6

  26. Larrea M, Raynal M, Soraluze I et al (2012) Specifying and implementing an eventual leader service for dynamic systems. Int J Web Grid Serv 8(3):204–224

    Article  Google Scholar 

  27. Lindgren T, Fors V, Pink S et al (2020) Anticipatory experience in everyday autonomous driving. Pers Ubiquit Comput 24(6):747–762

    Article  Google Scholar 

  28. Menon VG, PM JP (2019) Moving From Topology-Dependent to Opportunistic Routing Protocols in Dynamic Wireless Ad Hoc Networks: Challenges and Future Directions. In: Algorithms, methods, and applications in mobile computing and communications. IGI Global, pp 1–23

  29. Mo Y, Dasgupta S, Beal J (2019) Robustness of the adaptive bellman–ford algorithm: Global stability and ultimate bounds. IEEE Trans Autom Control 64(10):4121–4136

    Article  MathSciNet  MATH  Google Scholar 

  30. Mo Y, Audrito G, Dasgupta S et al (2020) A resilient leader election algorithm using aggregate computing blocks. IFAC-PapersOnLine 53(2):3336–3341

    Article  Google Scholar 

  31. Mukherjee S, Biswas G (2018) Networking for IoT and applications using existing communication technology. Egypt Inf J 19(2):107–127

    Google Scholar 

  32. Naas MI, Lemarchand L, Raipin P et al (2021) Iot data replication and consistency management in fog computing. J Grid Comput 19(3):1–25

    Article  Google Scholar 

  33. Raychoudhury V, Cao J, Niyogi R et al (2014) Top K-leader election in mobile ad hoc networks. Pervasive Mob Comput 13:181–202

    Article  Google Scholar 

  34. Roman R, Lopez J, Mambo M (2018) Mobile edge computing, fog et al : A survey and analysis of security threats and challenges. Futur Gener Comput Syst 78:680–698

    Article  Google Scholar 

  35. Saghiri AM, Meybodi MR (2018) An adaptive super-peer selection algorithm considering peers capacity utilizing asynchronous dynamic cellular learning automata. Appl Intell 48(2):271–299

    Article  Google Scholar 

  36. Santoro N (2006) Design and analysis of distributed algorithms, vol 56. Wiley

  37. Saranya N, Geetha K, Rajan C (2020) Data replication in mobile edge computing systems to reduce latency in internet of things. Wirel Pers Commun 112(4):2643–2662

    Article  Google Scholar 

  38. Saravanan K, Julie EG, Robinson YH (2019) Smart cities & IoT: evolution of applications, architectures & technologies, present scenarios & future dream. In: Internet of things and big data analytics for smart generation. Springer, pp 135–151

  39. Shakarami A, Ghobaei-Arani M, Shahidinejad A et al (2021) Data replication schemes in cloud computing: a survey. Clust Comput 24(3):2545–2579

    Article  Google Scholar 

  40. Shao ZL, Huang C, Li H (2021) Replica selection and placement techniques on the iot and edge computing: a deep study. Wirel Netw 27(7):5039–5055

    Article  Google Scholar 

  41. Sharma S, Singh AK (2018) An election algorithm to ensure the high availability of leader in large mobile ad hoc networks. Int J Parallel Emergent Distrib Syst 33(2):172–196

    Article  Google Scholar 

  42. Silva M, Teles A, Lopes R et al (2020) Neighborhood-aware mobile hub: An edge gateway with leader election mechanism for internet of mobile things. Mobile Networks and Applications :1–14

  43. Slimani S, Hamrouni T, Ben Charrada F (2021) Service-oriented replication strategies for improving quality-of-service in cloud computing: a survey. Clust Comput 24(1):361–392

    Article  Google Scholar 

  44. Universal Mobile Telecommunicatios System (UMTS) (1998) Selection procedures for the choice of radio transmission technologies of the UMTS. Tech. rep., European Telecommunications Standards Institute (ETSI)

  45. Vasudevan S, Kurose J, Towsley D (2004) Design and analysis of a leader election algorithm for mobile ad hoc networks. In: Proceedings of the 12th IEEE international conference on network protocols, 2004. ICNP 2004. IEEE, pp 350–360

  46. Xiao X, Zheng X, Jie T (2021) Dynamic resource allocation algorithm of virtual networks in edge computing networks. Pers Ubiquit Comput 25(3):571–586

    Article  Google Scholar 

  47. Xu L, Collier R, O’Hare GM (2017) A survey of clustering techniques in WSNs and consideration of the challenges of applying such to 5G IoT scenarios. IEEE Int Things J 4(5):1229–1249

    Article  Google Scholar 

  48. Yan B, Yu J, Yang M et al (2021) A novel distributed social internet of things service recommendation scheme based on lsh forest. Pers Ubiquit Comput 25(6):1013–1026

    Article  Google Scholar 

  49. Yue YG, He P (2018) A comprehensive survey on the reliability of mobile wireless sensor networks: Taxonomy, challenges, and future directions. Inf Fusion 44:188–204

    Article  Google Scholar 

  50. Zahid S, Abid SA, Shah N et al (2018) Distributed partition detection with dynamic replication management in a dht-based manet. IEEE Access 6:18,731–18,746

    Article  Google Scholar 

  51. Zhang D, Zhang T, Liu X (2019) Novel self-adaptive routing service algorithm for application in vanet. Appl Intell 49(5):1866–1879

    Article  Google Scholar 

Download references

Acknowledgements

This research work is funded by the Spanish Ministry of Science and Innovation through the project Ref. PID2019-109644RB-I00 / SRA (State Research Agency) / 10.13039 / 501100011033 and the Program of Promotion and Development of Research Activity of the University of Cádiz (Programa de Fomento e Impulso de la actividad Investigadora de la Universidad de Cádiz).

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Cadiz, Avda. de la Universidad de Cádiz 10, Puerto Real, 11519, Cádiz, Spain

    Gabriel Guerrero-Contreras & Sara Balderas-Díaz

  2. Department of Software Engineering, Computer Sciences School, University of Granada, C/ Periodista Daniel Saucedo Aranda s/n, 18014, Granada, Spain

    José Luis Garrido & María José Rodríguez-Fórtiz

  3. School of Computer Science and Statistics, Trinity College Dublin, College Green, Dublin 2, Dublin, D02 PN40, Ireland

    Gregory M. P. O’Hare

Authors
  1. Gabriel Guerrero-Contreras
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sara Balderas-Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José Luis Garrido
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. María José Rodríguez-Fórtiz
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Gregory M. P. O’Hare
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gabriel Guerrero-Contreras.

Ethics declarations

Conflict of Interests

On behalf of all authors, the corresponding author states that there is no conflict of interest.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Guerrero-Contreras, G., Balderas-Díaz, S., Garrido, J.L. et al. Proposal and comparative analysis of a voting-based election algorithm for managing service replication in MANETs. Appl Intell 53, 19563–19590 (2023). https://doi.org/10.1007/s10489-023-04506-7

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-023-04506-7

Keywords

Search

Navigation