Sciweavers

835 search results - page 101 / 167
» Scheduling to maximize participation
Sort
View
RTS
2002
111views more  RTS 2002»
14 years 11 months ago
Robust Adaptive Metrics for Deadline Assignment in Distributed Hard Real-Time Systems
Distributed real-time applications usually consist of several component tasks and must be completed by its end-to-end (E-T-E) deadline. As long as the E-T-E deadline of an applicat...
Jan Jonsson, Kang G. Shin
INFOCOM
2012
IEEE
13 years 2 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
INFOCOM
2009
IEEE
15 years 6 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
TON
2010
163views more  TON 2010»
14 years 10 months ago
Toward practical opportunistic routing with intra-session network coding for mesh networks
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
Bozidar Radunovic, Christos Gkantsidis, Peter B. K...
ICDCS
2005
IEEE
15 years 5 months ago
End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks
— The shared-medium multi-hop nature of wireless ad hoc networks poses fundamental challenges to the design of an effective resource allocation algorithm to maximize spatial reus...
Baochun Li