We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
Abstract—A network with two sensors communicating a remote measurement to a common access point (AP) is investigated. The sensors are connected via out-of-band and finite-capaci...
Consider a set of sensors that wish to consent on the message broadcasted by a multi-antenna transmitter in the presence of white-noise jamming. The jammer’s interference introd...
Shahrokh Farahmand, Alfonso Cano, Georgios B. Gian...
— Overlay applications have used various tools to measure path properties in order to construct efficient overlay networks. Typical examples include delay measurement, connectiv...