A new route discovery algorithm for MANETs with chase packets

Mznah A. Al-Rodhaan, Lewis Mackenzie, Mohamed Ould-Khaoua

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We introduce a new dual-tier route discovery algorithm for MANETs. The new algorithm uses chase packets to stop the fulfilled route requests in on-demand routing protocols. The algorithm works by including the most likely destinations for a given source node in a local neighbourhood and broadcast route requests with full speed within this region. However, outside such neighbourhood the route request has a very high chance of being fulfilled, so propagation of route requests in this region is deliberately delayed to provide the chase packets the opportunity to catch the route request and minimise network congestion without affecting the discovery process. The algorithm is adaptive and continuously updates the boundary of each source node’s neighbourhood to optimize performance. Furthermore, we provide a detailed performance evaluation using mathematical and simulation modelling and compare our algorithm with existing algorithms, to demonstrate that it does indeed improve the average route request time required.

Original languageEnglish
Pages (from-to)1-12
Number of pages12
JournalInternational Journal of Simulation: Systems, Science and Technology
Volume8
Issue number3
Publication statusPublished - Sep 1 2007

Fingerprint

Adaptive algorithms
Routing protocols
Vertex of a graph
Routing Protocol
Congestion
Mathematical Modeling
Broadcast
Performance Evaluation
Update
Likely
Optimise
Propagation
Minimise
Computer simulation
Demonstrate
Simulation
Demand

Keywords

  • Chase packets
  • MANETs
  • Performance analysis
  • Route discovery
  • Routing protocols

ASJC Scopus subject areas

  • Software
  • Modelling and Simulation

Cite this

A new route discovery algorithm for MANETs with chase packets. / Al-Rodhaan, Mznah A.; Mackenzie, Lewis; Ould-Khaoua, Mohamed.

In: International Journal of Simulation: Systems, Science and Technology, Vol. 8, No. 3, 01.09.2007, p. 1-12.

Research output: Contribution to journalArticle

@article{b74aca9b2ebd477781223e4d3d45f992,
title = "A new route discovery algorithm for MANETs with chase packets",
abstract = "We introduce a new dual-tier route discovery algorithm for MANETs. The new algorithm uses chase packets to stop the fulfilled route requests in on-demand routing protocols. The algorithm works by including the most likely destinations for a given source node in a local neighbourhood and broadcast route requests with full speed within this region. However, outside such neighbourhood the route request has a very high chance of being fulfilled, so propagation of route requests in this region is deliberately delayed to provide the chase packets the opportunity to catch the route request and minimise network congestion without affecting the discovery process. The algorithm is adaptive and continuously updates the boundary of each source node’s neighbourhood to optimize performance. Furthermore, we provide a detailed performance evaluation using mathematical and simulation modelling and compare our algorithm with existing algorithms, to demonstrate that it does indeed improve the average route request time required.",
keywords = "Chase packets, MANETs, Performance analysis, Route discovery, Routing protocols",
author = "Al-Rodhaan, {Mznah A.} and Lewis Mackenzie and Mohamed Ould-Khaoua",
year = "2007",
month = "9",
day = "1",
language = "English",
volume = "8",
pages = "1--12",
journal = "International Journal of Simulation: Systems, Science and Technology",
issn = "1473-804X",
publisher = "United Kingdom Simulation Society",
number = "3",

}

TY - JOUR

T1 - A new route discovery algorithm for MANETs with chase packets

AU - Al-Rodhaan, Mznah A.

AU - Mackenzie, Lewis

AU - Ould-Khaoua, Mohamed

PY - 2007/9/1

Y1 - 2007/9/1

N2 - We introduce a new dual-tier route discovery algorithm for MANETs. The new algorithm uses chase packets to stop the fulfilled route requests in on-demand routing protocols. The algorithm works by including the most likely destinations for a given source node in a local neighbourhood and broadcast route requests with full speed within this region. However, outside such neighbourhood the route request has a very high chance of being fulfilled, so propagation of route requests in this region is deliberately delayed to provide the chase packets the opportunity to catch the route request and minimise network congestion without affecting the discovery process. The algorithm is adaptive and continuously updates the boundary of each source node’s neighbourhood to optimize performance. Furthermore, we provide a detailed performance evaluation using mathematical and simulation modelling and compare our algorithm with existing algorithms, to demonstrate that it does indeed improve the average route request time required.

AB - We introduce a new dual-tier route discovery algorithm for MANETs. The new algorithm uses chase packets to stop the fulfilled route requests in on-demand routing protocols. The algorithm works by including the most likely destinations for a given source node in a local neighbourhood and broadcast route requests with full speed within this region. However, outside such neighbourhood the route request has a very high chance of being fulfilled, so propagation of route requests in this region is deliberately delayed to provide the chase packets the opportunity to catch the route request and minimise network congestion without affecting the discovery process. The algorithm is adaptive and continuously updates the boundary of each source node’s neighbourhood to optimize performance. Furthermore, we provide a detailed performance evaluation using mathematical and simulation modelling and compare our algorithm with existing algorithms, to demonstrate that it does indeed improve the average route request time required.

KW - Chase packets

KW - MANETs

KW - Performance analysis

KW - Route discovery

KW - Routing protocols

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

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

M3 - Article

VL - 8

SP - 1

EP - 12

JO - International Journal of Simulation: Systems, Science and Technology

JF - International Journal of Simulation: Systems, Science and Technology

SN - 1473-804X

IS - 3

ER -