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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 132 pp. Englisch. N° de réf. du vendeur 9783659942778
Quantité disponible : 2 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 132 pages. 8.66x5.91x0.30 inches. In Stock. N° de réf. du vendeur 3659942774
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Yadav Anil K.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 Universi. N° de réf. du vendeur 158430866
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783659942778
Quantité disponible : 1 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 132 pp. Englisch. N° de réf. du vendeur 9783659942778
Quantité disponible : 1 disponible(s)