Accurate range free localization in multi-hop wireless sensor networks
To localize wireless sensor networks (WSN)s nodes, only the hop-based data have been so far utilized by range free techniques, with poor-accuracy, though. In this thesis, we show that localization accuracy may importantly advantage from mutual utilization, at no cost, of the information already offe...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English English English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/424/1/24p%20ABDULLAH%20RAED%20ABDULWAHHAB.pdf http://eprints.uthm.edu.my/424/2/ABDULLAH%20RAED%20ABDULWAHHAB%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/424/3/ABDULLAH%20RAED%20ABDULWAHHAB%20WATERMARK.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | To localize wireless sensor networks (WSN)s nodes, only the hop-based data have been so far utilized by range free techniques, with poor-accuracy, though. In this thesis, we show that localization accuracy may importantly advantage from mutual utilization, at no cost, of the information already offered by the advancing nodes (i.e., relays) between all anchors (i.e., position-aware) and sensor nodes join up. In addition, energy-based informant localization approaches are generally established corresponding to the channel path-loss models in which the noise is mostly expected to shadow Gaussian distributions. In this thesis, we signify the applied additive noise by the Gaussian mixture model and improve a localization algorithm depend on the received signal intensity to attain the greatest likelihood location, estimator. By employing Jensen’s inequality and semidefinite relaxation, the originally offered nonlinear and nonconvex estimator is relaxed into a convex optimization difficulty, which is able to be professionally resolved to acquire the totally best solution. Moreover, the resultant Cramer–Rao lower bound is originated for occurrence comparison. Simulation and experimental results show a substantial performance gain achieved by our proposed localization algorithm in wireless sensor networks. The performance is evaluated in terms of RMSE in terms of three algorithms WLS, CRLR, and GMSDP based on using the Monte Carlo simulation with account the number of anchors that varying from anchor=4 to anchor =20. Finally, the GMSDP- algorithm achieves and provides a better value of RMSEs and the greatest localization estimation errors comparing with the CRLR algorithm and WLS algorithm. |
|---|