Login Register Cart 0
Generic placeholder image

International Journal of Sensors, Wireless Communications and Control

Editor-in-Chief

ISSN (Print): 2210-3279
ISSN (Online): 2210-3287

Back
Journal Home About Journal Editorial Board Journal Insight Current Issue Volumes/Issues
Subscribe
Research Article

RACOD: Routing Using Ant Colony Optimization in DTN

Author(s): Naveen Singh* and Awadhesh Singh

Volume 10, Issue 2, 2020

Page: [262 - 275] Pages: 14

DOI: 10.2174/2210327909666190404141124

Price: $65

Abstract

Background & Objective: Routing is a popular challenge in ad hoc networks. A routing algorithm developed for one type of ad hoc network may be adapted for other. However, such adaptation is very difficult for Delay Tolerant Network (DTN) due to special DTN characteristics like latency, intermittency, disruptions, etc. and its applications in hostile environments like extreme terrestrial and space.

Methods: We have used Ant Colony Optimization (ACO) to develop a routing algorithm suited to DTNs. The ants wander for food and after few epochs they find shortest path to it. The ant’s movement in ACO can be mapped with propagation of messages that are replicated in DTN and look for their destination. Also, we apply an efficient buffer management method to boost the performance of our routing algorithm.

Results & Conclusion: To highlight the effectiveness of our algorithm, the simulation results have been compared with some leading algorithms available in the literature and have found that our algorithm produces better result than other algorithms in terms of delivery, overhead and probability ratio.

Keywords: Ant colony optimization, buffer management, delay tolerant network, routing, ad hoc networks, intermittency.

« Previous Next »
Graphical Abstract

[1]
Papastergiou G, Psaras L, Tsaoussidis V. Deep-space transport protocol: A novel transport scheme for space DTNs. Comput Commun 2009; 32: 1757-67.
[2]
Juang P, Oki H, Wang Y, Martonosi M, Peh LS, Rubenstein D. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. 2002.
[http://dx.doi.org/10.1145/605397.605408]
[3]
Lu Z, Fan J. Delay/disruption tolerant network and its application in military communications. International Conference on Computer Design and Applications (ICCDA). Qinhuangdao, China. 2010.
[4]
Partan J, Kurose J, Levine BN. A survey of practical issues in underwater networks. Comp Sci 2007 2007; 23-33.
[http://dx.doi.org/10.1145/1347364.1347372]
[5]
Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks. Comp Sci 2000; 2000: 1-14.
[6]
Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob Comput Commun Review 2003; 7: 19-20.
[7]
Spyropoulos T, Psounis K, Raghavendra S. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. Adv Comp Netw 2005 2005; 252-9.
[http://dx.doi.org/10.1145/1080139.1080143]
[8]
Burgess J, Brian G, David J, Levine BN. MaxProp: Routing for vehicle-based disruption-tolerant networks. INFOCOM 2006; 6: 1-11.
[9]
Karaboga D, Basturk B. A powerful and efficient algorithm for numeric function Optimization: Artificial Bee Colony (ABC). J Global Optimizat 2007; 39(3): 459-71.
[10]
Pei Y, Wang W, Zhang S. Basic ant colony optimization. Int Conf Comput Sci Electron Eng 2012; 1: 665-7.
[11]
Goldberg D. Genetic algorithms in optimization, search and machine learning. 1st Edition. Addison Wesley 1987.
[12]
Kennedy J, Eberhart R. Particle swarm optimization. Proceedings of ICNN'95 - International Conference on Neural Networks Perth, WA, Australia 1995.
[http://dx.doi.org/10.1109/ICNN.1995.488968]
[13]
Storn R, Price K. Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 1997; 11: 341-59.
[http://dx.doi.org/10.1023/A:1008202821328]
[14]
Krihnanand KN, Ghose D. Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions. Swarm Intell 2009; 3: 87-124.
[15]
Yang XS, Deb S. Cuckoo search via levy flights. 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC). Coimbatore, India. 2009.
[http://dx.doi.org/10.1109/NABIC.2009.5393690]
[16]
Geng X, Wang Y, Feng H, Zhang L. Lane post: Lane-based optimal routing protocol for delay-tolerant maritime networks. Commun Theories Syst 2015; 14: 65-78.
[17]
Li F, Jiang H, Li H, Cheng Y, Wang Y. SEBAR: Social-energy-based routing for mobile social delay-tolerant networks. IEEE T Veh Technol 2017; 66: 7195-206.
[18]
Abdelkader T, Naik K, Nayak A, Goel N, Srivastava V. SGBR: A routing protocol for delay tolerant networks using social grouping. IEEE T Parall Distr Syst 2013; 24: 2472-81.
[19]
Wang E, Yang Y, Wu J. A knapsack-based buffer management strategy for delay tolerant networks. J Parallel Distr Comput 2015; 86: 1-15.
[http://dx.doi.org/10.1016/j.jpdc.2015.07.008]
[20]
Wang C, Zhao B, Peng W, Wu C, Gong Z. Routing algorithm based on ant colony optimization for DTN congestion control. 2012 15th International Conference on Network-Based Information Systems. Melbourne, VIC, Australia, 2015.
[http://dx.doi.org/10.1109/NBiS.2012.45]
[21]
Lu X, Hui P, Towsley D, Pu J, Xiong Z. Anti-localization anonymous routing for delay tolerant network. Comput Netw 2010; 54(11): 1899-910.
[http://dx.doi.org/10.1016/j.comnet.2010.03.002]
[22]
Fu Q, Krishnamachari B, Zhang L. DAWN: A density adaptive routing for deadline-based data collection in vehicular delay tolerant networks. Tsinghua Sci Technol 2013; 18(3): 230-41.
[23]
Picu A, Spyropoulos T. Dtn-meter: Forecasting the performance of dtn protocols under heterogeneous mobility. IEEE/ACM Transac Netw 2014; 32(2): 1-21.
[24]
Burleigh S, Hooke A, Torgerson L, et al. Delay-tolerant networking: An approach to interplanetary internet. IEEE Commun Mag 2003; 41(6): 128-36.
[25]
Fall K, Hong W, Madden S. Custody transfer for reliable delivery in delay tolerant networks Technical Report, IRB-TR-03-030. Intel Research at Berkeley 2003.
[26]
Fall K. A delay-tolerant network architecture for challenged internets. In: Feldmann A, Ed. Proceedings of the ACM SIGCOMM 2003 Conference on Computer Communications. 27-34.
[http://dx.doi.org/10.1145/863955.863960 ]
[27]
Sok P, Kim K. PRoPHET Routing Based on Distance Mechanism in Disruption-Tolerant Network. Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication. Siem Reap, Cambodia 2014.
[28]
Segundo FR, Silva ES, Farines JM. A DTN routing strategy based on neural networks for the urban bus transportation system. J Netw Comput Appl 2016; 64: 216-8.
[http://dx.doi.org/10.1016/j.jnca.2016.02.002]
[29]
Keranen A, Ott J, Karkkainen T. Simulating mobility and DTNs with the ONE. J Commun 2010; 5(2): 92-104.
[30]
Spyropoulos T, Psounis K, Raghavendra CS. Single-copy routing in intermittently connected mobile networks. Sensor Ad Hoc Commun Netw IEEE 2004; 2004: 235-44.

Rights & Permissions Print Cite
Article Metrics
12
© 2024 Bentham Science Publishers | Privacy Policy