Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 2009 | Published
Book Section - Chapter Open

Achievable rate and optimal physical layer rate allocation in interference-free wireless networks

Abstract

We analyze the achievable rate in interference-free wireless networks with physical layer fading channels and orthogonal multiple access. As a starting point, the point-to-point channel is considered. We find the optimal physical and network layer rate trade-off which maximizes the achievable overall rate for both a fixed rate transmission scheme and an improved scheme based on multiple virtual users and superposition coding. These initial results are extended to the network setting, where, based on a cut-set formulation, the achievable rate at each node and its upper bound are derived. We propose a distributed optimization algorithm which allows to jointly determine the maxim um achievable rate, the optimal physical layer rates on each network link, and an opportunistic back-pressure-type routing strategy on the network layer. This inherently justifies the layered architecture in existing wireless networks. Finally, we show that the proposed layered optimization approach can achieve almost all of the ergodic network capacity in high SNR.

Additional Information

© 2009 IEEE. This material is partly funded by subcontract #069153 issued by BAE Systems National Security Solutions, Inc. and supported by the Defense Advanced Research Projects Agency (DARPA) and the Space and Naval Warfare System Center (SPAWARSYSCEN), San Diego under Contract No. N6600108- C-2013, by NSF grant CCF08-30666, and by Caltech's Lee Center for Advanced Networking.

Attached Files

Published - Cui2009p110842009_Ieee_International_Symposium_On_Information_Theory_Vols_1-_4.pdf

Files

Cui2009p110842009_Ieee_International_Symposium_On_Information_Theory_Vols_1-_4.pdf

Additional details

Created:
August 20, 2023
Modified:
October 20, 2023