Skip to main content
EURASIP Journal on Wireless Communications and Networking
Figure 1 | EURASIP Journal on Wireless Communications and Networking

Figure 1

From: Multihop range-free localization with approximate shortest path in anisotropic wireless sensor networks

Figure 1

Approximate shortest paths and distance estimations with circular-shaped virtual hole. The proposed algorithm approximates the compound shortest path between two anchors as the boundary of a circular-shaped virtual hole whose size and placement are determined based on the difference between the expected hop count and the hop count of the compound shortest path between the anchors. The distance to each anchor is then estimated by dividing the approximate compound shortest path according to the hop counts to the anchors.

Back to article page