On Achieving Local View Capacity Via Maximal Independent Graph Scheduling
From MaRDI portal
Publication:5280924
DOI10.1109/TIT.2011.2119630zbMATH Open1366.94344arXiv1004.5588MaRDI QIDQ5280924FDOQ5280924
Authors: Vaneet Aggarwal, A. Salman Avestimehr, Ashutosh Sabharwal 
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: "If we know more, we can achieve more." This adage also applies to communication networks, where more information about the network state translates into higher sumrates. In this paper, we formalize this increase of sum-rate with increased knowledge of the network state. The knowledge of network state is measured in terms of the number of hops, h, of information available to each transmitter and is labeled as h-local view. To understand how much capacity is lost due to limited information, we propose to use the metric of normalized sum-capacity, which is the h-local view sum-capacity divided by global-view sum capacity. For the cases of one and two-local view, we characterize the normalized sum-capacity for many classes of deterministic and Gaussian interference networks. In many cases, a scheduling scheme called maximal independent graph scheduling is shown to achieve normalized sum-capacity. We also show that its generalization for 1-local view, labeled coded set scheduling, achieves normalized sum-capacity in some cases where its uncoded counterpart fails to do so.
Full work available at URL: https://arxiv.org/abs/1004.5588
Deterministic scheduling theory in operations research (90B35) Channel models (including quantum) in information and communication theory (94A40)
Cited In (1)
This page was built for publication: On Achieving Local View Capacity Via Maximal Independent Graph Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280924)
