Open Access   Article Go Back

A Lightweight and Reliable Routing Approach for in-Network Aggregation in Wireless Sensor Networks

G.Vinitha 1 , K. Bhuvaneshwari2

  1. Department of Computer Science, ARJ College of Engineering and Technology, Mannargudi, India.
  2. Department of Computer Science, ARJ College of Engineering and Technology, Mannargudi, India.

Correspondence should be addressed to: vinithacsebe@gmail.com.

Section:Review Paper, Product Type: Journal Paper
Volume-5 , Issue-6 , Page no. 284-287, Jun-2017

Online published on Jun 30, 2017

Copyright © G.Vinitha, K. Bhuvaneshwari . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: G.Vinitha, K. Bhuvaneshwari, “A Lightweight and Reliable Routing Approach for in-Network Aggregation in Wireless Sensor Networks,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.6, pp.284-287, 2017.

MLA Style Citation: G.Vinitha, K. Bhuvaneshwari "A Lightweight and Reliable Routing Approach for in-Network Aggregation in Wireless Sensor Networks." International Journal of Computer Sciences and Engineering 5.6 (2017): 284-287.

APA Style Citation: G.Vinitha, K. Bhuvaneshwari, (2017). A Lightweight and Reliable Routing Approach for in-Network Aggregation in Wireless Sensor Networks. International Journal of Computer Sciences and Engineering, 5(6), 284-287.

BibTex Style Citation:
@article{Bhuvaneshwari_2017,
author = {G.Vinitha, K. Bhuvaneshwari},
title = {A Lightweight and Reliable Routing Approach for in-Network Aggregation in Wireless Sensor Networks},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {6 2017},
volume = {5},
Issue = {6},
month = {6},
year = {2017},
issn = {2347-2693},
pages = {284-287},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1341},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1341
TI - A Lightweight and Reliable Routing Approach for in-Network Aggregation in Wireless Sensor Networks
T2 - International Journal of Computer Sciences and Engineering
AU - G.Vinitha, K. Bhuvaneshwari
PY - 2017
DA - 2017/06/30
PB - IJCSE, Indore, INDIA
SP - 284-287
IS - 6
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
368 393 downloads 586 downloads
  
  
           

Abstract

A focal issue in sensor network security is that sensors are defenseless to physical catch attacks. Once a sensor is traded off, the foe can without much of a stretch dispatch clone attacks by reproducing the bargained node, dispersing the clones all through the network, and beginning an assortment of insider attacks. Past conflicts with clone attacks experience the ill effects of either a high correspondence/stockpiling overhead or a poor discovery precision. Wireless Sensor Networks (WSNs) offer an incredible chance to screen conditions, and have a great deal of fascinating applications, some of which are very touchy in nature and require full verification secured condition. The security components utilized for wired networks can`t be specifically utilized as a part of sensor networks as there is no user-controlling of every individual node, wireless condition, and all the more significantly, rare vitality assets. In this composition, we address a portion of the extraordinary security dangers and attacks in WSNs. In our proposed work, a novel clone detection framework, called CSI to overcome the previous clone detection problems. We introduce two algorithms are CSI-1 and CSI-2.The CSI-1 (Ordinary Compressed Sensing-Based Approach) algorithm used to construct an aggregation tree. The CSI- 2 (Random Projection-Based Approach) is used to reduce the communication cost. Our proposed CSI method not only achieves lowest communication cost but also manage the network traffic evenly spread over sensor nodes. The presentation and security of CSI will be demonstrated feasibility of clone detection.

Key-Words / Index Term

WSN, Cloning Attack, Man-in-the-Middle Attack, Zero Knowledge Protocol

References

[1] T. Bonaci, P. Lee, L. Bushnell, and R. Poovendran, “A convex optimization approach for clone detection in wireless sensor networks,” Pervasive Mobile Comput., vol. 9, no. 4, pp. 528–545, 2012.
[2] C. T. Chou, A. Ignjatovic, and W. Hu, “Efficient computation of robust average of compressive sensing data in wireless sensor networks in the presence of sensor faults,” in Parallel Distrib. Syst., vol. 24, no. 8, pp. 1525–1534, Aug. 2013.
[3] K. Cho, M. Jo, T. Kwon, H.-H. Chen, and D. H. Lee, “Classification and experimental analysis for clone detection approaches in wireless sensor networks,” in IEEE Syst. vol. 7, no. 1, pp. 26–35, Mar. 2013.
[4] M. Conti, R. Di Pietro, L. V. Mancini, and A. Mei, “Distributed detection of clone attacks in wireless sensor networks,” IEEE Trans. Dependable Secure Comput., vol. 8, no. 5, pp. 685–698, Sep./Oct. 2011.
[5] H. Chen, A. Perrig, and D. Song, “Random key predistribution schemes for sensor networks,” in Proc. IEEE Symp. Sec. Privacy, 2003, pp. 197– 213.
[6] E. J. Candès, J. K. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489–509, Feb. 2006.
[7] Compressive Sensing Resources [Online]. Available: http://dsp.rice.edu/ cs
[8] H. Choi, S. Zhu, and T. F. La Porta, “SET: Detecting node clones in sensor networks,” in Proc. Int. Conf. Sec. Privacy Commun. Netw. (Securecomm), 2007, pp. 341–350.
[9] Y.-C. Hu, A. Perrig, and D. Johnson, “Packet leashes: A defense against wormhole attacks in wireless networks,” in Proc. IEEE Int. Conf. Comput. Commun. (INFOCOM), 2003, pp. 1976–1986.
[10] C.M.Yu, C.S.Lu, and S.Y.Kuo, “CSI: Compressed sensing-based clone identification in sensor networks,” in Proc. IEEE Int. Workshop Sensor Netw. Syst. Pervasive Comput. (PerSeNS), 2012, pp. 290–295.
[11] C.M.Yu, Y.T.Tsou, C.S Lu, and S.Y.Kuo, “Localized algorithms for detection of node replication attacks in mobile sensor networks,” IEEE Trans. Inf. Forensics Sec., vol. 8, no. 5, pp. 754–768, May 2013.
[12] B.Yu et al., “Distributed data aggregation scheduling in wireless sensor networks,” in Proc. IEEE Int. Conf. Comput. Commun. (INFOCOM), 2009, pp. 2159–2167.
[13] B. Zhu, S. Setia, S. Jajodia, S. Roy, and L. Wang, “Localized multicast: Efficient and distributed replica detection in large-scale sensor networks,” IEEE Trans. Mobile Comput., vol. 9, no. 7, pp. 913–926, Jul. 2010.
[14] Y. Zeng et al., “Random-walk based approach to detect clone attacks in wireless sensor networks,” IEEE J. Sel. Areas Commun., vol 28, no. 5, pp. 677–691, Jun. 2010.
[15] M. Zhang, V.Khanapure, S.Chen, and X.Xiao, “Memory efficient protocols for detecting node replication attacks in wireless sensor networks,” in Proc. IEEE Int. Conf. Netw. Protocols (ICNP), 2009, pp. 284–293.