We analyze a wireless line network employing wireless network coding. The two end nodes exchange their packets through relays. While a packet at a relay might not find its coding pair upon arrival, a transmission cost can be reduced by waiting for coding with a packet from the other side. To strike a balance between the reduced transmission cost and the cost incurred by the delay, a scheduling algorithm determining either to transmit an uncoded packet or to wait for coding is needed. Because of highly uncertain traffic injections, scheduling with no assumption of the traffic is critical. This paper proposes a randomized online scheduling algorithm for a relay in arbitrary traffic, which can be non-stationary or adversarial. The expected total cost (including a transmission cost and a delay cost) incurred by the proposed algorithm is at most $\frac {e}{e-1} \approx 1.58$ times the minimum achievable total cost. In particular, the proposed algorithm is universal in the sense that the ratio is independent of the traffic. With the universality, the proposed algorithm can be implemented at each relay distributedly (in a multi-relay network) with the same ratio. Moreover, the proposed algorithm turns out to generalize the classic ski-rental online algorithm.

中文翻译：

---

对抗性流量中的延迟感知无线网络编码

我们分析了采用无线网络编码的无线线路网络。两个端节点通过中继交换他们的数据包。虽然中继站的数据包在到达时可能找不到其编码对，但可以通过等待与来自另一端的数据包进行编码来降低传输成本。为了在降低的传输成本和延迟引起的成本之间取得平衡，需要一种确定是传输未编码数据包还是等待编码的调度算法。由于流量注入的高度不确定性，不考虑流量的调度至关重要。本文提出了一个随机在线调度算法 对于继电器 随意的 交通，可以 非平稳 或者 对抗性的. 所提出算法产生的预期总成本（包括传输成本和延迟成本）最多为 $\frac {e}{e-1} \approx 1.58$ 乘以可达到的最低总成本。特别地，所提出的算法是普遍的从某种意义上说，该比率与流量无关。具有普遍性，所提出的算法可以在每个中继上实现分布式（在多中继网络中）具有相同的比率。此外，所提出的算法最终推广了经典的滑雪租赁在线算法。