In this paper we discuss algorithms that allow the
concealed data aggregation (CDA) in wireless sensor networks.
We describe and evaluate three algorithms that were reported to
suit to the WSN scenario. As result of the evaluation, where we
emphasize the awareness to potential attack scenarios, we present
a brief overview of strengths and weaknesses of the algorithms.
Since no algorithm provides all desirable goals, we propose two
approaches to cope with the problems. The first is the successive
combination of two algorithms. It increases security, while the
additional efforts can be minimized by carefully selected
parameters. For the second approach we face specific weaknesses
and engineer mechanisms that solve the particular issues. With
the considered homomorphic message authentication code and a
discussion of the id-issue we exemplary evaluate the two biggest
issues of the very promising CMT algorithm.
Published In : IJCAT Journal Volume 1, Issue 9
Date of Publication : 31 October 2014
Pages : 473 - 479
Figures :04/p>
Tables : 01
Publication Link : A New Approach of Data Aggregation in Wireless
Sensor Networks
[1] S. Lindsey and C. Raghavendra, “PEGASIS:
Powerefficient gathering in sensor information
systems,” in 2010 IEEE International Conference on
Computational Intelligence and Computing Research
Proceedings of IEEE AerospaceConference, vol. 3,
Mar. 2002, pp. 1125–1130.
[2] M. Lee, and S. Lee, “Data Dissemination for Wireless
Sensor Networks”, in Proceedings of the 10 th IEEE
International Symposium on Object and Component-
Oriented Real-Time Distributed Computing
(ISORC’07).
[3] C. Intanagonwiwat, R. Govindan, D. Estrin, J.
Heidemann, and F. Silva, “Directed Diffusion for
Wireless Sensor Networking”, IEEE/ACM
Transactions on Networking, Vol. 11, no. 1, Feb 2003.
[4] H. Cam, S. Ozdemir, P. Nair, and D.Muthuavina
shiappan, “ESPDA: Energy-Efficient and Secure
Pattern-based Data Aggregation for Wireless Sensor
Networks”, in Proceedings of IEEE Sensor- The
Second IEEE Conference on Sensors, Toronto, Canada,
Oct. 22-24, 2003, pp. 732-736.
[5] Chalermek Intanagonwiwat, Ramesh Govindan, and
Deborah Estrin, “Directed diffusion: a scalable and
robust communication paradigm for sensor networks”,
(MobiCom 2000) pp 56-67. [6] K. Dasgupta, K. Kalpakis, and P. Namjoshi, “An
Efficient Clustering-based Heuristic for Data Gathering
and Aggregation in Sensor Networks”, IEEE 2003.
[7] E. Fasolo, M. Rossi, J. Widmer, and M. Zorzi, “In-
Network Aggregation Techniques for Wireless Sensor
Networks: A Survey”, IEEE Wireless communication
2007.
[8] M. Lee and V.W.S. Wong, “An Energy-aware
Spanning Tree Algorithm for Data Aggregation in
Wireless Sensor Networks,” IEEE PacRrim 2005,
Victoria, BC, Canada, Aug. 2005.
[9] M. Ding, X. Cheng, and G. Xue, “Aggregation tree
construction in sensor networks,” in Proc. of IEEE
VTC’03, Vol. 4, Orlando, FL, Oct. 2003.
[10] “The Design Space of Wireless Sensor Networks” by
Kay R¨omer and Friedemann Mattern
[11] http://en.wikipedia.org/wiki/Wireless_Sensor_Network
[12] Wendi B. Heinzelman, Anantha Chandrakasan, and
Hari Balakrishnan, “Energy Efficient Communication
Protocol for Wireless Microsensor Networks”, (33rd Hawaii International Conference on System Sciences,
2000).
[13] S. Nath et al., “Synopsis Diffusion for Robust
Aggregation in Sensor Networks,” ACM SenSys
2004, Baltimore, MD, Nov. 2004.