Sciweavers

1502 search results - page 22 / 301
» Node weighted scheduling
Sort
View
DSN
2007
IEEE
14 years 4 months ago
R-Sentry: Providing Continuous Sensor Services against Random Node Failures
The success of sensor-driven applications is reliant on whether a steady stream of data can be provided by the underlying system. This need, however, poses great challenges to sen...
Shengchao Yu, Yanyong Zhang
TON
2002
109views more  TON 2002»
13 years 9 months ago
Coordinated multihop scheduling: a framework for end-to-end services
In multi-hop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly, when packets inc...
Chengzhi Li, Edward W. Knightly
TMC
2010
167views more  TMC 2010»
13 years 4 months ago
Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
Ryo Sugihara, Rajesh K. Gupta
ACL
1996
13 years 11 months ago
Compilation of Weighted Finite-State Transducers from Decision Trees
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
Richard Sproat, Michael Riley
MSWIM
2009
ACM
14 years 4 months ago
Delay-throughput performance in mobile ad-hoc networks with heterogeneous nodes
In this paper, we analyze asymptotic delay-throughput performance of mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility. In particular, we consider a s...
Valentina Martina, Michele Garetto, Emilio Leonard...