Open AccessCongestion Control Through EDA with Shortest Path
Author(s) -
Seyed Amin Ahmadi Olounabadi*,
Avula. Damodaram,
V. Kamakshi Prasad,
Pvs Srinivas
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.b3661.129219
Subject(s) - computer network , computer science , node (physics) , network congestion , wireless ad hoc network , data transmission , successor cardinal , mobile ad hoc network , path (computing) , shortest path problem , transmission (telecommunications) , distributed computing , engineering , telecommunications , wireless , theoretical computer science , mathematics , mathematical analysis , graph , structural engineering , network packet
Ad hoc mobile networks contain remote nodes linking through electronic media, without any set backend facilities. Disturbance happens in any type of intermediate nodes in these networks when data packages travel from resource to destination, leading to high package loss and also lengthy delay, triggering network efficiency destruction. This paper presents EDAODV congestion and also command directing protocol for mobile ad-hoc networks. Via determining line position and also identifying congestion degrees, EDAODV senses node-level blockage. Based on blockage rates, EDAODV makes use of the uncongested precursor and successor nodes of an overloaded node as well as starts bi-directional processes to determine alternative, uncongested courses in between them for data transmission. The algorithm discovers a lot more non-congested remedies, picking the very best solitary course for data transmission.