<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en-US" 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/55169.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">55169</article-id>
<title-group>
<article-title>FREE HIT A Novel History based Reinforcement Approach for Fast Path Construction in Vehicular Ad hoc Networks</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Manchu</surname><given-names>Abhilash Kumar Reddy</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
<contrib contrib-type="author"><name><surname>Reddy</surname><given-names>A.Rama Mohan</given-names></name></contrib>
</contrib-group>
<aff id="aff1">INDIA, Sri Venkateswara University College of Engineering,Tirupati.</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2017-01-15">
<day>15</day>
<month>01</month>
<year>2017</year>
</pub-date>
<volume>17</volume>
<issue>E4</issue>
<fpage>1</fpage>
<lpage>8</lpage>
<abstract><p>Vehicular ad hoc networks playing significant role in development of intelligent transport system and rise in demand for accessing fascinated applications such as entertainment and advertisements in vehicles via internet leverages to build efficient routing mechanisms. Due to rapid vehicles flow in Vanets, network often subjected to link breaks and creates delay in communication which affects overall network performance, hence to address these serious issue earlier approaches focused on parameters like rate estimation, feedback and link-expiration-time but being different from earlier our Instant Look up and Immediate Action(ILU-IA) technique uses adaptive learning thru past knowledge. ILU-IA identifies immediate neighbour (Free-Hit-Node) efficiently at point of link failure using Case- Based-Learning and Q-learning techniques. Simulation analysis shows that proposed approach performance improved in terms of throughput with negligible delay also reduces network overhead.</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>vanets</kwd>
<kwd>graph-attribute</kwd>
<kwd>case-based-learning</kwd>
<kwd>q-learning</kwd>
<kwd>path reliability</kwd>
<kwd>intelligent road side units.</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://globaljournals.org/GJCST_Volume17/1-FREE-HIT–A-Novel-History.pdf" />
<self-uri content-type="html" xlink:href="https://globaljournals.org/scholarly-articles/free-hit-a-novel-history-based-reinforcement-approach-for-fast-path-construction-in-vehicular-ad-hoc-networks/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>Vehicular ad hoc networks playing significant role in development of intelligent transport system and rise in demand for accessing fascinated applications such as entertainment and advertisements in vehicles via internet leverages to build efficient routing mechanisms. Due to rapid vehicles flow in Vanets, network often subjected to link breaks and creates delay in communication which affects overall network performance, hence to address these serious issue earlier approaches focused on parameters like rate estimation, feedback and link-expiration-time but being different from earlier our Instant Look up and Immediate Action(ILU-IA) technique uses adaptive learning thru past  knowledge. ILU-IA identifies immediate neighbour (Free-Hit-Node) efficiently at point of link failure using Case- Based-Learning and Q-learning techniques. Simulation analysis shows that proposed approach performance  improved in terms of throughput with negligible delay also reduces network overhead.</p>
</sec>
</body>
</article>