Security in WSN using Polynomial Pool Based Mechanism
Chanchal G.Agrawal1, J. B. Kulkarni2
1Chanchal G. Agrawal, Computer Engineering, Pune University / Sinhgad College of Engineering, India.
2Prof. J. B. Kulkarni, Computer Engineering, Pune University/ Sinhgad college of Engineering, India.

Manuscript received on July 05, 2013. | Revised Manuscript received on July 11, 2013. | Manuscript published on July 15, 2013. | PP: 44-48 | Volume-1 Issue-8, July 2013. | Retrieval Number: H0395071813/2013©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: For efficient data accumulation, localized sensor reprogramming, and for distinguishing and revoking compromised sensor mobile sinks (MSs) are necessary in many wireless sensor network (WSN) applications, However, in sensor networks for pair wise key establishment and authentication between sensor nodes and mobile sinks exiting key predistribution schemes are used, the work of mobile sinks for data collection elevates a new security challenge: in the basic probabilistic and q-composite key pre distribution schemes, an attacker can easily obtain a large number of keys by tracing a small fraction of nodes, and hence, by deploying a replicated mobile sink preloaded with some compromised keys gain the control of overall network. A three-tier general framework describe that allow the use of any pair wise key pre distribution scheme as its basic component. This scheme requires two separate key pools, one for the mobile sink to access the network, and one for pair wise key establishment between the sensors. As compared to the polynomial pool-based scheme this security framework has higher network resilience to a mobile sink replication attack.
Keywords: Wireless Sensor Network, Random Key Predistribution, Mobile Sink, Hash, Prime, Key Distribution Center.