A two-phase multicast routing in MANETs using Steiner connected dominating core sets

Authors:
Chu-Fu Wang;Rong-Hong Jan
Affiliations:
Department of Computer Science, National Pingtung University of Education, Pingtung 90044, Taiwan.;Department of Computer and Information Science, National Chiao Tung University, Hsinchu 30050, Taiwan
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2005

Citing 7
Cited 0

Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Multicluster, mobile, multimedia radio network

Wireless Networks
R-Domination in Graphs

Journal of the ACM (JACM)
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links

IEEE Transactions on Parallel and Distributed Systems
On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Shared Tree Wireless Network Multicast

IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multicast communication is a point to multipoint transmission that occurs when data is to be delivered to a subset of nodes in a computer network. Because multicast communications can save network bandwidth when delivering data to multiple destinations, many researchers have given much attention to multicast routing problems. An ad hoc network is a multihop wireless network with highly dynamic behaviour. Because an ad hoc network's topology changes frequently, multicast routing in such a network is more complicated than in wired networks. In this paper, a two phase multicast routing scheme using Steiner Connected Dominating Core Sets (SCDCS) is proposed to accommodate the dynamic nature of ad hoc networks. The problem of finding the minimum SCDCS is called the Steiner Connected Domination Problem (SCDP). Two heuristic algorithms are proposed to compute the approximate SCDP solution. Some simulations are also made for evaluating the performance of the proposed methods. Two polynomial time exact algorithms to solve the proposed problem on trees with two types of dominating functions are given.