Login / Signup

A distributed algorithm for computing Connected Dominating Set in ad hoc networks.

Chuanhe HuangChuan QinYi Xian
Published in: Int. J. Wirel. Mob. Comput. (2006)
Keyphrases
  • ad hoc networks
  • dynamic programming
  • optimal solution
  • worst case
  • computational complexity
  • np hard
  • distributed systems
  • dominating set
  • special case
  • simulated annealing
  • routing protocol