A multicast routing algorithm using movement prediction for mobile ad hoc networks

Huei Wen Ferng, Hsing Yu Chen, Jeng Ji Huang, Wen Yan Kao

Research output: Contribution to journalConference article

Abstract

In mobile ad hoc networks, how to achieve the multicast communication is a challenging task due to the fact that the topology may change frequently and communication links may be broken because of users' mobility. To keep network connectivity, control packets are periodically sent within the system, resulting in high system overhead. To reduce the amount of control packets, a multicast routing algorithm for mobile ad hoc networks is designed in this paper. Utilizing movement prediction to estimate the life time of connections for every node pairs, the algorithm largely reduces the amount of control packets as compared to those using periodical path maintenance. Based on the estimate, a local path search rather than a global one is performed before the breakage of a path to get a backup path. This further lowers the system load. To avoid frequent path breakage, the algorithm chooses the path with the longest life among all possible paths. Using a simulation approach, we investigate the performance of the proposed algorithm through a comparison with an algorithm previously proposed in the literature. Based on the numerical results, we demonstrate that our proposed algorithm performs well.

Original languageEnglish
Pages (from-to)2518-2522
Number of pages5
JournalIEEE Vehicular Technology Conference
Volume61
Issue number4
Publication statusPublished - 2005 Oct 17
Event2005 IEEE 61st Vehicular Technology Conference -VTC 2005 - Spring Stockholm: Paving the Path for a Wireless Future - Stockholm, Sweden
Duration: 2005 May 302005 Jun 1

Fingerprint

Multicast Routing
Routing algorithms
Routing Algorithm
Mobile ad hoc networks
Mobile Ad Hoc Networks
Path
Prediction
Breakage
Telecommunication links
Network Connectivity
Topology
Movement
Multicast
Estimate
Maintenance
Communication
Choose
Numerical Results
Vertex of a graph
Demonstrate

Keywords

  • Ad Hoc
  • Multicast
  • Prediction
  • Routing
  • Wireless Networks

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

A multicast routing algorithm using movement prediction for mobile ad hoc networks. / Ferng, Huei Wen; Chen, Hsing Yu; Huang, Jeng Ji; Kao, Wen Yan.

In: IEEE Vehicular Technology Conference, Vol. 61, No. 4, 17.10.2005, p. 2518-2522.

Research output: Contribution to journalConference article

Ferng, Huei Wen ; Chen, Hsing Yu ; Huang, Jeng Ji ; Kao, Wen Yan. / A multicast routing algorithm using movement prediction for mobile ad hoc networks. In: IEEE Vehicular Technology Conference. 2005 ; Vol. 61, No. 4. pp. 2518-2522.
@article{6cf4a8b989dc4a099459ab83f555d49a,
title = "A multicast routing algorithm using movement prediction for mobile ad hoc networks",
abstract = "In mobile ad hoc networks, how to achieve the multicast communication is a challenging task due to the fact that the topology may change frequently and communication links may be broken because of users' mobility. To keep network connectivity, control packets are periodically sent within the system, resulting in high system overhead. To reduce the amount of control packets, a multicast routing algorithm for mobile ad hoc networks is designed in this paper. Utilizing movement prediction to estimate the life time of connections for every node pairs, the algorithm largely reduces the amount of control packets as compared to those using periodical path maintenance. Based on the estimate, a local path search rather than a global one is performed before the breakage of a path to get a backup path. This further lowers the system load. To avoid frequent path breakage, the algorithm chooses the path with the longest life among all possible paths. Using a simulation approach, we investigate the performance of the proposed algorithm through a comparison with an algorithm previously proposed in the literature. Based on the numerical results, we demonstrate that our proposed algorithm performs well.",
keywords = "Ad Hoc, Multicast, Prediction, Routing, Wireless Networks",
author = "Ferng, {Huei Wen} and Chen, {Hsing Yu} and Huang, {Jeng Ji} and Kao, {Wen Yan}",
year = "2005",
month = "10",
day = "17",
language = "English",
volume = "61",
pages = "2518--2522",
journal = "IEEE Vehicular Technology Conference",
issn = "0740-0551",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - A multicast routing algorithm using movement prediction for mobile ad hoc networks

AU - Ferng, Huei Wen

AU - Chen, Hsing Yu

AU - Huang, Jeng Ji

AU - Kao, Wen Yan

PY - 2005/10/17

Y1 - 2005/10/17

N2 - In mobile ad hoc networks, how to achieve the multicast communication is a challenging task due to the fact that the topology may change frequently and communication links may be broken because of users' mobility. To keep network connectivity, control packets are periodically sent within the system, resulting in high system overhead. To reduce the amount of control packets, a multicast routing algorithm for mobile ad hoc networks is designed in this paper. Utilizing movement prediction to estimate the life time of connections for every node pairs, the algorithm largely reduces the amount of control packets as compared to those using periodical path maintenance. Based on the estimate, a local path search rather than a global one is performed before the breakage of a path to get a backup path. This further lowers the system load. To avoid frequent path breakage, the algorithm chooses the path with the longest life among all possible paths. Using a simulation approach, we investigate the performance of the proposed algorithm through a comparison with an algorithm previously proposed in the literature. Based on the numerical results, we demonstrate that our proposed algorithm performs well.

AB - In mobile ad hoc networks, how to achieve the multicast communication is a challenging task due to the fact that the topology may change frequently and communication links may be broken because of users' mobility. To keep network connectivity, control packets are periodically sent within the system, resulting in high system overhead. To reduce the amount of control packets, a multicast routing algorithm for mobile ad hoc networks is designed in this paper. Utilizing movement prediction to estimate the life time of connections for every node pairs, the algorithm largely reduces the amount of control packets as compared to those using periodical path maintenance. Based on the estimate, a local path search rather than a global one is performed before the breakage of a path to get a backup path. This further lowers the system load. To avoid frequent path breakage, the algorithm chooses the path with the longest life among all possible paths. Using a simulation approach, we investigate the performance of the proposed algorithm through a comparison with an algorithm previously proposed in the literature. Based on the numerical results, we demonstrate that our proposed algorithm performs well.

KW - Ad Hoc

KW - Multicast

KW - Prediction

KW - Routing

KW - Wireless Networks

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

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

M3 - Conference article

AN - SCOPUS:26444596146

VL - 61

SP - 2518

EP - 2522

JO - IEEE Vehicular Technology Conference

JF - IEEE Vehicular Technology Conference

SN - 0740-0551

IS - 4

ER -