Sciweavers

1542 search results - page 287 / 309
» Adaptive Routing in Dynamic Ad Hoc Networks
Sort
View
IPSN
2007
Springer
15 years 4 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
HPDC
2005
IEEE
15 years 3 months ago
Increasing application performance in virtual environments through run-time inference and adaptation
Virtual machine distributed computing greatly simplifies the use of widespread computing resources by lowering the abstraction, benefiting both resource providers and users. Tow...
Ananth I. Sundararaj, Ashish Gupta, Peter A. Dinda
JFP
2008
72views more  JFP 2008»
14 years 10 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
SENSYS
2003
ACM
15 years 3 months ago
Integrated coverage and connectivity configuration in wireless sensor networks
An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide cont...
Xiaorui Wang, Guoliang Xing, Yuanfang Zhang, Cheny...
INFOCOM
1999
IEEE
15 years 2 months ago
Ring versus Tree Embedding for Real-time Group Multicast
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
Mario Baldi, Yoram Ofek