Efficient routing among mobile hosts is an important function in ad hoc networks. Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts are either in the set or neighbors of hosts in the set. The efficiency of dominating-set-based routing mainly depends on the overhead intr...

We consider the problem of finding a spanning tree with maximum number of leaves (MaxLeaf). A 2-approximation algorithm is known for this problem, and a 3/2-approximation algorithm when restricted to graphs where every vertex has degree 3 (cubic graphs). MaxLeaf is known to be APX-hard in general, and NP-hard for cubic graphs. We show that the problem is also APX-hard for cubic graphs. The APX-...

Even if several algorithms were proposed in the literature to solve the coverage problem in Wireless Sensor Networks (WSNs), they still suffer from some weaknesses. This is the reason why we suggest in this paper, a distributed protocol, called Single Phase Multiple Initiator (SPMI). Its aim is to find Connect Cover Set (CCS) for assuring the coverage and connectivity in WSN. Our idea is based ...

We give efficient distributed algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed families. To complement these results we argue that no efficient distributed algorithm for the minimum weight connected dominating set exists.

To achieve an efficient routing in a wireless sensor network, connected dominating set (CDS) is used as virtual backbone. A fault-tolerant virtual backbone can be modeled as a (k,m)-CDS. For a connected graph G = (V,E) and two fixed integers k and m, a node set C ⊆ V is a (k,m)-CDS of G if every node in V \C has at least m neighbors in C, and the subgraph of G induced by C is k-connected. Previ...

Due to resource constraint of WSNs, it may be unnecessary or impossible to provide full coverage in many applications. Instead, partial coverage is enough to satisfy user requirements. Meanwhile, by applying partial coverage, network lifetime can be prolonged remarkably which is a primary goal of WSNs. In this paper, we investigate the pPercent Coverage Problem which only requires that p% of th...

A set D of vertices in a graph G = (V, E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected. The weakly connected domination number of G is the minimum cardinality of a weakly connected dominating set of G. The weakly connected domination subdivision number of a connected graph G is the minimum number of edges that must be subdiv...

Many people studied the Minimum Connected Dominating Set (MCDS) problem to introduce Virtual Backbone (VB) to wireless networks. However, many existing algorithms assume a static wireless network, and when its topology is changed, compute a new CDS all over again. Since wireless networks are highly dynamic due to many reasons, their approaches can be inefficient in practice. Motivated by this o...

Many data dissemination techniques have been proposed for wireless sensor networks (WSNs) to facilitate data dissemination and query processing. However, these techniques may not work well in a large scale sensor network where a huge amount of sensing data is generated. In this paper, we propose an integrated distributed connected dominating set based indexing (CBI) data dissemination scheme to...

Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we...