Abstract
To solve the congestion problem in opportunistic networks, a congestion control strategy based on message deleting and transferring(DATM) is proposed. The congested node calculates the storage value of each message according to the forwarding probability and TTL of message, then deletes the message with the minimum storage value and transfers the message with the minimum forwarding probability to neighboring nodes. The neighboring nodes calculate the receiving value of the message according to the forwarding probability and free buffer capacity of this message. The congested node transfers the message to the neighboring node with the maximum receiving value. The message will be deleted when there is no neighboring node to receive it. The algorithm is more targeted at deleting messages. Besides, it combines the strategy of transferring message. Therefore, it can deal with the congestion more efficiently. The message arrival rate is improved significantly and the end-to-end delay is also reduced to some extent.
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.
