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

研究成果: Article同行評審

5 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)959-969
頁數11
期刊Expert Systems With Applications
36
發行號1
DOIs
出版狀態Published - 2009 1月

All Science Journal Classification (ASJC) codes

  • 工程 (全部)
  • 電腦科學應用
  • 人工智慧

指紋

深入研究「Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks」主題。共同形成了獨特的指紋。

引用此