Congestion Aviodance in Internal Nodes of Ad hoc Mobile Networks

M. Al-Hakak, Dr.Nada; A. Ibrahim, Nawal

	Congestion Aviodance in Internal Nodes of Ad hoc Mobile Networks
Baghdad College of Economic sciences University
Article 1, Volume 0, Issue 35, 2018, Pages 383-388
Authors
Dr.Nada M. Al-Hakak; Nawal A. Ibrahim
Abstract
Ad hoc network consist of nodes that communicate without the need of any centralized infrastructure . Because of the limited range of wireless devices, each node can be a router if it is an intermediate node on a route between any source and destination. Congestion is one of the main problems that networks suffer. It may occur if a node is part in several routes between sources and destinations. There are many studies on congestions, but they depend on algorithms that monitor a queue length at network nodes, That means they don't solve the congestion problems directly. In this paper, we proposed an algorithm that solves the congestion problem in ad hoc network directly by monitoring and limiting the number of routes that a node can be part of . If the number of routes exceeds a threshold on congestion Limit, the node will refuse being a part of any new routes until the number of its routes falls below the congestion limit. However, if a source node does not find a route, it can force the nodes to accept the route request. The performance of the proposed algorithm was evaluated and compared with the AODV protocol using GlomoSim simulator. Several performance parameters were used, including delivery success ratio, overhead and end-to-end delay . The simulation results show the proposed algorithm can outperform AODV substantially.

Statistics Article View: 65 PDF Download: 37