2002/11/19 by M.L. Huson, A. Sen · 3 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Interconnection Networks and Systems #Advanced Wireless Network Optimization #Computer science #Transceiver #Scheduling (production processes) #Transmitter #Graph coloring #Algorithm #Radio networks #Distributed computing #Graph #Computer network #Theoretical computer science #Wireless network #Mathematical optimization #Wireless #Telecommunications #Mathematics
paper · doi:10.1109/milcom.1995.483546
openalex publication_date 2002/11/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
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 nonuniform 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.