Abstract
In delay tolerant network interruptions will occur continuously because there is no end-to-end path exists for the longer period of time from source to destination. In this context, delays can be immensely large due to its environment contrails e.g. wildlife tracking, sensor network, deep space and ocean networks. Furthermore, larger replication of messages put into the network is to increase delivery probability. Due to this high buffer occupancy storage space and replication result in a huge overhead on the network. Consequently, well-ordered intelligent message control buffer drop policies are necessary to operate on buffer that allows control on messages drop when the node buffers are near to overflow. In this paper, we propose an efficient buffer management policy which is called message drop control source relay (MDC-SR) for delay tolerant routing protocols. We also illustrate that conventional buffer management policy like Drop oldest, LIFO and MOFO be ineffective to consider all appropriate information in this framework. The proposed MDC-SR buffer policy controls the message drop while at the same time maximizes the delivery probability and buffer time average and reduces the message relay, drop and hop count in the reasonable amount. Using simulations support on an imitation mobility models Shortest Path Map Based Movement and Map Route Movements, we show that our drop buffer management MDC-SR with random message sizes performs better as compared to existing MOFO, LIFO and DOA.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.