TY - JOUR
T1 - Energy efficiency of decode-and-forward for wideband wireless multicasting
AU - Jain, Aman
AU - Kulkarni, Sanjeev R.
AU - Verdú, Sergio
N1 - Funding Information:
Manuscript received November 29, 2009; revised February 07, 2011; accepted April 27, 2011. Date of current version December 07, 2011. This work was supported in part by the U.S. Office of Naval Research under Grant N00014-07-1-0555, by the U.S. Army Research Office under Grant W911NF-07-1-0185, and by the Center for Science of Information (CSoI), an NSF Science and Technology Center, under Grant CCF-0939370. The material in this paper was presented in part at the 47th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 2009.
PY - 2011/12
Y1 - 2011/12
N2 - In this paper, we study the minimum energy per bit required for communicating a message to all the destination nodes in a wireless network. The physical layer is modeled as an additive white Gaussian noise (AWGN) channel affected by circularly symmetric fading. The fading coefficients are known at neither transmitters nor receivers. We provide an information-theoretic lower bound on the energy requirement of general multicasting in arbitrary networks as the solution of a linear program, when no restrictions are placed on the bandwidth or the delay. We study the performance of decode-and-forward operating in the noncoherent wideband scenario, and compare it with the lower bound, for a variety of network classes where all nonsource nodes are destinations. For three-terminal networks with one source and two cooperative destination nodes, the energy expenditure of decode-and-forward is shown to be at most twice the lower bound and optimal in many cases. We also show that for arbitrary networks with k nodes, the energy requirement of decode-and-forward is at most k-1 times that of the lower bound regardless of the magnitude of channel gains. In networks that can be represented as directed acyclic graphs (DAGs), we establish the minimum energy per bit, also achieved by decode-and-forward. In addition, we also study regular networks where the energy consumption of decode-and-forward is shown to be almost order optimal in many situations of interest.
AB - In this paper, we study the minimum energy per bit required for communicating a message to all the destination nodes in a wireless network. The physical layer is modeled as an additive white Gaussian noise (AWGN) channel affected by circularly symmetric fading. The fading coefficients are known at neither transmitters nor receivers. We provide an information-theoretic lower bound on the energy requirement of general multicasting in arbitrary networks as the solution of a linear program, when no restrictions are placed on the bandwidth or the delay. We study the performance of decode-and-forward operating in the noncoherent wideband scenario, and compare it with the lower bound, for a variety of network classes where all nonsource nodes are destinations. For three-terminal networks with one source and two cooperative destination nodes, the energy expenditure of decode-and-forward is shown to be at most twice the lower bound and optimal in many cases. We also show that for arbitrary networks with k nodes, the energy requirement of decode-and-forward is at most k-1 times that of the lower bound regardless of the magnitude of channel gains. In networks that can be represented as directed acyclic graphs (DAGs), we establish the minimum energy per bit, also achieved by decode-and-forward. In addition, we also study regular networks where the energy consumption of decode-and-forward is shown to be almost order optimal in many situations of interest.
KW - Decode-and-forward
KW - flooding
KW - minimum energy per bit
KW - multicasting
KW - noncoherent communication
KW - relay networks
UR - http://www.scopus.com/inward/record.url?scp=83255166674&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=83255166674&partnerID=8YFLogxK
U2 - 10.1109/TIT.2011.2170120
DO - 10.1109/TIT.2011.2170120
M3 - Article
AN - SCOPUS:83255166674
SN - 0018-9448
VL - 57
SP - 7695
EP - 7713
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 12
M1 - 6094284
ER -