
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.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
