Authors: Chu-Fu Wang, Rong-Hong Jan
Addresses: 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
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.
Keywords: multicast routing; MANET; connected dominating set; Steiner connected domination problem; SCDP; mobile ad hoc networks.
International Journal of Ad Hoc and Ubiquitous Computing, 2005 Vol.1 No.1/2, pp.70 - 79
Available online: 10 Nov 2005Full-text access for editors Access for subscribers Purchase this article Comment on this article