International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 26 - Number 2 |
Year of Publication: 2011 |
Authors: Mustafa Jasim AL-Jubori, S. S. Pawale, S. R. Shinde |
10.5120/3072-4201 |
Mustafa Jasim AL-Jubori, S. S. Pawale, S. R. Shinde . Efficient Ad-Hoc On-demand Distance Vector Routing Protocol using Link State Algorithm. International Journal of Computer Applications. 26, 2 ( July 2011), 48-52. DOI=10.5120/3072-4201
We developed a new algorithm for route discovery, nodes management, and mobility handling for on-demand cache routing on mobile Ad-Hoc networks (MANET). We used Ad-Hoc On demand Distance Vector (AODV) protocol as the better known reactive protocol, as well as using Link State algorithm of the Optimize Link State Routing (OLSR) protocol together. We used two levels of caches memory L-1 and L-2 along with link state routing table for each node. Which maintaining by using the algorithm of OLSR, which working under the AODV protocol. For mobility handling, we used link state algorithm working under AODV to manage node addition, deletion and movement in the network efficiently. We used the Network simulator NS-2 version 2.29 to show the results comparing with the AODV used just cache memory, and comparing with AODV without cache memory. The results shows that our algorithms outperform comparing with AODV without cache memories, and AODV with two levels of cache memory on packet delivery rate, where the link state routing protocol is used to distribute and maintain routing information among various nodes within a domain by using two messages which are Hello messages and Topology Control messages (TC).