Search
Now showing items 1-10 of 16
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 ...
Reliably Detecting Connectivity using Local Graph Traits
(2010-09-09)
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 ...
Broadcasting in Unreliable Radio Networks
(2010-06-08)
Practitioners agree that unreliable links, which fluctuate between working and not working, are an important characteristic of wireless networks. In contrast, most theoretical models of radio networks fix a static set of ...
MAC Design for Analog Network Coding
(2010-08-02)
Most medium access control mechanisms discard collided packets and consider interference harmful. Recent work on Analog Network Coding (ANC) suggests a different approach, in which multiple interfering transmissions are ...
Structuring Unreliable Radio Networks
(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 ...
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 ...
A (Truly) Local Broadcast Layer for Unreliable Radio Networks
(2015-05-18)
In this paper, we implement an efficient local broadcast service for the dual graph model, which describes communication in a radio network with both reliable and unreliable links. Our local broadcast service offers ...
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
(2014-08-01)
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 three main contributions: (1) ...
Coded Emulation of Shared Atomic Memory for Message Passing Architectures
(2013-07-17)
This paper considers the communication and storage costs of emulating atomic (linearizable) read/write shared memory in distributed message-passing systems. We analyze the costs of previously-proposed algorithms by Attiya, ...
Leader Election Using Loneliness Detection
(2011-10-12)
We consider the problem of leader election (LE) in single-hop radio networks with synchronized time slots for transmitting and receiving messages. We assume that the actual number n of processes is unknown, while the size ...