Abstract

The storage resources and communication opportunities in space delay/disruption tolerant networks (DTN) are usually very limited. Moreover, as the links in space DTN are often subject to long delay, intermittent connectivity and asymmetric bandwidth, end-to-end continuous path may not be guaranteed and messages may stay at intermediate nodes for a long time. Thus, congestion in space DTN, which takes the form of persistent storage exhaustion, is inevitable. Due to the intrinsic features of space DTN, congestion control should be performed with local information before congestion occurs and limited storage and communication resources should be allocated to messages that have the highest probability to be delivered to destination. Based on these principles, a local information-based congestion control (LCC) scheme for space DTN is proposed in this paper. Firstly, LCC attempts to relieve the storage pressure by using alternative paths i.e. non-best paths when the network is about to congest. Secondly, LCC adopts a utility function based on the reciprocal of hop counts to destination to assist forwarding decision and queue management. Simulation results show that with the combination of LCC typical space DTN routing algorithm can achieve higher message delivery ratio and more uniform traffic distribution.

Full Text
Paper version not known

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 call

Disclaimer: 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.