ANALYSIS OF THE PRACTICAL ALGORITHM FOR DATA SECURITY

Willi Ballenthin1,  Foti Kacani2,  Sanjay Madria*2

Columbia University1, Computer Science, New York, NY 10027
Missouri University of Science and Technology2, Computer Engineering, Rolla, MO 65401

MADRIAS@MST.EDU


Abstract

Wireless sensors are expected to be widely deployed in the near future. The gamut of possible applications spans from the military to home user. The inherent constraints such as limited power, memory and computing resources of these devices, however, calls for constant design considerations at all layers. Security schemes optimized for wireless sensor networks have not been fully developed. In this paper we present a complete implementation of the Practical Algorithm for Data Security proposed by Albath et al., an end-to-end security scheme employing symmetric key encryption. The implementation takes full advantage of the modular design of the TinyOS environment. The simplicity of the algorithm allow for efficient implementation in hardware, a requirement for resource constraint devices. The protocol adds just 4 bytes of data per packet, on par with industry standards. Simulation and empirical results of the scheme are also provided. The analysis shows that the Practical Algorithm for Data Security is superior than standard security schemes.

Download

[Abstract (DOC)]