Verwandte Artikel zu Algorithm for a Connected Dominating Set in Wireless...

Algorithm for a Connected Dominating Set in Wireless Networks - Softcover

 
9783659347238: Algorithm for a Connected Dominating Set in Wireless Networks

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

Biografía del autor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Gratis für den Versand innerhalb von/der Deutschland

Versandziele, Kosten & Dauer

Suchergebnisse für Algorithm for a Connected Dominating Set in Wireless...

Foto des Verkäufers

Mukesh Kumar Awasthi|Noor Mohammad
ISBN 10: 365934723X ISBN 13: 9783659347238
Neu Softcover
Print-on-Demand

Anbieter: moluna, Greven, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: 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 . Bestandsnummer des Verkäufers 5150138

Verkäufer kontaktieren

Neu kaufen

EUR 41,67
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

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

Anbieter: dsmbooks, Liverpool, Vereinigtes Königreich

Verkäuferbewertung 4 von 5 Sternen 4 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

paperback. Zustand: New. New. book. Bestandsnummer des Verkäufers D7S9-1-M-365934723X-6

Verkäufer kontaktieren

Neu kaufen

EUR 157,74
Währung umrechnen
Versand: EUR 28,73
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: 1 verfügbar

In den Warenkorb