An improved localisation algorithm for performance improvement Online publication date: Mon, 23-Jul-2012
by Wei Hu; Fu-Yuan Xu
International Journal of Mobile Communications (IJMC), Vol. 10, No. 4, 2012
Abstract: Aiming at solving the localisation problems in wireless sensor networks with weak adaptability, high dependence on the network environment and imperfect position accuracy, an improved Distance Vector-Hop (DV-Hop) algorithm is presented in this paper. In the improved algorithm, network communication costs and packet collision probability are reduced because the original whole network flooding is replaced by the local flooding. By using the contribution factor, the anchor node groups are optimised and the initial estimation coordinates are corrected. Our experiments are implemented in the uniformly distributed network, C-shaped network and O-shaped network. The simulation results showed that the improved DV-Hop algorithm has better performances than traditional DV-Hop algorithms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Communications (IJMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com