A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Adaptive network coding for scheduling real-time traffic with hard deadlines
2012
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing - MobiHoc '12
We study adaptive network coding (NC) for scheduling realtime traffic over a single-hop wireless network. To meet the hard deadlines of real-time traffic, it is critical to strike a balance between maximizing the throughput and minimizing the risk that the entire block of coded packets may not be decodable by the deadline. Thus motivated, we explore adaptive NC, where the block size is adapted based on the remaining time to the deadline, by casting this sequential block size adaptation problem
doi:10.1145/2248371.2248389
dblp:conf/mobihoc/YangSL12
fatcat:gzn3ynk3a5fknkq62qjmwv2gvi