Positioning using local maps

ct 9 It is often useful to know the positions of nodes in a network. However, in a large network it is impractical to build a 10 single global map. In this paper, we present a new approach for distributed localization called Positioning using Local 11 Maps (PLM). Given a path between a starting node and a remote node we wish to localize, the nodes along the path 12 each compute a map of their local neighborhood. Adjacent nodes then align their maps, and the relative position of the 13 remote node can then be determined in the coordinate system of the starting node. Nodes with known positions can 14 easily be incorporated to determine absolute coordinates. We instantiate the PLM framework using the previously pro15 posed MDS-MAP(P) algorithm to generate the local maps. Through simulation experiments, we compare the resulting 16 algorithm, MDS-MAP(D), with existing distributed methods and show improved performance on both uniform and 17 irregular topologies. 18

• Type: Journal
• Year: 2006
• Where: ADHOC
• Authors: Yi Shang, Wheeler Ruml, Markus P. J. Fromherz
• Keywords: ADHOC 2006, Local 11 Maps, Remote Node, Single Global Map