—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rote...
Having access to accurate position information is a key requirement for many wireless sensor network applications. We present the design, implementation and evaluation of SpiderBa...
Georg Oberholzer, Philipp Sommer, Roger Wattenhofe...
— In this paper, we consider the standard state estimation problem over a congested packet-based network. The network is modeled as a queue with a single server processing the pa...
Michael Epstein, Abhishek Tiwari, Ling Shi, Richar...
Distance bounding protocols are used by nodes in wireless networks for the crucial purpose of estimating their distances to other nodes. Past efforts to analyze these protocols hav...