Pseudo-scheduling: A new approach to the broadcast scheduling problem
Document Type
Conference Proceeding
Date of Original Version
1-1-2013
Abstract
The broadcast scheduling problem asks how a multihop network of broadcast transceivers operating on a shared medium may share the medium in such a way that communication over the entire network is possible. This can be naturally modeled as a graph coloring problem via distance-2 coloring (L(1,1)-labeling, strict scheduling). This coloring is difficult to compute and may require a number of colors quadratic in the graph degree. This paper introduces pseudo-scheduling, a relaxation of distance-2 coloring. Centralized and decentralized algorithms that compute pseudo-schedules with colors linear in the graph degree are given and proved. © 2013 Springer-Verlag Berlin Heidelberg.
Publication Title, e.g., Journal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume
7718 LNCS
Citation/Publisher Attribution
Joseph, Shaun N. N., and Lisa C. Dipippo. "Pseudo-scheduling: A new approach to the broadcast scheduling problem." Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7718 LNCS, (2013): 93-104. doi: 10.1007/978-3-642-36092-3_11.
