Bandwidth-efficient routing protocol for mobile ad hoc networks

R. S. Al-Qassas, A. Al-Ayyoub, M. Ould-Khaoua

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Mobile ad hoc networks (MANETs) have dynamic irregular topologies by nature, and suffer from inherent limitations such as limited bandwidth and power. A number of routing protocols have been proposed in the past few years to deal with these issues efficiently. The paper proposes and evaluates a new routing protocol, referred to here as the vector routing protocol (VRP). One of the main features of the VRP is its lover communication overhead to establish a route from source to destination. Results obtained through simulation experiments reveal that the new VRP algorithm achieves a lower communication overhead than the well known DSDV and AODV protocols, especially in low mobility environments.

Original languageEnglish
Pages (from-to)230-234
Number of pages5
JournalIEE Proceedings: Software
Volume150
Issue number4
DOIs
Publication statusPublished - Aug 2003

Fingerprint

Mobile ad hoc networks
Routing protocols
Bandwidth
Communication
Topology
Network protocols
Experiments

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Bandwidth-efficient routing protocol for mobile ad hoc networks. / Al-Qassas, R. S.; Al-Ayyoub, A.; Ould-Khaoua, M.

In: IEE Proceedings: Software, Vol. 150, No. 4, 08.2003, p. 230-234.

Research output: Contribution to journalArticle

Al-Qassas, R. S. ; Al-Ayyoub, A. ; Ould-Khaoua, M. / Bandwidth-efficient routing protocol for mobile ad hoc networks. In: IEE Proceedings: Software. 2003 ; Vol. 150, No. 4. pp. 230-234.
@article{a49ef63809e34414b997653ce03114dd,
title = "Bandwidth-efficient routing protocol for mobile ad hoc networks",
abstract = "Mobile ad hoc networks (MANETs) have dynamic irregular topologies by nature, and suffer from inherent limitations such as limited bandwidth and power. A number of routing protocols have been proposed in the past few years to deal with these issues efficiently. The paper proposes and evaluates a new routing protocol, referred to here as the vector routing protocol (VRP). One of the main features of the VRP is its lover communication overhead to establish a route from source to destination. Results obtained through simulation experiments reveal that the new VRP algorithm achieves a lower communication overhead than the well known DSDV and AODV protocols, especially in low mobility environments.",
author = "Al-Qassas, {R. S.} and A. Al-Ayyoub and M. Ould-Khaoua",
year = "2003",
month = "8",
doi = "10.1049/ip-sen:20030811",
language = "English",
volume = "150",
pages = "230--234",
journal = "IET Software",
issn = "1751-8806",
publisher = "Institution of Engineering and Technology",
number = "4",

}

TY - JOUR

T1 - Bandwidth-efficient routing protocol for mobile ad hoc networks

AU - Al-Qassas, R. S.

AU - Al-Ayyoub, A.

AU - Ould-Khaoua, M.

PY - 2003/8

Y1 - 2003/8

N2 - Mobile ad hoc networks (MANETs) have dynamic irregular topologies by nature, and suffer from inherent limitations such as limited bandwidth and power. A number of routing protocols have been proposed in the past few years to deal with these issues efficiently. The paper proposes and evaluates a new routing protocol, referred to here as the vector routing protocol (VRP). One of the main features of the VRP is its lover communication overhead to establish a route from source to destination. Results obtained through simulation experiments reveal that the new VRP algorithm achieves a lower communication overhead than the well known DSDV and AODV protocols, especially in low mobility environments.

AB - Mobile ad hoc networks (MANETs) have dynamic irregular topologies by nature, and suffer from inherent limitations such as limited bandwidth and power. A number of routing protocols have been proposed in the past few years to deal with these issues efficiently. The paper proposes and evaluates a new routing protocol, referred to here as the vector routing protocol (VRP). One of the main features of the VRP is its lover communication overhead to establish a route from source to destination. Results obtained through simulation experiments reveal that the new VRP algorithm achieves a lower communication overhead than the well known DSDV and AODV protocols, especially in low mobility environments.

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

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

U2 - 10.1049/ip-sen:20030811

DO - 10.1049/ip-sen:20030811

M3 - Article

VL - 150

SP - 230

EP - 234

JO - IET Software

JF - IET Software

SN - 1751-8806

IS - 4

ER -