Ali Abbas
ABSTRACT
Recently, application-specific requirement becomes one of main research challenges in the area of routing for delay tolerant networks. Among various requirements, in this paper, we focus on achieving the desired delivery ratio within bounded given deadline. For this goal, we use analytical model and develop a new forwarding scheme in respective phase. The proposed protocol dynamically adjusts the number of message copies by analytical model and the next hop node is determined depending on the delivery probability and the inter-meeting time of the encountering nodes as well as remaining time. Simulation results demonstrate that our proposed algorithm meets bounded delay with lower overhead than existing protocols in an adaptive way to varying network conditions.
- Vahdat, A and Becker, D. 2000. Epidemic Routing for Partially Connected Ad Hoc Networks. Technical Report. Duke University.Google Scholar
- Lindgren, A., Doria, A. and Schelen, O. 2003. Probabilistic Routing in Intermittently Connected Networks. ACM SIGMOBILE Mobile Computing and Communications Review. 7, 3 (Jul. 2003), 19--20. Google ScholarDigital Library
- Balasubramanian, A., Levine, B. and Venkataramani, A. 2010. Replication Routing in DTNs: A Resource Allocation Approach. IEEE/ACM Transactions on Networking. 18, 2(Apr. 2010), 596--609. Google ScholarDigital Library
- Hui, P., Crowcroft, J. and Yoneki, E. 2010. Bubble Rap: Social-based Forwarding in Delay Tolerant Networks. IEEE Transactions on Mobile Computing. 10, 11(Nov. 2011), 1576--1589. Google ScholarDigital Library
- Bulut, E., Wang, Z. and Szymanski, B. 2010. Cost Effective Multi-Period Spraying for Routing in Delay Tolerant Networks. IEEE/ACM Transactions on Networking. 18, 5(Oct. 2010), 1530--1543. Google ScholarDigital Library
- Spyropoulos, T., Psounis, K. and Raghavendra, C. S. 2005. Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. In Proceedings of ACM SIGCOMM workshop on Delay tolerant network (New York, USA, August 2005). WDTN '05. Google ScholarDigital Library
- Nelson, S. C., Bakht, M. and Kravets, R. 2009. Encounter-based Routing in DTNs. In Proceedings of the 28th Conference on Computer Communication (Rio De Janeiro, Brazil, April 2009). INFOCOM '09.Google Scholar
- Musolesi, M. and Mascolo, C. 2009. CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks. IEEE Transactions on Mobile Computing. 8, 2(Feb. 2009), 246--260. Google ScholarDigital Library
- Bulut, E., Wang, Z. and Szymanski, B. 2008. Time Dependent Message Spraying for Routing in Intermittently Connected Networks. In Proceedings of Global Telecommunications Conference (New Orleans, USA, November 2008). GLOBECOM '08.Google Scholar
- Keranen, A., Ott, J. and Karkkainen, T. 2009. The ONE Simulator for DTN Protocol Evaluation. In Proceeding of 2nd International Conference on Simulation Tools And Techniques (New York, USA, March 2009). SIMUTools '09. Google ScholarDigital Library
Index Terms
- Delay bounded spray and wait in delay tolerant networks
Recommendations
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
WDTN '05: Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networkingIntermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks fall into the general category of Delay Tolerant Networks. There are ...
On Multicopy Opportunistic Forwarding Protocols in Nondeterministic Delay Tolerant Networks
Delay Tolerant Networks (DTNs) are characterized by nondeterministic mobility and connectivity. Message routing in DTNs usually employs a multicopy forwarding scheme. To avoid the cost associated with flooding, much effort has been focused on ...
Enhanced fuzzy logic-based spray and wait routing protocol for delay tolerant networks
Delay tolerant networks are a class of ad hoc networks that enable data delivery even in the absence of end-to-end connectivity between nodes, which is the basic assumption for routing in ad hoc networks. Nodes in these networks work on store-carry and ...
Comments