TY - GEN
T1 - Snap and spread
T2 - 4th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2008
AU - Bartolini, N.
AU - Calamoneri, T.
AU - Fusco, E. G.
AU - Massini, A.
AU - Silvestri, S.
PY - 2008
Y1 - 2008
N2 - The use of mobile sensors is motivated by the necessity to monitor critical areas where sensor deployment cannot be performed manually. In these working scenarios, sensors must adapt their initial position to reach a final deployment which meets some given performance objectives such as coverage extension and uniformity, total moving distance, number of message exchanges and convergence rate. We propose an original algorithm for autonomous deployment of mobile sensors called Snap & Spread. Decisions regarding the behavior of each sensor are based on locally available information and do not require any prior knowledge of the operating conditions nor any manual tuning of key parameters. We conduct extensive simulations to evaluate the performance of our algorithm. This experimental study shows that, unlike previous solutions, our algorithm reaches a final stable deployment, uniformly covering even irregular target areas. Simulations also give insights on the choice of some algorithm variants that may be used under some different operative settings.
AB - The use of mobile sensors is motivated by the necessity to monitor critical areas where sensor deployment cannot be performed manually. In these working scenarios, sensors must adapt their initial position to reach a final deployment which meets some given performance objectives such as coverage extension and uniformity, total moving distance, number of message exchanges and convergence rate. We propose an original algorithm for autonomous deployment of mobile sensors called Snap & Spread. Decisions regarding the behavior of each sensor are based on locally available information and do not require any prior knowledge of the operating conditions nor any manual tuning of key parameters. We conduct extensive simulations to evaluate the performance of our algorithm. This experimental study shows that, unlike previous solutions, our algorithm reaches a final stable deployment, uniformly covering even irregular target areas. Simulations also give insights on the choice of some algorithm variants that may be used under some different operative settings.
UR - http://www.scopus.com/inward/record.url?scp=45849094427&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=45849094427&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-69170-9_30
DO - 10.1007/978-3-540-69170-9_30
M3 - Conference contribution
AN - SCOPUS:45849094427
SN - 3540691693
SN - 9783540691693
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 451
EP - 456
BT - Distributed Computing in Sensor Systems - 4th IEEE International Conference, DCOSS 2008, Proceedings
Y2 - 19 July 2018 through 14 June 2008
ER -