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

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)959-969
Number of pages11
JournalExpert Systems With Applications
Volume36
Issue number1
DOIs
Publication statusPublished - 2009 Jan 1

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Computer Science Applications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks'. Together they form a unique fingerprint.

Cite this