Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"Minimum Connected Dominating Set"”.

  1. Connected Domination in Graphs

    A connected dominating set D is a set of vertices of a graph G = (V, E) such that every vertex in V − D is adjacent to at least one vertex in D and the subgraph hDi induced by the set D is connected. The connected domination number γc(G) is the minimum of the cardinalities of the connected …

    usf Repository record for Connected Domination in Graphs (opens in a new tab)

  2. Integer programming formulation for contention aware connected dominating set in wireless multi-hop network

    … concern in wireless networks. Broadcasting with Minimum Connected Dominating Set (MCDS) is used to reduce redundant transmission. Contention occurs when a group of nodes want to transmit over a shared channel at the same time. During contention, nodes defer transmissions for a random time. Using …

    lethbridge Repository record for Integer programming formulation for contention aware connected dominating set in wireless multi-hop network (opens in a new tab)

  3. Generalized Domination in Graphs with Applications in Wireless Networks

    … scenarios. In wireless ad-hoc network, a connected dominating set (CDS) can be used to serve as a virtual backbone, facilitating communication among the members in the network. Most literature focuses on creating the smallest virtual backbone without considering the distance that a message …

    tamu Repository record for Generalized Domination in Graphs with Applications in Wireless Networks (opens in a new tab)

  4. Optimization in Geometric Graphs: Complexity and Approximation

    … in a wire- less network is strongly related to a minimum connected dominating set in its graph theoretic representation. Motivated by the vastness of application areas, we study several problems including maximum independent set, minimum vertex coloring, minimum clique partition, max-cut and …

    tamu Repository record for Optimization in Geometric Graphs: Complexity and Approximation (opens in a new tab)

  5. Privacy of Contextual Information in Wireless Sensor Networks

    … fake sources to the problem of finding a minimum connected dominating set (MCDS) that covers the WSN deployment area. We then impose transmission schedules on the fake sources to accelerate the delivery of real event reports. Finally, we propose strong privacy traffic normalization …

    arizona-thes Repository record for Privacy of Contextual Information in Wireless Sensor Networks (opens in a new tab)

  6. Simulation-based Performance Evaluation of MANET Backbone Formation Algorithms

    … of mobile hosts and/or mobility rates. The Connected Dominating Set (CDS), a.k.a. virtual backbone or Spine, is proposed to facilitate routing, broadcasting, and establishing a dynamic infrastructure for distributed location databases. Minimizing the CDS produces a simpler abstracted …

    waterloo Repository record for Simulation-based Performance Evaluation of MANET Backbone Formation Algorithms (opens in a new tab)

  7. Scalable ReliableControllerPlacementinSoftwareDefinedNetworking

    … concern in SDN, via exploiting the independent dominating set approach to ensure a distribution of controllers with lowest response times. We propose a new node degree-based algorithm named High Degree with Independent Dominating Set (HDIDS) for the controller placement problem in the SDN …

    concordia Download PDF for Scalable ReliableControllerPlacementinSoftwareDefinedNetworking (opens in a new tab)