Sciweavers

1687 search results - page 81 / 338
» On the complexity of scheduling in wireless networks
Sort
View
IPPS
2007
IEEE
16 years 15 days ago
Using Coroutines for RPC in Sensor Networks
This paper proposes a concurrency model which integrates the asynchronous and event-driven nature of wireless etworks with higher-level abstractions that provide a more familiar p...
Marcelo Cohen, Thiago Ponte, Silvana Rossetto, Noe...
ADAEUROPE
2006
Springer
16 years 5 days ago
Interchangeable Scheduling Policies in Real-Time Middleware for Distribution
When a middleware layer is designed for providing semi-transparent distribution facilities to real-time applications, a trade-off must be made between the expressiveness and contro...
Juan López Campos, J. Javier Gutiérr...
QSHINE
2009
IEEE
16 years 28 days ago
On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang
CCR
2004
110views more  CCR 2004»
15 years 6 months ago
Distributed scheduling policies in networks of input-queued packet switches
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
Claus Bauer
ADHOC
2007
159views more  ADHOC 2007»
15 years 6 months ago
Cross-layer adaptive control for wireless mesh networks
Abstract— This paper investigates optimal routing and adaptive scheduling in a wireless mesh network composed of mesh clients and mesh routers. The mesh clients are power constra...
Michael J. Neely, Rahul Urgaonkar