Hybridization of Brownboost and Random Forest Tree with Gradient Free Optimization for Route Selection

Authors

  • P. Tamilselvi
  • T.N. Ravi

DOI:

https://doi.org/10.47839/ijc.20.3.2286

Keywords:

MANET, Stale route elimination, Hybridization of Brownboost Cluster, Random Forest Decision Tree, Gradient Free optimization

Abstract

MANETs are self-organizing network architectures of mobile nodes. Due to node mobility, wireless network topologies dynamically various over time.   A novel link stability estimation technique called Hybridization of Brownboost Cluster and Random Forest Decision Tree with Optimized Route Selection (HBCRFDT-GORS) technique is introduced for increasing the reliable data delivery by eliminating the stale routes in MANET. Brown Boost technique is applied to find the route paths having the smaller number of hop counts to perform the data transmission. After that, the status of the mobile nodes in the selected route paths is determined based on the residual energy and signal strength. Then, a random forest decision tree is applied to correctly identify the stale routes by finding the link failure due to the selfish node and the corruptive node along the route path. Then the broken link is removed from the route path. After eliminating the stale route from the path, the HBCRFDT-GORS technique finds the alternative optimal route through the gradient free optimization.  The proposed HBCRFDT-GORS technique performs stale route elimination and improves reliable data delivery from source to destination. Simulation is conducted on different performance metrics such as routing overhead, packet delivery ratio, packet drop rate, and delay with respect to the number of data packets. The Network simulation results indicate that the HBCRFDT-GORS technique is improving the data delivery and and minimizing the delay as well as reducing the packet losses when compared to the baseline approaches.

References

N. Noor Alleema & D. Siva Kumar, “Volunteer nodes of ant colony optimization routing for minimizing delay in peer to peer MANETs,” Peer-to-Peer Networking and Applications, Springer, vol. 13, pp. 590– 600, 2020. https://doi.org/10.1007/s12083-019-00772-w.

M. Rao and N. Singh, “Energy efficient QoS aware hierarchical KF-MAC routing protocol in MANET,” Wireless Personal Communications, Springer, vol. 101, issue 2, pp. 635–648, 2018. https://doi.org/10.1007/s11277-018-5708-3.

Rajendra Prasad P. and S. Shankar, “Efficient performance analysis of energy aware on demand routing protocol in mobile ad-hoc network,” Engineering Reports, Wiley, vol. 2, issue 3, pp. 1-14, 2020. https://doi.org/10.1002/eng2.12116.

L. Femila and M. Marsaline Beno, “Optimizing transmission power and energy efficient routing protocol in MANETs,” Wireless Personal Communications, Springer, vol. 106, pp. 1041–1056, 2019. https://doi.org/10.1007/s11277-019-06202-7.

M. Rajashanthi and K. Valarmathi, “Energy-efficient multipath routing in networking aid of clustering with OGFSO algorithm,” Soft Computing, vol. 24, pp. 12845–12854, 2020. https://doi.org/10.1007/s00500-020-04710-4.

R. Aruna, R. Subramanian, P. Sengottuvelan, J. Shanthini, “Optimized energy efficient route assigning method using related node discovery algorithm in MANET,” Cluster Computing, Springer, vol. 22, pp. 469-479, 2019. ttps://doi.org/10.1007/s10586-018-2520-5.

N.S. Saba Farheen, A. Jain, “Improved routing in MANET with optimized multi path routing fine tuned with hybrid modeling,” Journal of King Saud University – Computer and Information Sciences, Elsevier, pp. 1-8, 2020. https://doi.org/10.1016/j.jksuci.2020.01.001.

D. Sarkar, S. Choudhury, A. Majumder, “Enhanced-Ant-AODV for optimal route selection in mobile ad-hoc network,” Journal of King Saud University – Computer and Information Sciences, Elsevier, pp. 1-16, 2018. https://doi.org/10.1016/j.jksuci.2018.08.013.

