CORR
2008
Springer
13 years 11 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
WOWMOM
2006
ACM
14 years 5 months ago
2006
ACM
This paper analyzes the characteristics of a multi-hop 802.11b mobile ad hoc network. We present data gathered from a mobile network of 20 devices carried by test users over 5 day...