Browsing Department of Electrical Engineering and Computer Sciences by Title

Now showing items 78-97 of 108

    • Searching without communicating: tradeoffs between performance and selection complexity 

      Lenzen, Christoph; Lynch, Nancy; Newport, Calvin; Radeva, Tsvetomira (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 

      Lynch, Nancy; Lahiani, Limor; Dolev, Shlomi; Nolte, Tina (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 

      Dolev, Shlomi; Lahiani, Limor; Lynch, Nancy; Nolte, Tina (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 

      Gilbert, Seth; Lynch, Nancy Ann; Mitra, Sayan; Nolte, Tina (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 

      Dornhaus, Anna; Lynch, Nancy; Mallmann-Trenn, Frederik; Pajak, Dominik; Radeva, Tsvetomira (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 

      Wu, Jiang; Griffeth, Nancy; Droms, Ralph; Lynch, Nancy Ann; Newport, Calvin Charles (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 

      Shvartsman, Alexander A.; Lynch, Nancy Ann (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 

      Su, Lili; Chang, Chia-Jung; Lynch, Nancy (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 

      Kantor, Erez; Schwarzmann, Alexander A.; Konwar, Kishori Mohan; Prakash, N.; Lynch, Nancy Ann; e.a. (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 ...

    • Structuring Unreliable Radio Networks 

      Censor-Hillel, Keren; Lynch, Nancy Ann; Newport, Calvin Charles (Association for Computing Machinery (ACM), 2011)
      In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types of links: reliable, which always deliver ...

    • Structuring Unreliable Radio Networks 

      Censor-Hillel, Keren; Gilbert, Seth; Kuhn, Fabian; Lynch, Nancy; Newport, Calvin (2011-12-22)
      In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model. This model includes two types of links: reliable links, which always deliver ...

    • Superconducting Nanowire Spiking Element for Neural Networks 

      Toomey, E; Segall, K; Castellani, M; Colangelo, M; Lynch, N; e.a. (American Chemical Society (ACS), 2020)
      © 2020 American Chemical Society. All rights reserved. As the limits of traditional von Neumann computing come into view, the brain's ability to communicate vast quantities of information using low-power spikes has become ...

    • Systematic Removal of Nondeterminism for Code Generation in I/O Automata 

      Vaziri, Mandana; Tauber, Joshua A.; Tsai, Michael J.; Lynch, Nancy (2004-07-19)
      The Input/Output (I/O) automaton model developed by Lynch and Tuttle models components in asynchronous concurrentsystems as labeled transition systems. IOA is a precise language for describing I/O automata and for stating ...

    • Task Allocation in Ant Colonies 

      Cornejo, Alejandro; Dornhaus, Anna; Nagpal, Radhika; Lynch, Nancy Ann (Springer-Verlag, 2014-08)
      In this paper we propose a mathematical model for studying the phenomenon of division of labor in ant colonies. Inside this model we investigate how simple task allocation mechanisms can be used to achieve an optimal ...

    • Task-Structured Probabilistic I/O Automata 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2009.)
      Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit both probabilistic and nondeterministic choices. In order to use these frameworks to express claims about probabilities of ...

    • Task-Structured Probabilistic I/O Automata 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2006-03-31)
      In the Probabilistic I/O Automata (PIOA) framework, nondeterministicchoices are resolved using perfect-information schedulers,which are similar to history-dependent policies for Markov decision processes(MDPs). These ...

    • Task-structured probabilistic I/O automata 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (Elsevier BV, 2018)
      © 2017 Elsevier Inc. Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit both probabilistic and nondeterministic choices. In order to use these frameworks to express claims ...

    • Task-Structured Probabilistic I/O Automata 

      Canetti,, Ran; Cheung,, Ling; Kaynar,, Dilsun; Liskov,, Moses; Lynch,, Nancy; e.a. (2006-09-05)
      Modeling frameworks such as Probabilistic I/O Automata (PIOA) andMarkov Decision Processes permit both probabilistic andnondeterministic choices. In order to use such frameworks to express claims about probabilities of ...

    • The abstract MAC layer 

      Kuhn, Fabian; Lynch, Nancy; Newport, Calvin (Springer Nature America, Inc, 2011)
      A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an abstract MAC layer. This service provides reliable local ...

    • The Theory of Timed I/O Automata 

      Kaynar, Dilsun K.; Lynch, Nancy; Segala, Roberto; Vaandrager, Frits (2003-08-27)
      Revised version -- November 23, 2004.This paper presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed systems.