The wireless sensor network innovation is one of the biggest information preparing and correspondence systems frameworks which consistently produced for dispersed condition in field of ongoing application. There are such huge numbers of factor related with it`s as Data safety, working rate, cost proficiency and extra sensor organize imperatives. Principle thought is about increment the security over existing attacks without influence the execution and many-sided quality of general remote sensor organize. In this research, at first a protected correspondence key trading procedure for WSN called Grid Based Dynamic (GBSD) symmetric keying Protocol. Where in GBSD every sensor in a sensor organize shared symmetric keys to discuss safely with each other. In GBSD, demonstrates the Dynamic keying approach for sensor arranges that necessities to store shared symmetric keys to every sensor. This is near the ideal number of shared symmetric keys for any key dispersion conspire that isn`t defenseless against agreement. In this research achieves low energy consumption, secure way of data transmission, less traffic rate in data transmission.

Public Key Cryptography, Grid Based Dynamic symmetric keying protocol, Wireless Sensor Network

[1] W. Du, J. Deng, Y. S. Han, P. K. Varshney, J. Katz, and A. Khalili, “A pairwise key predistribution scheme for wireless sensor networks," ACM Transactions on Information and System Security (TISSEC), vol. 8, no. 2, pp. 228-258, 2005.
[2] O. Yagan and A. M. Makowski, “Modeling the pairwise key predistribution scheme in the presence of unreliable links," IEEE Transactions on Information Theory, vol. 59, no. 3, pp. 1740-1760, 2013.
[3] F. Yavuz, J. Zhao, O. Yagan, and V. Gligor, “On secure and reliable communications in wireless sensor networks: Towards k-connectivity under a random pairwise key predistribution scheme," in International Symposium on Information Theory (ISIT), IEEE, 2014, pp. 2381-2385.
[4] AzrinaAbd Aziz, “A survey on distributed Topology Control Techniques for Extending the Lifetime of Battery Powered Wireless Sensor network”, IEEE Communications Surveys & Tutorials, vol. 15, no. 1, pp. 1024-1039,2013.
[5] Benazir Fateh, “Joint Scheduling of Tasks and Messages for Energy Minimization in Interference-aware Real-time Sensor Networks”, IEEE Transactions On Mobile Computing, pp. 1123-1136, 2013.
[6] Chatterjea,S&Havinga, P, “A Dynamic data aggregation scheme for Wireless Sensor network,” Research on Integrated Systems and Circuits”, Veldhoven, The Netherlands, Nov. 2003.
[7] Chih-Min Chao, “Design of structure-free and energy-balanced data aggregation in Wireless Sensor network”, ELSEVIER, Journal of Network and Computer Applications vol. 37, no. 5, pp.229– 239,2014.
[8] Chi-Tsun Cheng, “A Delay-Aware Network Structure for Wireless Sensor network With In- Network Data Fusion”, IEEE Sensors Journal, vol. 13, no. 5, pp. 1234-1248,May 2013.
[9] Clausen, T&Jacquet, P, “Optimized Link State Routing Protocol (OLSR)”, http://tools.ietf.org/html/rfc3626, 2003.
[10] Considine, J, Li, F,Kollios, G & Byers, J, “Approximate aggregation techniques for sensor databases,” in Proc. IEEE Int. Conf. Data Engineering (ICDE), 2004.
[11] Cristescu, R,Beferull-Lozano,B&Vetterli, M, “On network correlated data gathering”, IEEE Computer and Communications Societies, vol. 4, pp. 2571–2582, 2004.
[12] Dantu, K &Sukhatme, G, “Connectivity vs. control: Using directional and positional cues to stabilize routing in robot networks”, International Conference on Robot Communication and Coordination (RoboComm’09). pp.1–6,2009.