ECARP

An efficient congestion adaptive routing protocol for mobile Ad hoc networks

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

Mobile Ad hoc Networks shows unexpected behavior with multiple data streams under heavy traffic load such as multimedia data when it is sent to common destination. The main reason for packet loss in mobile ad hoc networks is due to congestion. In the current design, the routing protocols are not congestion adaptive. The way in which the congestion is handled results in longer delay and more packet loss. When a new route is needed the routing protocols take significant overhead in finding it. In this paper we propose an adaptive congestion control algorithm, which out-performs even during constrained situation. For analyzing the performance we have chosen four popular routing protocols such as AODV, DSR, DSDV and TORA. We also observe through simulation in NS-2 that AODV out-performs other routing protocols in normal situation and DSR out-performs in constraint environment. The proposed congestion control routing protocol outperforms all the other routing protocols during heavy traffic loads. We strongly argue that routing should not only be aware of but also be adaptive to network congestion.

Original languageEnglish
Title of host publicationITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings
Pages715-718
Number of pages4
DOIs
Publication statusPublished - 01-12-2007
Externally publishedYes
EventITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings - Chengdu, China
Duration: 21-06-200623-06-2006

Conference

ConferenceITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings
CountryChina
CityChengdu
Period21-06-0623-06-06

Fingerprint

Mobile ad hoc networks
Routing protocols
Packet loss

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Basavaraju, T. G., Sarkar, S. K., Puttamadappa, C., & Gautham, M. A. (2007). ECARP: An efficient congestion adaptive routing protocol for mobile Ad hoc networks. In ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings (pp. 715-718). [4068689] https://doi.org/10.1109/ITST.2006.289001
Basavaraju, T. G. ; Sarkar, Subir Kumar ; Puttamadappa, C. ; Gautham, M. A. / ECARP : An efficient congestion adaptive routing protocol for mobile Ad hoc networks. ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings. 2007. pp. 715-718
@inproceedings{7ac44e62e2a246ee9bec3231060fc2f4,
title = "ECARP: An efficient congestion adaptive routing protocol for mobile Ad hoc networks",
abstract = "Mobile Ad hoc Networks shows unexpected behavior with multiple data streams under heavy traffic load such as multimedia data when it is sent to common destination. The main reason for packet loss in mobile ad hoc networks is due to congestion. In the current design, the routing protocols are not congestion adaptive. The way in which the congestion is handled results in longer delay and more packet loss. When a new route is needed the routing protocols take significant overhead in finding it. In this paper we propose an adaptive congestion control algorithm, which out-performs even during constrained situation. For analyzing the performance we have chosen four popular routing protocols such as AODV, DSR, DSDV and TORA. We also observe through simulation in NS-2 that AODV out-performs other routing protocols in normal situation and DSR out-performs in constraint environment. The proposed congestion control routing protocol outperforms all the other routing protocols during heavy traffic loads. We strongly argue that routing should not only be aware of but also be adaptive to network congestion.",
author = "Basavaraju, {T. G.} and Sarkar, {Subir Kumar} and C. Puttamadappa and Gautham, {M. A.}",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/ITST.2006.289001",
language = "English",
isbn = "0780395867",
pages = "715--718",
booktitle = "ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings",

}

Basavaraju, TG, Sarkar, SK, Puttamadappa, C & Gautham, MA 2007, ECARP: An efficient congestion adaptive routing protocol for mobile Ad hoc networks. in ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings., 4068689, pp. 715-718, ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings, Chengdu, China, 21-06-06. https://doi.org/10.1109/ITST.2006.289001

ECARP : An efficient congestion adaptive routing protocol for mobile Ad hoc networks. / Basavaraju, T. G.; Sarkar, Subir Kumar; Puttamadappa, C.; Gautham, M. A.

ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings. 2007. p. 715-718 4068689.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - ECARP

T2 - An efficient congestion adaptive routing protocol for mobile Ad hoc networks

AU - Basavaraju, T. G.

AU - Sarkar, Subir Kumar

AU - Puttamadappa, C.

AU - Gautham, M. A.

PY - 2007/12/1

Y1 - 2007/12/1

N2 - Mobile Ad hoc Networks shows unexpected behavior with multiple data streams under heavy traffic load such as multimedia data when it is sent to common destination. The main reason for packet loss in mobile ad hoc networks is due to congestion. In the current design, the routing protocols are not congestion adaptive. The way in which the congestion is handled results in longer delay and more packet loss. When a new route is needed the routing protocols take significant overhead in finding it. In this paper we propose an adaptive congestion control algorithm, which out-performs even during constrained situation. For analyzing the performance we have chosen four popular routing protocols such as AODV, DSR, DSDV and TORA. We also observe through simulation in NS-2 that AODV out-performs other routing protocols in normal situation and DSR out-performs in constraint environment. The proposed congestion control routing protocol outperforms all the other routing protocols during heavy traffic loads. We strongly argue that routing should not only be aware of but also be adaptive to network congestion.

AB - Mobile Ad hoc Networks shows unexpected behavior with multiple data streams under heavy traffic load such as multimedia data when it is sent to common destination. The main reason for packet loss in mobile ad hoc networks is due to congestion. In the current design, the routing protocols are not congestion adaptive. The way in which the congestion is handled results in longer delay and more packet loss. When a new route is needed the routing protocols take significant overhead in finding it. In this paper we propose an adaptive congestion control algorithm, which out-performs even during constrained situation. For analyzing the performance we have chosen four popular routing protocols such as AODV, DSR, DSDV and TORA. We also observe through simulation in NS-2 that AODV out-performs other routing protocols in normal situation and DSR out-performs in constraint environment. The proposed congestion control routing protocol outperforms all the other routing protocols during heavy traffic loads. We strongly argue that routing should not only be aware of but also be adaptive to network congestion.

UR - http://www.scopus.com/inward/record.url?scp=44449110893&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44449110893&partnerID=8YFLogxK

U2 - 10.1109/ITST.2006.289001

DO - 10.1109/ITST.2006.289001

M3 - Conference contribution

SN - 0780395867

SN - 9780780395862

SP - 715

EP - 718

BT - ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings

ER -

Basavaraju TG, Sarkar SK, Puttamadappa C, Gautham MA. ECARP: An efficient congestion adaptive routing protocol for mobile Ad hoc networks. In ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings. 2007. p. 715-718. 4068689 https://doi.org/10.1109/ITST.2006.289001