<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">inf17402</article-id><article-id pub-id-type="doi">10.15388/Informatica.2006.150</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Optimized on Demand Routing Protocol of Mobile Ad Hoc Network</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Jayakumar</surname><given-names>Chinnappan</given-names></name><email xlink:href="mailto:c_jayakumar2000@yahoo.com">c_jayakumar2000@yahoo.com</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><contrib contrib-type="Author"><name><surname>Chellappan</surname><given-names>Chenniappan</given-names></name><email xlink:href="mailto:drcc@annauniv.edu">drcc@annauniv.edu</email><xref ref-type="aff" rid="j_INFORMATICA_aff_001"/></contrib><aff id="j_INFORMATICA_aff_000">Research Associate, Department of Computer Science and Engineering, Anna University, Chennai, India-600025</aff><aff id="j_INFORMATICA_aff_001">Ramanujan Computing Center, Anna University, Chennai, India-600025</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>2006</year></pub-date><volume>17</volume><issue>4</issue><fpage>481</fpage><lpage>502</lpage><history><date date-type="received"><day>01</day><month>02</month><year>2005</year></date></history><abstract><p>In this paper optimization of DSR is achieved using New Link Cache structure and Source Transparent Route Maintenance Method. The new link cache effectively utilizes the memory by caching the routes in adjacent list type of data structures. It selects the shortest hop and least congested path, which in turn reduce the control packets, route request packets, route reply packets and increase the data packets forwarded by the nodes. To solve the DSR route maintenance problem during high mobility, source transparent route maintenance method is introduced in this paper. This method has two schemes namely cache validation and local route repair. These schemes reduce the packet loss, end-to-end delay and increase the throughput.</p></abstract><kwd-group><label>Keywords</label><kwd>link cache</kwd><kwd>local route repair</kwd><kwd>sequence number and cache validation</kwd></kwd-group></article-meta></front></article>