Agent-based hierarchal routing in large-dimension mobile networks

Abstract EN

Modern large-dimension computer networks (including mobile networks) have hierarchical structure, which allows solving network scalability problem and organizes the efficient routing system, with higher data security level.

In previous works [1-5], the scalability problem was solved by representing hierarchical routing by grouping near nodes into domains and using hybrid routing scheme of a classical proactive approach inside each domain and reactive approach between domains.

On one hand this approach has numerous advantages, such as; synchronization of stations in groups and finding a new service zones.

On the other hand it has a number of drawbacks, changing the topology structure, which requires continuous routing table update and changing of route table and increases the service traffic.

The aim is solving the optimization of traffic control in mobile networks that are related to use of dynamic routing algorithms, when the volume of control traffic depends on frequent changes in a network topology.

This research proposes a method of increasing efficiency of hierarchical routing fprocess based on the agent system, it also analyzed the dependence of change in distribution of network neighborhood of first and second network topology order and location of domain controllers, in addition it showed that changes in topology and those changes have non-linear pattern on density distribution dependence.