A survey on routing algorithms based on connected dominating sets in MANETS
D. S. John Deva Prasanna, D. John Aravindhar, A. George Amalanathan · 2017
Mobile Adhoc Networks (MANET) are dynamic and volatile in nature. Discovering and maintaining routes are challenging Conventional routing algorithms could not be applied to these networks. A The concept of Connected Dominating Sets (CDS) in graph theory has very constructive role on routing in MANETs. In this paper we have given a widespread survey of various CDS formation algorithms and their performances evaluations are discussed.