Energy-Aware Secure Multicast Communication In Wireless Ad-Hoc Networks

In this paper we address the problem of efficiently securing multicast communication in energy constrained wireless ad hoc networks. We show that existing scalable key distribution techniques that rely on logical hierarchies, are energy inefficient. We show that great energy savings can occur when physical location information is considered in the key distribution scheme construction. We also show that even greater energy savings occur when routing and physical layer information is exploited. We develop a location-aware key distribution scheme, with the use of an iterative clustering algorithm. We formulate an optimization problem for the key distribution tree construction and maintenance and show that any candidate optimal solution does not scale with group size. We alternatively propose a heuristic routing-aware algorithm for efficiently constructing and maintaining the key distribution tree. We further improve our algorithm by incorporating batch rekeying instead of individual rekeying after every membership change. We present simulation studies that illustrate the improvements achieved using our algorithms.

[1]  D. Ruppert The Elements of Statistical Learning: Data Mining, Inference, and Prediction , 2004 .

[2]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[3]  Srdjan Capkun,et al.  Self-Organized Public-Key Management for Mobile Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[4]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[5]  Robin Kravets,et al.  Key management for heterogeneous ad hoc wireless networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[6]  Dawn Xiaodong Song,et al.  ELK, a new protocol for efficient large-group key distribution , 2001, Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001.

[7]  Xiaozhou Li,et al.  Batch rekeying for secure group communications , 2001, WWW '01.

[8]  Alan T. Sherman,et al.  Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization , 2000 .

[9]  Sushil Jajodia,et al.  Kronos: a scalable group re-keying approach for secure multicast , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

[10]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Peter Kruus,et al.  CONSTRAINTS AND APPROACHES FOR DISTRIBUTED SENSOR NETWORK SECURITY , 2000 .

[12]  T. Aura,et al.  Robust Membership Management for Ad-hoc Groups , 2000 .

[13]  Zygmunt J. Haas,et al.  Securing ad hoc networks , 1999, IEEE Netw..

[14]  Eric J. Harder,et al.  Key Management for Multicast: Issues and Architectures , 1999, RFC.

[15]  Frank Stajano,et al.  The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks , 1999, Security Protocols Workshop.

[16]  Moni Naor,et al.  Multicast security: a taxonomy and some efficient constructions , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[17]  William J. Cook,et al.  Computing Minimum-Weight Perfect Matchings , 1999, INFORMS J. Comput..

[18]  Mohamed G. Gouda,et al.  Secure group communications using key graphs , 1998, SIGCOMM '98.

[19]  Harold N. Gabow,et al.  Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.

[20]  Harold Neil Gabow,et al.  Implementation of algorithms for maximum matching on nonbipartite graphs , 1973 .

[21]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .