Sciweavers

326 search results - page 14 / 66
» On the stability of network distance estimation
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—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...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
PODC
2010
ACM
13 years 11 months ago
Optimal gradient clock synchronization in dynamic networks
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...
IPSN
2011
Springer
12 years 11 months ago
SpiderBat: Augmenting wireless sensor networks with distance and angle information
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...
ICW
2005
IEEE
133views Communications» more  ICW 2005»
14 years 1 months ago
Estimation of Linear Stochastic Systems over a Queueing Network
— 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...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 7 months ago
Automatic analysis of distance bounding protocols
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...
Sreekanth Malladi, Bezawada Bruhadeshwar, Kishore ...