An Approach In Optimization Of AD-Hoc Routing Algorithms

TL;DR

This paper surveys various optimization techniques for ad-hoc routing algorithms and proposes a new training-based optimization method that reduces routing complexity by updating binary matrices at each node.

Contribution

Introduces a novel training-based optimization approach for ad-hoc routing that minimizes routing complexity using binary matrix updates.

Findings

Optimization algorithms can significantly reduce routing complexity.

The proposed method effectively updates node matrices after data transfers.

Routing efficiency improves with the training-based approach.

Abstract

In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each node in the network and gets updated after each data transfer using the protocols. The use of optimization algorithm in routing algorithm can reduce the complexity of routing to the least amount possible.