Throughput Scaling of Wireless Networks With Random Connections

DOI10.1109/TIT.2010.2051470MaRDI QIDQ5281341zbMATH OpenOpenAlexFDO

Authors Shengshan Cui, Alexander Haimovich, O. Somekh, H. Vincent Poor, S. Shamai

Publication date 27 July 2017

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

Full work available at URL https://doi.org/10.1109/tit.2010.2051470

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• A Deterministic Approach to Throughput Scaling in Wireless Networks
• Throughput Scaling Laws for Wireless Networks With Fading Channels
• On Capacity Scaling in Arbitrary Wireless Networks
• On the throughput scaling of wireless relay networks
• Throughput analysis of large wireless networks with regular topologies
• The throughput of some wireless multiaccess systems
• Throughput-coverage tradeoff in a scalable wireless mesh network
• Wireless Throughput and Energy Efficiency With Random Arrivals and Statistical Queuing Constraints
• The Capacity of Wireless Networks in Nonergodic Random Fading
• Modeling and computing throughput capacity of wireless multihop networks

Cited in

(2)

• Throughput analysis of fading sensor networks with regular and random topologies
• Topological properties of random wireless networks

This page was built for publication: Throughput Scaling of Wireless Networks With Random Connections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281341)