Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks

No abstract is available for this paper.

• Publication year

  2003

• Venue

  23rd International Conference on Distributed Computing Systems, 2003. Proceedings.

• Publication date

  2003-05-19

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ICDCS.2003.1203456
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Number of Neighbors Needed for Connectivity of Wireless Networks

  2004cited by this paper
• A performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks

  2004cited by this paper
• Lectures on discrete geometry

  2002cited by this paper
• Virtual backbones in wireless ad hoc networks

  2002cited by this paper
• An efficient distributed algorithm for constructing small dominating sets

  2002cited by this paper
• Topology control and routing in ad hoc networks: a survey

  2002cited by this paper
• Message-optimal connected dominating sets in mobile ad hoc networks

  2002cited by this paper
• New distributed algorithm for connected dominating set in wireless ad hoc networks

  2002cited by this paper
• Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks

  2002cited by this paper
• Distributed heuristics for connected dominating sets in wireless ad hoc networks

  2002influential reference
• Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

  2002cited by this paper
• RNG and internal node based broadcasting algorithms for wireless one-to-one networks

  2001cited by this paper
• Non-approximability results for optimization problems on bounded degree instances

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

  2001cited by this paper
• GPSR: greedy perimeter stateless routing for wireless networks

  2000cited by this paper
• On calculating connected dominating set for efficient routing in ad hoc wireless networks

  1999cited by this paper
• Routing with Guaranteed Delivery in Ad Hoc Wireless Networks

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

  1998cited by this paper
• Routing in ad-hoc networks using minimum connected dominating sets

  1997cited by this paper
• On weakly connected domination in graphs

  1997cited by this paper
• A threshold of ln n for approximating set cover (preliminary version)

  1996cited by this paper
• On the hardness of approximating minimization problems

  1994cited by this paper
• Simple heuristics for unit disk graphs

  1994cited by this paper
• Low diameter graph decompositions

  1993influential reference
• On sparse spanners of weighted graphs

  1993cited by this paper
• Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs

  1993influential reference
• Unit disk graphs

  1991cited by this paper
• Sparse partitions

  1990cited by this paper
• A simple parallel algorithm for the maximal independent set problem

  1985cited by this paper
• A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem

  1985cited by this paper

• Spin Glass approach to the 2-Distance Minimal Dominating Set problem

  2019cites this paper
• The weakly connected independent set polytope in corona and join of graphs

  2018cites this paper
• The minimum weakly connected independent set problem: Polyhedral results and Branch-and-Cut

  2016cites this paper
• Frequencies Assignment in Cellular Networks - Maximum Stable Approach

  2015cites this paper
• On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm

  2015cites this paper
• Fast detection of compact topology representation for wireless networks

  2015cites this paper
• Connected Dominating Set in Wireless Networks

  2013cites this paper
• Constructing efficient rotating backbones in wireless sensor networks using graph coloring

  2012cites this paper
• Optimal Algorithm for Connected Dominating Sets

  2011cites this paper
• An ACO Algorithm for Effective Cluster Head Selection

  2011cites this paper
• Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks

  2010cites this paper
• Constructing weakly connected dominating set for secure clustering in distributed sensor network

  2010influential citation
• UNIVERSIT ´ E BLAISE PASCAL - CLERMONT II

  2010cites this paper
• Graph-theoretic and geometric optimizations in communication networks

  2009cites this paper
• Bounds relating the weakly connected domination number to the total domination number and the matching number

  2009cites this paper
• A divide-and-conquer scheme for assigning roles in multi-channel wireless mesh networks

  2009cites this paper
• Algorithme distribué pour l'assignation de rôles dans Molecular MAC, une couche MAC multicanal

  2009cites this paper
• Simulation-based Performance Evaluation of MANET Backbone Formation Algorithms

  2008cites this paper
• DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks

  2007influential citation
• Survey of clustering techniques for mobile ad hoc networks

  2007cites this paper
• Maintaining a quality of service routing tree for mobile ad hoc networks

  2006cites this paper
• Graph Domination, Coloring and Cliques in Telecommunications

  2006cites this paper
• Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication

  2006cites this paper
• Minimum connected dominating sets and maximal independent sets in unit disk graphs

  2006cites this paper
• QoSRT: a Quality of Service Routing Tree for Wireless Ad Hoc Networks

  2006cites this paper
• Self-stabilizing Wireless Connected Overlays

  2006cites this paper
• A simple improved distributed algorithm for minimum CDS in unit disk graphs

  2005cites this paper
• Robust quality of service backbone for mobile ad hoc networks

  2005cites this paper
• Clustering mobile ad hoc networks using graph domination

  2004cites this paper
• Locating cache proxies in manets

  2004cites this paper
• CLUSTERING ALGORITHMS FOR AD HOC WIRELESS NETWORKS

  2004cites this paper
• Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks

  2003influential citation