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

Authors:
Tzu-Chiang Chiang;Cheng-Feng Tai;Ting-Wei Hou
Affiliations:
Department of Engineering Science, National Cheng Kung University, Taiwan, ROC;Department of Engineering Science, National Cheng Kung University, Taiwan, ROC;Department of Engineering Science, National Cheng Kung University, Taiwan, ROC
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 11
Cited 2

A hybrid genetic algorithm for the point to multipoint routing problem with single split paths

Proceedings of the 2001 ACM symposium on Applied computing
Genetic Algorithm and Graph Partitioning

IEEE Transactions on Computers
Multipath Unicast and Multicast Video Communication over Wireless Ad Hoc Networks

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs

IEEE Transactions on Mobile Computing
Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks

IEEE Transactions on Mobile Computing
On achieving maximum multicast throughput in undirected networks

IEEE Transactions on Information Theory
Fundamental limits and scaling behavior of cooperative multicasting in wireless networks

IEEE Transactions on Information Theory
Two novel multiway circuit partitioning algorithms using relaxed locking

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Multiple Tree Video Multicast Over Wireless Ad Hoc Networks

IEEE Transactions on Circuits and Systems for Video Technology
A survey of proposals for an alternative group communication service

IEEE Network: The Magazine of Global Internetworking

A virtual subnet scheme on clustering algorithms for mobile ad hoc networks

Expert Systems with Applications: An International Journal
A novel acknowledgment-based approach against collude attacks in MANET

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

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.