Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Opportunities for Network Coding: To Wait or Not to Wait (1105.4143v2)

Published 20 May 2011 in math.OC, cs.IT, cs.NI, and math.IT

Abstract: It has been well established that wireless network coding can significantly improve the efficiency of multi-hop wireless networks. However, in a stochastic environment some of the packets might not have coding pairs, which limits the number of available coding opportunities. In this context, an important decision is whether to delay packet transmission in hope that a coding pair will be available in the future or transmit a packet without coding. The paper addresses this problem by formulating a stochastic dynamic program whose objective is to minimize the long-run average cost per unit time incurred due to transmissions and delays. In particular, we identify optimal control actions that would balance between costs of transmission against the costs incurred due to the delays. Moreover, we seek to address a crucial question: what should be observed as the state of the system? We analytically show that observing queue lengths suffices if the system can be modeled as a Markov decision process. We also show that a stationary threshold type policy based on queue lengths is optimal. We further substantiate our results with simulation experiments for more generalized settings.

Citations (49)

Summary

We haven't generated a summary for this paper yet.