ition-based Opportunistic Routing for Highly Dynamic MANETSition-based Opportunistic Routing for Highly Dynamic MANETS
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2013, Vol 2, Issue 2
Abstract
This paper solves the problem of delivering data packets for highly dynamic mobile ad hoc networks in a timely and reliable way. Already existing ad hoc routing protocols are susceptible to node mobilty.The issue is solved by an efficient Position-based Opportunistic Routing (POR) protocol which takes the property of geographic routing. When a data packet is sent out from the source node, some of the neighbor nodes will be the forwarding candidates, and it will forward the packet if it is not forwarded by the best forwarder in a particular period of time. Communication hole is avoided by Virtual Destinationbased Void Handling(VDVH) scheme .
Authors and Affiliations
S. Sharon Ranjini, , G. ShineLet
Keywords
Related Articles
- EP ID EP151727
- DOI -
- Views 98
- Downloads 0
An Improved Approach in Clustering Algorithm for Load Balancing in Wireless Sensor Networks
Wireless sensor networks represent the next generation of sensing machines and structures. Inherent limited energy resource is the one of the limitations of wireless sensor nodes. In order to distribute the energ...
Performance Analysis of AODV and DSDV in Simulation Based Map
In recent days Inter-Vehicle communication has fascinated many research communities and automotive industries .With the introduction of inter-vehicle communication it would be possible for vehicles to communicate...
Conceptual Dependency Based Requirements Clustering for Component Selection
Component Based System (CBS) development is used to integrate existing components to build a software system, with the potential benefits of reducing development time and delivering quality system by using quality compon...
Survey on Improving the Performance of Web by Evaluation of Web Prefetching and Caching Algorithms
Web caching and prefetching have been studied in the past separately. In this paper, we present an integrated architecture for Web object caching and prefetching. Our goal is to design a prefetching system that c...
XML Query Answering using Tree based Association Rules
Mainly two approaches are used to access XML document: keyword-based search and query-answering. The first one comes from the tradition of information retrieval. Where most searches are performed on the textual con...