Andere Kunden interessierten sich auch für
![Voice Traffic Over Mobile Ad Hoc Networks: A Performance Analysis of the Optimized Link State Routing Protocol]( "Voice Traffic Over Mobile Ad Hoc Networks: A Performance Analysis of the Optimized Link State Routing Protocol")
Voice Traffic Over Mobile Ad Hoc Networks: A Performance Analysis of the Optimized Link State Routing Protocol60,99 €![Effective Mobile Routing through Dynamic Addressing]( "Effective Mobile Routing through Dynamic Addressing")
Effective Mobile Routing through Dynamic Addressing60,99 €![Evaluation of the Ad Hoc On-Demand Distance Vector Routing Protocol for Mobile Ad Hoc Networks]( "Evaluation of the Ad Hoc On-Demand Distance Vector Routing Protocol for Mobile Ad Hoc Networks")
Evaluation of the Ad Hoc On-Demand Distance Vector Routing Protocol for Mobile Ad Hoc Networks60,99 €![Routing of Time-Sensitive Data in Mobile Ad Hoc Networks]( "Routing of Time-Sensitive Data in Mobile Ad Hoc Networks")
Routing of Time-Sensitive Data in Mobile Ad Hoc Networks60,99 €![Performance Analysis and Comparison of Multiple Routing Protocols in a Large-Area, High-Speed Mobile Node Ad Hoc Network]( "Performance Analysis and Comparison of Multiple Routing Protocols in a Large-Area, High-Speed Mobile Node Ad Hoc Network")
Performance Analysis and Comparison of Multiple Routing Protocols in a Large-Area, High-Speed Mobile Node Ad Hoc Network60,99 €![A Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem]( "A Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem")
A Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem61,99 €![Case for Employing the Mobile Assault Company Concept Through the Spectrum of Warfare]( "Case for Employing the Mobile Assault Company Concept Through the Spectrum of Warfare")
Case for Employing the Mobile Assault Company Concept Through the Spectrum of Warfare60,99 €
Mobile Ad Hoc Network (MANET) routing protocols provide routing solutions in mobile wireless networks, without assuming any prior knowledge of topology nor any prediction of future topology. However, the resulting routes suffer from delay and consume precious bandwidth. Perfectly scripted routing could theoretically be optimal, (i.e., introduce no delay and cost no additional bandwidth), but would naturally be very fragile. This thesis explores a merging of these approaches, following a routing script if and when available, but reverting to a robust recovery approach otherwise. Script-Assisted Ad Hoc On-demand Distance Vector (S-AODV) routing protocol is designed to take advantage of prior knowledge of topology to improve performance in a MANET, better utilizing available bandwidth. S-AODV uses pre-simulation to build a script to substitute for the route discovery process, avoiding delay and bandwidth penalties.