53 search results - page 8 / 11 » Distributed averaging on digital erasure networks |
IWCMC
2010
ACM
14 years 14 days ago
2010
ACM
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...
MOBISYS
2010
ACM
13 years 9 months ago
2010
ACM
This paper develops a navigation service, called GreenGPS, that uses participatory sensing data to map fuel consumption on city streets, allowing drivers to find the most fueleffi...
MOBISYS
2007
ACM
14 years 7 months ago
2007
ACM
In this work, we investigate the use of directional antennas and beam steering techniques to improve performance of 802.11 links in the context of communication between a moving v...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...