Distributed Map Algorithm
,Every
node collects distance matrix for nodes in its vicinity
–1
hop or 2 hop (larger neighborhood not always better)
,Every
node computes its local map (relative position)
,If
needed, local maps can be patched to a bigger map or global map
,In
any map, given three anchor nodes that have their coordinates known,
the map is translated into the absolute positions.