A constant-factor approximation for d-hop connected dominating sets in unit disk graph

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Int. J. Sens. Networks

• Publication date

  2012-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1504/IJSNET.2012.050447
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks

  2013cited by this paper
• Minimum Data-Latency-Bound $k$-Sink Placement Problem in Wireless Sensor Networks

  2011cited by this paper
• Two algorithms for minimum 2-connected r-hop dominating set

  2010cited by this paper
• Analysis on Theoretical Bounds for Approximating Dominating Set Problems

  2009cited by this paper
• A Better Approximation for Minimum Average Routing Path Clustering Problem in 2-d Underwater Sensor Networks

  2009cited by this paper
• Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks

  2008cited by this paper
• A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks

  2007cited by this paper
• Multi-hop Clustering Based on Neighborhood Benchmark in Mobile Ad-hoc Networks

  2007cited by this paper
• Connected D-Hop Dominating Sets in Mobile Ad Hoc Networks

  2006cited by this paper
• Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets

  2005cited by this paper
• Enhancing broadcast operations in ad hoc networks with two-hop connected dominating sets

  2004cited by this paper
• A New Adaptive Distributed Routing Protocol Using d-hop Dominating Sets for Mobile Ad Hoc Networks

  2004cited by this paper
• Connectivity Based k-Hop Clustering in Wireless Networks

  2002cited by this paper
• A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks

  2001cited by this paper
• Adapting d-hop dominating sets to topology changes in ad hoc networks

  2000cited by this paper
• Propagation and Leader Election in a Multihop Broadcast Environment

  1998cited by this paper

• Computation of minimum d-hop connected dominating set of trees in O(n) time

  2022cites this paper
• A Constant Factor Approximation for $d$ -Hop Connected Dominating Set in Three-Dimensional Wireless Networks

  2019cites this paper
• Distributed Construction of D-Hop Connected Dominating Sets for Wireless Sensor Networks

  2018cites this paper
• A Novel Approximation for Multi-Hop Connected Clustering Problem in Wireless Networks

  2017cites this paper
• Partage des ressources dans le nuage de véhicules

  2017cites this paper
• An Optimized Flow Allocation in Vehicular Cloud

  2016cites this paper
• A distributed D-hop cluster formation for VANET

  2016cites this paper
• A Novel Approximation for Multi-hop Connected Clustering Problem in Wireless Sensor Networks

  2015cites this paper
• MULTICRITERION ESTIMATION OF EFFICIENCY OF MOBILE NETWORK CLUSTERING

  2015cites this paper
• An efficient distributed node clustering protocol for high dimensional large-scale wireless sensor networks

  2014cites this paper
• A New Greedy Algorithm for D-Hop Connected Dominating Set

  2014cites this paper
• Efficient Data Dissemination in Wireless Ad Hoc Networks

  2014cites this paper
• Graph-Based Routing, Broadcasting and Organizing Algorithms for Ad-Hoc Networks

  2012cites this paper
• Internet of things' authentication and access control

  2012cites this paper
• Chapter 3 Graph-Based Routing , Broadcasting and Organizing Algorithms for Ad-Hoc Networks

  2012cites this paper
• A PTAS for minimum d-hop connected dominating set in growth-bounded graphs

  2010cites this paper