A Heuristic Routing Mechanism Using a New Addressing Scheme

TL;DR

This paper introduces a novel heuristic routing mechanism utilizing variable addresses and genetic algorithms, offering flexible solutions for dynamic networks, especially ad-hoc networks with mobility challenges.

Contribution

It presents a new variable addressing scheme combined with heuristic routing based on genetic algorithms, a novel approach compared to traditional fixed-address routing methods.

Findings

Effective routing in ad-hoc networks with mobility.

Flexible adaptation to network changes.

Original solutions for mobility issues.

Abstract

Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network changes. Despite the variability of data in routing tables, node addresses are constant. In this paper, we first introduce the new concept of variable addresses, which results in a novel framework to cope with routing problems using heuristic solutions. Then we propose a heuristic routing mechanism based on the application of genes for determination of network addresses in a variable address network and describe how this method flexibly solves different problems and induces new ideas in providing integral solutions for variety of problems. The case of ad-hoc networks is where simulation results are more supportive and original solutions have been proposed for issues like mobility.