Modeling key agreement in multi-hop ad hoc networks

IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference

Volumn 2006, Issue , 2006, Pages 39-44

  Di Crescenzo, Giovanni ^a   Striki, Maria ^b   Baras, John S ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Approximation algorithms; Efficiency; Group key agreement; Optimization; Performance evaluation; Topology driven protocols

Indexed keywords

GROUP KEY AGREEMENT; MULTI HOP AD HOC NETWORKS; PERFORMANCE EVALUATION; TOPOLOGY DRIVEN PROTOCOLS; ANALYTICAL RESULTS; KEY AGREEMENT; KEY AGREEMENT PROTOCOL; LOGICAL NETWORK; MULTI-HOP AD HOC NETWORK; MULTICAST COMMUNICATION; MULTIHOP; NATURAL EXTENSION; NETWORK NODE; NON-TRIVIAL; PASSIVE ADVERSARY; PHYSICAL NETWORK; PROCESSING COSTS; RESEARCH DIRECTIONS; RESOURCE-CONSTRAINED; ROUTING STRUCTURES; WIRED NETWORKS; WIRELESS NETWORKING;

APPROXIMATION ALGORITHMS; NETWORK PROTOCOLS; OPTIMIZATION; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; TOPOLOGY; USER INTERFACES; COMPUTER SCIENCE; FLUORINE CONTAINING POLYMERS; MILITARY APPLICATIONS; NETWORK SECURITY; SENSOR NETWORKS; SIMULATORS; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC NETWORKS;

EID: 34247342260     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143549.1143559     Document Type: Conference Paper

References (13)

1. d ACM Conf. on Computer & Communication Security, ACM Press, 1996, 31-37.
2. W.Diffie, M.Hellman, New directions in cryptography, IEEE Transactions on Information Theory, 22 (1976), 644-654.
3. M. Burmester, Y. Desmedt. A Secure and Efficient Conference Key Distribution System. Advances in Cryptology-EUROCRYPT '94, Lecture Notes in Computer Science. Springer-Verlag, Berlin Germany, 1994.
4. I. Ingemarsson, D. Tang, C. Wong. A Conference Key Distribution System. IEEE Transactions on Information Theory, 28(5):714-720, Sept. 1982
5. F.T. Leighton. Introduction to Parallel Algorithms and Architectures, Morgan Kauffman, 1992
6. th, ACM Symp., on Principles of Distributed Computing, May 1999, 229-237
7. th annual ACM SIGOPS symp. on Principles of Distributed Computing, Portland, OR, 16-19 July 2000.
8. R. Gallager, P. Humblet, P. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems (TOPLAS), 5(1): 66-77, January 1983
9. C. Cheng, I. Cimet, S. Kumar. A protocol to maintain a minimum spanning tree in a dynamic topology. In symp. Procs' on Communication architectures and protocols, 330-337, ACM Press, 1988
10. A. Mooij, W. Wesselink. A formal analysis of a dynamic distributed spanning tree algorithm. Computer Science TR OS16, Technische Universiteit Eindhoven, Dec. 2003
11. S. Dolev, A. Israeli, S. Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3-16,1993.
12. L. Blin, F. Butelle. The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs. Int'l Parallel and Distributed Processing Symposium (IPDPS'03), p. 161a.
13. F. Gärtner, A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms, EPFL Technical Report, 2003.