M. Anbarasan, S. Prakash, M. Anand, A. Antonidoss, “Improving performance inmobile ad hoc networks by reliable path selection routing using RPS-LEACH,” Concurrency and Computation: Practice and Experience, Wiley, vol. 31, issue 7, pp. 1-11, 2019. https://doi.org/10.1002/cpe.4984.

R. J. Cai, X. J. Li, P. H. J. Chong, “An evolutionary self-cooperative trust scheme against routing disruptions in MANETs,” IEEE Transactions on Mobile Computing, vol. 18, issue 1, pp. 42–55, 2019. https://doi.org/10.1109/TMC.2018.2828814.

J. Bai, Y. Sun, C. Phillips, and Y. Cao, “Toward constructive relay-based cooperative routing in MANETs,” IEEE Systems Journal, vol. 12, issue 2, pp. 1743–1754, 2018. https://doi.org/10.1109/JSYST.2017.2721543.

D. Kang, H.-S. Kim, C. Joo, S. Bahk, “ORGMA: Reliable opportunistic routing with gradient forwarding for MANETs,” Computer Networks, Elsevier, vol. 131, pp. 52-64, 2018. https://doi.org/10.1016/j.comnet.2017.12.001.

M. Zhang, M. Yang, Q. Wu, R. Zheng, J. Zhu, “Smart perception and autonomic optimization: A novel bio-inspired hybrid routing protocol for MANETs,” Future Generation Computer Systems, Elsevier, vol. 81, pp. 505-513, 2018. https://doi.org/10.1016/j.future.2017.07.030.

Y. Song, H. Luo, S. Pi, C. Gui, B. Sun, “Graph kernel based clustering algorithm in MANETs,” IEEE Access, vol. 8, pp. 107650–107660, 2020. https://doi.org/10.1109/ACCESS.2020.3001137.

Z. Chen, Wenli Zhou, S. Wu, L. Cheng, “An adaptive on-demand multipath routing protocol with QoS support for high-speed MANET,” IEEE Access, vol. 8, pp. 44760–44773, 2020. https://doi.org/10.1109/ACCESS.2020.2978582.

N. Wang, H. Zhao, L. Hai, “Distributed routing algorithm with dynamic connection partition for mobile ad hoc networks,” IET Networks, vol. 8, issue 4, pp. 239–245, 2019. https://doi.org/10.1049/iet-net.2018.5150.

S. Hao, H. Zhang, M. Song, “A stable and energy-efficient routing algorithm based on learning automata theory for MANET,” Journal of Communications and Information Networks, Springer, vol. 3, pp. 52-66, 2018. https://doi.org/10.1007/s41650-018-0012-7.

H. Zheng, C. Gao, Y. Yan, B. Chai, “An algorithm to construct minimum velocity based stable connected dominating sets for MANETs using strong neighborhoods,” Procedia Computer, Elsevier, vol. 174, pp. 591-596, 2020. https://doi.org/10.1016/j.procs.2020.06.129.

G. Singal, V. Laxmi, M.S. Gaur, S. Todi, V. Rao, M. Tripathi, R. Kushwaha, “Multi-constraints link stable multicast routing protocol in MANETs,” Ad Hoc Networks, Elsevier, vol. 63, pp. 115-128, 2017. https://doi.org/10.1016/j.adhoc.2017.05.007.

D. Chander, R. Kumar, “QoS enabled cross-layer multicast routing over mobile ad hoc networks,” Procedia Computer Science, Elsevier, vol. 125, pp. 215-227, 2018. https://doi.org/10.1016/j.procs.2017.12.030.

Downloads

Published

2021-09-30

How to Cite

Tamilselvi, P., & Ravi, T. (2021). Hybridization of Brownboost and Random Forest Tree with Gradient Free Optimization for Route Selection. International Journal of Computing, 20(3), 400-407. https://doi.org/10.47839/ijc.20.3.2286

Issue

2021, Volume 20, Issue 3

Section

Articles

License

International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:
•    Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
•    Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
•    Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.