Performance Analysis of Tag Embedded Based Message Authentication Scheme

Tag-embedded has been proposed in the literature as an efficient message authentication scheme due to low spectrum, power and time resources required as compared to the conventional tag-appending schemes. This work addresses the mathematical analysis of the performance of the tag-embedded message authentication scheme, which has never been presented in the literature. The authentication fail probability, as a performance evaluation metric, has been derived in closed form expressions based on two different detection methods, namely, joint detection and successive detection. The derived formulas are validated through simulation results where exact matching is noted.