On the minimization of the number of forwarding nodes for multicast in wireless ad hoc networks

Authors:
Chen-guang Xu;Yin-long Xu;Jun-min Wu
Affiliations:
Department of Computer Science & Technology, University of Science & Technology of China, National High Performance Computing Center at Hefei, P.R. China;Department of Computer Science & Technology, University of Science & Technology of China, National High Performance Computing Center at Hefei, P.R. China;Department of Computer Science & Technology, University of Science & Technology of China, National High Performance Computing Center at Hefei, P.R. China
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 10
Cited 1

Unit disk graphs

Discrete Mathematics - Topics on domination
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
Improved methods for approximating node weighted Steiner trees and connected dominating sets

Information and Computation
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
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
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Approximation Algorithms for Connected Dominating Sets

Algorithmica
The core-assisted mesh protocol

IEEE Journal on Selected Areas in Communications

Approximating node-weighted multicast trees in wireless ad-hoc networks

Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ad-hoc networks are collections of mobile nodes communicating using wireless media and without any fixed physical infrastructure. Multicast is an important application in wireless ad hoc networks. Most of the existing protocols construct a VMB (Virtual Multicast Backbone) to provide multicast services. In this paper, we will use MSCDS (Minimum Steiner Connected Dominating Set) in UDG (Unit Disk Graph) to model the optimal VMB, which aims at minimizing the number of forwarding nodes and present a centralized approximation algorithm with a PR (Performance Ratio) approaching 2c + 1 , where c is the PR of edge weighted Steiner tree algorithm, currently with c = 1.55. It is an improvement of the previous best approximation guarantee 10.