Communication in Vibrant Peer Groups For Cluster Key Management

  ijett-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
© 2013 by IJETT Journal
Volume-4 Issue-5                       
Year of Publication : 2013
Authors : Hemanth Siramdasu , Hari Krishna


Hemanth Siramdasu , Hari Krishna. "Communication in Vibrant Peer Groups For Cluster Key Management". International Journal of Engineering Trends and Technology (IJETT). V4(5):1367-1373 May 2013. ISSN:2231-5381. published by seventh sense research group.


In this paper we present an efficient way of group communication using key trees. group member can be formed as a tree structure and it is divided into global cluster and local clusters and group communication can be done in 3 different ways as follows 1) intra cluster communication 2) inter cluster communication 3) global commun ication. We also provide authenticated group key management in all above 3 cases of group communications. And we are going to reduce the n umber of rekeying operations and the numbers of group key distributions operations in the case of inter cluster communication and intra cluster communication and proving the flexible communication among the group members. Our approach is by insight that when a Diffie - Hellman public key is updated, in a cluster based method it suffices to update one cluster to other cluster which are going to be communicate based on type of communication. More over TA guaranteeing key authentication, enhancing the fault to lerance and protecting our protocol from all types of attacks. And we are going to proposing to reduce the communication overhead and increasing the performance.


[1] H. M. N. D. Bandara and A. P. Jayasuman a, "Collaborative applications over peer - to - peer systems - Challenges and solutions," Peer - to - Peer Networking and Applications, Springer, 2012
[2] Chi - Jyh Guo, Yuh - Ming Huang , " Residency based Distributed Collaboration key Agreement for Dynamic Peer Groups" Int ernational Journal of Innovative Computing Information & Control, vol.8,No.8,Aug.2012.
[3] Sandro Rafeali, David Hutchison , “ A survey of key management for secure group communication " ACM Computing Surveys, vol.35, iss3,Sep.200 3 .
[4] Lee, P.P.C, " Distributed coll aborative key agreement and authentication protocols for dynamic peer Group " IEEE Transactions on Networking, vol.14,iss.6,April2012.
[5] P. Lee, A. P. Jayasumana, H. M. N. D. Bandara, SLim, and V. Chandrasekar, “A peer - to - peer collaboration framework for mult i - sensor data fusion,” J. of Network and Computer Applications, vol. 35, no. 3, May 2012, pp. 1052 – 1066 .
[6] Zhou, L., C.V.Ravishankar : " Efficient, authenticated, and fault - tolerant key agreement for dynamic peer groups. Technical Report " 88, Dept. of Computer Science and Engineering, University of California, Riverside (2003)
[7] Hanaa Torkey , Gamal Atiya, “ Modified Fast Recovery Algorithm for Performance Enhancement of TCP - NewReno ” IJCA vo l .40,iss.12, Feb 2012. .
[8] M. S. Artigas and B. Herrera, “ SocialHelpers: Introducing social trust to ameliorate churn in P2P reputation systems,” In Proc. IEEE Int. Conf. on Peer - to - Peer Computing " , Aug. - Sep. 2011, pp. 328 – 337.
[9] H. M. N. D. Bandara and A. P. Jayasumana, “ Evaluation of P2P resource discovery archi tectures using real - life multi - attribute resource and query characteristics, ” In Proc. IEEE Consumer Communications and Networking Conf. (CCNC ‘12), Jan. 2012.
[10] P. Ganesan, B. Yang, and H. Garcia - Molina, “One torus to rule them all: Multi - dimensional querie s in P2P systems ,” In Proc. 7th Int. Workshop on Web and Databases (WebDB ‘04), June 2004

Intra cluster communication & Inter cluster communication , AFTD protocol.