An energy-efficient random verification protocol for the detection of node clone attacks in wireless sensor networks

EURASIP Journal on Wireless Communications and Networking

Table 1 Comparisons of average communication overhead and memory overhead

	Communication overhead	Memory overhead
Randomized multicast (RM)	O(n²)	$O (\sqrt{n})$
Line-selected multicast (LSM)	$O (g \times p_{f} \times d \times \sqrt{n})$	$O (g \times p_{f} \times d \times \sqrt{n})$
RMC	$O (\frac{\sqrt{n} \times \sqrt{m}}{2})$	$O (\sqrt{n})$
P-MPC	$O (r \times \sqrt{n}) + O (s)$	o(w)