Browsing Department of Electrical Engineering and Computer Sciences by Title
Now showing items 34-53 of 108
-
Consensus using Asynchronous Failure Detectors
(2015-03-02)The FLP result shows that crash-tolerant consensus is impossible to solve in asynchronous systems, and several solutions have been proposed for crash-tolerant consensus under alternative (stronger) models. One popular ... -
The Cost of Global Broadcast Using Abstract MAC Layers
(2010-02-09)We analyze greedy algorithms for broadcasting messages throughout a multi-hop wireless network, using a slot-based model that includes message collisions without collision detection. Our algorithms are split formally into ... -
The cost of radio network broadcast for different models of unreliable links
(Association for Computing Machinery, 2013-07)We study upper and lower bounds for the global and local broadcast problems in the dual graph model combined with different strength adversaries. The dual graph model is a generalization of the standard graph-based radio ... -
Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems
(Public Library of Science (PLoS), 2017-12)Adaptive collective systems are common in biology and beyond. Typically, such systems require a task allocation algorithm: a mechanism or rule-set by which individuals select particular roles. Here we study the performance ... -
Decomposing Broadcast Algorithms Using Abstract MAC Layers
(2011-02-23)In much of the theoretical literature on global broadcast algorithms for wireless networks, issues of message dissemination are considered together with issues of contention management. This combination leads to complicated ... -
Decomposing broadcast algorithms using abstract mac layers
(Association for Computing Machinery, 2010-09)In much of the theoretical literature on wireless algorithms, issues of message dissemination are considered together with issues of contention management. This combination leads to complicated algorithms and analysis, ... -
Distributed Computation in Dynamic Networks
(2009-11-10)In this report we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the communication links for each round are chosen ... -
Distributed computation in dynamic networks
(Association for Computing Machinery, 2010)In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the communication links for each round are chosen ... -
Distributed House-Hunting in Ant Colonies
(Association for Computing Machinery (ACM), 2015-07)We introduce the study of the ant colony house-hunting problem from a distributed computing perspective. When an ant colony's nest becomes unsuitable due to size constraints or damage, the colony relocates to a new nest. ... -
Dynamic Input/Output Automata: a Formal and Compositional Model for Dynamic Systems
(2013-07-08)We present dynamic I/O automata (DIOA), a compositional model of dynamic systems, based on I/O automata. In our model, automata can be created and destroyed dynamically, as computation proceeds. In addition, an automaton ... -
Dynamic input/output automata: A formal and compositional model for dynamic systems
(Elsevier BV, 2016-03)We present dynamic I/O automata (DIOA), a compositional model of dynamic systems. In DIOA, automata can be created and destroyed dynamically, as computation proceeds, and an automaton can dynamically change its signature, ... -
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems
(2003-07-26)We present a mathematical state-machine model, the Dynamic I/O Automaton (DIOA) model, for defining and analyzing dynamic systems of interacting components. The systems we consider are dynamic in two senses: (1) components ... -
An efficient communication abstraction for dense wireless networks
(2017)© Magnús Halldórsson, Fabian Kuhn, Nancy Lynch, and Calvin Newport. In this paper we study the problem of developing efficient distributed algorithms for dense wireless networks. For many problems in this setting, fast ... -
Engineering the Virtual Node Layer for Reactive MANET Routing
(2011-08)The VNLayer approach simplifies software development for MANET by providing the developers an abstraction of a network divided into fixed geographical regions, each containing a virtual server for network services. In this ... -
Environment Characterization for Non-Recontaminating Frontier-Based Robotic Exploration
(Springer Berlin / Heidelberg, 2011-11)This paper addresses the problem of obtaining a concise description of a physical environment for robotic exploration. We aim to determine the number of robots required to clear an environment using non-recontaminating ... -
Fast lean erasure-coded atomic memory object
(2019)© Kishori M. Konwar, N. Prakash, Muriel Médard, and Nancy Lynch; licensed under Creative Commons License CC-BY 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). In this work, we propose ... -
GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks
(2004-02-25)We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memoryin mobile ad hoc networks. Our approach is based on associating abstract atomic objects with certain geographiclocations. ... -
How to Color a French Flag: Biologically Inspired Algorithms for Scale-Invariant Patterning
(Springer International Publishing, 2020)© 2020, Springer Nature Switzerland AG. In the French flag problem, initially uncolored cells on a grid must differentiate to become blue, white or red. The goal is for the cells to color the grid as a French flag, i.e., ... -
Impossibility of boosting distributed service resilience
(2005-02-25)We prove two theorems saying that no distributed system in whichprocesses coordinate using reliable registers and f-resilient servicescan solve the consensus problem in the presence of f+1 undetectableprocess stopping ... -
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation
(Association for Computing Machinery (ACM), 2016-07)© 2016 ACM. The focus of this paper is to understand storage costs of em- ulating an atomic shared memory over an asynchronous, dis- tributed message passing system. Previous literature has de- veloped several shared memory ...
