Image Processing Reference
In-Depth Information
E
S
2
S
2
d
1
d
2
d
1
d
2
g
12
d
1
B
2
B
1
B
2
B
1
d
1
d
2
d
2
E
S
1
S
1
d
3
B
3
(a)
(b)
Beacon
B
i
with known position
Sensor node
S
i
with unknown position
Maximal transmission range
Circles with radius
d
i
around
B
i
with intersections at
S
1
and
S
2
FIGURE .
(a) Localization of
B
and
B
resulting in two positions each. (b) full localization of
B
and
B
.
the visualized example,
B
is located in plane
E
and therefore
S
must be
E
(
B
∈
N
(
B
)∩
N
(
S
)→
B
,
S
E
). In the end, this algorithm calculates a third distance implicitly, if enough
neighboring information is provided.
∈
E
→
S
∈
6.2.8 Neighborhood Intersection
Buschmann et al. proposed another algorithm [BPF] using neighboring information called neigh-
borhood intersection distance estimation scheme (NIDES). It requires uniformly distributed sensor
nodes only. A synchronization of nodes and explicit distance measurements are not necessary.
Figure . demonstrates the estimation of distance
d
between two sensor nodes
S
and
S
.If
both nodes are in range to each other, the transmission ranges form an overlapping region
A
.he
Transmission
range
A
TR
y
Overlapping
region
A
S
2
r
S
1
d
l
x
FIGURE .
Neighborhood intersection distance estimation schema.
