Thomas Clouser

  • Citations Per Year
Learn More
We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and updates and it stabilizes in linear time. It is based on sparse 0-1 skip list. We rigorously prove the algorithm correct in the shared register model. We(More)
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate that, on average, CFR significantly outperforms the best known geometric routing algorithms in the path stretch: the speed of message delivery. Its performance approaches the(More)
We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.
We describe Emuli — a method of effectively substituting sensor data by synthetic data on physical wireless nodes (motes). The sensor application is oblivious to this substitution. Emuli generates data on demand from the application. The replies are based on the sensor model which is driven by the data pre-loaded to the mote before the experiment. Since the(More)
We present DRIFT - a total order multicast algorithm for ad hoc networks with mobile or static nodes. Due to the ad hoc nature of the network, DRIFT uses flooding for message propagation. The key idea of DRIFT is virtual flooding - a way of using unrelated message streams to propagate message causality information in order to accelerate message delivery. We(More)
Geometric routing provides a scalable and efficient way to route messages in ad hoc networks if extensive routing information is unavailable. Such algorithms require a planar graph to guarantee message delivery. The routing techniques for such guarantee usually center around the traversal of planar faces of the graph. However, in realistic wireless networks(More)
We present DRIFT1, a total ordering multicast algorithm optimized for ad hoc networks. DRIFT combines virtual flooding with a communication history ordering algorithm. Virtual flooding is a way of using unrelated message streams to propagate message causality information in order to accelerate message delivery. We review the total order multicast problem(More)
We describe Emuli - a method of replacing sensor data with a network-wide model of stimuli events. Sensor readings are generated on demand from the modeling data stored at each device. This approach allows for both repeatable and variable experimentation with a network of physical devices for existing and planned sensing modalities. We illustrate the(More)