Efficient Route Discovery Algorithm for MANETs

Route Discovery Optimization

Highlights
Proposed Method Mechanism Used Proposed Algorithm

Proposed Method
Algorithm for Route Discovery Optimization. New routing discovery algorithm ERDA is proposed for MANET. ERDA improves traditional route discovery algorithms. It reduces routing overhead in the traffic. Need : Unfortunately sometimes route request will keep spreading even after a route has been found and this will congest the network and waste the bandwidth. Hence there is need of this novel approach.

Mechanism Used
Each source maintains a neighborhood region. Route requests are broadcasted in this region by using routing algorithm. Algorithm deliberately delays transmission of route requests beyond neighborhood region. This delays provides chasing mechanism, which is used to stop the propagation. Thus it minimizes congestion. ERDA is adaptive It continuously updates the neighborhood boundary.

Mechanism Used
It employs chase packets approach. Chase packet is control packet, broadcasted after finding the desired route to stop the further route request propagation.

Proposed Algorithm
ERDA divides network into components. It establishes 2-regions,
Neighborhood Region Beyond-neighborhood Region

Process route requests quickly within neighborhood region. Delay has been introduced to slowdown the propagation of route requests within beyond-neighborhood region. Delay=2*hop-count [linear] Once source gets route reply, it broadcasted a chase packet to halt the propagation of route requests. Note : Chase packet travels faster than route request packets within beyond-neighborhood region.

RREQ Processing at node for ERDA

1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. If RR is duplicate Discard the RREQ Else If chase packet has been received then Store RREQ information Discard the RREQ Else If hop_count > R, then Wait(2hopcount) unit time End if Process RR

RREP Processing at node for ERDA

1. 2. 3. 4. 5. If current node is sender then Create a chase packet Broadcast the chase packet Start transmitting the data Process the RREP

Chase Packet Processing at node for ERDA

If the chase packet is duplicate then Discard it Else Store the chase information If the RREQ is received then If the RREQ is broadcast then Broadcast the chase packet Else Discard both packets Else Discard the chase packet

Division between Chase Packet and RREP and RREQ

1 Channel 1

Channel 2

2 3

RREQ
4 Chase Packet/RREP 5

Conclusion
ERDA achieves lower end-to-end delay due to reduction in network congestion and channel contention ERDA has good throughput performance irrespective of network density, traffic load or speed. Due to end-to-end delay in ERDA,transmission of data packets starts earlier.