n source and destination pairs randomly located in an area extending linearly with n want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power attenuation of r-and random phase changes. Classical multihop architectures that decode and forward packets can deliver a n-scaling of the aggregate throughput, while recently proposed hierarchical cooperation achieves n2-,/2-scaling, which is superior to multi-hop for a < 3.The study of information theoretic upper bounds has revealed the optimality of multi-hop for av > 4, while the moderateattenuation regime (2 < av < 4) remains uncharacterized. We close this gap by deriving a tight upper bound on the scaling of the aggregate throughput, valid for all c > 2. Our result shows that the mentioned schemes are scaling-optimal, namely that no other scheme can beat hierarchical cooperation when av < 3, nor can it beat classical multi-hop when av > 3. The key ingredient is a careful evaluation of the scaling of the cut-set bound.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.