We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which captures the characteristics of the set-up phase of such multi-hop radio networks: asynchronous wake-up, the hidden terminal problem, and scarce knowledge about the topology of the network graph. When modelling the network as a u...

In this paper, we describe and compare several distributed greedy algorithms that produce sets of nodes that can be used to form the backbone of an ad hoc wireless network. The backbone produced is always a d-hop dominating, d-hop connected set and has a desirable “shortest path property”. The perfomance of these algorithms for various parameters are compared.

Efficient communication between nodes in ad-hoc networks can be established through repeated cluster formations with designated clusterheads. In this context minimum d-hop dominating set problem was introduced for cluster formation in ad-hoc networks and is proved to be NP-complete. Hence, an exact solution to this problem for certain subclass of graphs (representing an ad-hoc network) can be b...

A Mobile Ad Hoc Network (MANET) is an infrastructureless wireless network that can support highly dynamic mobile units. The multi-hop feature of a MANET suggests the use of clustering to simplify routing. Graph domination can be used in defining clusters in MANETs. A variant of dominating set which is more suitable for clustering MANETs is the weakly-connected dominating set. A cluster is defin...

‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...

a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...

Given a graph G = ( V , E ) and an integer k ? 1 - hop dominating set D of is subset such that, for every vertex v ? there exists node u whose distance from at most . A -hop minimum cardinality called In this paper, we present linear-time algorithm that finds in cactus graphs which improves the O n 3 -time Borradaile Le (2017). To achieve this, show problem unicyclic reduces to piercing circula...