ECARP: An Efficient Congestion Adaptive Routing Protocol for Mobile Ad Hoc Networks

Basavaraju, T. G.; Sarkar, Subir Kumar; Puttamadappa, C.; Gautham, M

doi:10.1109/itst.2006.289001

Cited by 15 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to this it also computes end to end delay to exercise flow request. ECARP [10] is proposed for heavy traffic loads in MANETs and this protocol considers the number of packets in node buffer to regulate congestion among nodes. CARM [11] prefers less congested, high throughput links for traffic by employing weighted delay, retransmission count, and queuing delay in buffer.…”

Section: Related Workmentioning

confidence: 99%

Buffer Based Routing Mechanism for Load Balancing in Wireless Mesh Networks

Keerthi¹,

A²,

Basavaraju³

2019

IJCET

View full text Add to dashboard Cite

In recent years it is witnessed that the Wireless Mesh Networks (WMNs) are becoming the most promising technology as they offer low cost broadband wireless connectivity, larger coverage area, high flexibility and easy deployment. WMNs are an extension of existing wireless networks. WMN is an emerging technology; however, there are certain challenges that still exist in the network such as scalability, load balancing, mobility, power management etc. Here we have proposed a novel routing protocol which considers buffer occupancy of intermediate nodes for route selection. Simulation results convey that the proposed protocol outstandingly enhances the performance of the network by balancing the traffic load among less congested nodes compared to the standard protocol.

show abstract

Section: Related Workmentioning

confidence: 99%

Buffer Based Routing Mechanism for Load Balancing in Wireless Mesh Networks

Keerthi¹,

A²,

Basavaraju³

2019

IJCET

View full text Add to dashboard Cite

show abstract

“…But, at the same time CRP tries to minimise bypass to reduce protocol overhead. An efficient congestion adaptive routing protocol (ECARP) proposed by Basavraju et al (2006) is based on AODV and better than every other routing protocol during heavy traffic loads. It ensures high availability of alternative routes and reduces the rate of stale routes.…”

Section: Literature Surveymentioning

confidence: 99%

Congestion aware multi-path routing protocol for mobile ad-hoc networks

Bhardwaj

Kant

2015

IJCONVC

View full text Add to dashboard Cite

We propose a congestion-based extension to existing multipath routing protocol AOMDV (CA-AOMDV). AOMDV is based on minimum number of hops count between source and destination nodes and is not suitable for real time applications because of its high end to end delay, jitter and packet loss. CA-AOMDV selects a least congested path instead of minimum number of hops between source and destination nodes. CA-AOMDV performs well under high load and varying mobility conditions. In CA-AOMDV, end to end delay is improved by 20%-80%, jitter is reduced by 25%-47%, routing overheads is reduced by 40%-70%. CA-AOMDV performs better than AOMDV in real time applications.

show abstract

“…Traffic is split probabilistically over these two routes, primary and bypass, thus effectively lessening the chance of congestion occurrence. In [10], an efficient congestion adaptive routing protocol (ECARP) for MANETs has been proposed that outperforms all the other routing protocols during heavy traffic loads. The ECARP is designed to ensure the high availability of alternative routes and reduce the rate of stale route.…”

Section: Related Workmentioning

confidence: 99%

Load Balanced Congestion Adaptive Routing for Mobile Ad Hoc Networks

Kim

Tomar

Shrivastava

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In mobile ad hoc networks the congestion is a major issue, which affects the overall performance of the networks. The load balancing in the network alongside the congestion is another major problem in mobile ad hoc network (MANET) routing due to difference in link cost of the route. Most of the existing routing protocols provide solutions to load balancing or congestion adaptivity separately. In this paper, a congestion adaptive routing along with load balancing, that is, load balanced congestion adaptive routing (LBCAR), has been proposed. Transferring of load from congested nodes to less busy nodes and involvement of other nodes in transmission that can take part in route can improve the overall network life. In the proposed protocol two metrics, traffic load density and link cost associated with a routing path, have been used to determine the congestion status. The route with low traffic load density and maximum life time is selected for packet transmission using this protocol. Performance of the network using LBCAR has been analyzed and compared with congestion adaptive routing protocol (CRP) for packet delivery ratio, average end-to-end delay, and normalized routing overhead.

show abstract

ECARP: An Efficient Congestion Adaptive Routing Protocol for Mobile Ad Hoc Networks

Cited by 15 publications

References 6 publications

Buffer Based Routing Mechanism for Load Balancing in Wireless Mesh Networks

Buffer Based Routing Mechanism for Load Balancing in Wireless Mesh Networks

Congestion aware multi-path routing protocol for mobile ad-hoc networks

Load Balanced Congestion Adaptive Routing for Mobile Ad Hoc Networks

Contact Info

Product

Resources

About