Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities

DOI10.1109/18.737513zbMath0934.94009OpenAlexW2123097741MaRDI QIDQ4701210

David N. C. Tse, S. V. Hanly

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/215b6de40a43315b77c20a8a75fcd704ca48aea8

zbMATH Keywords

capacityGaussian noisepolymatroidcapacity regionfading channelmultiaccesssuccessive cancellation

Mathematics Subject Classification ID

Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40)

Related Items (9)

Polymatroid Prophet Inequalities ⋮ Delay-optimal scheduling for two-hop relay networks with randomly varying connectivity: join the shortest queue-longest connected queue policy ⋮ Capacity and fairness of the multiple access channel in energy harvesting wireless networks ⋮ Nonconcave utility maximisation in the MIMO broadcast channel ⋮ Channel MAC protocol for opportunistic communication in ad hoc wireless networks ⋮ Budget feasible mechanisms on matroids ⋮ Power control and capacity of spread spectrum wireless networks ⋮ On Capacity Regions of Discrete Asynchronous Multiple Access Channels ⋮ Maximizing queueing network utility subject to stability: greedy primal-dual algorithm

This page was built for publication: Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities