Sciweavers

3147 search results - page 439 / 630
» Distributed averaging in dynamic networks
Sort
View
MOBICOM
2003
ACM
15 years 12 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
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...
Anand Srinivas, Eytan Modiano
PDPTA
2004
15 years 8 months ago
On the Use of NSGrid for Accurate Grid Schedule Evaluation
Abstract Computational Grids consist of a multitude of geographically distributed resources. The co-allocation of several of those resources allows for the execution of highly comp...
Bruno Volckaert, Pieter Thysebaert, Marc De Leenhe...
ICDCS
2006
IEEE
16 years 19 days ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
SENSYS
2006
ACM
16 years 16 days ago
Supporting concurrent applications in wireless sensor networks
It is vital to support concurrent applications sharing a wireless sensor network in order to reduce the deployment and administrative costs, thus increasing the usability and ef...
Yang Yu, Loren J. Rittle, Vartika Bhandari, Jason ...
206
Voted
MOBICOM
2003
ACM
15 years 12 months ago
Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED
Significant TCP unfairness in ad hoc wireless networks has been reported during the past several years. This unfairness results from the nature of the shared wireless medium and ...
Kaixin Xu, Mario Gerla, Lantao Qi, Yantai Shu