Adequate Sparse Secure and Minkowski Distance Based Location Privacy Approach in Wireless Sensor Network

Abstract

Abstract:Wireless sensor networks (WSNs) are susceptible to various issues such as privacy and security. To overcome these issues, our worka first validates the location privacy issues and security protection. So that introduce a novel method known as Adequate Sparse Secure and Minkowski distance based Location Privacy (ASSMLP), in this first phase concentrates on location privacy which is improved by presenting a technique known as Fake Source and Fake Sink (FSFS). In this the location of fake node is separated by Modified Pillar k means based Minkowski distance. Second phase deliberate on security and here confidentiality of message can be ensured through sparse matrix. Thus the result shows throughput, energy consumption, energy efficiency, delay and packet delivery ratio and it achieves 2%, 7%, 36%, 8% and 8% better performance than existing work. Clustering accuracy is showed by means of minimum silhouette coefficient. Since real node cannot identify with an intruder.

A Novel Technique for Improving the Security of WSN Using Random Key PreDistribution Scheme

“…The coverage area of the entire network 100m×2000m and the position of the base station is 50,50 that is x and y coordinates. For knowing the performance of the LEACH-RKP-WSN, it is compared with ASSMLP [20].…”

“…The following Table 1 shows the specifications which is used in the LEACH-RKP-WSN methodology. For knowing the performance of this LEACH-RKP-WSN method, it is compared with ASSMLP [20].…”

“…Where energy consumption of the WSN is represented as , is defiend as the total amount of energy, the transmitting and receiving energy is represented as and respectively. [20]. Energy consumption of the LEACH-RKP-WSN is less compared to the ASSMLP [20] method.…”

“…[20]. Energy consumption of the LEACH-RKP-WSN is less compared to the ASSMLP [20] method. Energy consumption is more when the distance among the source to the destination becomes high.…”

“…The keys at initialization, membership change and key compromise are analysed by polynomial function. This method needs less memory, even the number of [20] has presented the ASSMLP to overcome the location privacy and security protection issues. This method comprises of two different phases.…”