Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 50 for “"LEADER ELECTION"”.
-
Self-stabilizing leader election in dynamic networks
The leader election problem is one of the fundamental problems in distributed computing. It has applications in almost every domain. In dynamic networks, topology is expected to change frequently. An algorithm A is self-stabilizing if, starting from a completely arbitrary configuration, the network …
-
A Simulator Application for Distributed Leader Election Algorithms
… to simulate the execution of distributed leader election algorithms in a ring-network. The application was developed using Visual C# on Microsoft .NET Framework 4.5. The Distributed Algorithm Simulator consists of two major components: A Visual Simulator, which visually demonstrates the …
-
Churn-tolerant leader election on weakly-consistent membership
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms
-
An Almost Tight Lower Bound for Abortable Leader Election
… n) remote memory references (RMR) of abortable leader election in both cache coherent (CC) and distributed shared memory (DSM) models. Hence, showing a gap in the RMR complexity of abortable and non-abortable leader election, as leader election has O(1) RMR complexity [30]. Further, a small …
-
Swarm dispersion via leader election, potential fields, and counting hops.
Robot swarm dispersion is an important area of research with many applications including the deployment of sensor networks for military, search and rescue, emergency response, intruder alert, and other applications. In this work, we examine how robots with only laser data and the ability to …
-
Leader election and group management in vehicular ad hoc network
Made available in DSpace on 2016-07-07T20:27:57Z (GMT). No. of bitstreams: 2 NIE-THESIS-2016.pdf: 1423126 bytes, checksum: 93ad7bcfef8608a58f8dfd0c5d6f82c3 (MD5) LICENSE.txt: 4207 bytes, checksum: f4eaba5199e45c1f013bfc9ca795a447 (MD5) Previous issue date: 2016-04-26
-
Leader election in distributed networks using agent based self-stabilizing technique
There are many variants of leader election algorithm in distributed networks. In this research, an agent based approach to leader election in distributed networks is investigated. Agents have shown to be useful in several ways. In the theoretical perspective, agents sometime help in reducing the …
-
Mechanism design-based leader election scheme for intrusion detection in MANET
We study the leader election in the presence of selfish nodes for intrusion detection systems (IDS) in a mobile ad hoc network (MANET). To balance the resource consumption among all nodes and prolong the lifetime of a MANET, nodes with the most remaining resources should be elected as the leaders. …
-
Two algorithms for leader election and network size estimation in mobile ad hoc networks
… merge over time. We first present a deterministic leader election algorithm for asynchronous MANETs along with a correctness proof for it. Our work involves substantial modifications of an existing algorithm and its proof, and we adapt the existing algorithm to the asynchronous environment. Our …
-
Techniky ochrany proti DoS na producenty bloků v Ethereu
… pre jednorazový tajný výber lídra (Single Secret Leader Election – SSLE): WHISK (založený na premiešavaní pomocou SNARK dôkazov) a Homomorphic Sortition (využívajúci plne homomorfné šifrovanie – TFHE). Experimentálne výsledky ukazujú, že WHISK poskytuje praktický výkon vhodný na integráciu do …
-
LATENCY, CONDUCTANCE, AND THE ROLE OF CONNECTIVITY IN GRAPH PROBLEMS
… another. We study several graph problems namely leader election, information dissemination and minimum weight spanning tree (MST) construction in various different communication models and show that the time and message complexities required to solve these problems do in fact depend on the …
-
Analyzing and Improving Performance of Byzantine Fault Tolerance Consensus Protocols
… piggybacking techniques, and decentralizing leader election. We show that the techniques used in these protocols significantly improve scalability and system performance. We also investigate the effect of alternate communication topologies like ring topology in reducing communication …
-
On the security and performance of next-generation blockchains
… Bitcoin's blockchain operation into two planes: leader election and transaction serialization; HotStuff differs from Bitcoin by renovating classic Byzantine fault tolerance (BFT) consensus protocol. However, the security and performance of these protocols have not been fully explored in the …
-
Achieving Efficiency, Robustness, and Security in Distributed Computing
… of the \emph{message complexity} of the \emph{leader election} problem in diameter-two networks. We first give a simple randomized Monte-Carlo leader election algorithm that with high probability\footnote{Throughout this dissertation, we would use ``eith high probability'' or ``whp'' to mean …
-
Multi-robot Caravanning
… At the heart of our algorithm is the use of leader election to efficiently exploit the unique environmental knowledge available to each robot in order to plan paths for the group, which makes it general enough to work with robots that have heterogeneous representations of the environment. We …
-
Mechanism design and game theoretical models for intrusion detection
… (MANETs). Specifically, we are addressing the leader election in the presence of selfish nodes, the tradeoff between security and IDS's resource consumption, and the multi-fragment intrusion detection via sampling. To balance the resource consumption among all the nodes and prolong the lifetime …
-
Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation
… knowledge, (2) neighbor detection, and (3) leader election. The solutions to (1) and (3) consider a system with perfectly synchronized clocks while the solution to (2) considers a system with bounded clock drift. Services such as neighbor detection and maintaining neighbor knowledge can …
-
Self-stabilizing k-clustering in mobile ad hoc networks
… have unique IDs, and there is no designated leader. BFS-MIS-CLSTR solves three problems; it elects a leader and constructs a BFS tree for the network, constructs a minimal independent set, and finally a k-clustering. Finding a minimal k-clustering is known to be NP -hard. If the network is a …
Page 1 of 3