Energy and bandwidth-efficient key distribution in wireless Ad Hoc networks: A cross-layer approach

IEEE/ACM Transactions on Networking

Volumn 15, Issue 6, 2007, Pages 1527-1540

  Salido, Javier ^a   Lazos, Loukas ^b   Poovendran, Radha ^b  

^a MICROSOFT   (United States)

^b University of Washington   (United States)

Author keywords

Access control; Ad hoc; Ad hoc networks; Energy conservation; Key distribution; Key management; Multicast communication; Secure group communication; Security

Indexed keywords

ACCESS CONTROL; BANDWIDTH; CRYPTOGRAPHY; ENERGY CONSERVATION; HEURISTIC ALGORITHMS; MULTICASTING; NETWORK SECURITY;

GROUP CONTROLLER; KEY DISTRIBUTION PROBLEM; SECURE GROUP COMMUNICATION;

AD HOC NETWORKS;

EID: 37549056154     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.902696     Document Type: Article

References (27)

1. M. Çagalj, J. P. Hubaux, and C. Enz, "Minimum-energy broadcast in all-wireless networks: NP-completness and distribution issues," presented at the ACM Mobile Communications Conf., MOBICOM 2002, Atlanta, GA, 2002.
2. R. Canetti, T. Malkin, and K. Nissim, "Efficient communication-storage tradeoffs for multicast encryption," presented at the Eurocrypt'99, Prague, Czech Republic, 1999.
3. A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, "A worstcase analysis of a MST-based heuristic to construct energy-efficient broadcast subtrees in wireless networks," Univ. of Rome Tor Vergata,0 TR 010, 2001 [Online]. Available: http:// www.mat.uniroma2.it/penna/papers/stacs01-TR.ps.gz
4. J. Edmonds, "Maximum matching and a polyhedron with (0,1) vertices," J. Res. National Bureau of Standards, vol. 69B, pp. 125-130, Jun. 1965.
5. L. Eschenauer and V. Gligor, "A key management scheme for distributed sensor networks," in Proc. 9th ACM Conf. Computer and Communications Security (CCS), 2002, pp. 41-47.
6. A. Fiat and M. Naor, "Broadcast encryption," Advances in Cryptology-Crypto'93, Lecture Notes in Computer Science, vol. 773, pp. 4 80-491, 1994.
7. H. Gabow, "Data structures for weighted matching and nearest common ancestors with linking," in Proc. 1st Annu. ACM SIAM Symp. Discrete Algorithms (SODA '90), San Francisco, CA, Jan. 1990, pp. 434-443.
8. J. Goshi and R. E. Ladner, "Algorithms for dynamic multicast key distribution trees," in Proc. 22nd Annu. Symp. Principles of Distributed Computing, PODC 2003, 2003, pp. 243-251.
9. R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Communications, R. Miller and J. Thatcher, Eds. New York: Plenum Press, 1972, pp. 85-103.
10. E. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Dover, Feb. 2001.
11. L. Lazos and R. Poovendran, "Cross-layer design for energy-efficient secure multicast communications in ad hoc networks," in Proc. IEEE Int. Conf. Communications, ICC 2004, Paris, France, May 2004, pp. 3633-3639.
12. L. Lazos and R. Poovendran, "Power proximity based key management for secure multicast in ad hoc networks," ACM/Springer J. Wireless Networks (WINET), vol. 13, no. 1, pp. 127-148, Feb. 2007.
13. L. Lazos, J. Salido, and R. Poovendran, "VP3: Using vertex path and power proximity for energy efficient key distribution," in Proc. IEEE Vehicular Technology Conf., VTC 2004, Los Angeles, CA, Sep. 2004, pp. 1228-1232.
14. L. Lazos, R. Poovendran, and G. H. Cirincione, "Location-aware secure wireless multicast in ad hoc networks under heterogeneous pathloss," Seattle, WA, Univ. of Washington, Dept. Electr. Eng., Tech. Rep. Series, UWEETR-2003-0012, 2003.
15. X. Li, Y. Yang, M. Gouda, and S. Lam, "Batch re-keying approach for secure multicast," in Proc. World Wide Web 10 (WWW10), Hong Kong, May 2001.
16. M. Moyer, J. Rao, and P. Rohatgi, "Maintaining balanced key trees for secure multicast," Internet draft, draft-irtf-smug-key-tree-balance-00. txt, Jun. 1999.
17. R. Needham and M. Schroeder, "Using encryption for authentication in large networks of computers," Commun. ACM, vol. 21, no. 12, pp. 993-999, 1978.
18. R. Poovendran and J. S. Baras, "An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2824-2834, Nov. 2001.
19. S. Setia, S. Koussih, and S. Jajodia, "Kronos: A scalable group re-keying approach for secure multicast," in Proc. IEEE Security and Privacy Symp. 2000, Oakland, CA, May 2000, pp. 215-228.
20. J. Snoeyink, S. Suri, and G. Varghese, "A lower bound for multicast key distribution," in Proc. IEEE INFOCOM 2001, Apr. 2001, pp. 422-431.
21. Y. Sun, W. Trappe, and K. J. R. Liu, "A scalable multicast key management scheme for heterogeneous wireless networks," IEEE/ACM Trans. Networking, vol. 12, no. 4, pp. 653-666, Aug. 2004.
22. Y. Vardi, "Metrics useful in network tomography studies," IEEE Signal Process. Lett., vol. 11, no. 3, pp. 353-355, Mar. 2004.
23. D. M. Wallner, E. C. Harder, and R. C. Agee, "Key management for multicast: Issues and architectures," Internet Draft, Sep. 1998.
24. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "On the construction of energy efficient broadcast and multicast trees in wireless networks," in Proc. IEEE INFOCOM 2000, Mar. 2000, pp. 585-594.
25. C. K. Wong, M. Gouda, and S. Lam, "Secure group communications using key graphs," IEEE/ACM Trans. Networking, vol. 8, no. 1, pp. 16-31, Feb. 2000.
26. Y. Yang, X. Li, and S. Lam, "Reliable group rekeying: Design and performance analysis," presented at the ACM SIGCOMM, San Diego, CA, Aug. 2001.
27. X. B. Zhang, S. S. Lam, D. Y. Lee, and Y. R. Yang, "Protocol design for scalable and reliable group rekeying," IEEE/ACM Trans. Networking vol. 11, no. 6, pp. 908-921, Dec. 2003.