A novel multi-featured metric for adaptive routing in mobile ad hoc networks

  • Songul Hasdemir
  • Selim Yilmaz
  • Sevil SenEmail author


The design of adaptive, scalable, and low cost routing protocols presents one of the most challenging research problems in mobile ad hoc networks (MANETs). Many routing protocols for MANETs have been proposed in the literature, which are based mainly on selecting the shortest path between communication endpoints. In this paper, a new evolution-based routing metric called EVO is proposed. This metric is generated automatically by means of genetic programming. In the evolution process of this metric, mobility- and traffic-related features are employed. In this study, the metric is applied to the Ad hoc On-Demand Distance Vector (AODV) protocol, one of the most popular on-demand routing algorithms for MANETs. The modified version of AODV, called EVO-AODV, ranks and selects routes according to the evolved multi-featured metric between communication endpoints. The performance of the proposed metric has been tested on networks with varying mobility and traffic patterns. The metric is also compared with AODV and two recently proposed routing metrics, the hop change metric (HOC) (Zangabad 2014) and encounter-based routing metric (PER) (Son et al. in Ad Hoc Netw 14:2–14, 2014). The extensive simulation results demonstrate that the proposed approach improves the packet delivery ratio significantly and also decreases the packet drop rate, routing overhead, and end-to-end delay, especially on networks under medium traffic.


