Browsing by Subject "distributed computing"
Now showing items 1-4 of 4
-
Average Case Analysis of a Shared Register Emulation Algorithm
Distributed algorithms are important for managing systems with multiple networked components, where each component operates independently but coordinates to achieve a common goal. Previous theoretical research has produced ... -
Bounded Protocols for Efficient Reliable Message Transmission
(2017-07-20)In the reliable message transmission problem (RMTP) processors communicate by exchanging messages, but the channel that connects two processors is subject to message loss, duplication, and reordering. Previous work focused ... -
Fault tolerant pulse synchronization
(2009-05-15)Pulse synchronization is the evolution of spontaneous firing action across a network of sensor nodes. In the pulse synchronization model all nodes across a network produce a pulse, or "fire", at regular intervals even ... -
Two algorithms for leader election and network size estimation in mobile ad hoc networks
(Texas A&M University, 2005-02-17)We develop two algorithms for important problems in mobile ad hoc networks (MANETs). A MANET is a collection of mobile processors (nodes) which communicate via message passing over wireless links. Each node can communicate ...