TY - GEN
T1 - Energy efficiency of wireless cooperation
AU - Jain, Aman
AU - Kulkarni, Sanjeev R.
AU - Verdu, Sergio
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2017/2/10
Y1 - 2017/2/10
N2 - We study the energy efficiency of wireless transmissions for a class of networks where a large number of proximal nodes co-operate over the wireless medium to reliably decode the message from a distant transmitter (the source). The objective is to minimize the sum total of energy expenditure (per bit) over all transmissions in the network. The wireless medium is assumed to be affected by Gaussian noise and symmetric fading with the channel state information known at the receivers but not at the transmitters. Furthermore, we assume the possibility of wideband communication and no delay constraints. In a network with k proximal nodes, where the links amongst the nodes are much better than the link between the source and the nodes, the lower bound on the energy per bit could reduce by as much as k-1 (in k) up to a certain point. This suggests a large potential benefit in co-operating with proximal nodes. We first propose and analyze an estimate-and-forward transmission scheme inspired by the Gaussian CEO problem but show that it does not have such an asymptotic behavior (in k) under most conditions. Next, we propose a simple, uncoded aggregate-and-forward scheme and show that it has an almost optimal asymptotic behavior.
AB - We study the energy efficiency of wireless transmissions for a class of networks where a large number of proximal nodes co-operate over the wireless medium to reliably decode the message from a distant transmitter (the source). The objective is to minimize the sum total of energy expenditure (per bit) over all transmissions in the network. The wireless medium is assumed to be affected by Gaussian noise and symmetric fading with the channel state information known at the receivers but not at the transmitters. Furthermore, we assume the possibility of wideband communication and no delay constraints. In a network with k proximal nodes, where the links amongst the nodes are much better than the link between the source and the nodes, the lower bound on the energy per bit could reduce by as much as k-1 (in k) up to a certain point. This suggests a large potential benefit in co-operating with proximal nodes. We first propose and analyze an estimate-and-forward transmission scheme inspired by the Gaussian CEO problem but show that it does not have such an asymptotic behavior (in k) under most conditions. Next, we propose a simple, uncoded aggregate-and-forward scheme and show that it has an almost optimal asymptotic behavior.
UR - http://www.scopus.com/inward/record.url?scp=85015216374&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85015216374&partnerID=8YFLogxK
U2 - 10.1109/ALLERTON.2016.7852295
DO - 10.1109/ALLERTON.2016.7852295
M3 - Conference contribution
AN - SCOPUS:85015216374
T3 - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
SP - 664
EP - 671
BT - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
Y2 - 27 September 2016 through 30 September 2016
ER -