Rateless Codes can reduce retransmission costs over erasure channels. Existing routing algorithms using rateless codes assume densely connected networks and pre-decide the forwarder nodes which subsequently participate in message forwarding. Using a rateless code which is easy to analyze and implement, we propose practically implementable opportunistic message forwarding algorithms for sparsely connected networks in which all the nodes can potentially participate in forwarding, and study their performance through simulations.
Rateless Codes are effective in reducing the costs of retransmissions over erasure channels. Some rateless codes have systematic leading parts which have been shown in the literature to enhance their performance. The systematic part allows a node to start transmitting packets as soon as they are received without waiting for the entire multi-packet message to be decoded. This will naturally reduce the end-to-end delay which is critical for streaming applications. Using systematic rateless codes, this paper proposes a network routing algorithm to reduce streaming delays. The algorithm is easy to analyze and implement. Its performance is studied and compared against the existing algorithms through simulations in network scenarios where the nodes use systematic rateless codes for communication.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.