Now showing items 1-20 of 107

    • A Reliable Broadcast Scheme for Sensor Networks 

      Livadas, Carolos; Lynch, Nancy A. (2003-08-11)
      In this short technical report, we present a simple yet effective reliable broadcast protocol for sensor networks. This protocol disseminates packets throughout the sensor network by flooding and recovers from losses ...
    • The Abstract MAC Layer 

      Kuhn, Fabian; Newport, Calvin; Lynch, Nancy (2009-05-11)
      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 abstract MAC layer 

      Kuhn, Fabian; Lynch, Nancy Ann; Newport, Calvin Charles (Association for Computing Machinery, 2009-09)
      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 abstract MAC layer 

      Kuhn, Fabian; Lynch, Nancy Ann; Newport, Calvin Charles (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 Abstract MAC Layer 

      Kuhn, Fabian; Lynch, Nancy; Newport, Calvin (2010-08-26)
      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 ...
    • Ant-inspired density estimation via random walks 

      Musco, Cameron Nicholas; Su, Hsin-Hao; Lynch, Nancy Ann (National Academy of Sciences (U.S.), 2017-10)
      Many ant species use distributed population density estimation in applications ranging from quorum sensing, to task allocation, to appraisal of enemy colony strength. It has been shown that ants estimate local population ...
    • Ant-Inspired Dynamic Task Allocation via Gossiping 

      Su, Hsin-Hao; Su, Lili; Dornhaus, Anna; Lynch, Nancy (Springer Nature, 2017)
      © Springer International Publishing AG 2017. We study the distributed task allocation problem in multi-agent systems, where each agent selects a task in such a way that, collectively, they achieve a proper global task ...
    • Ant-Inspired Dynamic Task Allocation via Gossiping 

      Su, Hsin-Hao; Su, Lili; Dornhaus, Anna; Lynch, Nancy Ann (Springer Nature, 2017)
      © Springer International Publishing AG 2017. We study the distributed task allocation problem in multi-agent systems, where each agent selects a task in such a way that, collectively, they achieve a proper global task ...
    • ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage 

      Nicolaou, Nicolas; Cadambe, Viveck; Prakash, N.; Konwar, Kishori; Medard, Muriel; e.a. (Institute of Electrical and Electronics Engineers (IEEE), 2019-10)
      © 2019 IEEE. Emulating a shared atomic, read/write storage system is a fundamental problem in distributed computing. Replicating atomic objects among a set of data hosts was the norm for traditional implementations (e.g., ...
    • ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage 

      Nicolaou, Nicolas; Cadambe, Viveck; Prakash, N; Konwar, Kishori; Medard, Muriel; e.a. (Institute of Electrical and Electronics Engineers (IEEE), 2019)
      © 2019 IEEE. Emulating a shared atomic, read/write storage system is a fundamental problem in distributed computing. Replicating atomic objects among a set of data hosts was the norm for traditional implementations (e.g., ...
    • Asynchronous Failure Detectors 

      Cornejo, Alejandro; Lynch, Nancy; Sastry, Srikanth (2013-01-30)
      Failure detectors -- oracles that provide information about process crashes -- are an important abstraction for crash tolerance in distributed systems. The generality of failure-detector theory, while providing great ...
    • Asynchronous Failure Detectors 

      Cornejo, Alejandro; Lynch, Nancy; Sastry, Srikanth (2013-10-10)
      Failure detectors -- oracles that provide information about process crashes -- are an important abstraction for crash tolerance in distributed systems. The generality of failure-detector theory, while providing great ...
    • Automated Formal Verification of the DHCP Failover Protocol Using Timeout Order Abstraction 

      Umeno, Shinya; Lynch, Nancy Ann (Institute of Electrical and Electronics Engineers (IEEE), 2010-11)
      In this paper, we present automated formal verification of the DHCP Failover protocol. We conduct bounded model-checking for the protocol using Timeout Order Abstraction (TO-Abstraction), a technique to abstract a given ...
    • Bounded-Contention Coding for Wireless Networks in the High SNR Regime 

      Censor-Hillel, Keren; Haeupler, Bernhard; Lynch, Nancy Ann; Medard, Muriel (Springer-Verlag, 2012)
      Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ...
    • Bounded-Contention Coding for Wireless Networks in the High SNR Regime 

      Censor-Hillel, Keren; Haeupler, Bernhard; Lynch, Nancy; Medard, Muriel (2012-08-27)
      Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ...
    • Bounded-Contention Coding for wireless networks in the high SNR regime 

      Censor-Hillel, Keren; Haeupler, Bernhard; Lynch, Nancy Ann; Medard, Muriel (2015-04)
      Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ...
    • Bounds on Contention Management in Radio Networks 

      Ghaffari, Mohsen; Haeupler, Bernhard; Newport, Calvin Charles; Lynch, Nancy Ann (Springer-Verlag, 2012)
      The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two well-studied ...
    • Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication 

      Newport, Calvin Charles; Kuhn, Fabian; Lynch, Nancy Ann (Association for Computing Machinery, 2009)
      We prove two broadcast lower bounds for a wireless network model that includes unreliable links. For deterministic algorithms, we show n − 1 rounds are required, where n is the number of processes. For randomized algorithms, ...
    • Brief announcement: Integrating temporal information to spatial information in a neural circuit 

      Lynch, Nancy Ann; Wang, Mien Brabeeba (2019)
      © Nancy Lynch and Mien Brabeeba Wang. In this paper, we consider networks of deterministic spiking neurons, firing synchronously at discrete times. We consider the problem of translating temporal information into spatial ...
    • Brief announcement: Integrating temporal information to spatial information in a neural circuit 

      Lynch, N; Wang, MB (2019)
      © Nancy Lynch and Mien Brabeeba Wang. In this paper, we consider networks of deterministic spiking neurons, firing synchronously at discrete times. We consider the problem of translating temporal information into spatial ...