The hardware design miniaturization has led to the introduction of tiny sensing devices with communication and processing capabilities embedded in the physical world or spread throughout our environment. Nowadays sensor not only has the sensing and transmission capability but also processing capability: Sensing + Processing + Transmission = Sensor, whence arises an attractive topic of deciding things that can be processed before transmission in order to reduce communication cost. In this context, the transmission of a message authentication code (MAC) as mechanism for authentication of a message which is frequently used in (WSN) is extremely significant to be considered. There are two lines of actions to this concern, viz, Pairwise MAC (PMAC) which requires adding each MAC to its corresponding message and Single XORMAC (SXMAC) in which one single XORMAC stands for a several messages. The latter leads to less authenticity of the messages but cheaper transmission cost than the former. In contrast, PMAC provides better authenticity but with expensive communication cost than SXMAC. In the middle of this spectacle, for the sake of efficiency and better tradeoff between communication cost and authentication, in this work, we find a balance between the two approaches under consideration by leaning on Reed Solomon error control code and interleaving for sending MACs so that we can reduce the transmission cost and at the same time protect the authenticity of messages as an alternative to the antithesis between SXMAC and PMAC.

[1] Lin, Shu, and Daniel J. Costello, Jr., "Error Control Coding: Fundamentals and Applications", Englewood Cliffs, N.J.: Prentice-Hall, 1983. ISBN 0-13-283796-X.
[2] McEliece, R., “The theory of information and coding”, Cambridge University Press, 2004
[3] Humphreys, J., “A course in group theory”, Oxford University Press, USA, 1996
[4] Athanassoulis, M.; Alagiannis, I. & Hadjieuthimiades, S. ,“A Multi-Criteria Message Forwarding Architecture for Wireless Sensor Networks”, the proceedings of the 10th Pan-Hellenic Conference on Informatics, Volos, Greece, 2005
[5] Raymond Hill, “A First course in coding theory”, Clarendon Press, 1986
[6]Bleichenbacher, D.; Kiayias, A. & Yung, M., “Decoding interleaved Reed-Solomon codes over noisy channels,” Theor. Comput. Sci., Elsevier Science Publishers Ltd., 2007, 379, 348-360
[7] Reed, I. & Solomon, G., “Polynomial codes over certain finite fields”, Journal of the Society for Industrial and Applied Mathematics, Society for Industrial and Applied Mathematics, 1960, 300-304
[8] Kasami, T. & Lin, S., “On the probability of undetected error for the maximum distance separable codes”,Communications, IEEE Transactions on [legacy, pre-1988], 1984, 32, 998-1006
[9] Ma, R.; Xing, L. & Michel, H. “A New Mechanism for Achieving Secure and Reliable Data Transmission in Wireless Sensor Networks”, IEEE, 2007, 6
[10] Culler, D.; Estrin, D. & Srivastava, M., “Guest editors' introduction: Overview of sensor networks” Computer, 2004, 37, 41-49
[11] Culler, D.; Hill, J.; Buonadonna, P.; Szewczyk, R. & Woo, A., “A network-centric approach to embedded software for tiny devices”, Lecture Notes in Computer Science, Springer, 2001, 2211, 114-130
[12] Fu, T.; Peng, W. & Lee, W., “Optimizing parallel itineraries for knn query processing in wireless sensor networks”, Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, 2007, 391-400
[13] Chan, H.; Perrig, A. & Song, D., “Secure hierarchical in-network aggregation in sensor networks”, Proceedings of the 13th ACM conference on Computer and communications security, 2006, 278-287
[14] Wander, A.; Gura, N.; Eberle, H.; Gupta, V. & Shantz, S., “Energy analysis of public-key cryptography for wireless sensor networks”, Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications, 2005, 324-328
[15] McEliece, R., “Finite fields for computer scientists and engineers”, Springer, 1987
[16] Hamming, R. W., “Coding and information theory”, (2nd ed.) Prentice-Hall, Inc., 1986
[17] Douligeris, C. & Serpanos, D., “Network security: current status and future directions”, Wiley-IEEE Press, 2007
[18] Kent, S.; Atkinson, R. & Header, I., “RFC 2402,IP Authentication Header”, 1998
[19] Forney Jr, G., “On decoding BCH codes”, IEEE Transactions on information theory, 1965, 11, 549-557
[20] Rivest, R. RFC1321: “The MD5 message-digest algorithm”, RFC Editor United States, RFC Editor, United States, 1992
[21] Hu, L. & Evans, D., “Secure aggregation for wireless networks, Applications and the Internet Workshops”, 2003. Proceedings. 2003 Symposium on, 2003, 384-391
[22] Bellare, M.; Guerin, R. & Rogaway, P., “XOR MACs: New methods for message authentication using finite pseudorandom functions”, Lecture Notes in Computer Science, Springer, 1995, 963, 15-28
[23] Zhu, S.; Setia, S.; Jajodia, S. & Ning, P., “An interleaved hop-by-hop authentication scheme for filtering of injected false data in sensor networks”, 2004 IEEE Symposium on Security and Privacy, 2004. Proceedings, 2004, 259-271
[24] Chien, R., “Cyclic decoding procedures for Bose – Chaudhuri - Hocquenghem codes”, IEEE Transactions on Information Theory, 1964, 10, 357-363
[25] Ma, R.; Xing, L.; Michel, H. & Dartmouth, M., “Fault-Intrusion Tolerant Techniques in Wireless Sensor Networks,” 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing, 2006, 85-94
[26] Hill, J.; Szewczyk, R.; Woo, A.; Hollar, S.; Culler, D. & Pister, K., “System architecture directions for networked sensors,” ACM Sigplan Notices, ACM New York, NY, USA, 2000, 35, 93-104
[27] Erik-Oliver Blass, Jens Horneber, Martina Zitterbart, “Analyzing Data Prediction in Wireless Sensor Networks”, Proceedings of IEEE 67th VTC Spring Conference, pages 86—87, Marina Bay, Singapore, May 2008. (ISBN 978-1-4244-1645-5)
[28] Calle, M. & Kabara, J., “Measuring energy consumption in wireless sensor networks using gsp”, 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications, 2006, 1-5
[29] Xia, F.; Tian, Y.; Li, Y. & Sun, Y., “Wireless sensor/actuator network design for mobile control applications Sensors”, vol. 7, no. 10, pp. 2157-2173, 2007, 2008
[30] Wolfram Math World, [Online]. Available:
http://mathworld.wolfram.com/PrimitivePolynomial.html
[31] Sloane, N. J. A. Sequence A011260/M0107 in "The On-Line Encyclopedia of Integer Sequences.". Available:
http://www.research.att.com/~njas/sequences/A011260
[32] Kiri, Y.; Sugano, M. & Murata, M., “Performance Evaluation of Intercluster Multi-hop Communication Large-Scale Sensor Networks”, Computer and Information Technology, 2006. CIT'06. The Sixth IEEE International Conference on, 2006, 215-215
[33] Liu, Y. & Boncelet, C. “The BCH-NTMAC for Noisy Message Authentication”, Information Sciences and Systems, 2006 40th Annual Conference on, 2006, 246-251