Comparative Analysis of Congestion Control Routing Protocol in AD HOC Networks
Material type:
TextPublication details: Nawabshah: QUEST, 2019.Description: 28pOnline resources:
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Thesis and Dissertation
|
Research Section | Available | MP/44-504 | |||||||||||||||
Thesis and Dissertation
|
Research Section | Available | MP/53-654 |
ABSTRACT
Congestion control in wireless ad-hoc networks is a genuine problem. In this thesis, the two routing protocols for congestion control are calculated. The measures to decrease the collision problem arc described wit h special congest ion control routing protocols. After the comparison between AODY and R-AODY with the help of some congest ion control mechanism, it is found that AODY works on a simple algorithm which is not sufficient to control the congestion in ad hoc network. On the other hand R-J\ODV uses drop factor techniques which drop the extra packets on the network and also decreases the congest ion
on heavy traffic load. However, R-AODV works better on heavy traffic as compared to
AODY. Apart from this, R-J\ODY 's performance is not affected y the quantity of mobile nodes and data rate. Additionally, my results show that when RAODY is compared with
/\ODY method , its delay per packet decreases hut the quantity of packet delivery ratio increases.
There are no comments on this title.