Abstract
Rateless code properties ideally suit multi-node transmissions and have been extensively employed in multihop delay tolerant networks (DTNs). However conventional multihop networks, where the transmission proceeds from one-hop to the next, may lead to starvation of some nodes with good channel conditions. In such instances, the overall latency can be alleviated by cooperation among the forwarding nodes. This paper analytically quantifies the latency of both conventional and cooperative rateless coded delay tolerant multihop networks by deriving the exact closed form equations for the channel usage. These are verified and supported with results from extensive simulation studies.
Sign-in/Register to access full text options 
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.
