Abstract
Recent advances in the development of compact microprocessors have brought forth new applications in the field of data acquisition and wireless communication. One of these applications is a compact sensor mote that has the ability to perform both data acquisition and transmission within a Wireless Sensor Network (WSN). Wireless sensor communication is susceptible to the same data security threats as traditional wireless networks. In an environment where sensors are broadcasting battlefield intelligence or patient biometrics, data confidentiality must be enforced utilizing some form of encryption. Unlike traditional wireless networks, where the communicating devices have unrestricted access to power and memory, a wireless sensor has very limited resources. A wireless sensor consists of a battery designed to last an extended amount of time, therefore it is critical that the computation and transmission overhead involved in enforcing data security be optimized to preserve battery life. The research presented in this thesis details a nesC/TinyOS implementation of the NTRUEncrypt PKCS executing on a Crossbow MICAz mote. Algorithm details regarding message encryption and decryption are analyzed along with optimization techniques that improve execution time and reduce memory size. A summary of performance metrics including execution time, power consumption and code size relative to the comparable ECIES-160 PKCS is also provided.
Library of Congress Subject Headings
Wireless sensor networks--Security measures; Computer algorithms
Publication Date
5-1-2009
Document Type
Thesis
Department, Program, or Center
Computer Engineering (KGCOE)
Advisor
Yang, Shanchieh Jay
Advisor/Committee Member
Lopez, Manuel
Recommended Citation
Schab, Michael, "Extremely low-overhead security for wireless sensor networks: Algorithms and implementation" (2009). Thesis. Rochester Institute of Technology. Accessed from
https://repository.rit.edu/theses/5507
Campus
RIT – Main Campus
Comments
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: TK7872.D48 S33 2009