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

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.

[1]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[2]  Jean-Pierre Hubaux,et al.  Securing wireless mesh networks , 2006, IEEE Wireless Communications.

[3]  Vivek Tiwari,et al.  Adaptive learning solution for congestion avoidance in wireless sensor networks , 2009, 2009 IEEE/ACS International Conference on Computer Systems and Applications.

[4]  Mohammad S. Obaidat,et al.  Guest editorial learning automata: theory, paradigms, and applications , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[5]  Kaddour Najim,et al.  Learning Automata: Theory and Applications , 1994 .

[6]  Kaddour Najim,et al.  Multimodal searching technique based on learning automata with continuous input and changing number of actions , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[7]  B. John Oommen,et al.  An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks , 2006, IEEE Transactions on Computers.

[8]  S. Lakshmivarahan,et al.  Learning Algorithms Theory and Applications , 1981 .

[9]  Mohammad S. Obaidat,et al.  Using Ant-Like Agents for Fault-Tolerant Routing in Mobile Ad-Hoc Networks , 2009, 2009 IEEE International Conference on Communications.

[10]  P. Venkata Krishna,et al.  Adaptive link-state routing and intrusion detection in wireless mesh networks , 2010, IET Inf. Secur..

[11]  Mohammad S. Obaidat,et al.  Fast learning automata for high-speed real-time applications , 2000, ICECS 2000. 7th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.00EX445).

[12]  Klara Nahrstedt,et al.  Providing Fault-Tolerant Ad hoc Routing Service in Adversarial Environments , 2004, Wirel. Pers. Commun..

[13]  Georgios I. Papadimitriou,et al.  Learning automata-based receiver conflict avoidance algorithms for WDM broadcast-and-select star networks , 1996, TNET.

[14]  B. John Oommen,et al.  Random Early Detection for Congestion Avoidance in Wired Networks: A Discretized Pursuit Learning-Automata-Like Solution , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[15]  Vallipuram Muthukkumarasamy,et al.  Securing Wireless Mesh Networks , 2008, IEEE Internet Computing.

[16]  Kumpati S. Narendra,et al.  Learning Automata - A Survey , 1974, IEEE Trans. Syst. Man Cybern..

[17]  William Stallings,et al.  Wireless Communications and Networks , 2001, 2020 International Conference on Smart Systems and Technologies (SST).

[18]  Petros Nicopolitidis,et al.  Learning automata-based polling protocols for wireless LANs , 2003, IEEE Trans. Commun..

[19]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[20]  P. Venkata Krishna,et al.  A stochastic learning automata-based solution for intrusion detection in vehicular ad hoc networks , 2011, Secur. Commun. Networks.

[21]  M. A. L. Thathachar,et al.  Networks of Learning Automata , 2004 .

[22]  B. John Oommen,et al.  Cybernetics and Learning Automata , 2009, Handbook of Automation.

[23]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[24]  B. John Oommen,et al.  Dynamic algorithms for the shortest path routing problem: learning automata-based solutions , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[25]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[26]  Sudip Misra,et al.  Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering: A Multiple Race Track Learning Approach , 2007, IEEE Transactions on Computers.

[27]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[28]  Yue Wu,et al.  Security in Wireless Mesh Networks: Challenges and Solutions , 2009, 2009 Sixth International Conference on Information Technology: New Generations.

[29]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[30]  Eyal Kushilevitz,et al.  Learning Automata , 2008, Encyclopedia of Algorithms.

[31]  B. John Oommen,et al.  Fault-Tolerant Routing in Mobile Ad Hoc Networks , 2011 .

[32]  B. John Oommen,et al.  Performance evaluation for asynchronous MC-CDMA systems with a symbol timing offset , 2009 .

[33]  Witold Pedrycz,et al.  Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques , 2003, IEEE Trans. Syst. Man Cybern. Part C.

[34]  Mohammad Reza Meybodi,et al.  Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs , 2011, Wirel. Pers. Commun..

[35]  B. John Oommen,et al.  A Fault-Tolerant Routing Algorithm for Mobile Ad Hoc Networks Using a Stochastic Learning-Based Weak Estimation Procedure , 2006, 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.