Articles liés à Algorithm for A Connected Dominating Set in Wireless...
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
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.
Biographie de l'auteur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 41,67
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour Algorithm for A Connected Dominating Set in Wireless...
Image fournie par le vendeur
Algorithm for A Connected Dominating Set in Wireless Networks
Edité par
LAP LAMBERT Academic Publishing, 2013
ISBN 10 : 365934723X
ISBN 13 : 9783659347238
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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 . N° de réf. du vendeur 5150138
Quantité disponible : Plus de 20 disponibles
Image d'archives
Algorithm for A Connected Dominating Set in Wireless Networks
Edité par
LAP LAMBERT Academic Publishing, 2013
ISBN 10 : 365934723X
ISBN 13 : 9783659347238
Neuf
paperback
Vendeur : dsmbooks, Liverpool, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
paperback. Etat : New. New. book. N° de réf. du vendeur D7S9-1-M-365934723X-6
Quantité disponible : 1 disponible(s)