TY - GEN

T1 - Minimum energy per bit for wideband wireless multicasting

T2 - IEEE INFOCOM 2010

AU - Jain, Aman

AU - Kulkarni, Sanjeev R.

AU - Verdú, Sergio

PY - 2010/6/15

Y1 - 2010/6/15

N2 - 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 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 multicasting in arbitrary wireless networks as the solution of a linear program. We study the broadcast performance of decode-and-forward operating in the non-coherent wideband scenario, and compare it with the lower bounds. For arbitrary networks with k nodes, the energy requirement of decode-and-forward is within a factor of k - 1 of the lower bound regardless of the magnitude of channel gains. We also show that decode-and-forward achieves the minimum energy per bit in networks that can be represented as directed acyclic graphs, thus establishing the exact minimum energy per bit for this class of networks. We also study regular networks where the area is divided into cells, each cell containing at least k and at most k nodes placed arbitrarily within the cell. A path loss model (with path loss exponent α > 2) dictates the channel gains between the nodes. It is shown that the ratio between the upper bound using decode-and-forward based flooding, and the lower bound is at most a constant times kα+2/k.

AB - 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 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 multicasting in arbitrary wireless networks as the solution of a linear program. We study the broadcast performance of decode-and-forward operating in the non-coherent wideband scenario, and compare it with the lower bounds. For arbitrary networks with k nodes, the energy requirement of decode-and-forward is within a factor of k - 1 of the lower bound regardless of the magnitude of channel gains. We also show that decode-and-forward achieves the minimum energy per bit in networks that can be represented as directed acyclic graphs, thus establishing the exact minimum energy per bit for this class of networks. We also study regular networks where the area is divided into cells, each cell containing at least k and at most k nodes placed arbitrarily within the cell. A path loss model (with path loss exponent α > 2) dictates the channel gains between the nodes. It is shown that the ratio between the upper bound using decode-and-forward based flooding, and the lower bound is at most a constant times kα+2/k.

UR - http://www.scopus.com/inward/record.url?scp=77953298026&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77953298026&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2010.5462066

DO - 10.1109/INFCOM.2010.5462066

M3 - Conference contribution

AN - SCOPUS:77953298026

SN - 9781424458363

T3 - Proceedings - IEEE INFOCOM

BT - 2010 Proceedings IEEE INFOCOM

Y2 - 14 March 2010 through 19 March 2010

ER -