An Efficient Authenticated Key Agreement with Location Privacy in Wireless Sensor Network

Abstract

newline The common problem in Wireless Sensor Network (WSN) is the source, sink node location newlineprivacy, message authentication, and key agreement. The authentication is progressed here newlineto avoid the corruption that occurs by any uncertainty. This scheme includes public key, and newlinesymmetric key cryptography. This can establish the following things, namely, availability, newlinescalability, computational complexity, communication overhead and prevent from various newlineattacks. Those needs are satisfied with the scheme of Source Anonymous Message newlineAuthentication (SAMA), and the security is by Elliptic Curve Cryptography. Here the source newlinelocation privacy is a necessary thing to protect the source location from the adversary nodes, newlineand same way the sink location is protected from the adversary node, which tries to degrade newlinethe sensor network. In particular, while conveying the data from source to destination, the newlinesafeguard must be required to the base station in order to protect the message. The security newlinethreat concurrences, as well as location privacy can be overcome through the Euclidean newlineZigzag Bidirectional Tree (EZBT) algorithm. It deals with location privacy issues in sensor newlinesystems and demonstrates high throughput required for accomplishing security protection. newlineHere we introduce a new method namely Adequate Sparse Secure Minkowski distance newlinebased Location Privacy (ASSMLP). These approaches have two stages, one is for the newlinelocation privacy, and another one is security. The privacy established by technique is Fake newlineSource Fake Sink (FSFS). Modified Pillar K means algorithm used to retrieve the false newlinenodes. The next approach of sparse matrix is used here to analyse the security, over which newlinethe confidentiality of the message has been insecure. Owing to the limitation of insecure transmission, the lightweight key agreement protocols are developed. The sensed data have been carried out by gateway node. The privacy is maintained through the cryptographic techniques. The light weight cryptographic algorithm is used for key agreement process, and the rekeying is processed by Diffie-Hellman cryptographic algorithm. These all are included in key generation phase, after that, the routing is carried out by Social Spider Optimization (SSO) algorithm. Finally, the simulation results are carried out under the MATLAB R2014a platform. The performance of throughput, latency, energy, communication overhead, computational complexity, packet and delivery ratio of each proposed one is to be compared with the existing techniques to show the effectiveness of the proposed methodology. newline