A Hypothesis for Ad-Hoc Routing Algorithm Improvement
Main Article Content
Abstract
In this article, a new approach to reducing the complexity of routing algorithms is discussed to improve routing in ad hoc networks. To avoid duplicating the routing process for each data transfer, nodes create binary matrices for each base station and update them when the routing is complete. Routing may be made much simpler using the method given here.
Article Details
How to Cite
Pragya Kabra, et. al. (2023). A Hypothesis for Ad-Hoc Routing Algorithm Improvement. International Journal on Recent and Innovation Trends in Computing and Communication, 11(7), 446–450. https://doi.org/10.17762/ijritcc.v11i7.10060
Issue
Section
Articles