Opportunistic Routing Algorithm Based on Estimator Learning Automata

  • Zhuoran HanEmail author
  • Shenghong Li
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 463)


The mobile ad hoc network has proven its efficient performance for supporting multimedia and real-time applications in wireless network. The opportunistic routing is a kind of promising protocol for utilizing the characteristics of broadcast of MANET. In traditional opportunistic routing algorithm, the periodic update of link qualities has been employed in adjusting the network congestion condition. In this paper, we proposed Dynamic Cooperative Routing using Estimator Algorithm (DCREA). We use estimator learning automata to implement this algorithm so that it can accommodate dynamic network changes. The algorithm has been simulated on OMNET++ platform, and the result has shown that the DCREA outperforms traditional algorithm.


Opportunistic routing Learning automata  Mobile ad hoc network 


  1. 1.
    Biswas, S., Morris, R.: ExOR: opportunistic multi-hop routing for wireless networks. In: Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, vol. 35, pp. 133–144. ACM (2005)Google Scholar
  2. 2.
    Chachulski, S., Jennings, M., Katti, S., Katabi, D.: Trading structure for randomness in wireless opportunistic routing. In: Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, vol. 37, pp. 169–180. ACM (2007)Google Scholar
  3. 3.
    Ghasemi, M., Abdolahi, M., Bag-Mohammadi, M., Bohlooli, A.: Adaptive multi-flow opportunistic routing using learning automata. Ad Hoc Netw. 25(PB), 472–479 (2015)Google Scholar
  4. 4.
    Narendra, K.S., Thathachar, M.A.L.: Learning Automata: An Introduction (1989). DBLPGoogle Scholar
  5. 5.
    Oommen, B.J., Lanctot, J.K.: Discretized pursuit learning automata. IEEE Trans. Syst. Man Cybern. 20(4), 931–938 (1990)Google Scholar
  6. 6.
    Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: 1999 Second IEEE Workshop on Mobile Computing Systems and Applications, Proceedings, WMCSA 99, vol. 6, pp. 90–100. IEEE (2002)Google Scholar
  7. 7.
    Vasilakos, A.V., Papadimitriou, G. I., Paximadis, C.T.: A new approach to the design of reinforcement schemes for learning automata: stochastic estimator learning algorithms. In: IEEE International Conference on Systems, Man, and Cybernetics, 1991, decision Aiding for Complex Systems, Conference Proceedings, vol. 2 & 6, pp. 1387–1392. IEEE (2002)Google Scholar
  8. 8.
    Varga, A.: Omnet++-object-oriented discrete event simulatorGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Shanghai Jiao Tong UniversityShanghaiChina

Personalised recommendations