Sciweavers

460 search results - page 76 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
ISLPED
2003
ACM
138views Hardware» more  ISLPED 2003»
14 years 29 days ago
An environmental energy harvesting framework for sensor networks
Energy constrained systems such as sensor networks can increase their usable lifetimes by extracting energy from their environment. However, environmental energy will typically no...
Aman Kansal, Mani B. Srivastava
OSDI
2008
ACM
14 years 8 months ago
Probabilistic Inference in Queueing Networks
Although queueing models have long been used to model the performance of computer systems, they are out of favor with practitioners, because they have a reputation for requiring u...
Charles A. Sutton, Michael I. Jordan
MOBICOM
2006
ACM
14 years 1 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
EDBT
2008
ACM
102views Database» more  EDBT 2008»
14 years 7 months ago
Summary management in P2P systems
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffici...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...