Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Time Efficiency of BATS Coding on Wireless Relay Network With Overhearing

Hoover H. F. Yin

TL;DR

This paper applies a network coding scheme called BATS codes on a wireless relay network where the relay node has a stable power supply, so that it can aim for the best decoding time instead of minimizing the number of transmissions for saving energy.

Abstract

Wireless relay network is a solution to extend the reach of a wireless connection by installing a relay node between the source node and the sink node. Due to the broadcast nature of wireless transmission, the sink node has a chance to receive part of the data sent by the source node. In this paper, we apply a network coding scheme called BATS codes on a wireless relay network where the relay node has a stable power supply, so that we can aim for the best decoding time instead of minimizing the number of transmissions for saving energy. We optimize the time efficiency that maximize the average decoding rate per unit time by some heuristics, and bring out a message that it is not optimal to set an average number of recoded packets per batch at the relay node equals the number of packets per batch sent by the source node.

Time Efficiency of BATS Coding on Wireless Relay Network With Overhearing

TL;DR

This paper applies a network coding scheme called BATS codes on a wireless relay network where the relay node has a stable power supply, so that it can aim for the best decoding time instead of minimizing the number of transmissions for saving energy.

Abstract

Wireless relay network is a solution to extend the reach of a wireless connection by installing a relay node between the source node and the sink node. Due to the broadcast nature of wireless transmission, the sink node has a chance to receive part of the data sent by the source node. In this paper, we apply a network coding scheme called BATS codes on a wireless relay network where the relay node has a stable power supply, so that we can aim for the best decoding time instead of minimizing the number of transmissions for saving energy. We optimize the time efficiency that maximize the average decoding rate per unit time by some heuristics, and bring out a message that it is not optimal to set an average number of recoded packets per batch at the relay node equals the number of packets per batch sent by the source node.
Paper Structure (10 sections, 13 equations, 5 figures, 2 tables, 2 algorithms)

This paper contains 10 sections, 13 equations, 5 figures, 2 tables, 2 algorithms.

Table of Contents

  1. Introduction
  2. BATS Codes
  3. Encoding, Recoding and Decoding
  4. Adaptive Recoding
  5. Time Efficiency
  6. Expected Total Idling Time
  7. Algorithm
  8. Upper Bound
  9. Numerical Evaluation
  10. Concluding Remarks

Figures (5)

  • Figure 1: A wireless relay network. The source node (s) broadcasts the packets to the relay node (r) and the destination node (d). The link between (s) and (d) is considered as an overhearing channel.
  • Figure 2: The time efficiency achieved by the objectives of \ref{['eq:eff0']} and \ref{['eq:eff1']}.
  • Figure 3: The zigzag shape of the time efficiency.
  • Figure : End-Points of the Time Efficiency Segment
  • Figure : Search for Optimal Time Efficiency