Mobile ad hoc networks (MANETs) Reactive routing protocols Routing metric AODV Evolutionary computation Genetic programming Adaptive routing 



  1. 1.
    Abri R, Sen S (2013) A lightweight threshold-based improvement on dsdv. In: International conference on ad hoc networks, lecture notes of the institute for computer sciences, social informatics and telecommunications engineering, vol 129. Springer, pp 135–145Google Scholar
  2. 2.
    Adya A, Bahl P, Padhye J, Wolman A, Zhou L (2004) A multi-radio unification protocol for ieee 802.11 wireless networks. In: First international conference on broadband networks, 2004. Broadnets 2004. Proceedings, pp 344–354,
  3. 3.
    Aschenbruck N, Ernst R, Gerhards-Padilla E, Schwamborn M (2010) Bonnmotion: a mobility scenario generation and analysis tool. In: Proceedings of the 3rd international ICST conference on simulation tools and techniques, SIMUTools ’10. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), Brussels, pp 51:1–51:10Google Scholar
  4. 4.
    Barolli L, Koyama A, Shiratori N (2003) A qos routing method for ad-hoc networks based on genetic algorithm. In: 14th international workshop on database and expert systems applications, 2003. Proceedings, pp 175–179,
  5. 5.
    Boukerche A, Turgut B, Aydin N, Ahmad MZ, Bölöni L, Turgut D (2011) Routing protocols in ad hoc networks: a survey. Comput Netw 55(13):3032–3080CrossRefGoogle Scholar
  6. 6.
    Broch J, Maltz DA, Johnson DB, Hu YC, Jetcheva J (1998) A performance comparison of multi-hop wireless ad hoc network routing protocols. In: Proceedings of the 4th annual ACM/IEEE international conference on mobile computing and networking. ACM, pp 85–97Google Scholar
  7. 7.
    Camp T, Boleng J, Davies V (2002) A survey of mobility models for ad hoc network research. Wirel Commun Mob Comput 2(5):483–502. CrossRefGoogle Scholar
  8. 8.
    Chen W, Rao N, Liang D, Liao R, Huang W (2008) An ad hoc routing algorithm of low-delay based on hybrid particle swarm optimization. In: International conference on communications, circuits and systems, 2008. ICCCAS 2008,
  9. 9.
    Chettibi S, Chikhi S (2016) Dynamic fuzzy logic and reinforcement learning for adaptive energy efficient routing in mobile ad-hoc networks. Appl Soft Comput 38:321–328.
  10. 10.
    Cramer NL (1985) A representation for the adaptive generation of simple sequential programs. In: Proceedings of the first international conference on genetic algorithms, pp 183–187Google Scholar
  11. 11.
    De Couto DSJ, Aguayo D, Bicket J, Morris R (2003) A high-throughput path metric for multi-hop wireless routing. In: Proceedings of the 9th annual international conference on mobile computing and networking, MobiCom ’03. ACM, New York, pp 134–146,
  12. 12.
    Derrac J, Garcia S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18CrossRefGoogle Scholar
  13. 13.
    Di Caro G, Ducatelle F, Gambardella LM (2005) Anthocnet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. Eur Trans Telecommun 16(5):443–455CrossRefGoogle Scholar
  14. 14.
    Draves R, Padhye J, Zill B (2004) Comparison of routing metrics for static multi-hop wireless networks. In: ACM SIGCOMM computer communication review, vol 34. ACM, pp 133–144Google Scholar
  15. 15.
    ECJ (2017) A java-based evolutionary computation research system.
  16. 16.
    Finner H (1993) On a monotonicity problem in step-down multiple test procedures. J Am Stat Assoc 88 (423):920–923. MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32(200):675–701.
  18. 18.
    Ghaffari A (2017) Real-time routing algorithm for mobile ad hoc networks using reinforcement learning and heuristic algorithms. Wirel Netw 23(3):703–714CrossRefGoogle Scholar
  19. 19.
    Goswami M, Dharaskar R, Thakare V (2009) Fuzzy ant colony based routing protocol for mobile ad hoc network. In: International conference on computer engineering and technology, 2009. ICCET ’09, vol 2, pp 438–444,
  20. 20.
    Gouda M, Schneider M (2003) Maximizable routing metrics. IEEE/ACM Trans on Networking 11(4):663–675. CrossRefGoogle Scholar
  21. 21.
    Haas ZJ (1997) A new routing protocol for the reconfigurable wireless networks. In: IEEE 6th international conference on universal personal communications record, 1997. Conference record, 1997, vol 2. IEEE, pp 562–566Google Scholar
  22. 22.
    Hodges JL, Lehmann EL (1962) Rank methods for combination of independent experiments in analysis of variance. Ann Math Stat 33(2):482–497. MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Holland BS, Copenhaver MD (1987) An improved sequentially rejective bonferroni test procedure. Biometrics 43(2):417–423. MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Huang J, Liu Y (2010) Moeaq: a qos-aware multicast routing algorithm for {MANET}. Expert Systems with Applications 37(2):1391–1399. .
  25. 25.
    Hussein O, Saadawi T (2003) Ant routing algorithm for mobile adhoc networks (arama). In: Conference proceedings of the 2003 IEEE international performance, computing, and communications conference, pp 281–290,
  26. 26.
    Hussein OH, Saadawi TN, Lee MJ (2005) Probability routing algorithm for mobile ad hoc networks’ resources management. IEEE J Sel Areas Commun 23(12):2248–2259CrossRefGoogle Scholar
  27. 27.
    Johnson DB, Maltz DA (1996) Dynamic source routing in ad hoc wireless networks. In: Mobile computing. Springer, pp 153–181Google Scholar
  28. 28.
    Kaliappan M, Augustine S, Paramasivan B (2016) Enhancing energy efficiency and load balancing in mobile ad hoc network using dynamic genetic algorithms. J Netw Comput Appl 73:35–43.
  29. 29.
    Karkazis P, Trakadas P, Leligou HC, Sarakis L, Papaefstathiou I, Zahariadis T (2013) Evaluating routing metric composition approaches for qos differentiation in low power and lossy networks. Wirel Netw 19 (6):1269–1284CrossRefGoogle Scholar
  30. 30.
    Khelil A, Marron PJ, Rothermel K (2005) Contact-based mobility metrics for delay-tolerant ad hoc networking. In: 13Th IEEE international symposium on modeling, analysis, and simulation of computer and telecommunication systems. IEEE, pp 435–444Google Scholar
  31. 31.
    Kout A, Labed S, Chikhi S, Bourennane EB (2018) AODVCS, a new bio-inspired routing protocol based on cuckoo search algorithm for mobile ad hoc networks. Wirel Netw 24(7):2509–2519. CrossRefGoogle Scholar
  32. 32.
    Koza JR (1992) Genetic programming: on the programming of computers by means of natural selection, vol 1. MIT press, CambridgezbMATHGoogle Scholar
  33. 33.
    Li JD (2008) A two-step rejection procedure for testing multiple hypotheses. Journal of Statistical Planning and Inference 138(6): 1521–1527.
  34. 34.
    Macone D, Oddi G, Pietrabissa A (2013) Mq-routing: Mobility-, gps- and energy-aware routing protocol in {MANETs} for disaster relief scenarios. Ad Hoc Netw 11(3):861–878.
  35. 35.
    Marwaha S, Srinivasan D, Tham CK, Vasilakos A (2004) Evolutionary fuzzy multi-objective routing for wireless mobile ad hoc networks. In: Congress on evolutionary computation, 2004. CEC 2004, vol 2, pp 1964–1971,
  36. 36.
    Misra S, Dhurandher SK, Obaidat MS, Gupta P, Verma K, Narula P (2010) An ant swarm-inspired energy-aware routing protocol for wireless ad-hoc networks. J Syst Softw 83 (11):2188–2199. Interplay between usability evaluation and software development
  37. 37.
    Moussaoui A, Boukeream A (2015) A survey of routing protocols based on link-stability in mobile ad hoc networks. J Netw Comput Appl 47:1–10CrossRefGoogle Scholar
  38. 38.
    Naimi S, Busson A, Veque V, Ben Hadj Slama L, Bouallegue R (2014) Mobility management in ad hoc networks using routing metrics. In: 2014 international conference on communications and networking (ComNet), pp 1–6Google Scholar
  39. 39.
    Ns-2 The network simulatorGoogle Scholar
  40. 40.
    Oh S, Ahn C, Ramakrishna RS (2006) Neural Information Processing: 13th international conference, ICONIP 2006, Hong Kong, China, October 3–6, 2006. Proceedings, Part III. In: A genetic-inspired multicast routing optimization algorithm with bandwidth and end-to-end delay constraints. Springer, Berlin, pp 807–816Google Scholar
  41. 41.
    Perkins C, Belding-Royer E, Das S (2003) Ad hoc on-demand distance vector (aodv) routing, rfc 3561. Tech repGoogle Scholar
  42. 42.
    Perkins CE, Bhagwat P (1994) Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers. In: ACM SIGCOMM computer communication review, vol 24. ACM, pp 234–244Google Scholar
  43. 43.
    Perkins CE, Royer EM (1999) Ad-hoc on-demand distance vector routing. In: Second IEEE workshop on mobile computing systems and applications, 1999. Proceedings. WMCSA’99. IEEE, pp 90–100Google Scholar
  44. 44.
    Poli R, Langdon WB, McPhee NF (2008) A field guide to genetic programming. Lulu enterprises, UK LtdGoogle Scholar
  45. 45.
    Quade D (1979) Using weighted rankings in the analysis of complete blocks with additive block effects. J Am Stat Assoc 74(367):680–683. MathSciNetCrossRefzbMATHGoogle Scholar
  46. 46.
    Reina DG, Ruiz P, Ciobanu R, Toral S, Dorronsoro B, Dobre C (2016) A survey on the application of evolutionary algorithms for mobile multihop ad hoc network optimization problems. Int J Distrib Sens Netw 12 (2):2082496CrossRefGoogle Scholar
  47. 47.
    Rom DM (1990) A sequentially rejective test procedure based on a modified bonferroni inequality. Biometrika 77(3):663–665. MathSciNetCrossRefGoogle Scholar
  48. 48.
    Sen B, Guo J, Zhao X, Jha S (2012) Ectx: a high-throughput path metric for multi-hop wireless routing exploiting mac-layer cooperative retransmission. In: 2012 IEEE international symposium on a world of wireless, mobile and multimedia networks (WoWMoM). IEEE, pp 1–9Google Scholar
  49. 49.
    Sen S (2015) Chapter 4 - a survey of intrusion detection systems using evolutionary computation. In: Yang X-S, Chien SF, Ting TO (eds) Bio-inspired computation in telecommunications. Morgan Kaufmann, Boston, pp 73–94.,
  50. 50.
    Sen S, Clark JA (2011) Evolutionary computation techniques for intrusion detection in mobile ad hoc networks. Comput Netw 55(15):3441–3457.
  51. 51.
    Son TT, Le-Minh H, Aslam N (2016) Msar: a metric self-adaptive routing model for mobile ad hoc networks. J Netw Comput Appl 68:114–125CrossRefGoogle Scholar
  52. 52.
    Son TT, Le Minh H, Sexton G, Aslam N (2015) Self-adaptive proactive routing scheme for mobile ad-hoc networks. IET Networks 4(2):128–136CrossRefGoogle Scholar
  53. 53.
    Son TT, Le Minh H, Sexton G, Aslam N, Boubezari R (2014) A new mobility, energy and congestion aware routing scheme for manets. In: 2014 9th international symposium on communication systems, networks & digital signal processing (CSNDSP). IEEE, pp 771–775Google Scholar
  54. 54.
    Son TT, Minh HL, Sexton G, Aslam N (2014) A novel encounter-based metric for mobile ad-hoc networks routing. Ad Hoc Netw 14:2–14.
  55. 55.
    Suraj R, Tapaswi S, Yousef S, Pattanaik K, Cole M (2016) Mobility prediction in mobile ad hoc networks using a lightweight genetic algorithm. Wirel Netw 22(6):1797–1806CrossRefGoogle Scholar
  56. 56.
    Taha A, Alsaqour R, Uddin M, Abdelhaq M, Saba T (2017) Energy efficient multipath routing protocol for mobile ad-hoc network using the fitness function. IEEE Access 5:10369–10381CrossRefGoogle Scholar
  57. 57.
    Turky A, Sabar NR, Song A (2016) A multi-population memetic algorithm for dynamic shortest path routing in mobile ad-hoc networks. In: 2016 IEEE congress on evolutionary computation (CEC), pp 4119–4126,
  58. 58.
    Walikar GA, Biradar RC (2017) A survey on hybrid routing mechanisms in mobile ad hoc networks. J Netw Comput Appl 77:48–63CrossRefGoogle Scholar
  59. 59.
    Wu C, Kumekawa K, Kato T (2009) A manet protocol considering link stability and bandwidth efficiency. In: International conference on ultra modern telecommunications workshops, 2009. ICUMT ’09, pp 1–8,
  60. 60.
    Yang S, Cheng H, Wang F (2010) Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks. IEEE Trans Syst Man Cybern Part C Appl Rev 40(1):52–63.
  61. 61.
    Yang Y, Wang J (2008) Design guidelines for routing metrics in multihop wireless networks. In: INFOCOM 2008. The 27th conference on computer communications. IEEE. IEEEGoogle Scholar
  62. 62.
    Younes A (2011) Multicast routing with bandwidth and delay constraints based on genetic algorithms. Egyptian Informatics Journal 12(2):107–114. CrossRefGoogle Scholar
  63. 63.
    Zangabad RA (2014) A new metric for adaptive routing in mobile ad hoc networks. Master’s thesis, Hacettepe UniversityGoogle Scholar
  64. 64.
    Zhang H, Wang X, Memarmoshrefi P, Hogrefe D (2017) A survey of ant colony optimization based routing protocols for mobile ad hoc networks. IEEE Access 5:24139–24161CrossRefGoogle Scholar
  65. 65.
    Zhou J, Tan H, Deng Y, Cui L, Liu DD (2016) Ant colony-based energy control routing protocol for mobile ad hoc networks under different node mobility models. EURASIP J Wirel Commun Netw 2016(1):105CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.WISE Laboratory, Department of Computer EngineeringHacettepe UniversityAnkaraTurkey

Personalised recommendations