Advanced Search
DSpace@MIT

Browsing MIT Open Access Articles by Author "Lynch, Nancy Ann"

Research and Teaching Output of the MIT Community

Browsing MIT Open Access Articles by Author "Lynch, Nancy Ann"

Sort by: Order: Results:

  • 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 ...
  • Cornejo Collado, Alex; Lynch, Nancy Ann; Sastry, Srikanth (Association for Computing Machinery, 2012-07)
    Failure detectors - oracles that provide information about process crashes - are an important abstraction for crash tolerance in distributed systems. Although current failure-detector theory provides great generality and ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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, ...
  • Cornejo Collado, Alex; Lynch, Nancy Ann (Association for Computing Machinery, 2009)
    Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensuring the communication graph remains ...
  • Radeva, Tsvetomira; Lynch, Nancy Ann (Association for Computing Machinery (ACM), 2011)
    Partial Reversal (PR) is a link reversal algorithm which ensures that an initially directed acyclic graph (DAG) is eventually a destination-oriented DAG. While proofs exist to establish the acyclicity property of PR, they ...
  • Kuhn, Fabian; Lynch, Nancy Ann; Newport, Calvin Charles; Oshman, Rotem; Richa, Andrea (Association for Computing Machinery, 2010-07)
    Practitioners agree that unreliable links, which sometimes deliver messages and sometime do not, are an important characteristic of wireless networks. In contrast, most theoretical models of radio networks fix a static set ...
  • Cadambe, Viveck R.; Lynch, Nancy Ann; Medard, Muriel; Musial, Peter (Institute of Electrical and Electronics Engineers (IEEE), 2014-08)
    This paper considers the communication and storage costs of emulating atomic (linearizable) multi-writer multi-reader shared memory in distributed message-passing systems. The paper contains two main contributions: (1) ...
  • Cadambe, Viveck R.; Medard, Muriel; Musial, Peter; Lynch, Nancy Ann (Institute of Electrical and Electronics Engineers (IEEE), 2014-08)
    This paper considers the communication and storage costs of emulating atomic (linearizable) multi-writer multi-reader shared memory in distributed message-passing systems. The paper contains two main contributions: 1) We ...
  • Ghaffari, Mohsen; Lynch, Nancy Ann; Newport, Calvin Charles (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 ...
  • Khabbazian, Majid; Kowalski, Dariusz R.; Kuhn, Fabian; Lynch, Nancy Ann (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, ...
  • Kuhn, Fabian; Lynch, Nancy Ann; Oshman, Rotem (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 ...
  • Ghaffari, Mohsen; Musco, Cameron Nicholas; Radeva, Tsvetomira T.; Lynch, Nancy Ann (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. ...
  • Wu, Jiang; Griffeth, Nancy; Newport, Calvin Charles; Lynch, Nancy Ann (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 ...
  • Volkov, Mikhail; Cornejo Collado, Alex; Lynch, Nancy Ann; Rus, Daniela L. (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 ...
  • Halldorsson, Magnus M.; Holzer, Stephan Sebastian; Lynch, Nancy Ann (Association for Computing Machinery (ACM), 2015-07)
    We present the first algorithm that implements an abstract MAC (absMAC) layer in the Signal-to-Interference-plus-Noise-Ratio (SINR) wireless network model. We first prove that efficient SINR implementations are not possible ...
  • Khabbazian, Majid; Kuhn, Fabian; Lynch, Nancy Ann; Medard, Muriel; Parandehgheibi, Ali (Association for Computing Machinery (ACM), 2011-06)
    Most medium access control (MAC) mechanisms discard collided packets and consider interference harmful. Recent work on Analog Network Coding (ANC) suggests a different approach, in which multiple interfering transmissions ...
Open Access