TY - GEN
T1 - Opportunities for network coding
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
AU - Hsu, Yu Pin
AU - Abedini, Navid
AU - Ramasamy, Solairaja
AU - Gautam, Natarajan
AU - Sprintson, Alex
AU - Shakkottai, Srinivas
PY - 2011
Y1 - 2011
N2 - It has been well established that reverse-carpooling based network coding can significantly improve the efficiency of multi-hop wireless networks. However, in a stochastic environment when there are no opportunities to code because of packets without coding pairs, should these packets wait for a future opportunity or should they be transmitted without coding? To help answer that question we formulate a stochastic dynamic program with the objective of minimizing the long-run average cost per unit time incurred due to transmissions and delays. In particular, we develop optimal control actions that would balance between costs of transmission against those of delays. In that process we seek to address a crucial question: what should be observed as the state of the system? We analytically show that just the queue lengths is enough if it can be modeled as a Markov process. Subsequently we show that a stationary policy based on queue lengths is optimal and describe a procedure to find such a policy. We further substantiate our results with simulation experiments for more generalized settings.
AB - It has been well established that reverse-carpooling based network coding can significantly improve the efficiency of multi-hop wireless networks. However, in a stochastic environment when there are no opportunities to code because of packets without coding pairs, should these packets wait for a future opportunity or should they be transmitted without coding? To help answer that question we formulate a stochastic dynamic program with the objective of minimizing the long-run average cost per unit time incurred due to transmissions and delays. In particular, we develop optimal control actions that would balance between costs of transmission against those of delays. In that process we seek to address a crucial question: what should be observed as the state of the system? We analytically show that just the queue lengths is enough if it can be modeled as a Markov process. Subsequently we show that a stationary policy based on queue lengths is optimal and describe a procedure to find such a policy. We further substantiate our results with simulation experiments for more generalized settings.
UR - http://www.scopus.com/inward/record.url?scp=80054816034&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80054816034&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2011.6034243
DO - 10.1109/ISIT.2011.6034243
M3 - Conference contribution
AN - SCOPUS:80054816034
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 791
EP - 795
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -