<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01422nam a22001337a 4500</leader>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">65859</subfield>
    <subfield code="d">65856</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Bhatti, Ghulam Mustafa </subfield>
    <subfield code="a">13MSST05</subfield>
    <subfield code="a">Supervisor - Dr. Adnan Ahmed Arain</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Comparative Analysis of Congestion Control Routing Protocol in AD HOC Networks </subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Nawabshah:</subfield>
    <subfield code="b">QUEST,</subfield>
    <subfield code="c">2019.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">28p.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">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.
</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Department of Information  Technology</subfield>
  </datafield>
  <datafield tag="856" ind1=" " ind2=" ">
    <subfield code="u">http://tinyurl.com/u3cda9r4</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RESEARCH</subfield>
    <subfield code="b">RESEARCH</subfield>
    <subfield code="d">2019-10-15</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">MP/53-654</subfield>
    <subfield code="r">2019-10-15 00:00:00</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RESEARCH</subfield>
    <subfield code="b">RESEARCH</subfield>
    <subfield code="d">2023-12-21</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">MP/44-504</subfield>
    <subfield code="r">2023-12-21 00:00:00</subfield>
    <subfield code="w">2023-12-21</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
</record>
