A communication-efficient key agreement protocol in ad hoc networks

A secure communication-efficient key agreement protocol based on the bilinear pairings in ad hoc networks is proposed. In this protocol, the dynamicity of the networks is considered and the l-hop assumption is weakened by employing hierarchical routing techniques to ensure that the logical model of key agreement consist with the actual topology of networks. As a result, the communication overhead is reduced. The analysis result shows that the proposed scheme is applicable to ad hoc networks with large size.