417 search results - page 70 / 84 » A randomized algorithm for the joining protocol in dynamic d... |
SIGMETRICS
2003
ACM
14 years 2 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
IPSN
2011
Springer
13 years 4 days ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
MIDDLEWARE
2004
Springer
14 years 2 months ago
2004
Springer
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
MOBICOM
2003
ACM
14 years 2 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...