From: Instantly decodable network coding for real-time scalable video broadcast over wireless networks
Description | Description | ||
---|---|---|---|
Q | Number of remaining transmissions | L | Number of video layers |
\(\mathcal {M}\) | Set of M receivers | \(\mathcal {N}^{1:\ell }\) | Set of N ^{1:ℓ} packets |
R _{ i } | The ith receiver in \(\mathcal {M}\) | P _{ j } | The jth packet in \(\mathcal {N}\) |
F ^{1:ℓ} | M×N ^{1:ℓ} state feedback matrix | ω _{ ℓ } | ℓth window among L windows |
\(\mathcal {H}_{i}^{1:\ell }\) | Has set of receiver R _{ i } in the first ℓ layers | \(\mathcal {W}_{i}^{1:\ell }\) | Wants set of receiver R _{ i } in the first ℓ layers |
\(T_{W_{i}^{1:\ell }}\) | Individual completion time of receiver R _{ i } for ℓ layers | T ^{1:ℓ} | Individual completion times of all receivers for ℓ layers |
\(\mathcal { G}^{1:\ell } \) | IDNC graph constructed from F ^{1:ℓ} | \(T_{B}^{1:\ell }\) | Individual completion times of all non-critical receivers for ℓ layers |
\(\mathcal {C}^{1:\ell }\) | Critical set of receivers for the first ℓ layers | \(\mathcal {A}^{1:\ell }\) | Affected set of receivers for the first ℓ layers |
\(\mathcal {B}^{1:\ell }\) | Non-critical set of receivers for the first ℓ layers | \(\mathcal {M}_{w}^{1:\ell }\) | Set of receivers having non-empty Wants sets in the first ℓ layers |
v _{ ij } | A vertex in an IDNC graph induced by missing packet P _{ j } at receiver R _{ i } | \(\mathcal {X}(\kappa)\) | Set of targeted receivers in maximal clique κ |