Efficient Reactive Routing Algorithm Based On Link Node For Mobile Ad Hoc Networks

Presently, in wireless communication systems and technology of mobile are growth sofast and they acquired for the rapid deployment of independent mobile users. This indicatedthat instantly include establishing survivable, efficient, dynamic communication for rescue/emergency operations, military networks, and disaster relief efforts. Such network scenarioscannot rely on centralized and organized connectivity and can be superficial as applicationsof mobile ad hoc networks (MANETs).In this thesis, we anticipated an efficient reactive routing algorithm in mobile ad hocnetwork that determined by link position. This presented routing algorithm, initially, wedetermined the efficient link reference and set up the relationship among power consumption,signal to noise ratio and packet reception probability in wireless link. Next, we using efficientlink node defined by efficient link reference to observe the link more effective. In this case,the performance motivation is better than other on-demand routing protocols in conditions ofreliable route, packet delay, power consumption and routing overhead. To fulfil this situation,we decrease power consumption and use the connection between packet reception probabilityand mini-power consumption for transmitting data packet. The comparison of this proposedrouting algorithm has better performance than other reactive routing algorithm.In order to verify the proposed routing algorithm, our evaluation is the NS-2simulatorwith DSDV, AODV, and DSR routing algorithm proposed. In our simulations, weevaluated the packet delivery ratio, routing overhead and average end-to-end delay.Simulation results show that this is the PDR behaviour of about2-4percent better thanothers, the end-to-end delay decreases average0.06-0.2seconds better than AODV andDSDV routing overhead (control message) reduced by10-15percent, compared withAODV. The simulation outcome shows that the proposed routing algorithm is more reliablethan other existing DSDV, AODV, and DSR. Otherwise, the results of simulation show thatthe performance of our proposed routing algorithm is superior to the existing routingprotocols delay, packet reception rate and routing overhead.