Algorithms for Minimum m-Connected k-Dominating Set Problem

Shang, Weiping; Yao, Fei; Wan, Peng‐Jun; Hu, Xiaodong

doi:10.1007/978-3-540-73556-4_21

Cited by 20 publications

(18 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They provide a distributed algorithm for general graphs and a probabilistic algorithm for a unit disk graph. Reference [21] focuses on minimum m-connected k-tuple dominating set problem. Three centralized algorithms are presented for m=1, 2.…”

Section: Kmcdsbased Fault-tolerant Virtual Backbone Construction:mentioning

confidence: 99%

K-Connected M-Dominating Set Based Fault-Tolerant Virtual Backbone: A Survey

2017

IJAERD

View full text Add to dashboard Cite

show abstract

Section: Kmcdsbased Fault-tolerant Virtual Backbone Construction:mentioning

confidence: 99%

K-Connected M-Dominating Set Based Fault-Tolerant Virtual Backbone: A Survey

2017

IJAERD

View full text Add to dashboard Cite

show abstract

“…The authors focus on k-fold dominating set in two network models. The authors in [15] focus on minimum m-connected k-tuple dominating set problem.…”

Section: Related Workmentioning

confidence: 99%

A Fault-tolerant Improved OLSR Protocol using k-Connected m-Dominating Set

Vinayagam¹

2017

IJCNIS

View full text Add to dashboard Cite

Abstract-The inherent properties of ad hoc networks such as limited energy, short transmission range and absence of routers along with node mobility, node failures and link failures make routing a challenging task. In order to facilitate routing, virtual backbone has been proposed as a viable solution in the literature. Optimize Link State Routing (OLSR) protocol, a proactive routing protocol, uses Multipoint Relay (MPR) set to construct virtual backbone. Prior research has, however, identified various issues with the MPR selection scheme that needs improvement. One of the alternatives that could be used to construct virtual backbone is Connected Dominating Set (CDS). Although CDS generates a smaller virtual backbone, its 1-connected 1-domination nature may render a virtual backbone obsolete in case of networks which witness frequent node mobility, node failures and link failures. To overcome this, k-Connected mDominating CDS (kmCDS) could be used to construct fault-tolerant virtual backbone structure. In this direction, the present paper proposes a Fault-Tolerant Improved Optimized Link State Routing (FT-IOLSR) protocol that uses kmCDS to form fault-tolerant virtual backbone, effectively replacing the MPR set of OLSR protocol. Simulations are carried out to assess the performance of the FT-IOLSR protocol in relation to the OLSR protocol, with respect to various node speed and pause time combinations, and varying network size. The results show that the FT-IOLSR protocol is better in terms of packet delivery ratio under varying mobility and varying network size. Also it has been observed that, with increase in k-connectivity and m-domination factor, there is improvement in the performance of the protocol.

show abstract

“…There exist several algorithms including centralized and distributed ones to construct a kmCDS. The related works to us are [8,9,10,11,12,13].…”

Section: Related Workmentioning

confidence: 99%

“…Similarly, this work is also only for the case where k=2 and m=1. Shang et al proposed three centralized algorithms [10] . One is for constructing a 1-connected m-dominating set.…”

Section: Related Workmentioning

confidence: 99%

Construction of a Fault Tolerance Connected Dominating Set in Wireless Sensor Network

Bian

Huang

Zeng

2009

2009 International Conference on Measuring Technology and Mechatronics Automation

View full text Add to dashboard Cite

Abstract-In wireless sensor networks, virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to construct a small virtual backbone for high efficiency, which is modeled as the minimum Connected Dominating Set (MCDS) problem. However, the nodes in the CDS need to carry other nodes' traffic and they are subject to failure. Therefore, it is desirable to construct a fault tolerant CDS. In this paper, we first propose a distributed algorithm to construct a connected dominating set (DACDS). Based on DACDS, we further develop a fault tolerant algorithm (kCDS). We also show our algorithm have better performance ratios and low message complexity.

show abstract

Algorithms for Minimum m-Connected k-Dominating Set Problem

Cited by 20 publications

References 10 publications

K-Connected M-Dominating Set Based Fault-Tolerant Virtual Backbone: A Survey

K-Connected M-Dominating Set Based Fault-Tolerant Virtual Backbone: A Survey

A Fault-tolerant Improved OLSR Protocol using k-Connected m-Dominating Set

Construction of a Fault Tolerance Connected Dominating Set in Wireless Sensor Network

Contact Info

Product

Resources

About