Broadcast scheduling algorithms for radio networks

Mark L. Huson, Arunabha Sen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

40 Scopus citations

Abstract

We investigate scheduling problems associated with radio networks using models based on graphs. Scheduling in networks is typically solved using graph coloring algorithms. In many cases the coloring algorithms are based on simplifying assumptions about the network structure. We show the limitations of the current models and propose modifications. The current models do not address the non-uniform transceiver/transmitter networks and they over-restrict transceiver interconnections. We develop algorithms which are more specific to the domain of radio network scheduling. We compare the performance of the earlier algorithms to our algorithms. The results are analyzed with respect to both execution time and quality of solution for networks of various sizes and densities.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Military Communications Conference MILCOM
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages647-651
Number of pages5
Volume2
StatePublished - 1995
EventProceedings of the 1995 Military Communications Conference (MILCOM). Part 1 (of 3) - San Diego, CA, USA
Duration: Nov 5 1995Nov 8 1995

Other

OtherProceedings of the 1995 Military Communications Conference (MILCOM). Part 1 (of 3)
CitySan Diego, CA, USA
Period11/5/9511/8/95

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Broadcast scheduling algorithms for radio networks'. Together they form a unique fingerprint.

  • Cite this

    Huson, M. L., & Sen, A. (1995). Broadcast scheduling algorithms for radio networks. In Proceedings - IEEE Military Communications Conference MILCOM (Vol. 2, pp. 647-651). IEEE.