返回
On Approximating Minimum 3-Connected m-Dominating Set Problem in Unit Disk Graph
DOI:10.1109/TNET.2015.2475335.png)
摘要
En 中文
Over years, virtual backbone has attracted lots of attention as a promising approach to deal with the broadcasting storm problem in wireless networks. Frequently, the problem of a quality virtual backbone is formulated as a variation of the minimum connected dominating set problem. However, a virtual backbone computed in this way is not resilient against topology change since the induced graph by the connected dominating set is one-vertex-connected. As a result, the minimum k-connected m-dominating set problem is introduced to construct a fault-tolerant virtual backbone. Currently, the best known approximation algorithm for the problem in unit disk graph by Wang et al. assumes k <= 3 and m >= 1, and its performance ratio is 280 when k = m = 3. In this paper, we use a classical result from graph theory, Tutte decomposition, to design a new approximation algorithm for the problem in unit disk graph for k <= 3 and m >= 1. In particular, the algorithm features with (a) a drastically simple structure and (b) a much smaller performance ratio, which is nearly 62 when k = m = 3. We also conduct simulation to evaluate the performance of our algorithm.
Keyword:
3-connected m-dominating set
approximation algorithm
fault-tolerant
Tutte decomposition
virtual backbone
wireless networks
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
Health-related quality of life among survivors in minority area 2 years after Jiuzhaigou earthquake
Medicine
IF0
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks在无线网络中构造具有有限直径的最小连通支配集
Starting where the client is some first steps towards making health care more accessible to ethnic minority users从客户当前状况出发,采取初步措施,使医疗服务对少数民族用户更加可及。
Practice
IF0


