loading...
Complexity Analysis of Group Key Agreement Protocols for Ad Hoc Networks
Bhubaneswar, India December 18-December 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICIT.2006.399th International Conference on Infor ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Rakesh Chandra Gangwar, Indian Institute of Technology, Roorkee, Uttaranchal, India
Anil K. Sarje, Indian Institute of Technology, Roorkee, Uttaranchal, India
Secure and efficient group communication in ad hoc networks is a very challenging task. Due to resource constraints in ad hoc networks, the group key agreement protocols must be efficient in various parameters such as number of rounds, number of messages exchanged, exponential computation performed etc. This paper presents various group key agreement protocols, and compares them for their suitability for ad hoc networks.
Citation:
Rakesh Chandra Gangwar, Anil K. Sarje, "Complexity Analysis of Group Key Agreement Protocols for Ad Hoc Networks," icit, pp.98-99, 9th International Conference on Information Technology (ICIT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions