1st International ICST Conference on Scalable Information Systems

Research Article

Pairwise key establishment for large-scale sensor networks: from identifier-based to location-based

  • @INPROCEEDINGS{10.1145/1146847.1146874,
        author={Chanjun Yang and Jianming Zhou and Wensheng  Zhang and Johnny Wong},
        title={Pairwise key establishment for large-scale sensor networks: from identifier-based to location-based},
        proceedings={1st International ICST Conference on Scalable Information Systems},
        publisher={ACM},
        proceedings_a={INFOSCALE},
        year={2006},
        month={6},
        keywords={},
        doi={10.1145/1146847.1146874}
    }
    
  • Chanjun Yang
    Jianming Zhou
    Wensheng Zhang
    Johnny Wong
    Year: 2006
    Pairwise key establishment for large-scale sensor networks: from identifier-based to location-based
    INFOSCALE
    ACM
    DOI: 10.1145/1146847.1146874
Chanjun Yang1,*, Jianming Zhou1,*, Wensheng Zhang1,*, Johnny Wong1,*
  • 1: Department of Computer Science, Iowa State University
*Contact email: cjyang@cs.iastate.edu, jmzhou@cs.iastate.edu, wzhang@cs.iastate.edu, wong@cs.iastate.edu

Abstract

Letting two communicating parties share a key is an effective approach to achieve confidentiality and authenticity for their communications. If the parties know each other's id or are within each other's communication range, such a key can be set up using existing pairwise key establishment schemes. However, in sensor networks, there exist some communication patterns in which the sender only knows some attribute such as the rough location of its desired receiver, and the sender and receivers could be far apart. Directly extending the existing schemes to establish a pairwise key for such communicating parties is not efficient due to various reasons. To address the problem, we propose in this paper a new scheme that enables the two parties to securely communicate as long as they know each other's rough location. In this scheme, any two groups of nodes can set up a group-to-group (G2G) pairwise key based on their rough locations. Then the G2G key can be used to protect the communications between any two nodes in these groups. Extensive analysis and simulations are conducted to evaluate our approach. The results show that, by choosing the system parameters appropriately, a desired security level can be achieved without incurring high overhead.