International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169 Volume: 2 Issue: 8 2303 – 2305 _______________________________________________________________________________________________ 2303 IJRITCC | August 2014, Available @ http://www.ijritcc.org _______________________________________________________________________________________ Secretive Data Transactions Using Quantum Key in Wireless Networks Mr.S.Vijayanand Department of Computer Science and Engineering Shree Venkateshwara Hi Tech Engineering College, Gobi, Tamilnadu, India. anand.vijay87@gmail.com Dr.T.Senthilprakash Department of Computer Science and Engineering Shree Venkateshwara Hi Tech Engineering Collge, Gobi, Tamilnadu, India. jtyesp@yahoo.co.in Abstract-- Currently uses of wireless devices are increased rapidly. In real time environment, secret communication between two wireless devices plays a major role. Generally in wireless network evaluation of private key extraction, involves to extract d bits having very low entropy in Received Signal Strength (RSS). But it is not suitable for moving devices. In an existing system use an adaptive secret key generation scheme for providing a secret communication between two wireless devices. The security of this scheme mainly follows reciprocity principle. It state that the process of identifying the channel fluctuation using adaptive lossy quantizer concurrent with Cascade-based information reconciliation and privacy amplification. In the proposed system, the Delay-bounded sink mobility problem of WSNs used to avoid the delay of data delivery. WSNs are arranged to monitor the adjacent environment and the data generation rate of sensors can be estimated accurately.to avoid the delay of data delivery. WSNs are arranged to monitor the adjacent environment and the data generation rate of sensors can be estimated accurately. The benefits of involving a mobile sink and the impact of network parameters are increased. Mainly the number of sensors used is reduced.. Keywords- adaptive lossy quantizer, quantization, Single Photon Quantum Key, iterative distillation __________________________________________________*****_________________________________________________ I. INTRODUCTION Wireless Sensor Network is a bridge between the real physical and virtual worlds. It consists of a group of dedicated sensors for monitoring and recording the physical conditions of the environment and organizing the collected data at a central location. Nowadays networks are bi-directional, also enabling control of sensor activity. The WSN is made up of nodes – from a few to many hundreds where each node is connected to one or many sensors. Each sensor node consisting of several parts like radio transceiver with internal antenna, a micro controller, an electronic circuit which is used for interfacing with sensors and an energy source it may be a battery. The sensor node size is varying from size to size. Depending on the size of sensor node the cost can be changed. The main characteristics of WSN consisting of 1. Power consumption 2. Capability to handle with node failure 3. Mobility of nodes 4. Dynamic network topology 5. Communication failures 6. Heterogeneity of nodes II. LITERATURE SURVEY A. Efficient Scheduling for the Mobile Sink in Wireless Sensor Networks with Delay Constraint Here introduced a new technique polynomial time optimal algorithm for identifying mobile sink mobility. Here mobile sink can be classified into two ways. Random mobility was easy to implement but it produces low performance. Whereas controlled mobility increased network life time and increases the performance. For this introduced a new algorithm to increase the performance by using single and multi-sinks. It is used to improve the efficiency by considering multi hop routing, sink mobility and delay bound. To design a new path for routing DeSM problem used. The problem mainly concentrates on gathering sensed data by traveling around the network. In this delay of data defined by spending time for moving one sink to other sink. This model increased energy by providing necessary network parameters like sensors, delay bound. B. Secure Data Aggregation in Wireless Sensor Networks In this paper proposed a large sensor network data aggregation used to reduce the utilizing energy in a communication. Synopsis diffusion is a multipath routing schemes which is used to accurately compute aggregates. It provides a high security among vast attacks. The used algorithm verifying the received information is correct or not. The sub aggregate value cannot predict by an aggregation framework. In a base station uses aggregation hierarchy used to find out large errors. III. PROPOSED ALGORITHM A. Delay-bounded sink mobility problem In the proposed system, the Delay-bounded sink mobility problem of WSNs used to avoid the delay of data delivery. WSNs are arranged to monitor the adjacent environment and the data generation rate of sensors can be estimated accurately. To constrain the mobile sink to a set of sink sites. First,