English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we study a real-time scalable video broadcast over wirelessnetworks in instantly decodable network coded (IDNC) systems. Such real-timescalable video has a hard deadline and imposes a decoding order on the videolayers.We first derive the upper bound on the probability that the individualcompletion times of all receivers meet the deadline. Using this probability, wedesign two prioritized IDNC algorithms, namely the expanding window IDNC(EW-IDNC) algorithm and the non-overlapping window IDNC (NOW-IDNC) algorithm.These algorithms provide a high level of protection to the most important videolayer before considering additional video layers in coding decisions. Moreover,in these algorithms, we select an appropriate packet combination over a givennumber of video layers so that these video layers are decoded by the maximumnumber of receivers before the deadline. We formulate this packet selectionproblem as a two-stage maximal clique selection problem over an IDNC graph.Simulation results over a real scalable video stream show that our proposedEW-IDNC and NOW-IDNC algorithms improve the received video quality compared tothe existing IDNC algorithms.

Instantly Decodable Network Coding for Real-Time Scalable Video Broadcast over Wireless Networks