A quality of service load balanced stochastic diffusion search (TABU) search (TSDS) network backbone for manet


  • V. R.Kavitha Department of Computer Science and Engineering, Prathyusha Engineering College, Chennai, Tamilnadu, India
  • M. Moorthi Electronics and Communication Engineering, Prathyusha Engineering College, Chennai, Tamilnadu, India






Quality of Service (QoS), Mobile Ad hoc Network (MANET), AOMDV (Ad hoc On-demand Multipath Distance Vector), Stochastic Diffusion Search (SDS) and TABU Search (TS).


The ad hoc network can present many different problems that influence a solution which can assure a proper quality of Service (QoS). The primary goal offered by the QoS was to ensure information delivery that was better and carried out by this network with a better network resource utilization. The main objective of the QoS routing found in the Mobile Ad hoc Network (MANET) was the optimization of the utilization of network resources when satisfying some application requirements. The AOMDV (the Ad hoc On-demand Multipath Distance Vector) and its routing protocol was a multipath extension of the protocol of AODV which aims at identifying a loop-free along with a link-disjoint multipath at the time of the process of route discovery. A Stochastic Diffusion Search (SDS) will have a strong framework in mathematics that can describe the algorithm and its behaviour by means of investi-gating resource allocation, linear time complexity, minimal criteria of convergence, global optimum convergence and robustness. The TABU Search (TS) is a search strategy based on memory for guiding the method of local search in order to continue a search beyond the local optimum. For this work, there is a hybrid SDS along with the TS which is proposed for improving the QoS load balancing.



[1] Srivastava, N., Srivastava, S., (2017) “A Survey on Ad Hoc On-Demand Multipath Distance Vector Routing Protocolâ€, International Journal of Advanced Research in Computer and Communication Engineering, Vol. 6, Issue 7, July 2017, pp. (53-55).

[2] M. Bheemalingaiah, M. M. Naidu, D. Sreenivasa Rao, et al., “Energy Aware Node-Disjoint Routing in Mobile Ad Hoc Networks,†Journal of Theoretical and Applied Information Technology, Vol. 5, No. 4, pp 416- 431, 2009.

[3] Tekaya, M., Tabbane, N., &Tabbane, S. (2010). Multipath routing with load balancing and QoS in ad hoc network. IJCSNS international Journal of computer science and network security, 10(8), 280-286. https://doi.org/10.1109/ICCES.2010.5674892.

[4] Armaghan, M., Haghighat, A. T., &Armaghan, M. (2009, October). Qos multicast routing algorithms based on tabu search with elite candidate list. In Application of Information and Communication Technologies, 2009. AICT 2009. International Conference on (pp. 1-5). IEEE. https://doi.org/10.1109/ICAICT.2009.5372563.

[5] Allakany, A. M., Mahmoud, T. M., Okamura, K., &Girgis, M. R. (2015). Multiple constraints QoS multicast routing optimization algorithm based on Genetic Tabu Search Algorithm. Advances in Computer Science: an International Journal, 4(3), 118-125.

[6] Yu, J., Wang, N., Wang, G., & Yu, D. (2013). Connected dominating sets in wireless ad hoc and sensor networks–A comprehensive survey. Computer Communications, 36(2), 121-134. https://doi.org/10.1016/j.comcom.2012.10.005.

[7] Shi, T., Cheng, S., Cai, Z., Li, Y., & Li, J. (2017). Exploring connected dominating sets in energy harvest networks. IEEE/ACM Transactions on Networking (TON), 25(3), 1803-1817. https://doi.org/10.1109/TNET.2017.2657688.

[8] Guibas, L., Milosavljević, N., &Motskin, A. (2013). Connected dominating sets on dynamic geometric graphs. Computational Geometry, 46(2), 160-172. https://doi.org/10.1016/j.comgeo.2012.01.004.

[9] Marina, M. K., & Das, S. R. (2001, November). On-demand multipath distance vector routing in ad hoc networks. In Network Protocols, 2001. Ninth International Conference on (pp. 14-23). IEEE.

View Full Article: