Search
Now showing items 1-10 of 40
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 ...
Task-Structured Probabilistic I/O Automata
(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 ...
An $\Omega(n \log n)$ Lower Bound on the Cost of Mutual Exclusion
(2006-07-23)
We prove an $\Omega(n \log n)$ lower bound on the number ofnon-busywaiting memory accesses by any deterministic algorithm solving$n$ process mutual exclusion that communicates via shared registers.The cost of the algorithm ...
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 ...
The Theory of Timed I/O Automata
(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.
The Theory of Timed I/O Automata
(2005-03-02)
This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed systems.
The Abstract MAC Layer
(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 ...
Distributed Computation in Dynamic Networks
(2009-11-10)
In this report 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 ...
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 ...