Articoli correlati a Algorithm for A Connected Dominating Set in Wireless...

Algorithm for A Connected Dominating Set in Wireless Networks - Brossura

 
9783659347238: Algorithm for A Connected Dominating Set in Wireless Networks

Sinossi

A wireless adhoc network is a collection of wireless mobile nodes forming a temporary network without the aid of any established infrastructure or centralized administration. The wireless networks face challenges to form an optimal routing protocol. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. Routing based on a connected dominating set is a Efficient approach, where the searching space for a route is reduced to nodes in the set, The proposed algorithm is an enhancement of the distributed algorithm proposed by Wu and Li. In this book, we propose a simple and efficient distributed algorithm for calculating connected dominating set in adhoc wireless networks, where connections of nodes are determined by their geographical distances. We also propose an update/recalculation algorithm for the connected dominating set when the topology of the adhoc wireless network changes dynamically. The simulation results show that the average dominating set of nodes decreased considerable after applying the new algorithm. Our approach can be potentially used in designing efficient routing algorithms based on a connected dominating set.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

L'autore

Dr. Mukesh Kumar Awasthi has done his post-graduation in Mathematics from the University of Lucknow in the year 2007. He has obtained his Ph.D degree in Mathematics from Indian Institute of Technology Roorkee in 2012. Currently he is working as an assistant Professor in the Department of Mathematics, Graphic Era University, Dehradun.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

EUR 9,70 per la spedizione da Germania a Italia

Destinazione, tempi e costi

Risultati della ricerca per Algorithm for A Connected Dominating Set in Wireless...

Immagini fornite dal venditore

Mukesh Kumar Awasthi|Noor Mohammad
ISBN 10: 365934723X ISBN 13: 9783659347238
Nuovo Brossura
Print on Demand

Da: moluna, Greven, Germania

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Awasthi Mukesh KumarDr. Mukesh Kumar Awasthi has done his post-graduation in Mathematics from the University of Lucknow in the year 2007. He has obtained his Ph.D degree in Mathematics from Indian Institute of Technology Roorkee in . Codice articolo 5150138

Contatta il venditore

Compra nuovo

EUR 41,67
Convertire valuta
Spese di spedizione: EUR 9,70
Da: Germania a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Foto dell'editore

Awasthi, Mukesh Kumar, Mohammad, Noor
ISBN 10: 365934723X ISBN 13: 9783659347238
Nuovo paperback

Da: dsmbooks, Liverpool, Regno Unito

Valutazione del venditore 4 su 5 stelle 4 stelle, Maggiori informazioni sulle valutazioni dei venditori

paperback. Condizione: New. New. book. Codice articolo D7S9-1-M-365934723X-6

Contatta il venditore

Compra nuovo

EUR 157,74
Convertire valuta
Spese di spedizione: EUR 28,58
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: 1 disponibili

Aggiungi al carrello