Sciweavers

182 search results - page 9 / 37
» Approximation algorithms for time-constrained scheduling on ...
Sort
View
INFOCOM
2012
IEEE
11 years 10 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...
ICNP
1999
IEEE
13 years 12 months ago
A Distributed Scheduling Algorithm for Quality of Service Support in Multiaccess Networks
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...
Craig Barrack, Kai-Yeung Siu
IJCNN
2000
IEEE
14 years 23 hour ago
Recursive Non Linear Models for On Line Traffic Prediction of VBR MPEG Coded Video Sources
Any performance evaluation of broadband networks requires modeling of the actual network traffic. Since multimedia services and especially MPEG coded video streams are expected to...
Anastasios D. Doulamis, Nikolaos D. Doulamis, Stef...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 1 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
INFOCOM
2009
IEEE
14 years 2 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ú...