TY - JOUR
T1 - On the vulnerabilities of voronoi-based approaches to mobile sensor deployment
AU - Bartolini, Novella
AU - Ciavarella, Stefano
AU - Silvestri, Simone
AU - La Porta, Thomas
N1 - Funding Information:
This work is partially supported by NATO - North Atlantic Treaty Organization, under the SPS grant G4936 "Hybrid Sensor Network for Emergency Critical Scenarios".
PY - 2016/12/1
Y1 - 2016/12/1
N2 - Mobile sensor networks are the most promising solution to cover an Area of Interest (AoI) in safety critical scenarios. Mobile devices can coordinate with each other according to a distributed deployment algorithm, without resorting to human supervision for device positioning and network configuration. In this paper, we focus on the vulnerabilities of the deployment algorithms based on Voronoi diagrams to coordinate mobile sensors and guide their movements. We give a geometric characterization of possible attack configurations, proving that a simple attack consisting of a barrier of few compromised sensors can severely reduce network coverage. On the basis of the above characterization, we propose two new secure deployment algorithms, named SecureVor and Secure Swap Deployment (SSD). These algorithms allow a sensor to detect compromised nodes by analyzing their movements, under different and complementary operative settings. We show that the proposed algorithms are effective in defeating a barrier attack, and both have guaranteed termination. We perform extensive simulations to study the performance of the two algorithms and compare them with the original approach. Results show that SecureVor and SSD have better robustness and flexibility and excellent coverage capabilities and deployment time, even in the presence of an attack.
AB - Mobile sensor networks are the most promising solution to cover an Area of Interest (AoI) in safety critical scenarios. Mobile devices can coordinate with each other according to a distributed deployment algorithm, without resorting to human supervision for device positioning and network configuration. In this paper, we focus on the vulnerabilities of the deployment algorithms based on Voronoi diagrams to coordinate mobile sensors and guide their movements. We give a geometric characterization of possible attack configurations, proving that a simple attack consisting of a barrier of few compromised sensors can severely reduce network coverage. On the basis of the above characterization, we propose two new secure deployment algorithms, named SecureVor and Secure Swap Deployment (SSD). These algorithms allow a sensor to detect compromised nodes by analyzing their movements, under different and complementary operative settings. We show that the proposed algorithms are effective in defeating a barrier attack, and both have guaranteed termination. We perform extensive simulations to study the performance of the two algorithms and compare them with the original approach. Results show that SecureVor and SSD have better robustness and flexibility and excellent coverage capabilities and deployment time, even in the presence of an attack.
UR - http://www.scopus.com/inward/record.url?scp=84999864976&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84999864976&partnerID=8YFLogxK
U2 - 10.1109/TMC.2016.2524630
DO - 10.1109/TMC.2016.2524630
M3 - Article
AN - SCOPUS:84999864976
VL - 15
SP - 3114
EP - 3128
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
SN - 1536-1233
IS - 12
M1 - 7401077
ER -