Connected Dominating Set Based Topology Construction
Minimum Connected Dominating Set based Virtual Backbone Construction in OLSR Protocol
... Puducherry, India ABSTRACT In ad hoc wireless networks, nodes have limited energy and short transmission range. There are no pre-designated routers in these networks and hence routing cannot be done in the conventional ...
9
Application oriented connected dominating set-based cluster formation in wireless sensor networks
... are based on a (k, r)-Connected Dominating Set, which is suitable for cluster-based hierarchical ...selected based on quality, which is a function of the residual battery power, ...
16
Distributed construction of minimum connected dominating set in Wireless Sensor Network using two-hop information
... In our second experiment, we did an analysis on how much PDS nodes change their 750 status in post-Steiner Tree construction phase and what is its impact on reduction of overall CDS size. For varied network sizes ...
50
Randomized Algorithms for Approximating a Connected Dominating Set in Wireless Sensor Networks
... this topology density - in other words every sensor flipping a coin with a probability p six times is enough to form a CDS for this network ...needed based on the density (as measured by the number of ...
9
Distributed Computation of Connected Dominating Set for Multi-Hop Wireless Networks
... smallest set of dominant nodes for forwarding packets would be a good approach for better ...communication. Connected dominating set (CDS) computation is one of the method to find important ...
6
On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks
... The main advantage of connected-dominating-set-based routing is that it centralizes the whole network into small connected dominating set subnetwork, which means onl[r] ...
8
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
... algorithm, connected dominating set, independent set, leader election, spanning ...The topology of such wireless ad hoc net- work can be modeled as a unit-disk graph [6], a geometric ...
7
Leveraging 1-hop Neighborhood Knowledge for Connected Dominating Set in Wireless Sensor Networks
... smaller connected dominating set, a new algorithm, Leveraging 1-hop Neighborhood Knowledge for Connected Domi- nating Set in Wireless Sensor Networks (OHCDS), which is based on ...
8
Ant Colony Optimization Algorithm with Pheromone Correction Strategy for the Minimum Connected Dominating Set Problem
... minimum connected dominating set ...method based on a greedy heuristic where our pheromone correction strategy and special attention to the initial condition of the ACO over- come shortcomings ...
18
A content based routing protocol for mobile ad hoc networks using a distributed connected k Hop dominating set as a backbone
... The simplified simulation model allows for complete control and track-keeping of the state and actions of the individual nodes and the network as a whole. Measurements have been made by checking the state of the Ck-HDS ...
119
The First Constant Factor Approximation for Minimum Partial Connected Dominating Set Problem in Growth-bounded Graphs
... (a) most wireless network topology can be more accu- rately abstracted using the subgraphs of our inter- est rather than general graphs, and (b) even though Khuller et al.’s algorithm for general graphs still ...
10
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
... intermittent topology changes. If faults or topology changes occur during converging period, self-stabilizing algorithms restart computation from the configuration just after the faults or ...
11
A Heuristic Approach for Dominating Set and Network Coding-based Routing in Wireless Mesh Networks
... the topology of WMNs, we have to find the connected dominating set ...a connected dominating set node routing first calculating their node ...edges connected to the ...
5
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
... the connected dominating set in a node-weighted graph with the minimum total ...the dominating sets for the graph first and then interconnecting ...algorithm based on the partition and ...
11
A PTAS for the minimum dominating set problem in unit disk graphs
... In [3], a PTAS for the minimum connected dominating set is presented, also using separation of the graph based on a grid. However, the case when no geometric representation is present is ...
14
CONNECTED WEIGHT DOMINATING EDGE SET ON S - VALUED GRAPHS
... Recently, Chandramouleeswaran et.al. introduced the notion of semiring valued graphs. Since then several properties of S-Valued graphs have been studied by others. In our earlier paper, we studied the notion of edge ...
10
Fuzzy Dominating Set
... fuzzy dominating set, then there exists a fuzzy subset α 0 of σ such that α 0 is a fuzzy dominating set, where α ∩ α 0 = φ and α ∪ α 0 = ...fuzzy dominating set of ...fuzzy ...
5
Online Dominating Set
... As something a little unusual in competitive analysis, we are working with two different optimal algorithms. This is with the aim of investigating whether it is predominantly the requirement to maintain feasible ...
15
Line Set Dominating Set with Reference to Degree
... line set dominating number of G and is denote by ϑ sl ' ( G ) ...Line set Dominating set are analyse with respect to the strong domination parameter for separable ...line set ...
6
a minimum total dominating set ∗
... Each vertex in pn(v, S) is called a private neighbor of v. A vertex cover of G is a set X ⊆ V such that each edge of G is incident to at least one vertex of X. A minimum vertex cover is a vertex cover of smallest ...
12