Maximizing the Lifetime and Data Security of WSNs
Abijith Nayak M R, Akshay kumar A, D P Santrupth, B N Kiran · International Journal of Modern Trends in Engineering and Research · 2016
Wireless Sensor Networks have gained wide popularity in the recent years for its important applications such as remote environment monitoring, target tracking, safety-critical monitoring applications etc. But WSNs have many constraints like low computational power, small memory, and limited energy resources. Two of the major issues associated with WSNs are the network lifetime and data security which we aim to address in this paper. Network lifetime maximization has become an essential system requirement for wireless sensor network which if maximized would contribute to the extensive usage of the capabilities especially for those used for safety-critical and highly-reliable applications. Clustering sensors into groups is a popular strategy to maximize the network Lifetime. In this paper, the High Energy First (HEF) clustering algorithm is chosen as a design reference model, which is proved to be an optimal clustering policy under certain ideal conditions. Further as an enhancement to avoid energy dissipation in WSNs, we use cluster node active/sleep algorithm. For protection of sensor data process from various kinds of attacks currently most of the WSN use hop by hop data security. But due to many decryptions performed by the intermediate nodes there is more consumption of battery power. End to end data security on the other hand can guarantee the end-to-end data confidentiality and result in less transmission latency and computation cost. In this paper we use privacy Homomorphism, which is one such encryption scheme that strives to provide data security. KeywordsCluster head, base station, nodes, public key, private key. ______________________________________________________________________________________