Congestion avoidance routing for MANETs

Yao Hua Ho, Meng Chang Chen, Han Chieh Chao

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In a mobile ad hoc network (MANET), communication connections need to adapt to frequent and unpredictable topology changes. Early solutions focused reconnecting a broken link quickly with a low overhead; however, this strategy cannot cope with a high mobility environment. For high mobility environments, greedy techniques rely on any mobile hosts along the general direction of the destination node to forward data packets. However, the greedy approach suffers from packet loss because the packet forwarding policy does not consider traffic congestion along the route or the direction. In this paper, we propose a congestion avoidance routing (CAR) technique for two greedy protocols, connectionless approach (CLA) and contention-based forwarding (CBF), to address the packet loss problem by rerouting packets dynamically to avoid traffic congestion. To demonstrate the improvement, we present extensive simulation results to show the proposed techniques can prevent the occurrence of contention areas and significantly outperform existing techniques.

Original languageEnglish
Pages (from-to)26-41
Number of pages16
JournalInternational Journal of Ad Hoc and Ubiquitous Computing
Volume16
Issue number1
DOIs
Publication statusPublished - 2014

Fingerprint

Traffic congestion
Packet loss
Mobile ad hoc networks
Topology
Communication

Keywords

  • Communication connection
  • Congestion avoidance
  • MANET
  • Mobile ad hoc networks
  • Routing protocol
  • Ubiquitous computing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Congestion avoidance routing for MANETs. / Ho, Yao Hua; Chen, Meng Chang; Chao, Han Chieh.

In: International Journal of Ad Hoc and Ubiquitous Computing, Vol. 16, No. 1, 2014, p. 26-41.

Research output: Contribution to journalArticle

Ho, Yao Hua ; Chen, Meng Chang ; Chao, Han Chieh. / Congestion avoidance routing for MANETs. In: International Journal of Ad Hoc and Ubiquitous Computing. 2014 ; Vol. 16, No. 1. pp. 26-41.
@article{c3e014846a264de084de34ded4d63a9d,
title = "Congestion avoidance routing for MANETs",
abstract = "In a mobile ad hoc network (MANET), communication connections need to adapt to frequent and unpredictable topology changes. Early solutions focused reconnecting a broken link quickly with a low overhead; however, this strategy cannot cope with a high mobility environment. For high mobility environments, greedy techniques rely on any mobile hosts along the general direction of the destination node to forward data packets. However, the greedy approach suffers from packet loss because the packet forwarding policy does not consider traffic congestion along the route or the direction. In this paper, we propose a congestion avoidance routing (CAR) technique for two greedy protocols, connectionless approach (CLA) and contention-based forwarding (CBF), to address the packet loss problem by rerouting packets dynamically to avoid traffic congestion. To demonstrate the improvement, we present extensive simulation results to show the proposed techniques can prevent the occurrence of contention areas and significantly outperform existing techniques.",
keywords = "Communication connection, Congestion avoidance, MANET, Mobile ad hoc networks, Routing protocol, Ubiquitous computing",
author = "Ho, {Yao Hua} and Chen, {Meng Chang} and Chao, {Han Chieh}",
year = "2014",
doi = "10.1504/IJAHUC.2014.062489",
language = "English",
volume = "16",
pages = "26--41",
journal = "International Journal of Ad Hoc and Ubiquitous Computing",
issn = "1743-8225",
publisher = "Inderscience Enterprises Ltd",
number = "1",

}

TY - JOUR

T1 - Congestion avoidance routing for MANETs

AU - Ho, Yao Hua

AU - Chen, Meng Chang

AU - Chao, Han Chieh

PY - 2014

Y1 - 2014

N2 - In a mobile ad hoc network (MANET), communication connections need to adapt to frequent and unpredictable topology changes. Early solutions focused reconnecting a broken link quickly with a low overhead; however, this strategy cannot cope with a high mobility environment. For high mobility environments, greedy techniques rely on any mobile hosts along the general direction of the destination node to forward data packets. However, the greedy approach suffers from packet loss because the packet forwarding policy does not consider traffic congestion along the route or the direction. In this paper, we propose a congestion avoidance routing (CAR) technique for two greedy protocols, connectionless approach (CLA) and contention-based forwarding (CBF), to address the packet loss problem by rerouting packets dynamically to avoid traffic congestion. To demonstrate the improvement, we present extensive simulation results to show the proposed techniques can prevent the occurrence of contention areas and significantly outperform existing techniques.

AB - In a mobile ad hoc network (MANET), communication connections need to adapt to frequent and unpredictable topology changes. Early solutions focused reconnecting a broken link quickly with a low overhead; however, this strategy cannot cope with a high mobility environment. For high mobility environments, greedy techniques rely on any mobile hosts along the general direction of the destination node to forward data packets. However, the greedy approach suffers from packet loss because the packet forwarding policy does not consider traffic congestion along the route or the direction. In this paper, we propose a congestion avoidance routing (CAR) technique for two greedy protocols, connectionless approach (CLA) and contention-based forwarding (CBF), to address the packet loss problem by rerouting packets dynamically to avoid traffic congestion. To demonstrate the improvement, we present extensive simulation results to show the proposed techniques can prevent the occurrence of contention areas and significantly outperform existing techniques.

KW - Communication connection

KW - Congestion avoidance

KW - MANET

KW - Mobile ad hoc networks

KW - Routing protocol

KW - Ubiquitous computing

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

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

U2 - 10.1504/IJAHUC.2014.062489

DO - 10.1504/IJAHUC.2014.062489

M3 - Article

AN - SCOPUS:84902274828

VL - 16

SP - 26

EP - 41

JO - International Journal of Ad Hoc and Ubiquitous Computing

JF - International Journal of Ad Hoc and Ubiquitous Computing

SN - 1743-8225

IS - 1

ER -