Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks

Tzu Chiang Chiang; Cheng Feng Tai; Ting Wei Hou

doi:10.1016/j.eswa.2007.10.035

Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks

Tzu Chiang Chiang
, Cheng Feng Tai
, Ting Wei Hou

Department of Engineering Science

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

Finding a near-optimal routing solution for multicast requests is a challenge for supporting different multicast applications including video and group communications over wireless ad hoc networks. A heuristic partitioning algorithm for solving the multicast routing problem with separate paths in ad hoc networks is presented. We consider scheduling a set of multicast requests which may have a source node with multiple destinations respectively through a wireless network. Our heuristic method for partitioning arbitrary routing requests is both effective in finding a near-optimal solution, and efficient to solve large multicast requests. Our simulation shows that the average overall latency reduces up to 38%. We also find that the handling scales up well from 8 nodes to 64 nodes.

Original language	English
Pages (from-to)	959-969
Number of pages	11
Journal	Expert Systems With Applications
Volume	36
Issue number	1
DOIs	https://doi.org/10.1016/j.eswa.2007.10.035
Publication status	Published - 2009 Jan

All Science Journal Classification (ASJC) codes

General Engineering
Computer Science Applications
Artificial Intelligence

Access to Document

10.1016/j.eswa.2007.10.035

Cite this

@article{dc99e195c6b9401fabbcc25582208ed9,

title = "Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks",

abstract = "Finding a near-optimal routing solution for multicast requests is a challenge for supporting different multicast applications including video and group communications over wireless ad hoc networks. A heuristic partitioning algorithm for solving the multicast routing problem with separate paths in ad hoc networks is presented. We consider scheduling a set of multicast requests which may have a source node with multiple destinations respectively through a wireless network. Our heuristic method for partitioning arbitrary routing requests is both effective in finding a near-optimal solution, and efficient to solve large multicast requests. Our simulation shows that the average overall latency reduces up to 38\%. We also find that the handling scales up well from 8 nodes to 64 nodes.",

author = "Chiang, \{Tzu Chiang\} and Tai, \{Cheng Feng\} and Hou, \{Ting Wei\}",

year = "2009",

month = jan,

doi = "10.1016/j.eswa.2007.10.035",

language = "English",

volume = "36",

pages = "959--969",

journal = "Expert Systems With Applications",

issn = "0957-4174",

publisher = "Elsevier Limited",

number = "1",

}

TY - JOUR

T1 - Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks

AU - Chiang, Tzu Chiang

AU - Tai, Cheng Feng

AU - Hou, Ting Wei

PY - 2009/1

Y1 - 2009/1

N2 - Finding a near-optimal routing solution for multicast requests is a challenge for supporting different multicast applications including video and group communications over wireless ad hoc networks. A heuristic partitioning algorithm for solving the multicast routing problem with separate paths in ad hoc networks is presented. We consider scheduling a set of multicast requests which may have a source node with multiple destinations respectively through a wireless network. Our heuristic method for partitioning arbitrary routing requests is both effective in finding a near-optimal solution, and efficient to solve large multicast requests. Our simulation shows that the average overall latency reduces up to 38%. We also find that the handling scales up well from 8 nodes to 64 nodes.

AB - Finding a near-optimal routing solution for multicast requests is a challenge for supporting different multicast applications including video and group communications over wireless ad hoc networks. A heuristic partitioning algorithm for solving the multicast routing problem with separate paths in ad hoc networks is presented. We consider scheduling a set of multicast requests which may have a source node with multiple destinations respectively through a wireless network. Our heuristic method for partitioning arbitrary routing requests is both effective in finding a near-optimal solution, and efficient to solve large multicast requests. Our simulation shows that the average overall latency reduces up to 38%. We also find that the handling scales up well from 8 nodes to 64 nodes.

UR - https://www.scopus.com/pages/publications/53849112993

UR - https://www.scopus.com/pages/publications/53849112993#tab=citedBy

U2 - 10.1016/j.eswa.2007.10.035

DO - 10.1016/j.eswa.2007.10.035

M3 - Article

AN - SCOPUS:53849112993

SN - 0957-4174

VL - 36

SP - 959

EP - 969

JO - Expert Systems With Applications

JF - Expert Systems With Applications

IS - 1

ER -

Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this