Abstract
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.
Highlights
Delay-tolerant networks[1] (DTNs) are wireless mobile networks, in which mobile carriers communicate with each other via their short-distance and lowcost devices to share data objects.[2]
To solve the optimization problem, we propose an improved genetic algorithm (GA), which is more general and efficient than the enumeration algorithm used in Community-based adaptive spray (CAS)
We study the cost-efficient dynamic quota-controlled routing in the multi-community DTNs and address the optimization problem of minimizing the average number of copies of a message that satisfies the required delivery probability under the given lifetime of the message
Summary
Delay-tolerant networks[1] (DTNs) are wireless mobile networks, in which mobile carriers (e.g. human beings) communicate with each other via their short-distance and lowcost devices to share data objects.[2]. A network model of the multi-community DTNs is presented in this article Based on this model, we formulate a dynamic quotacontrolled routing problem of minimizing the average number of copies of a message that satisfies the required delivery probability under the given time-to-live (TTL) of the message as a nonlinear optimization problem. 3. A cost-efficient community-based dynamic quota-controlled routing protocol with our optimization algorithm is proposed, which adopts 2-period S&W and can dynamically adjust message copies according to its assigned delivery probability and TTL in different communities on the shortest path. A cost-efficient community-based dynamic quota-controlled routing protocol with our optimization algorithm is proposed, which adopts 2-period S&W and can dynamically adjust message copies according to its assigned delivery probability and TTL in different communities on the shortest path Both the numerical and simulation results show that the routing protocol with our algorithm has more significant advantages in cost efficiency
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callMore From: International Journal of Distributed Sensor Networks
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.
