Flow-Based Transmission Scheduling in Constrained Delay Tolerant Networks
|
| Title | Flow-Based Transmission Scheduling in Constrained Delay Tolerant Networks |
| Authors | |
| Abstract | Abstract—Routing is one of the most challenging problemsin Delay-Tolerant Networks (DTNs) due to network partitioningand intermittent connectivity. Most existing protocolsare based on unlimited bandwidth and buffer size. Previousprotocols based on limited bandwidth or buffer size (e.g.,MaxProp, RAPID, etc) only consider the scenario that eachnode has at most one contact opportunity during any timeinterval, and discuss the packet scheduling mechanisms foreach separate contact to minimize the average delivery delay. However, in many applications of DTNs, more than onecontact opportunities with the same source node, which arecalled as related contact opportunities, may arise in the sametime interval. But previous scheduling algorithms cannotapply to such applications. Therefore, we propose a moregeneral scheduling algorithm to optimize the delivery delayin constrained DTNs including the scenario that multiplerelated contact opportunities may arise in the same interval,called Flow-Based Transmission Scheduling (FBTS). Weevaluate it on publicly available data sets against MED,MaxProp and RAPID. The results show that the deliverydelay of FBTS is at least 35% shorter than that of existingworks. |
| Publisher | ACADEMY PUBLISHER |
| Date | 2012-01-01 |
| Source | Journal of Computers Vol 7, No 1 (2012): Special Issue: Parallel Algorithms, Scheduling and Architectures |
| Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |