Network Coding and Wireless Physical-layer ... - Jacobs University
Network Coding and Wireless Physical-layer ... - Jacobs University
Network Coding and Wireless Physical-layer ... - Jacobs University
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
46 Chapter 4: Unequal Erasure Protection (UEP) in <strong>Network</strong> <strong>Coding</strong><br />
4.7 The Problem of GEK Assignment<br />
According to (4.8) <strong>and</strong> (4.11), the best option for the sink i is to make ρ i,j large for small<br />
j to satisfy the UEP requirements <strong>and</strong> optimize the scalable data quality. To do so, it<br />
first sorts the erasure probability P e,ik such that P e,ik ≤ P e,ir for any 1 ≤ k < r ≤ ω.<br />
Then, we find that the ideal strategy is to allocate a first-UEP-level GEK to the path<br />
with the index k = 1, such that we only need the path with the lowest erasure probability<br />
to recover the most important prefix P 1 . In this case, ρ i,1 = 1 − P e,i1 , which is the highest<br />
possible ρ i,1 . Next, we allocate a second-UEP level GEK to the path with next-to-thelowest<br />
erasure probability, i.e., k = 2, such that ρ i,2 = (1 − P e,i1 ) (1 − P e,i2 ), which is the<br />
highest possible ρ i,2 . We then keep allocating a q th level GEK to the path with the index<br />
k = q until reaching the last path [5].<br />
However, as earlier discussed in Section 4.3, this simple allocation scheme may not be<br />
possible due to conflicts among sink nodes as well as linear independence <strong>and</strong> dependence<br />
constraints of GEKs. Linear independence constraints ensure that the maximum information<br />
flow is achieved at each node, whereas linear dependence represents topological<br />
constrains, i.e., the GEK of any outgoing edge of the node i must be linearly dependent<br />
on the GEKs of incoming edges [5]. These constraints will be discussed in detail in the<br />
next section.<br />
The conflicts among receiving nodes pose an economic problem of optimal distribution<br />
of goods, which is discussed countlessly in economic literature. The proper solution<br />
depends on the nature of the problem as well as the camp to which the decision maker<br />
belongs, i.e., whether he is a socialist, capitalist, or something in between. Although we<br />
will not give arguments about economic philosophy in general, we propose two solutions<br />
to our GEK assignment problem according to different st<strong>and</strong>ards of evaluation. The first<br />
one in Section 4.9 is more socialist <strong>and</strong> the second in Section 4.10 more capitalist.<br />
Before presenting the two solutions in Section 4.9 <strong>and</strong> 4.10, we explain how to reduce<br />
the complexity of the problem in the next section.