Abstract
Rateless codes can reduce retransmission costs over erasure channels. Existing routing algorithms using rateless codes assume densely connected networks and predecide 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
