Low-latency Routing in Ad Hoc Wireless Networks using Finite Horizons

Amer Filipovic, Amitava Datta, Chris Mcdonald

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

An ad-hoc wireless network is a cooperative body of mobile wireless nodes that is capable of sustaining multi-hop communication. DSR is a well known routing protocol that has been proven to be robust and reliable in forming such networks. Tire protocol inherently has a large control packet and byte overhead, so it makes extensive use of its caching strategy to optimise its performance. However, large control packets severely restrict the protocol's ability to scale to larger networks. In addition, the source controlled routing paradigm introduces high latency when scaled. In this paper we address this problem by presenting a hybrid protocol, called Finite Horizon Routing (FHR.), which improves upon the existing routing strategy of DSR and makes it more resilient to link failures in oversized networks, Full, partially removes the large control packet problem of DSR. Through our simulations we show that the reliability, total overhead, and latency cart be improved by tip to 10%, 23% and 53% respectively.
Original languageEnglish
Pages (from-to)422-433
JournalLecture Notes in Computer Science
Volume3759
DOIs
Publication statusPublished - 2005

Fingerprint

Ad Hoc Wireless Networks
Finite Horizon
Wireless ad hoc networks
Latency
Routing
Network protocols
Tire
Caching
Multi-hop
Routing Protocol
Routing protocols
Tires
Paradigm
Optimise
Communication
Vertex of a graph
Simulation
Strategy

Cite this

@article{f5eb262268aa4ee4a393a313caa70c33,
title = "Low-latency Routing in Ad Hoc Wireless Networks using Finite Horizons",
abstract = "An ad-hoc wireless network is a cooperative body of mobile wireless nodes that is capable of sustaining multi-hop communication. DSR is a well known routing protocol that has been proven to be robust and reliable in forming such networks. Tire protocol inherently has a large control packet and byte overhead, so it makes extensive use of its caching strategy to optimise its performance. However, large control packets severely restrict the protocol's ability to scale to larger networks. In addition, the source controlled routing paradigm introduces high latency when scaled. In this paper we address this problem by presenting a hybrid protocol, called Finite Horizon Routing (FHR.), which improves upon the existing routing strategy of DSR and makes it more resilient to link failures in oversized networks, Full, partially removes the large control packet problem of DSR. Through our simulations we show that the reliability, total overhead, and latency cart be improved by tip to 10{\%}, 23{\%} and 53{\%} respectively.",
author = "Amer Filipovic and Amitava Datta and Chris Mcdonald",
year = "2005",
doi = "10.1007/11576259_47",
language = "English",
volume = "3759",
pages = "422--433",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer-Verlag London Ltd.",

}

Low-latency Routing in Ad Hoc Wireless Networks using Finite Horizons. / Filipovic, Amer; Datta, Amitava; Mcdonald, Chris.

In: Lecture Notes in Computer Science, Vol. 3759, 2005, p. 422-433.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Low-latency Routing in Ad Hoc Wireless Networks using Finite Horizons

AU - Filipovic, Amer

AU - Datta, Amitava

AU - Mcdonald, Chris

PY - 2005

Y1 - 2005

N2 - An ad-hoc wireless network is a cooperative body of mobile wireless nodes that is capable of sustaining multi-hop communication. DSR is a well known routing protocol that has been proven to be robust and reliable in forming such networks. Tire protocol inherently has a large control packet and byte overhead, so it makes extensive use of its caching strategy to optimise its performance. However, large control packets severely restrict the protocol's ability to scale to larger networks. In addition, the source controlled routing paradigm introduces high latency when scaled. In this paper we address this problem by presenting a hybrid protocol, called Finite Horizon Routing (FHR.), which improves upon the existing routing strategy of DSR and makes it more resilient to link failures in oversized networks, Full, partially removes the large control packet problem of DSR. Through our simulations we show that the reliability, total overhead, and latency cart be improved by tip to 10%, 23% and 53% respectively.

AB - An ad-hoc wireless network is a cooperative body of mobile wireless nodes that is capable of sustaining multi-hop communication. DSR is a well known routing protocol that has been proven to be robust and reliable in forming such networks. Tire protocol inherently has a large control packet and byte overhead, so it makes extensive use of its caching strategy to optimise its performance. However, large control packets severely restrict the protocol's ability to scale to larger networks. In addition, the source controlled routing paradigm introduces high latency when scaled. In this paper we address this problem by presenting a hybrid protocol, called Finite Horizon Routing (FHR.), which improves upon the existing routing strategy of DSR and makes it more resilient to link failures in oversized networks, Full, partially removes the large control packet problem of DSR. Through our simulations we show that the reliability, total overhead, and latency cart be improved by tip to 10%, 23% and 53% respectively.

U2 - 10.1007/11576259_47

DO - 10.1007/11576259_47

M3 - Article

VL - 3759

SP - 422

EP - 433

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -