Delay bounded spray and wait in delay tolerant networks

Abbas, Ali; Lee, Chungjae; Kim, Ki-Il

doi:10.1145/2701126.2701175

Cited by 8 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has been shown that the average number of copies of multi-period S&W is smaller than that of the original S&W protocol with the same required delivery ratio and deadline. Moreover, Abbas et al 10 proposed a delay-bounded S&W protocol, which dynamically adjusts the quota of messages based on the measured delivery probability and TTL of messages.…”

Section: Related Workmentioning

confidence: 99%

“…spray and wait 8 ) and dynamic (e.g. multi-period S&W 9 and delay-bounded S&W 10 ) according to whether the quota is fixed or adjustable while routing a message. It is shown that the dynamic quota-controlled routing protocols can adapt the dynamic characteristic of DTNs and have more efficient utilization of the network resources by theoretical analysis and experimental results.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cost-efficient dynamic quota-controlled routing in multi-community delay-tolerant networks

Liu

2018

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Delay-tolerant networks are novel wireless mobile networks, which are characterized with high latency and frequent disconnectivity. Besides, people carrying mobile devices form a lot of communities because of similar interests and social relationships. How to improve the routing efficiency in multi-community scenarios has become one of the research hot spots in delay-tolerant networks. In this article, we present a network model of the multi-community delay-tolerant networks and formulate a dynamic quota-controlled routing problem of minimizing the average number of copies of a message that satisfies the required delivery probability under the given time-to-live of the message as a nonlinear optimization problem. To solve this problem, we propose an improved genetic algorithm called genetic algorithm for delivery probability and time-to-live optimization for the dynamic quota-controlled routing scheme to reduce the routing cost further. In addition, a cost-efficient dynamic quota-controlled routing protocol based on genetic algorithm for delivery probability and time-to-live optimization is proposed, which can dynamically adjust message copies according to its assigned delivery probability and time-to-live in different communities on the shortest path. Both the numerical and simulation results show that our routing with the proposed algorithm is more cost efficient.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%