Efficiency of Data Aggregation Using Anonymous Aggregator Election in Wireless Sensor Networks  
  Authors : A. Manikandan; Dr. A. Arul Lawrence Selvakumar; G. Vijayakumar


Wireless sensor and actuator networks are potentially useful building blocks for cyber-physical systems. Those systems must typically guarantee high-confidence operation, which induces strong requirements on the dependability of their building blocks, including the wireless sensor and actuator network. Dependability means resistance against both accidental failures and intentional attacks, and it should be addressed at all layers of the network architecture, including the networking protocols and the distributed services built on top of them, as well as the hardware and software architecture of the sensor and actuator nodes themselves. Within this context, in this paper, I focus on the security aspects of aggregator node election and data aggregation protocols in wireless sensor networks(WSN).


Published In : IJCAT Journal Volume 2, Issue 10

Date of Publication : October 2015

Pages : 399 - 404

Figures :03

Tables : 02

Publication Link :Efficiency of Data Aggregation Using Anonymous Aggregator Election in Wireless Sensor Networks




A. Manikandan : is working as Assistant Professor & Head, Department of Computer Science, Muthayammal Memorial College of Arts & Science, Rasipuram, Tamilnadu, India. He completed his B.Sc & M.Sc., degree from Bharathidasan University, Trichy, Tamilnadu, India in 1999. He also completed M.Phil degree from Manonmaniam Sundharanar University, Tirunelveli, Tamilnadu, India in 2003. He finished his M.Tech from Prist University, Tanjore, Tamilnadu, India in 2011. He is doing his Ph.D programme at Dravidian University, Kuppam, Andra Pradesh, India. He has more than 15 years of teaching experience.

Dr. A. Arul Lawrence Selvakumar : is working as a professor & Head, Depatment of CSE, Rajiv Gandhi Institute of Technology, Bengaluru, Karnataka, India. He published various journals & books. He is a supervisor to guide the scholars under the various universities. He has more than 20 years of teaching experience.

G. Vijayakumar : is working as a professor & Principal, Muthaymmal Polytechnic College, Rasipuram, Tamilnadu, India. He completed his M.E degree from Anna University, Chennai, Tamilnadu, India in 2008. He published various international journals & attended conferences. He has more than 15 years of teaching experience.












Vehicular Networks

In this paper, I proposed two private aggregator node election protocols for WSN that hide the elected aggregator nodes from attacker, who, therefore, cannot locate and disable them. My basic protocol provides fewer guarantees than my advanced protocol. Advanced protocol hides the identity of the elected aggregator nodes even from insider attackers, thus it handles node compromise attacks too. The aggregation protocol allows the aggregator nodes to collect sensor readings & respond to queries of the operator, respectively. In aggregation and query protocols are resistant to both external eavesdroppers and compromised nodes participating in the protocol. The communication in the advanced protocol is based on connected dominating set, which suits to WSN.










[1] N. K. Prema and Dr. A. Arul S.K, International Research Journal of Computer Science, 2393-9842, Vol 1, Issue 3, pages 63-79, 2014. [2] M. Abadi & C. Fournet. Theoretical Computer Science, 322(3):427–476, 2004. [3] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. Wireless sensor networks: a survey. Computer networks, 38(4):393–422, 2013. [4] M. Aoki & H. Fujii. Technical issues on vehicle control application. Communications Magazine, IEEE, 34(10):90–93, 2011. [5] A.R. Beresford & F. Stajano. Mix zones: User privacy in locationaware services. Pervasive Computing & Communications Workshops. Proceedings of the 2nd IEEE Annual Conference on, pages 127–131. IEEE, 2014. [6] Z. Berki. Development of Traffic Models on the basis of Passanger Demand Surveys Thesis of the PhD dissertation. PhD thesis, Budapest University of Technology and Economics, 2014. [7] M. Beye & T. Veugen. Cryptology ePrint Archive, Report 2011/395, 2013. [8] M. Beye and T. Veugen. Anonymity for key-trees with adaptive adversaries. Security and Privacy in Communication Networks, pages 409–425, 2013. [9] Jan Camenisch and Markus Stadler. Proof systems for general statements about discrete logarithms. Technical report, Department of Computer Science, ETH Z¨urich, 2010. [10] B. Carbunar & Y. Yu, L. Shi, Query privacy in wireless sensor networks. In Sensor, Mesh & Ad Hoc Communications and Networks, SECON’07. 4th Annual IEEE Communications Society Conference on, pages 203–212. IEEE,2012. [11] H. Chan & A. Perrig. Security & privacy in sensor networks. Computer, 36(10):103–105, 2013. [12] H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor networks. In IEEE Symposium on Security and Privacy, pages 197–215. IEEE Computer Society, 2013.