Information theory and communication networks: an unconsummated union
From MaRDI portal
Publication:4701197
DOI10.1109/18.720543zbMath1125.94302OpenAlexW2158013409MaRDI QIDQ4701197
Bruce Hajek, Anthony Ephremides
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/ec243e8b4fd37ba0a5042419c28364655b4a8f61
Related Items (12)
A Random Multiple-Access Protocol with Spatial Interactions ⋮ Bridging the Gap Between Information Theory and Wireless Networking ⋮ A RANDOM ACCESS G-NETWORK: STABILITY, STABLE THROUGHPUT, AND QUEUEING ANALYSIS ⋮ Fluid limits for an ALOHA-type model with impatient customers ⋮ Spatially decentralized protocols in random multiple access networks ⋮ Dynamic tree algorithms ⋮ Coding and control for communication networks ⋮ A probabilistic analysis of some tree algorithms ⋮ On stability of multiple access systems with minimal feedback ⋮ Throughput and delay analysis of an opportunistic tree algorithm ⋮ On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency ⋮ Stability of a Markov-modulated Markov Chain, with application to a wireless network governed by two protocols
This page was built for publication: Information theory and communication networks: an unconsummated union
