Search
Now showing items 1-7 of 7
Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication
(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, ...
Timeout Order Abstraction for Time-Parametric Verification of Loosely Synchronized Real-Time Distributed Systems
(Artist Consortium, 2009-12)
We present timeout order abstraction (TO-abstraction), a
technique to systematically abstract a given loosely synchronized
real-time distributed system (LSRTDS) into an untimed model. We
define the subclass of LSRTDS’s ...
The abstract MAC layer
(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 ...
Self-stabilizing robot formations over unreliable networks
(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 ...
Brief announcement: Minimum spanning trees and cone-based topology control
(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 ...
Simulating fixed virtual nodes for adapting wireline protocols to MANET
(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 ...
On the weakest failure detector ever
(Springer Berlin Heidelberg, 2009-01)
Many problems in distributed computing are impossible to solve when no information about process failures is available. It is common to ask what information about failures is necessary and sufficient to circumvent some ...