pith. sign in

arxiv: 1502.01964 · v1 · pith:JA6UMT7Pnew · submitted 2015-02-06 · 💻 cs.NI

Maximum Likelihood based Multihop Localization in Wireless Sensor Networks

classification 💻 cs.NI
keywords multihoplocalizationsensorwirelessalgorithmconnectiondatafunctions
0
0 comments X
read the original abstract

For data sets retrieved from wireless sensors to be insightful, it is often of paramount importance that the data be accurate and also location stamped. This paper describes a maximum-likelihood based multihop localization algorithm called kHopLoc for use in wireless sensor networks that is strong in both isotropic and anisotropic network deployment regions. During an initial training phase, a Monte Carlo simulation is utilized to produce multihop connection density functions. Then, sensor node locations are estimated by maximizing local likelihood functions of the hop counts to anchor nodes. Compared to other multihop localization algorithms, the proposed kHopLoc algorithm achieves higher accuracy in varying network configurations and connection link-models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.