11.03.2014 Views

Network Coding and Wireless Physical-layer ... - Jacobs University

Network Coding and Wireless Physical-layer ... - Jacobs University

Network Coding and Wireless Physical-layer ... - Jacobs University

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

42 Chapter 4: Unequal Erasure Protection (UEP) in <strong>Network</strong> <strong>Coding</strong><br />

where ϱ il <strong>and</strong> ρ i,j represent the probabilities that the symbol m l <strong>and</strong> the prefix P j are<br />

recovered at the sink i, respectively. From (4.8), the quality improves if the term ρ i,j<br />

becomes larger, especially for a small j implying a large ∆ j . This reaffirms the essence<br />

of UEP, which is to better protect the high-priority preamble. ρ i,j depends on the transmission<br />

channels <strong>and</strong> our network codes, which will be investigated in the next section.<br />

The equation (4.8) satisfies the paragraph 2 of Law 4.2 generalized by linearity assumption,<br />

such that any two probabilistic objects having the same expected value, despite<br />

being linearly-combined by different probabilistic proportion of data <strong>layer</strong>s, are considered<br />

economically equivalent.<br />

4.6 Utility of Global Encoding Kernels (GEKs) for<br />

Linear <strong>Network</strong> Codes<br />

In the previous section, we consider scalable data as probabilistic objects <strong>and</strong> derive its<br />

utility. In this section, after having a quick review of the meaning of global encoding<br />

kernels (GEKs), we will see that the assignment of GEKs to the edges in the network is<br />

analogous to assigning received symbols to the sinks in an erasure-free network. In case<br />

there are erasures, we can identify the utility of GEKs based on erasure probabilities of<br />

transmission channels just as we can identify the utility of scalable data.<br />

Let us now revisit the global encoding kernel (GEK) defined in Chapter 3.<br />

For a<br />

network that employs linear network coding, each of its edges in the graphical model,<br />

such as Fig. 4.2, is used to transmit the linear combination of the source symbols. This<br />

linear combination can either be represented locally as a linear function of symbols from<br />

adjacent edges, which is called “a local encoding mapping,” or globally as a linear function<br />

of source symbols, which is called “a global encoding mapping” [61]. The global encoding<br />

mapping is described by a vector called ”a global encoding kernel (GEK),” which is<br />

introduced in Definition 4.6.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!