TY - GEN
T1 - Energy-efficient cooperative broadcast in fading wireless networks
AU - Qiu, Chenxi
AU - Shen, Haiying
AU - Yu, Lei
PY - 2014
Y1 - 2014
N2 - Cooperative broadcast, in which receivers are allowed to combine received packet from different senders to combat transmission errors, has gained increasing attention. Previous studies showed that broadcast optimization solutions are sufficient in non-fading environments but may suffer a low delivery ratio under wireless channel fading. Though previous work analyzed the tradeoff between energy and delay in cooperative broadcast, no works investigated the tradeoff in a fading environment. Thus, in this paper, we study this tradeoff with the consideration of fading. We formulate this problem as a Fading-resistant Delay-constrained Minimum Energy Cooperative Broadcast (FDMECB) problem, and prove that it is NP-complete. We then propose an approximation algorithm for theoretical interests. We further propose a heuristic algorithm that makes approximately optimal local decision to achieve global optimization. Our experimental results show that our algorithms outperform a previous non-fading resistant algorithm.
AB - Cooperative broadcast, in which receivers are allowed to combine received packet from different senders to combat transmission errors, has gained increasing attention. Previous studies showed that broadcast optimization solutions are sufficient in non-fading environments but may suffer a low delivery ratio under wireless channel fading. Though previous work analyzed the tradeoff between energy and delay in cooperative broadcast, no works investigated the tradeoff in a fading environment. Thus, in this paper, we study this tradeoff with the consideration of fading. We formulate this problem as a Fading-resistant Delay-constrained Minimum Energy Cooperative Broadcast (FDMECB) problem, and prove that it is NP-complete. We then propose an approximation algorithm for theoretical interests. We further propose a heuristic algorithm that makes approximately optimal local decision to achieve global optimization. Our experimental results show that our algorithms outperform a previous non-fading resistant algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84904443397&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904443397&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2014.6848042
DO - 10.1109/INFOCOM.2014.6848042
M3 - Conference contribution
AN - SCOPUS:84904443397
SN - 9781479933600
T3 - Proceedings - IEEE INFOCOM
SP - 1114
EP - 1122
BT - IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 33rd IEEE Conference on Computer Communications, IEEE INFOCOM 2014
Y2 - 27 April 2014 through 2 May 2014
ER -