Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks

This publication has 10 references indexed in Scilit:

• Routing in ad-hoc networks using minimum connected dominating sets
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm
  Published by Association for Computing Machinery (ACM) ,2001
• A new approach to the design and analysis of peer‐to‐peer mobile networks
  Wireless Networks, 1999
• A performance comparison of multi-hop wireless ad hoc network routing protocols
  Published by Association for Computing Machinery (ACM) ,1998
• Approximation Algorithms for Connected Dominating Sets
  Algorithmica, 1998
• On weakly connected domination in graphs
  Discrete Mathematics, 1997
• A cluster-based approach for routing in dynamic networks
  ACM SIGCOMM Computer Communication Review, 1997
• Multicluster, mobile, multimedia radio network
  Wireless Networks, 1995
• The Design and Simulation of a Mobile Radio Network with Distributed Control
  IEEE Journal on Selected Areas in Communications, 1984
• A Distributed Algorithm for Minimum-Weight Spanning Trees
  ACM Transactions on Programming Languages and Systems, 1983