{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/89159"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/89159","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Secure Minimum Time Data Collection (SMTDC) protocol for wireless sensor networks","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Huang, He"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engineering","degree_department":null,"school":null,"contributors":["Nahrstedt, Klara"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-03-02T20:24:19Z","date_published":"2016-03-02T20:24:19Z","updated_at":"2026-07-22T22:26:32Z","subjects":["Wireless sensor networks","secure data collection","tree formation","time scheduling"],"languages":["en"],"rights":["Copyright 2015 He Huang"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/89159","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Nahrstedt, Klara"]},{"key":"dc:creator","label":"Author","values":["Huang, He"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2016-03-02T20:24:19Z","2018-03-03T10:15:30Z","2015-12-10","2015-12"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Wireless sensor networks","secure data collection","tree formation","time scheduling"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2015 He Huang"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/89159"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2017-12-01","The student, He Huang, accepted the attached license on 2015-12-09 at 14:03.","The student, He Huang, submitted this Thesis for approval on 2015-12-09 at 14:12.","This Thesis was approved for publication on 2015-12-10 at 13:09.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8990 on 2016-03-02 at 14:07:54","Made available in DSpace on 2016-03-02T20:24:19Z (GMT). No. of bitstreams: 2 HUANG-THESIS-2015.pdf: 1556289 bytes, checksum: 5185ccfcaca7f94a53c588d8cd45f248 (MD5) LICENSE.txt: 4205 bytes, checksum: 2b7dc4287de468bffa0ee95797bb5182 (MD5) Previous issue date: 2015-12-10","Embargo set by: Seth Robbins for item 91361 Lift date: 2018-03-02T20:24:31Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 91361 on 2018-03-03T10:15:30Z."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Secure Minimum Time Data Collection (SMTDC) protocol for wireless sensor networks"]}]}],"canonical_facts":{"dc:contributor":["Nahrstedt, Klara"],"dc:creator":["Huang, He"],"dc:date":["2016-03-02T20:24:19Z","2018-03-03T10:15:30Z","2015-12-10","2015-12"],"dc:description":["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.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2017-12-01","The student, He Huang, accepted the attached license on 2015-12-09 at 14:03.","The student, He Huang, submitted this Thesis for approval on 2015-12-09 at 14:12.","This Thesis was approved for publication on 2015-12-10 at 13:09.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8990 on 2016-03-02 at 14:07:54","Made available in DSpace on 2016-03-02T20:24:19Z (GMT). No. of bitstreams: 2 HUANG-THESIS-2015.pdf: 1556289 bytes, checksum: 5185ccfcaca7f94a53c588d8cd45f248 (MD5) LICENSE.txt: 4205 bytes, checksum: 2b7dc4287de468bffa0ee95797bb5182 (MD5) Previous issue date: 2015-12-10","Embargo set by: Seth Robbins for item 91361 Lift date: 2018-03-02T20:24:31Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 91361 on 2018-03-03T10:15:30Z."],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/89159"],"dc:language":["en"],"dc:rights":["Copyright 2015 He Huang"],"dc:subject":["Wireless sensor networks","secure data collection","tree formation","time scheduling"],"dc:title":["Secure Minimum Time Data Collection (SMTDC) protocol for wireless sensor networks"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:32Z"}