Incremental Construction of k-Dominating Sets in Wireless Sensor Networks

Couture, Mathieu; Barbeau, Michel; Bose, Prosenjit; Kranakis, Evangelos

doi:10.1007/11945529_15

Cited by 14 publications

(15 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that in this paper we use landmark-based coordinates for the energy efficient step, but any other coordinate system may be used instead, including GPS localization. Therefore, we intend to explore another coordinate system other than the landmark-based one in order to avoid the preprocessing flooding step by applying dominating set [26]. …”

Section: Resultsmentioning

confidence: 99%

Towards a Hybrid Energy Efficient Multi-Tree-Based Optimized Routing Protocol for Wireless Networks

Mitton

Razafindralambo

Simplot‐Ryl

2012

Sensors

View full text Add to dashboard Cite

This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop distances toward several landmarks. In HECTOR, the node currently holding the packet forwards it to its neighbor that optimizes ratio of power cost over distance progress with landmark coordinates, among nodes that reduce landmark coordinates and do not increase distance in tree coordinates. If such a node does not exist, then forwarding is made to the neighbor that reduces tree-based distance only and optimizes power cost over tree distance progress ratio. We theoretically prove the packet delivery and propose an extension based on the use of multiple trees. Our simulations show the superiority of our algorithm over existing alternatives while guaranteeing delivery, and only up to 30% additional power compared to centralized shortest weighted path algorithm.

show abstract

Section: Resultsmentioning

confidence: 99%

Towards a Hybrid Energy Efficient Multi-Tree-Based Optimized Routing Protocol for Wireless Networks

Mitton

Razafindralambo

Simplot‐Ryl

2012

Sensors

View full text Add to dashboard Cite

show abstract

“…The problem of distributively constructing the k-dominating sets and an incremental distributed algorithm for the same has been dealt in [23]. The main idea of their algorithm is that first a 1-dominating set is formed by building a MIS.…”

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

“…For the special case of unit disk graphs, various approximation results exist, see for example [8,22,31]. In this specific graph model, a unit disk can contain at most five independent nodes, which leads to a constant approximation ratio for the minimum dominating set problem [27].…”

Section: Related Workmentioning

confidence: 99%

Approximating Fault-Tolerant Domination in General Graphs

Foerster

2013

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)

View full text Add to dashboard Cite

In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to fail and still dominate the graph. The classic minimum dominating set problem is a special case with k = 1. We show that the approach of having at least k dominating nodes in the neighborhood of every node is not optimal. For each α > 1 it can give solutions k α times larger than a minimum k-dominating set. We also study lower bounds on possible approximation ratios. We show that it is NP-hard to approximate the minimum k-dominating set problem with a factor better than (0.2267/k) ln(n/k). Furthermore, a result for special finite sums allows us to use a greedy approach for k-domination with an approximation ratio of ln(∆ + k) + 1 < ln(∆) + 1.7, with ∆ being the maximum node-degree. We also achieve an approximation ratio of ln(n) + 1.7 for h-step k-domination, where nodes do not need to be direct neighbors of dominating nodes, but can be h steps away.

show abstract

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks

Cited by 14 publications

References 26 publications

Towards a Hybrid Energy Efficient Multi-Tree-Based Optimized Routing Protocol for Wireless Networks

Towards a Hybrid Energy Efficient Multi-Tree-Based Optimized Routing Protocol for Wireless Networks

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

Approximating Fault-Tolerant Domination in General Graphs

Contact Info

Product

Resources

About