We consider the problem of localizing random sensor networks by means of time of arrival capabilities. Interactions among sensors are modeled by a mass-spring system. Masses (sensors) initially have a random estimation of their position. The knowledge of their distance from other masses is translated into connect masses with springs whose length should reach the estimated distances. This determines a set of forces to which masses are subject to. Starting from this configuration we propose several strategies reducing the overall time needed to reach the desired level of equilibrium.
Distributed Localization Strategies for Sensor Networks
NAVARRA, Alfredo;
2007
Abstract
We consider the problem of localizing random sensor networks by means of time of arrival capabilities. Interactions among sensors are modeled by a mass-spring system. Masses (sensors) initially have a random estimation of their position. The knowledge of their distance from other masses is translated into connect masses with springs whose length should reach the estimated distances. This determines a set of forces to which masses are subject to. Starting from this configuration we propose several strategies reducing the overall time needed to reach the desired level of equilibrium.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
