Abstract
For some applications of Delay-Tolerant Networks (DTNs), such as publish/subscribe systems, messages do not have explicit destination addresses. In those cases, message routing is driven by message content instead of by destination addresses. In this paper, to achieve more efficient and robust message dissemination, a Content Encounter Probability based Message Dissemination (CEPMD) scheme for DTNs is proposed. In CEPMD, we use request predicates to represent subscribers' interests and propagate request predicate messages over the network. A request predicate is tagged with an ep, representing the probability that the predicate's host node will encounter the destination node. Content messages are forwarded to the nodes that have a request predicate that matches the content message and have a greater ep value. The corresponding content messages can be forwarded to the subscriber along the probability gradient of predicates. The experimental results show that CEPMD outperforms the state-of-the-art DTN algorithms on both message delivery ratio and delivery delay.
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.