Abstract:

An ad hoc network is a kind of temporary Local Area Network (LAN) where multiple devices can be used at the same time, however, it reduces the performance of the network. Another issue faced by the users of ad-hoc is establishing configuration. Since the user devices are portable it changes the topology based on the location. There is no centralized framework and hence it is ineluctable to define the way of allotting IP addresses to the nodes. This is an arduous task due to the fact that the connections of nodes are dropped unexpectedly or by purpose. This minimizes the throughput of the network. To tackle those issues, we proposed a novel protocol in this article known as the AIPAC(Automatic IP Address Configuration)based Hunger Game-search (HGS) optimization model. This method is exploited to enrich the Optimized gradual merging index ( Ogmi ) and deletes the duplicate addresses in the network. This method is also utilized to manage the configuration, IP addresses, and so on. To analyze the performance we used the NS2 simulator which can be used to verify the efficacy of the applied protocol. This method also eliminates the overlapping and traffic issues in the dynamic ad-hoc network.

Description:

Hunger Game search, dynamic network, IP addresses, gradual merging index, traffic, and GPS