Editore: LAP LAMBERT Academic Publishing, 2023
ISBN 10: 6206791904 ISBN 13: 9786206791904
Lingua: Inglese
Da: preigu, Osnabrück, Germania
EUR 71,00
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Wormhole Isolation Method in MANET using Threshold Technique | Vikrant Sharma (u. a.) | Taschenbuch | Englisch | 2023 | LAP LAMBERT Academic Publishing | EAN 9786206791904 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
Editore: LAP LAMBERT Academic Publishing Okt 2023, 2023
ISBN 10: 6206791904 ISBN 13: 9786206791904
Lingua: Inglese
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 84,90
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Neuware -In this study work, we focus on performance issues of routing protocols, Optimized Link State Routing (OLSR), Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Temporally Ordered Routing Algorithm (TORA) in mobility and standalone ad-hoc networks. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks.We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.Books on Demand GmbH, Überseering 33, 22297 Hamburg 224 pp. Englisch.
Editore: LAP LAMBERT Academic Publishing Okt 2023, 2023
ISBN 10: 6206791904 ISBN 13: 9786206791904
Lingua: Inglese
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 84,90
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In this study work, we focus on performance issues of routing protocols, Optimized Link State Routing (OLSR), Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Temporally Ordered Routing Algorithm (TORA) in mobility and standalone ad-hoc networks. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks.We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm. 224 pp. Englisch.
Editore: LAP Lambert Academic Publishing, 2023
ISBN 10: 6206791904 ISBN 13: 9786206791904
Lingua: Inglese
Da: moluna, Greven, Germania
EUR 67,82
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. In this study work, we focus on performance issues of routing protocols, Optimized Link State Routing (OLSR), Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Temporally Ordered Routing Algorithm (TORA) in mobility and standalone a.
Editore: LAP LAMBERT Academic Publishing, 2023
ISBN 10: 6206791904 ISBN 13: 9786206791904
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 85,92
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In this study work, we focus on performance issues of routing protocols, Optimized Link State Routing (OLSR), Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Temporally Ordered Routing Algorithm (TORA) in mobility and standalone ad-hoc networks. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks.We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.