Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model

DOI10.1109/TAC.2009.2031719zbMath1367.90022OpenAlexW2106717724MaRDI QIDQ4974824

Ness B. Shroff, Xiaojun Lin, Changhee Joo

Publication date: 8 August 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2009.2031719

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference

This page was built for publication: Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model