Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Proposal and comparative analysis of a voting-based election algorithm for managing service... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Intelligence Springer Journals

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

Download PDF
28 pages

Loading next page...
 
/lp/springer-journals/proposal-and-comparative-analysis-of-a-voting-based-election-algorithm-qDZ6B7NTd4
Publisher
Springer Journals
Copyright
Copyright © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. 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.
ISSN
0924-669X
eISSN
1573-7497
DOI
10.1007/s10489-023-04506-7
Publisher site
See Article on Publisher Site

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.

Journal

Applied Intelligence – Springer Journals

Published: Mar 9, 2023

Keywords: Leader election (LE); Election algorithm; Availability; Reliability; MANETs; Network lifetime

References

  • Internet of Things-enabled smart cities: State-of-the-art and future trends
    Alavi, AH; Jiao, P; Buttlar, WG
  • Multi-robot exploration in task allocation problem
    Alitappeh, RJ; Jeddisaravi, K
  • Frlle: a failure rate and load-based leader election algorithm for a bidirectional ring in distributed systems
    Biswas, A; Maurya, AK; Tripathi, AK
  • A novel leader election algorithm based on resources for ring networks
    Biswas, T; Bhardwaj, R; Ray, AK
  • A comparison of stateless position-based packet routing algorithms for fanets
    Bujari, A; Palazzi, CE; Ronzani, D
  • A survey of mobility models for ad hoc network research
    Camp, T; Boleng, J; Davies, V
  • Aspect-oriented challenges in system integration with microservices, SOA and IoT
    Cerny, T
  • A Proactive Context-Aware Service Replication Scheme for Adhoc IoT Scenarios
    Choudhury, B; Choudhury, S; Dutta, A
  • Self-stabilizing leader election in optimal space under an arbitrary scheduler
    Datta, AK; Larmore, LL; Vemula, P
  • Internet of Things (IoT), mobile cloud, cloudlet, mobile IoT, IoT cloud, fog, mobile edge, and edge emerging computing paradigms: Disambiguation and research directions
    Elazhary, H
  • Toward the improvement of traffic incident management systems using car2x technologies
    Farrag, SG; Outay, F; Yasar, AUH
  • Impossibility of distributed consensus with one faulty process
    Fischer, MJ; Lynch, NA; Paterson, MS
  • Elections in a Distributed Computing System
    Garcia-Molina, H
  • Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services
    Gilbert, S; Lynch, N
  • A context-aware architecture supporting service availability in mobile cloud computing
    Guerrero-Contreras, G; Garrido, JL; Balderas-Díaz, S
  • Specifying and implementing an eventual leader service for dynamic systems
    Larrea, M; Raynal, M; Soraluze, I
  • Anticipatory experience in everyday autonomous driving
    Lindgren, T; Fors, V; Pink, S
  • Robustness of the adaptive bellman–ford algorithm: Global stability and ultimate bounds
    Mo, Y; Dasgupta, S; Beal, J
  • A resilient leader election algorithm using aggregate computing blocks
    Mo, Y; Audrito, G; Dasgupta, S
  • Networking for IoT and applications using existing communication technology
    Mukherjee, S; Biswas, G
  • Iot data replication and consistency management in fog computing
    Naas, MI; Lemarchand, L; Raipin, P
  • Top K-leader election in mobile ad hoc networks
    Raychoudhury, V; Cao, J; Niyogi, R
  • Mobile edge computing, fog et al : A survey and analysis of security threats and challenges
    Roman, R; Lopez, J; Mambo, M
  • An adaptive super-peer selection algorithm considering peers capacity utilizing asynchronous dynamic cellular learning automata
    Saghiri, AM; Meybodi, MR
  • Data replication in mobile edge computing systems to reduce latency in internet of things
    Saranya, N; Geetha, K; Rajan, C
  • Data replication schemes in cloud computing: a survey
    Shakarami, A; Ghobaei-Arani, M; Shahidinejad, A
  • Replica selection and placement techniques on the iot and edge computing: a deep study
    Shao, ZL; Huang, C; Li, H
  • An election algorithm to ensure the high availability of leader in large mobile ad hoc networks
    Sharma, S; Singh, AK
  • Service-oriented replication strategies for improving quality-of-service in cloud computing: a survey
    Slimani, S; Hamrouni, T; Ben Charrada, F
  • Dynamic resource allocation algorithm of virtual networks in edge computing networks
    Xiao, X; Zheng, X; Jie, T
  • A survey of clustering techniques in WSNs and consideration of the challenges of applying such to 5G IoT scenarios
    Xu, L; Collier, R; O’Hare, GM
  • A novel distributed social internet of things service recommendation scheme based on lsh forest
    Yan, B; Yu, J; Yang, M
  • A comprehensive survey on the reliability of mobile wireless sensor networks: Taxonomy, challenges, and future directions
    Yue, YG; He, P
  • Distributed partition detection with dynamic replication management in a dht-based manet
    Zahid, S; Abid, SA; Shah, N
  • Novel self-adaptive routing service algorithm for application in vanet
    Zhang, D; Zhang, T; Liu, X