Comparative Study of Routing Mechanism for Ad Hoc Network

摘要

As we knew that the current working routing protocols for ad hoc network are use shortest path routing .it include On Demand routing protocols such as DSR and AODV it provides Qos for traffic management but it cannot support Quality of Services for timely and guaranteed transmission of data packet. Ad hoc network is dynamic in nature therefore we cannot directly use wire line protocol and algorithm so that we have been designed a natural time management scenario for routing the data. Exiting work in routing in a ad hoc networks is presented in(1),where protocol manage the delay and delay and bandwidth constrained in routing, To make the decision it will uses the deterministic model for choosing the routing decision but this paper use a periodic time scheduled for making the routing communication fast and timely with no data loss. Due to the dynamic nature of ad hoc networking it is necessary for an organization that communication performance major should be there for reliability and network management so that performance major for finding routs (path) based on least cost routing using hop count performance will be major. In this paper we are handling the time quantum at each and every node of the ad hoc network it making the overheads but provide the services of confidentially reliable communication.