Browsing Department of Electrical Engineering and Computer Sciences by Title
Now showing items 67-86 of 108
-
Neighbor discovery in mobile ad hoc networks using an abstract MAC layer
(Institute of Electrical and Electronics Engineers, 2010-01)We explore the problem of neighbor discovery in a mobile ad hoc network environment. We describe a protocol for learning about neighboring nodes in such an environment. The protocol is used for establishing and tearing ... -
Neuro-RAM unit with applications to similarity testing and compression in spiking neural networks
(2017)© Nancy Lynch, Cameron Musco, and Merav Parter;. We study distributed algorithms implemented in a simplified biologically inspired model for stochastic spiking neural networks. We focus on tradeoffs between computation ... -
On simple back-off in unreliable radio networks
(2018)© Seth Gilbert, Nancy Lynch, Calvin Newport, and Dominik Pajak. In this paper, we study local and global broadcast in the dual graph model, which describes communication in a radio network with both reliable and unreliable ... -
On the weakest failure detector ever
(Springer Berlin Heidelberg, 2009-01)Many problems in distributed computing are impossible to solve when no information about process failures is available. It is common to ask what information about failures is necessary and sufficient to circumvent some ... -
Partial Reversal Acyclicity
(2011-04-14)Partial Reversal (PR) is a link reversal algorithm which ensures that the underlying graph structure is destination-oriented and acyclic. These properties of PR make it useful in routing protocols and algorithms for solving ... -
Perspectives on the CAP Theorem
(Institute of Electrical and Electronics Engineers, 2012-02)Almost twelve years ago, in 2000, Eric Brewer introduced the idea that there is a fundamental trade-off between consistency, availability, and partition tolerance. This trade-off, which has become known as the CAP Theorem, ... -
RADON: Repairable Atomic Data Object in Networks
(2016)© Kishori M. Konwar, N. Prakash, Nancy A. Lynch, and Muriel Medard. Erasure codes offer an efficient way to decrease storage and communication costs while implementing atomic memory service in asynchronous distributed ... -
RADON: Repairable Atomic Data Object in Networks
(2017)© Kishori M. Konwar, N. Prakash, Nancy A. Lynch, and Muriel Medard. Erasure codes offer an efficient way to decrease storage and communication costs while implementing atomic memory service in asynchronous distributed ... -
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
(Springer-Verlag, 2010-09)n this paper, we present Rambo, an algorithm for emulating a read/write distributed shared memory in a dynamic, rapidly changing environment. Rambo provides a highly reliable, highly available service, even as participants ... -
Random sketching, clustering, and short-term memory in spiking neural networks
(2020)© Yael Hitron, Nancy Lynch, Cameron Musco, and Merav Parter. We study input compression in a biologically inspired model of neural computation. We demonstrate that a network consisting of a random projection step (implemented ... -
Reliably Detecting Connectivity Using Local Graph Traits
(Springer, 2010-12)Local distributed algorithms can only gather sufficient information to identify local graph traits, that is, properties that hold within the local neighborhood of each node. However, it is frequently the case that global ... -
Searching without communicating: tradeoffs between performance and selection complexity
(Springer Nature, 2017)© 2016, Springer-Verlag Berlin Heidelberg. We consider the ANTS problem (Feinerman et al.) in which a group of agents collaboratively search for a target in a two-dimensional plane. Because this problem is inspired by the ... -
Self-Stabilizing Message Routing in Mobile ad hoc Networks
(2009-01-28)We present a self-stabilizing algorithm for routing messages between arbitrary pairs of nodes in a mobile ad hoc network. Our algorithm assumes the availability of a reliable GPS service, which supplies mobile nodes with ... -
Self-Stabilizing Mobile Node Location Management and Message
(2005-08-11)We present simple algorithms for achieving self-stabilizing locationmanagement and routing in mobile ad-hoc networks. While mobile clients maybe susceptible to corruption and stopping failures, mobile networks areoften ... -
Self-stabilizing robot formations over unreliable networks
(Association for Computing Machinery, 2009-07)We describe how a set of mobile robots can arrange themselves on any specified curve on the plane in the presence of dynamic changes both in the underlying ad hoc network and in the set of participating robots. Our strategy ... -
Self-Stabilizing Task Allocation In Spite of Noise
(Association for Computing Machinery (ACM), 2020)© 2020 ACM. We study the problem of distributed task allocation by workers in an ant colony in a setting of limited capabilities and noisy environment feedback. We assume that each task has a demand that should be satisfied ... -
Simulating fixed virtual nodes for adapting wireline protocols to MANET
(Institute of Electrical and Electronics Engineers, 2009-08)The virtual node layer (VNLayer) is a programming abstraction for mobile ad hoc networks (MANETs). It defines simple virtual servers at fixed locations in a network, addressing a central problem for MANETs, which is the ... -
Special issue on DISC 2010
(Springer-Verlag, 2013-06)This special issue of Distributed Computing is based on papers that originally appeared as extended abstracts in the Proceedings of the 24th International Symposium on Distributed Computing (DISC2010), held in Cambridge, ... -
Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits
(MIT Press - Journals, 2019)© 2019 Massachusetts Institute of Technology. Winner-take-all (WTA) refers to the neural operation that selects a (typ-ically small) group of neurons from a large neuron pool. It is conjectured to underlie many of the ... -
Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems
(Institute of Electrical and Electronics Engineers (IEEE), 2016-05)Erasure codes are increasingly being studied in the context of implementing atomic memory objects in large scale asynchronous distributed storage systems. When compared with the traditional replication based schemes, erasure ...
