In order to protect the data from the intruders powerful encryption algorithms with multiple keys has been used over the recent years. Once the encryption process has been done then there is a need to transmit it over the channel. The secured model has been examined on the basis of its design, mode of transmission of data and number of nodes. With increase in number of nodes, key length, number of keys and data length the model consume more power and takes more time to generate keys from the available data. Therefore in this paper a new approach has been proposed in which keys are generated, processed and distributed in the model by the help of S- Boxes in order to reduce the processing time. MATLAB 7.3 has been used to determine the processing and failure rate of various keys in multinode network.

1. G. McGraw 2006, Software Security: Building Security In. Addison Wesley.
2. R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu 2004, “Order-Preserving Encryption for Numeric Data,” Proc. 2004 ACM Sigmod Conference.
3. Ruth M. Davis 1997, “The Data Encryption Standard” Proceedings of Conference on Computer Security and the Data Encryption Standard, National Bureau of Standards, Gaithersburg, MD, Feb. 15, NBS Special Publication 500-27, pp 5-9.
4. W. Stallings 1999, “Cryptography and Network Security: principles and practices, prentice Hall, 2nd edition.
5. Subbarao V. Wunnava 2002, “Data Encryption Performance and Evaluation Schemes” Proceedings IEEE Southeastcon, pp 234-238.
6. L. Eschenauer and V.D.Gligor 2002, “A key management scheme for distributed sensor networks” Proceedings of 9th ACM conference on computer and communications security, pp. 41-47
7. Donggang Liu and Peng Ning 2003, “Establishing pair wise keys in Distributed Networks,” CCS,s 03, USA, ACM, October 27-31.
8. C. Karlof and D. Wagner 2003, “Secure routing in wireless sensor networks: attacks and countermeasures, 1st IEEE international workshop on sensor network protocols and applications.
9. Xun Yi 2004, “Identity-Based Fault-Tolerant Conference Key Agreement”, IEEE Transactions on Dependable and Secure Computing, Vol. 1, No. 3, pp 170-178
10. Jong Tae Park, Jae Wook Nah, and Wee Hyuk Lee, 2008 “Dynamic Path Management with Resilience Constraints under Multiple Link Failures in MPLS/GMPLS Networks” IEEE Transactions on Dependable and Secure Computing, Vol. 5, No. 3, pp. 143-154.
11. Fischlin, M. (2001) “A cost-effective pay-per-multiplication comparison method for millionaires”, CT-RSA’01, Volume 2020 of Lecture Notes in Computer Science, Springer, pp.457–472.
12. G. Ciardo, R.M. Marmorstein, and R. Siminiceanu (2003), “Saturation Unbound”, Proceedings of International on Tools and Algorithms for the Construction and Analysis of Systems, pp. 379-393.
13. H. Chan, A. Perrig, and D. Song (May, 2003), “Random Key Pre distribution Schemes for Sensor Networks,” Proceedings of IEEE Symposium on Security and Privacy (S & P ’03), pp. 197-213.
14. J. Muppala, M. Malhotra, and K. Trivedi (1994), “Stiffness-Tolerant Methods for Transient Analysis of Stiff Markov Chains,” Microelectronics and Reliability, Vol. 34, No.11, pp. 1825-1841.
15. Jian Ren, and Lein Harn, (July 2008), “Generalized Ring Signatures”, IEEE Transactions on Dependable and Secure Computing, Vol. 5, No. 3, pp153-164.
16. S. Pradheepkumar, R. Fareedha, M. Jenieferkavetha, A. geanremona and R . Juliajoyce 2010,” A Secured Grid Based Route Driven PKC Scheme for Heterogeneous Sensor Network” International Journal of Grid Computing & Applications (IJGCA) Vol.1, No.2, December 2010
17. Lepakshi Goud. T 2011, “A Routing-Driven Public key Crypto system based key management scheme for a Sensor Network”, International Journal of Advanced Engineering Sciences and Technologies, Vol. No. 6, Issue No. 2, 246 - 255.

Shared segment protection mode Multinode Network