Skip to main content
Log in

Design and Evaluation of Load Balanced Termite: A Novel Load Aware Bio Inspired Routing Protocol for Mobile Ad Hoc Network

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Bio inspired computing based on Swarm Intelligence is successful in dealing with the networking problems such as routing, congestion and load balancing by finding an optimal path to the destination. Most of the existing bio inspired protocols for MANETs focused only on the routing problem. In this paper, a novel heuristic bio inspired routing with load balancing algorithm referred to as Load Balanced Termite (LB-Termite) is proposed for MANETs by exploiting the salient features of social insect, “Termites”. The primary objective of the LB-Termite algorithm is to find the stable nodes and thereby giving preferences for these stable nodes during the path setup; thus finding the reliable route to the destination. The secondary objective of the proposed LB-Termite algorithm is to mitigate the stagnation problem by using pheromone heuristic control method. The simulation results of LB-Termite are compared with other state-of-the-art bio inspired routing algorithms (ACO based Simple Ant Routing Algorithm and the Termite algorithm) and non bio inspired (Ad Hoc on Demand Distance Vector Routing Algorithm) routing protocols for its performance evaluation and the results are found to be encouraging.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. De Couto, D. S. J., Aguayo, D., Bicket, J., & Morris, R. (2003, September). Ahigh-throughput path metric for multi-hop wireless routing. In Proceedings of the 9th ACM international conference on mobile computing and networking (MobiCom’03).

  2. Toh, C. K., Le, A.-N., & Cho, Y.-Z. (2009, August). Load balanced routing protocols for ad hoc mobile wireless networks. In IEEE communications magazine topics in ad hoc and sensor networks.

  3. Bonabeau, E., Dorigo, M., & Theraulaz, G. (1999). Swarm intelligence: From natural to artificial systems. New York, USA: Oxford University Press.

    MATH  Google Scholar 

  4. Regnier, F. E., & Law, J. N. (1968). Insect pheromones. Journal of Lipid Research, 9, 541–551.

    Google Scholar 

  5. Wyatt, T. D. (2003). Pheromones and animal behaviour: Communication by smell and taste. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  6. Kolias, C., Kambourakis, G., & Maragoudakis, M. (2011). Swarm Intelligence in intrusion detection: A survey. Computers and Security, 30(8), 625–642.

    Article  Google Scholar 

  7. Saleem, M., Dicaro, G. A., & Farooqb, M. (2011). Swarm intelligence based routing protocol for wireless senson networks: Survey and future directions. Information Sciences, 181(20), 4597–4624.

    Article  Google Scholar 

  8. Sim, K. M., & Sun, W. H. (2003). Ant colony optimization for routing and load balancing: Survey and new directions. IEEE Transactions on Systems, Man and cybernetics—Part A: Systems and humans 33(5), 560–572.

    Google Scholar 

  9. Neumann, F., & Witt, C. (2010). Bioinspired computation in combinatorial optimiation—algorithms and their computational complexity, natural computing series. Berlin: Springer.

    Google Scholar 

  10. Singh, G., Kumar, N., & Verma Kumar, A. (2012, November). Ant colony algorithms in MANETs: A review. Journal of Network and Computer Applications 35(6), (pp. 1964–1972), London, UK: Academic Press Ltd.

    Google Scholar 

  11. Jha, V., Khetarpal, K., & Sharma, M. (2011). A survey of nature inspired routing algorithm for MANET’s. 3rd IEEE international conference on electronics computer technology (ICET-2011), (pp. 16–24). 8th–10th April 2011.

  12. Correia, F., & Vazao, T. (2008). Simple ant routing algorithm. International conference on information networking (ICOIN–2008) (pp. 1–8). Busan: IEEE, 23–25 January, 2008.

  13. Correia, F., & Vazao T. (2010). Simple ant routing algorithm strategies for a (Multipurpose) MANET model. Ad Hoc Networks, 8(8):810–823, Elsevier.

    Google Scholar 

  14. Wedde, H. F., Farooq, M., Timm, C., Fischer, J., Kowalski, M., Langhans, M., et al. (2005a). BeeAdHoc-an efficient, secure, scalable routing framework for mobile ad hoc networks. Technical report-pg460, LSIII, School of Computer Science, University of Dortmund.

  15. Wedde, H. F., Farooq, M., Pannenbaecker, T., Vogel, B., Mueller, C., Meth, J., et al. (2005b). BeeAdHoc: An energy efficient routing algorithm for mobile ad-hoc networks inspired by bee behaviour. In Proceedings of GECCO (pp. 153–161).

  16. Mazhar, N., & Farooq, M. (2007). BeeAIS: Artificial immune system security for nature inspired, MANET routing protocol, BeeAdHoc. In Proceedings of the 6th international conference on artificial immune systems, volume 4628 of LNCS. Berlin: Springer.

  17. Srinivasan, T., Niranjan Babu, T., Mahadevan, V., Nivedita, M., Sahitya, G., Meyyappan, A., et al. (2006). BFBR A novel Bird Flocking Behavior based Routing for Highly Mobile Ad hoc Networks. In International conference on computational intelligence for modelling control and automation, and international conference on intelligent agents, web technologies and internet commerce (CIMCA-IAWTIC’06), 2006.

  18. Tiwari, M., & Varma, S. (2010). March) Bird flight inspired clustering based routing protocol for mobile ad hoc networks. In IJCSNS International Journal of Computer Science and. Network Security, 10(3), 119–125.

  19. Roth, M., & Wicker, S. (2003, June). Termite: Emergent ad-hoc networking. In The 2nd Mediterranean workshop on ad-hoc networking (MedHoc 2003).

  20. Ruth, M., & Wicker, S. (2003). Termite: Ad-Hoc Networking with Stigmergy. IEEE Global Communication Conference, 5, 2937–2941.

    Google Scholar 

  21. Roth, M. (2006). A framework and model for soft routing—The Markovian Termite and other curious creatures. In Ant colony optimization and swarm intilligence. Lecture Notes in Computer Science, Vol. 4150

  22. Roth, M. (2007). The Markovian Termite: A soft routing framework. Swarm intelligence symposium (SIS-2007), (pp. 213–220). IEEE, 1–5th April, 2007.

  23. Roth, M., & Wicker, S. (2004). Network routing with filters: Link utility estimation in swarm intelligent MANETs. This Research is Sponsored by the Defence Advance Research Project Agency (DARPA) and administrated by the Army Research Office under Emergent Surveilliance Plexus MURI Award No. DAAD 19–01-1-0504.

  24. Roth, M., & Wicker, S. (2004). Asymptotic pheromone behavior in swarm intelligent MANETS–An analytical analysis of routing behavior. In Sixth IFIP IEEE international conference on nobile and wireless communication networks, MWCN.

  25. Kiran, M., Praveenkumar, G. H., & Reddy, G. R. M. (2012). Distance based Termite algorithm for mobile ad-hoc networks. In International conference on information processing (ICIP-2012), CCIS 292 (pp. 35–45). Springer, 10–12 August, 2012.

  26. Ling, S., & Wei, W. (2009). Multi-ant-colony based multi-path routing algorithm for overlay network. Global Congress on Intelligent Systems (GCIS), 1, 188–192.

    Google Scholar 

  27. Kim, S. (2012). An ant-based multipath routing algorithms for QoS aware mobile ad-hoc networks. Wireless Personal Communications, 66, 739–749.

    Article  Google Scholar 

  28. Hussein, O. H., Saadawi, T. N., & Lee, M. J. (2005 December). Probability routing algorithm for mobile ad hoc networks’ resources management. IEEE Journal on Selected Areas in Communications, 23(12), 2248–2259.

    Google Scholar 

  29. Stutzle, T., & Hoos, H. H. (2000). Max–Min ant system. Future Generation Computing Systems, 16(8), 889–914.

    Article  Google Scholar 

  30. Wong, K. Y., & See, P. C. (2009). A new minimum pheromone threshold strategy (MPTS) for Max–Min ant system. Applied Soft computing, 9, 882–888.

    Article  Google Scholar 

  31. Mathew, D. C. (2008). Improved lower limits for pheromone trails in ACO, LNCS 5199 (pp. 508–517). Berlin: Springer.

    Google Scholar 

  32. Laalaoui, Y., Drias, H., Bouridah, A., & Ahmed, R. B. (2009). Ant Colony system with stagnation avoidance for the scheduling of real time tasks. IEEE symposium on computational intelligence in scheduling (pp. 1–6).

  33. Kiran, M., & Reddy, G. R. M. (2011). Throughput enhancement of the prioritized flow in self aware MANET based on neighborhood node distances. In IEEE international conference on computer applications and industrial electronics (ICCAIE), 4–7th Dec, 2011, Penang, Malaysia.

  34. Network Simulator-2 (ns-2) (Online). http://www.isi.edu/vint/nsnam/.

  35. NS-2 simulation code for SARA: http://cnm.tagus.inesc-id.pt/software/simple-ant-routing-algorithm-sara.

  36. Perkins, C, Belding-Royer, E., & Das, S. (2003, July). Ad hoc on demand distance vector (AODV) routing. In Network working group, request for comments, vol. 3561.

Download references

Acknowledgments

This work is supported by RGNF Grant funded by the Indian Government (No. F. 14-2 (SC) / 2009 (SA III)).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Kiran.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kiran, M., Reddy, G.R.M. Design and Evaluation of Load Balanced Termite: A Novel Load Aware Bio Inspired Routing Protocol for Mobile Ad Hoc Network. Wireless Pers Commun 75, 2053–2071 (2014). https://doi.org/10.1007/s11277-013-1453-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1453-9

Keywords

Navigation