Constructing k-Connected m-Dominating Sets in Wireless Sensor Networks

Wu, Yiwei; Wang, Feng; Thai, My T.; Li, Yingshu

doi:10.1109/milcom.2007.4454774

Cited by 70 publications

(42 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With k-connectivity, communication will not be disrupted even when up to k − 1 paths fail. k-connected virtual backbones also provide multi-path redundancy for load balancing and transmission error tolerance [9,14,15].…”

Section: K-connected M-dominating Set (Kmcds)mentioning

confidence: 99%

“…The m-domination constraint ensures that every dominatee node has at least mneighbour dominators in a CDS. Therefore, one dominatee node can still be connected with the CDS even when up to its m − 1 dominator neighbours fail [9,14,15]. Thus with a kmCDS, every dominatee node can tolerate up to m -1 faults on its dominators and the virtual backbone can tolerate up to k -1 faults [16].…”

Section: K-connected M-dominating Set (Kmcds)mentioning

confidence: 99%

“…Reference [15] presents a centralized algorithm (CGA) and a distributed deterministic algorithm (DDA) to build kmCDSfor general kand m. The authors report that, a small kmCDS could be obtained by using CGA as compared to DDA; however, in a real network, implementing DDA is easier than CGA. Minimum m-connected k-dominating Set problem for m=1, 2 has been investigated in [17].…”

Section: Kmcdsbased Fault-tolerant Virtual Backbone Construction:mentioning

confidence: 99%

See 2 more Smart Citations

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

2017

IJAERD

View full text Add to dashboard Cite

show abstract

Section: K-connected M-dominating Set (Kmcds)mentioning

confidence: 99%

Section: K-connected M-dominating Set (Kmcds)mentioning

confidence: 99%

Section: Kmcdsbased Fault-tolerant Virtual Backbone Construction:mentioning

confidence: 99%

See 1 more Smart Citation

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 in [17] present a centralized algorithm and a distributed deterministic algorithm to build kmCDS for general k and m. The problem of distributively constructing the k-dominating sets is examined in [18] and an incremental distributed algorithm for the same has been presented. In [3], the authors focus on fault-tolerant CDS problem in wireless networks.…”

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 exists some works in [13], [14] that describes the construction of k-connected m-dominating sets for fault tolerance. To this end, they have proposed two approximation algorithms -Connecting Dominating Set Augmentation (CDSA) and k-connected m-dominating set (k, mCDS) -to construct a k-connected virtual backbone which can accommodate the failure of one wireless node.…”

Section: Related Workmentioning

confidence: 99%

A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks

Rizvi

Qureshi

Khayam

et al. 2012

Journal of Network and Computer Applications

View full text Add to dashboard Cite

This is the unspecified version of the paper.This version of the publication may differ from the final published version. by the large number of algorithms, techniques, and protocols that have been developed to save energy, and thereby extend the lifetime of the network. However, in the context of WSN's routing and dissemination, Connected Dominating Set (CDS) principle has emerged as the most popular method for energy-efficient topology control (TC) in WSN's. In a CDS-based topology control technique, a virtual backbone is formed which allows communication between any arbitrary pair of nodes in the network. In this paper, we present a CDS based topology control protocol -A1 -which forms an energy efficient virtual backbone. In our simulations, we compare the performance of A1 with three prominent CDS-based protocols namely Energy-efficient CDS (EECDS), CDS Rule K and A3. The results demonstrate that A1 performs consistently better in terms of message overhead and other selected metrics. Moreover, the A1 protocol not only achieves better connectivity under topology maintenance but also provides better sensing coverage when compared with the other protocols. Permanent repository link

show abstract

Constructing k-Connected m-Dominating Sets in Wireless Sensor Networks

Cited by 70 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

A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks

Contact Info

Product

Resources

About