Opportunities for Network Coding: To Wait or Not to Wait

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 2 figures, Extended version of IEEE ISIT 2011

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Opportunities for Network Coding: To Wait or Not to Wait does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Opportunities for Network Coding: To Wait or Not to Wait, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Opportunities for Network Coding: To Wait or Not to Wait will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-650309

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.