Computer Science – Information Theory
Scientific paper
2008-09-12
Computer Science
Information Theory
Proc. of the IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2008), Atlanta, USA, September 2008
Scientific paper
Network coding is a highly efficient data dissemination mechanism for wireless networks. Since network coded information can only be recovered after delivering a sufficient number of coded packets, the resulting decoding delay can become problematic for delay-sensitive applications such as real-time media streaming. Motivated by this observation, we consider several algorithms that minimize the decoding delay and analyze their performance by means of simulation. The algorithms differ both in the required information about the state of the neighbors' buffers and in the way this knowledge is used to decide which packets to combine through coding operations. Our results show that a greedy algorithm, whose encodings maximize the number of nodes at which a coded packet is immediately decodable significantly outperforms existing network coding protocols.
Barros João
Costa Rui A.
Munaretto Daniele
Widmer Joerg
No associations
LandOfFree
Informed Network Coding for Minimum Decoding Delay does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Informed Network Coding for Minimum Decoding Delay, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Informed Network Coding for Minimum Decoding Delay will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-368976