On the performance of graph-based scheduling algorithms for packet radio networks


Many published algorithms used for scheduling transmissions in packet radio networks are based on finding maximal independent sets in an underlying graph. Such algorithms are developed under the assumptions of variations of the Protocol Interference Model, which does not take the aggregated effect of interference into consideration. We provide a… (More)
DOI: 10.1109/GLOCOM.2003.1258872

4 Figures and Tables



Citations per Year

82 Citations

Semantic Scholar estimates that this publication has 82 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics