Connected Dominating Set: Theory and Experimental Study

This study intends to fulfill a need in the Computer Science community by designing efficient algorithms for Connected Dominating Set in wireless ad hoc, sensor network to provide coverage and connectivity. The overview on CDS is aimed at graduates, post graduates and research scholars for computer science stream seeking the latest development on backbone formation techniques for corresponding graph representing the network.

Autorentext

Dr. Anil K Yadav is Asst. Professor and Head MCA at UIET,CSJM University, Kanpur, India. He has 15 years of experience in teaching Computer Science to UG & PG students besides research. He received MTech from IP University Delhi & PhD in CSE from MNNIT Allahabad. Research interests: Graph algorithm for ad hoc network, Optimization and Big Data.