Scheduling broadcasts in wireless networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1879, Issue , 2000, Pages 290-301

  Kalyanasundaram, Bala ^a   Pruhs, Kirk ^b   Velauthapillai, Mahe ^a  

^a GEORGETOWN UNIVERSITY   (United States)

^b University of Pittsburgh   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

WIRELESS NETWORKS; ALGORITHMS;

DATA DISSEMINATION; DATA ITEMS; FIRST COME FIRST SERVED; OBJECTIVE FUNCTIONS; OFFLINE; ON-LINE ALGORITHMS; WORST-CASE ANALYSIS;

APPROXIMATION ALGORITHMS;

EID: 84927131234     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_27     Document Type: Article

References (12)

1. S. Aacharya, and S. Muthukrishnan, “Scheduling on-demand broadcasts: new metrics and algorithms”, MobiCom, 1998. also at: http://www.bell-labs.com/user/acharya/papers/mobicom98.ps.gz/.
2. D. Aksoy, and M. Franklin, “RxW: A scheduling approach for large-scale ondemand data broadcast”, INFOCOM, 1998.
3. AirMedia website, http://www.airmedia.com.
4. Y. Bartal, and S. Muthukrishnan, “Minimizing Maximum Response Time in Scheduling Broadcasts”, 558-559, SODA, 2000.
5. E. Coffman, and P. Denning, Operating Systems Theory, Prentice-Hall, 1973.
6. DirecPC website, http://www.direcpc.com.
7. Hybrid website, http://www.hybrid.com.
8. Intel intercast website, http://www.intercast.com.
9. B. Kalyanasundaram, and K. Pruhs, “Speed is as powerful as clairvoyance”, IEEE Symposium on Foundations of Computation, 214-221, 1995.
10. E. Lawler, J.K. Lenstra, A. Rinnooy Kan, and D. Shmoys, “Sequencing and Scheduling: Algorithms and Complexity”, in S. Graves, A. Rinnooy Kan, and P. Zipkin (eds.), Logistics of Production and Inventory, Handbooks in OR & MS 4, Elsevier Science, Chapter 9, 445–522, 1993.
11. S. Leonardi, and D. Raz, “Approximating total flow time on parallel machines”, ACM Symposium on Theory of Computing, 110-119, 1997.
12. C. Phillips, C. Stein, E. Torng, and J. Wein “Optimal time-critical scheduling via resource augmentation”, ACM Symposium on Theory of Computing, 140-149, 1997.