A Lightweight Leader Election Algorithm for IoT: Cloud Storage Use Case

preprint OA: closed
View at publisher

Abstract

IoT devices in a distributed environment that work on shared data still have a necessity for a locking mechanism to safely take turns while updating shared data. However, we no longer have the notion of mutexes when working in a distributed system. That is where distributed locks and leader elections mechanisms come into the picture. In addition to its low power consumption, BROGO (Branch Optima to Global Optimum) Leader Election Algorithm offers a lot of powerful features so it is well suited for the IoT environment. This algorithm decreases energy consumption by 95\% compared with basic techniques. In this paper, we employ BROGO as a use case in the cloud storage domain.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00