1st International ICST Conference on Scalable Information Systems

Research Article

A scalable key management and clustering scheme for ad hoc networks

  • @INPROCEEDINGS{10.1145/1146847.1146875,
        author={Jason H.  Li  and Renato Levy and Miao  Yu and Bobby  Bhattacharjee},
        title={A scalable key management and clustering scheme for ad hoc networks},
        proceedings={1st International ICST Conference on Scalable Information Systems},
        publisher={ACM},
        proceedings_a={INFOSCALE},
        year={2006},
        month={6},
        keywords={},
        doi={10.1145/1146847.1146875}
    }
    
  • Jason H. Li
    Renato Levy
    Miao Yu
    Bobby Bhattacharjee
    Year: 2006
    A scalable key management and clustering scheme for ad hoc networks
    INFOSCALE
    ACM
    DOI: 10.1145/1146847.1146875
Jason H. Li 1,*, Renato Levy1,*, Miao Yu2,3,*, Bobby Bhattacharjee2,3,*
  • 1: Intelligent Automation, Inc., 15400 Calhoun Drive, Ste 400, Rockville, MD, 20855, USA
  • 2: Department of Mechanical Engineering, Department of Computer Science
  • 3: College Park, MD, 20742, USA
*Contact email: jli@i-a-i.com, rlevy@i-a-i.com, mmyu@glue.umd.edu, bobby@cs.umd.edu

Abstract

This paper describes a scalable key management and clustering scheme for secure group communications in ad hoc and sensor networks. The scalability problem is solved by partitioning the communicating devices into subgroups, with a leader in each subgroup, and further organizing the subgroups into hierarchies. Each level of the hierarchy is called a tier or layer. Key generation, distribution, and actual data transmissions follow the hierarchy. The Distributed, Efficient Clustering Approach (DECA) provides robust clustering to form subgroups, and analytical and simulation results demonstrate that DECA is energy-efficient and resilient against node mobility. Comparing with most other schemes, our approach is extremely scalable and efficient, provides more security guarantees, and is selective, adaptive and robust.