A scalable hidden-Markov model algorithm for location-based services in WiMAX networks
MetadataShow full item record
Hidden-Markov Models (HMM) have shown promise as viable solutions to providing location- based services (LBS) within cellular networks. Previously established work includes a scheme to merge the stochastic contribution of the HMM and maximum likelihood decisions based on signal strength measurements and timing adjust parameters. A novel scalable positioning algorithm that utilizes the aforementioned techniques along with reorientation of the state vector in order to favor the local measurements within the area of interest is proposed in this paper. The resulting scheme is presented and its performance validated through simulations built from a scenario based on a real world WiMAX network. The results demonstrate improved performance over previous work, and the effect of scaling the algorithm is discussed.
The article of record as published may be found at http://doi.org/10.1109/HICSS.2014.627
Showing items related by title, author, creator and subject.
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ...
Huang, Jo-Wen (Monterey, California: Naval Postgraduate School, 2017-06);With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential ...
Oral, Sabri Onur (Monterey, California. Naval Postgraduate School, 1991-09);The process of finding an exact minimization for a multiple-valued logic (MVL) expression requires an extensive search and enormous computation time. One of the heuristics to reduce this computation time is the Neighborhood ...