Skip to main content
SpringerLink
Log in

A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Reliable routing of packets in a Mobile Ad Hoc Network (MANET) has always been a major concern. The open medium and the susceptibility of the nodes of being fault-prone make the design of protocols for these networks a challenging task. The faults in these networks, which occur either due to the failure of nodes or due to reorganization, can eventuate to packet loss. Such losses degrade the performance of the routing protocols running on them. In this paper, we propose a routing algorithm, named as learning automata based fault-tolerant routing algorithm (LAFTRA), which is capable of routing in the presence of faulty nodes in MANETs using multipath routing. We have used the theory of Learning Automata (LA) for optimizing the selection of paths, reducing the overhead in the network, and for learning about the faulty nodes present in the network. The proposed algorithm can be juxtaposed to any existing routing protocol in a MANET. The results of simulation of our protocol using network simulator 2 (ns-2) shows the increase in packet delivery ratio and decrease in overhead compared to the existing protocols. The proposed protocol gains an edge over FTAR, E2FT by nearly 2% and by more than 10% when compared with AODV in terms of packet delivery ratio with nearly 30% faulty nodes in the network. The overhead generated by our protocol is lesser by 1% as compared to FTAR and by nearly 17% as compared to E2FT when there are nearly 30% faulty nodes.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Salem N, Hubaux J-P (2006) Securing wireless mesh networks. IEEE Wirel Commun 13(2):50–55. doi:10.1109/MWC.2006.1632480

    Article  Google Scholar 

  2. Akyildiz I, Wang X, Wang W (2005) Wireless mesh networks: a survey. Comput Netw 47(4):445–487. doi:10.1016/j.comnet.2004.12.001

    Article  MATH  Google Scholar 

  3. Yi P, Tong T, Liu N, Wu Y, Ma J (2009) Security in wireless mesh networks: challenges and solutions. In: Sixth international conference on information technology new generations, ITNG ’09, 27–29 April, pp 423–428. doi:10.1109/ITNG.2009.20

    Chapter  Google Scholar 

  4. Glass S, Portmann M, Muthukkumarasamy V (2008) Securing wireless mesh networks. IEEE Internet Comput 12(4):30–36. doi:10.1109/MIC.2008.85

    Article  Google Scholar 

  5. Xue Y, Nahrstedt K (2004) Providing fault-tolerant ad hoc routing service in adversarial environments. Wirel Pers Commun 29(3–4):367–388

    Article  Google Scholar 

  6. Xue Y, Nahrstedt K (2003) Fault-tolerant routing in mobile ad hoc networks. In: Wireless communications and networking, 2003, WCNC, 20–20 March, vol 2, pp 1174–1179. doi:10.1109/WCNC.2003.1200537

    Chapter  Google Scholar 

  7. Royer EM, Toh C-K (1999) A review of current routing protocols for ad hoc mobile wireless networks. IEEE Pers Commun 6(2):46–55. doi:10.1109/98.760423

    Article  Google Scholar 

  8. Narendra KS, Thathachar MAL (1974) Learning automata: a survey. IEEE Trans Syst Man Cybern SMC-4(4):323–334. doi:10.1109/TSMC.1974.5408453

    Article  MathSciNet  Google Scholar 

  9. Tsetlin ML (1973) Automaton theory and the modelling of biological systems. Academic Press, New York/London

    Google Scholar 

  10. Narendra KS, Thathachar MAL (1989) Learning automata. Prentice-Hall, New York

    Google Scholar 

  11. Oommen BJ, Misra S (2006) A fault-tolerant routing algorithm for mobile ad hoc networks using a stochastic learning-based weak estimation procedure. In: IEEE international conference on wireless and mobile computing, networking and communications, (WiMob’2006), 19–21 June, pp 31–37. doi:10.1109/WIMOB.2006.1696374

    Chapter  Google Scholar 

  12. Misra S, Dhurandher SK, Obaidat MS, Verma K, Gupta P (2009) Using ant-like agents for fault-tolerant routing in mobile ad-hoc networks. In: IEEE international conference on communications ICC’09, 14–18 June, pp 1–5. doi:10.1109/ICC.2009.5199555

    Google Scholar 

  13. Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: Varela F, Bourgine P (eds) Proceedings of the European conference on artificial life (ECAL’91), Paris, France, pp 134–142. Elsevier, Amsterdam

    Google Scholar 

  14. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern, Part B, Cybern 26(1):29–41. doi:10.1109/3477.484436

    Article  Google Scholar 

  15. Torkestani JA, Meybodi MR (2010) Weighted steiner connected dominating set and its application to multicast routing in wireless MANETs. Wirel Personal Commun. doi:10.1007/s11277-010-9936-4

  16. Zarei M, Faez K, Nya JM, Meinagh MA (2008) Route stability estimation in mobile ad hoc networks using learning automata. In: 16th telecommunications forum TELFOR 2008, Belgrade, Serbia, Nov 25–27, pp 76–79

    Google Scholar 

  17. Perkins C, Belding-Royer E, Das S (2003) Ad hoc on-demand distance vector (AODV) routing. IETF, RFC 3561, July

  18. Lakshmivarahan S (1981) Learning algorithms: theory and applications. Springer, New York

    Book  MATH  Google Scholar 

  19. Obaidat MS, Papadimitriou GI, Pomportsis AS (2002) Learning automata: theory, paradigms, and applications. IEEE Trans Syst Man Cybern, Part B, Cybern 32(6):706–709. doi:10.1109/TSMCB.2002.1049604

    Article  Google Scholar 

  20. Najim K, Poznyak AS (1996) Multimodal searching technique based on learning automata with continuous input and changing number of actions. IEEE Trans Syst Man Cybern, Part B, Cybern 26(4):666–673. doi:10.1109/3477.517043

    Article  Google Scholar 

  21. Obaidat MS, Papadimitriou GI, Pomportsis AS (2000) Fast learning automata for high-speed real-time applications. In: The 7th IEEE international conference on electronics, circuits and systems, ICECS 2000, vol 2, pp 633–636. doi:10.1109/ICECS.2000.912957

    Google Scholar 

  22. Najim K, Poznyak AS (1994) Learning automata: theory and applications. Pergamon Press, Oxford

    Google Scholar 

  23. Oommen BJ, Misra S (2009) Cybernetics and learning automata. In: Nof S (ed) Handbook of automation. Springer, Berlin. Chap 12

    Google Scholar 

  24. Misra S, Krishna PV, Abraham KI (2010) Adaptive link-state routing and intrusion detection in wireless mesh networks. IET Inf Sec 4(4):374–389. doi:10.1049/iet-ifs.2009.0196

    Article  Google Scholar 

  25. Misra S, Krishna PV, Abraham KI (2010) Stochastic packet sampling for adaptive intrusion detection in vehicular ad-hoc networks. Secur Commun Netw. doi:10.1002/sec.200

  26. Misra S, Oommen BJ, Yanamandra S, Obaidat MS (2010) Random early detection for congestion avoidance in wired networks: a discretized pursuit learning-automata-like solution. IEEE Trans Syst Man Cybern, Part B, Cybern 40(1):66–76. doi:10.1109/TSMCB.2009.2032363

    Article  Google Scholar 

  27. Misra S, Tiwari V, Obaidat MS (2009) Adaptive learning solution for congestion avoidance in wireless sensor networks. In: IEEE/ACS international conference on computer systems and applications, AICCSA, 10–13 May, pp 478–484. doi:10.1109/AICCSA.2009.5069367

    Chapter  Google Scholar 

  28. Oommen BJ, Misra S, Granmo O-C (2007) Routing bandwidth-guaranteed paths in MPLS traffic engineering: a multiple race track learning approach. IEEE Trans Comput 56(7):959–976. doi:10.1109/TC.2007.1045

    Article  MathSciNet  Google Scholar 

  29. Misra S, Oommen BJ (2009) An efficient pursuit automata approach for estimating stable all-pairs shortest paths in stochastic network environments. Int J Commun Syst 22(4):441–468

    Article  Google Scholar 

  30. Misra S, Oommen BJ (2005) Dynamic algorithms for the shortest path routing problem: learning automata-based solutions. IEEE Trans Syst Man Cybern, Part B, Cybern 35(6):1179–1192. doi:10.1109/TSMCB.2005.850180

    Article  Google Scholar 

  31. Misra S, Oommen BJ (2006) An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks. IEEE Trans Comput 55(6):686–702. doi:10.1109/TC.2006.83

    Article  Google Scholar 

  32. Papadimitriou GI, Maritsas DG (1996) Learning automata-based receiver conflict avoidance algorithms for WDM broadcast-and-select star networks. IEEE/ACM Trans Netw 4(3):407–412. doi:10.1109/90.502239

    Article  Google Scholar 

  33. Nicopolitidis P, Papadimitriou GI, Pomportsis AS (2003) Learning automata-based polling protocols for wireless LANs. IEEE Trans Commun 51(3):453–463. doi:10.1109/TCOMM.2003.809788

    Article  Google Scholar 

  34. Vasilakos A, Saltouros MP, Atlassis AF, Pedrycz W (2003) Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques. IEEE Trans Syst Man Cybern, Part C, Appl Rev 33(3):297–312. doi:10.1109/TSMCC.2003.817354

    Article  Google Scholar 

  35. Thathachar MAL, Sastry PS (2003) Networks of learning automata. Kluwer Academic, Dordrecht

    Google Scholar 

  36. Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementation. Wiley, New York

    Google Scholar 

  37. ns-2: Network Simulator 2, http://www.nsnam.org (2011)

Download references

Author information

Authors and Affiliations

  1. School of Information Technology, Indian Institute of Technology, Kharagpur, West Bengal, India

    Sudip Misra

  2. School of Computing Science and Engineering, VIT University, Vellore, Tamil Nadu, India

    P. Venkata Krishna, Akhil Bhiwal & Amardeep Singh Chawla

  3. Department of Informatik, University of Hamburg, Hamburg, Germany

    Bernd E. Wolfinger

  4. Hanshin University, Osan-si city, Korea

    Changhoon Lee

Authors
  1. Sudip Misra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Venkata Krishna
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Akhil Bhiwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Amardeep Singh Chawla
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bernd E. Wolfinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Changhoon Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sudip Misra.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Misra, S., Krishna, P.V., Bhiwal, A. et al. A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks. J Supercomput 62, 4–23 (2012). https://doi.org/10.1007/s11227-011-0639-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-011-0639-8

Keywords

Search

Navigation