<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">global-journal-of-computer-science-and-technology-e-network-web-security</journal-id>
<journal-title-group>
<journal-title>Global Journal of Computer Science and Technology - E: Network, Web &amp; Security</journal-title>
</journal-title-group>
<issn publication-format="print">0975-4350</issn>
<issn publication-format="electronic">0975-4172</issn>
<publisher><publisher-name>Global Journals Publishing Group Incorporated</publisher-name></publisher>
<self-uri xlink:href="https://globaljournals.org/journal-seo-export/jats/77453.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">77453</article-id>
<title-group>
<article-title>QoS Routing solution based on Genetic Algorithm for MANETs</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Chandra</surname><given-names>M.L.Ravi</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
<contrib contrib-type="author"><name><surname>Reddy</surname><given-names>Dr. P. Chandra Sekhar</given-names></name></contrib>
</contrib-group>
<aff id="aff1">INDIA, NETAJI INSTITUTE OF ENGINEERING &amp; TECHNOLOGY/ JNTU, HYDERABAD</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2014-01-15">
<day>15</day>
<month>01</month>
<year>2014</year>
</pub-date>
<volume>14</volume>
<issue>E4</issue>
<fpage>23</fpage>
<lpage>28</lpage>
<abstract><p>Qos routing protocol design for mobile ad-hoc networks is more challenging than wire lane network. Mainly due to node mobility, multi hop communications, contention for channel access and lack of central ordination.QoS guarantees are required by the most of the applications. Most optimal route has to be selected from source to destination by using QoS routing protocol. Many routing protocols are designed for single QoS metric. If it requires to design routing protocol for multi constrained routing path, normal algorithms can be failed. In this paper we proposed genetic algorithm based route selection protocol to solve the multi constrained QoS route. Genetic algorithm finds the optimal route with population initialization, cross over, mutation and fitness function calculation. QoS constraints consists of end to end delay, band width, packet loss rate, node connectivity index (Ni) and dynamic resource availability. Simulations have been performed in ns-2. Performance of genetic algorithm is compared with AOMDV and results shows that genetic algorithm is giving efficient results for different metrics (delay, throughput and Delivery ratio).</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>genetic algorithm</kwd>
<kwd>AOMDV</kwd>
<kwd>mutation</kwd>
<kwd>cross over and fitness function.</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://globaljournals.org/GJCST_Volume14/4-QoS-Routing-Solution.pdf" />
<self-uri content-type="html" xlink:href="https://globaljournals.org/scholarly-articles/qos-routing-solution-based-on-genetic-algorithm-for-manets/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>Qos routing protocol design for mobile ad-hoc networks is more challenging than wire lane network. Mainly due to node mobility, multi hop communications, contention for channel access and lack of central ordination.QoS guarantees are required by the most of the applications. Most optimal route has to be selected from source to destination by using QoS routing protocol. Many routing protocols are designed for single QoS metric. If it requires to design routing protocol for multi constrained routing path, normal algorithms can be failed. In this paper we proposed genetic algorithm based route selection protocol to solve the multi constrained QoS route. Genetic algorithm finds the optimal route with population initialization, cross over, mutation and fitness function calculation. QoS constraints consists of end to end delay, band width, packet loss rate, node connectivity index (Ni) and dynamic resource availability. Simulations have been performed in ns-2. Performance of genetic algorithm is compared with AOMDV and results shows that genetic algorithm is giving efficient results for different metrics (delay, throughput and Delivery ratio).</p>
</sec>
</body>
</article>