Design/prototype Model For Location Management (LM) Algorithm Testing
Wireless location management (LM) algorithms
Versandkostenfrei!
Versandfertig in 6-10 Tagen
38,99 €
inkl. MwSt.
PAYBACK Punkte
19 °P sammeln!
The wireless networking industry has limited academic literature regarding location management (LM) algorithms and their importance to the overhead of wireless networks. The available literature approaches the topic from a mathematical approach. Though a valid direction, it is limiting in terms of the interoperability of the various processes involved. This is a different viewpoint on a way to evaluate LM s. The purpose of this research effort was to develop a model that provides repeatable Location Management (LM) testing using a network simulation tool, QualNet version 5.1 (2011). The model ...
The wireless networking industry has limited academic literature regarding location management (LM) algorithms and their importance to the overhead of wireless networks. The available literature approaches the topic from a mathematical approach. Though a valid direction, it is limiting in terms of the interoperability of the various processes involved. This is a different viewpoint on a way to evaluate LM s. The purpose of this research effort was to develop a model that provides repeatable Location Management (LM) testing using a network simulation tool, QualNet version 5.1 (2011). The model will provide protocol developers a framework to simulate stable protocol environments for development. Using the Design Science Research methodology development and validation of a model as the artifact for this study was done. This process used LM algorithms to provide validity to the test of repeatability of the simulation events. This book provides a new metrics for their evaluations. I would like to thank the following for their assistance and reviewing of the work: Richard Livingood, PhD, Hilmi Lahoud, PhD, Chien-Wei-Han, William A. Reed, PhD, Dean, School of Business and Technology.
Andere Kunden interessierten sich für
