Secure Minimum Time Data Collection (SMTDC) protocol for wireless sensor networks

Recent work has shown that a mobile data collector moving along a predefined trajectory can improve the real-time data collection duration and efficiency in wireless sensor networks (WSN). Due to the fixed trajectory and limited communication range, data collection is conducted using a many-to-one communication pattern known as convergecast. However, because of the confidentiality concern of data being transmitted, security issues such as security key leakage, eavesdropping, and malicious attack raise significant challenges in minimizing the data collection time. To address this issue, we present the design and implementation of the Secure Minimum Time Data Collection (SMTDC) protocol, a tree formulated, and time-scheduled protocol for large scale, stationary, hardware-limited WSN. SMTDC can cooperate with many existing security communication frameworks. During the tree formation phase of SMTDC, we build well-balanced optimized trees that have the potential for minimum data collection time. We formulate our approach as an integer linear programming problem and solve it using linear relaxation based iterative rounding (LR-IR). During the time scheduling phase of SMTDC, we use a heuristic time-slot arrangement algorithm to solve the tree scheduling problem. The proposed algorithms and schemes are validated through simulation experiments using GUROBI solver and OMNET++ under realistic WSN topology. The result shows that SMTDC tree formation outperforms other algorithms in building a more effectively secure and load-balanced tree, and SMTDC scheduling significantly improves the data collection time over pre-generated tree topology.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Electrical & Computer Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2016

Author dc:creator

• Huang, He

Contributors dc:contributor

• Nahrstedt, Klara

• Wireless sensor networks
• secure data collection
• tree formation
• time scheduling

Statement dc:rights

• Copyright 2015 He Huang

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/89159

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/89159