The paper deals with the problem of computing trajectories for a network of mobile sensors in order to maximize coverage within a fixed time interval and at the same time to reduce the noise in the measurements. The solution is provided within the framework of the heterogeneous dynamic sensor networks. A formulation of the field coverage problem is given under network connection maintenance and collision avoidance constraints. The same formulation is then used to face the problem of K-coverage, increasing the number of cooperative sensors in the same area at each time instant so reducing the effects of random noise. Simulation results are reported to show the effects of the proposed approach.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Measurement noise reduction in dynamic sensor networks|
|Data di pubblicazione:||2008|
|Appartiene alla tipologia:||04b Atto di convegno in volume|