| Popis: |
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x CHAPTER 1. INTRODDUCTION . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 Network coding for multiple unicast . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Dissertation outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 CHAPTER 2. BACKGROUND AND RELATED WORK . . . . . . . . . . 6 CHAPTER 3. NETWORK CODING FOR THREE UNICAST SESSIONS 10 3.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.2 Network coding for three unicast sessions Infeasible instances . . . . . . . . . 13 3.3 Network coding for three unicast sessions Feasible instances . . . . . . . . . . 16 3.3.1 Code assignment procedure for instances with connectivity level [1 3 3] 19 3.3.2 Code assignment procedure for instances with connectivity level [2 2 4] 21 3.3.3 Code assignment procedure for instances with connectivity level [1 2 5] 27 3.4 Simulation results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40 3.5 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 CHAPTER 4. NETWORK CODING FOR TWO UNICAST SESSIONS . 44 4.1 System model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 4.2 Achievable rate region for given k12−1, k12−2, k1−1, k2−2, k1−2, and k2−1 . . . . . 45 4.2.1 Low interference case k1−2 + k2−1 ≤ min(k12−1, k12−2) . . . . . . . . . 49 |
