an efficient group key establishment in location-aided mobile ad hoc networks
Mobile Ad hoc Networks (MANETs) create additional challenges for implementing the group key establishment due to resource constraints on nodes and dynamic changes on the topology. To facilitate the deployment of group key agreements in MANETs, a range of distributed algorithms have been proposed. However, for a given level of security, these algorithms incur linearly increasing communication and computational costs. In this paper, we present two scalable maximum matching algorithms (M2) to deploy binary tree-based group key agreements in MANETs. Furthermore, the proposed technique is lightweight since it uses the Elliptic Curve Diffie-Hellman key exchange in place of the regular Diffie-Hellman and also does not require third-party's support. The performance analysis shows that our distributed M2 algorithms reduce key establishment's round number from O( n ) to O(log 2 n ) and our novel group key establishment decreases communication cost and computational overhead significantly.
maximum matching key tree group key management