Skip to main content

Table 3 Computational costs.

From: Efficient Key Agreements in Dynamic Multicast Height Balanced Tree for Secure Multicast Communications in Ad Hoc Networks

 

Key operations

Node operations

Communication

nodes height Level

Group key reconstruction

Exponentiations

Node traversal

Node joining/delete

The number of nodes

Rounds

Msgs sent per node

Total Msgs

DMHBGKA

Node joining

0

Average = 

Joining  =  O(log )

1

 

Node leaving

0

Average = 

Delete = O (log )

1

GDH

Node joining

1

Joining = O (1)

2

1

 

Node leaving

1

Delete = O(1)

1

1

TGDH

Node joining

6 to

i

Joining = O(log )

2

3

 

Node leaving

3 to

i

Delete = O(log )

1

1