CFP last date
20 June 2024
Reseach Article

HEF Clustering for Secure and Efficient Data Transmission in CWSN

by Kesia Salimon, R.lavanya, B.mathivanan
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 116 - Number 4
Year of Publication: 2015
Authors: Kesia Salimon, R.lavanya, B.mathivanan
10.5120/20323-2416

Kesia Salimon, R.lavanya, B.mathivanan . HEF Clustering for Secure and Efficient Data Transmission in CWSN. International Journal of Computer Applications. 116, 4 ( April 2015), 16-23. DOI=10.5120/20323-2416

@article{ 10.5120/20323-2416,
author = { Kesia Salimon, R.lavanya, B.mathivanan },
title = { HEF Clustering for Secure and Efficient Data Transmission in CWSN },
journal = { International Journal of Computer Applications },
issue_date = { April 2015 },
volume = { 116 },
number = { 4 },
month = { April },
year = { 2015 },
issn = { 0975-8887 },
pages = { 16-23 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume116/number4/20323-2416/ },
doi = { 10.5120/20323-2416 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:56:07.244880+05:30
%A Kesia Salimon
%A R.lavanya
%A B.mathivanan
%T HEF Clustering for Secure and Efficient Data Transmission in CWSN
%J International Journal of Computer Applications
%@ 0975-8887
%V 116
%N 4
%P 16-23
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Among the modern wireless networks, wireless sensor network plays a prominent role. Bunch reduces the general energy consumption. In this paper HEF (High Energy First) bunch protocol is employed. This protocol provides improved network time period since the energy level of the nodes are considered while choosing the cluster head. The cluster area is fashioned dynamically and sporadically. The cluster heads are usually having more resources (generally energy) on comparison with other nodes in the cluster. We tend to propose a globally trust management theme that enhance security in WSNs. In this trust management scheme, trust model takes 2 methodologies, trust from direct observation methodology and trust from indirect observation method. In direct observation methodology observer node gets trust value by exploiting theorem reasoning. On the other hand, with indirect observation trust value is obtained from neighbor nodes of the observer node. The trust value for this methodology is based on Dempster-Shafer theory. Combining these 2 trust models, we tend to get a lot of correct trust values that results the effectiveness of our methodology.

References
  1. T. Hara, V. I. Zadorozhny, and E. Buchmann,2010 Wireless Sensor Network Technologies for the Information Explosion Era, Studies in Computational Intelligence. vol. 278. Springer-Verlag.
  2. A. Shamir, 1985 Identity-Based Cryptosystems and Signature Schemes, Proc. Advances in Cryptology (CRYPTO), pp. 47-53.
  3. Chris Karlof, David Wagner,2003, Secure routing in wireless sensor networks: attacks and countermeasures, University of California at Berkeley, Berkeley, CA 94720.
  4. D. W. Carman, 2005, New Directions in Sensor Network Key Manage-ment, Int'l J. Distributed Sensor Networks, vol. 1, pp. 3- 15.
  5. F. Hess, 2003,Efficient Identity Based Signature Schemes Based on Pairings, Proc. Ninth Ann. Int'l Workshop Selected Areas in Cryptography (SAC), pp. 310-324.
  6. H. Lu, J. Li, and H. Kameda, 2010. A Secure Routing Protocol for Cluster-Based Wireless Sensor Networks Using ID-Based Digital Signature, Proc. IEEE GLOBECOM, pp. 1-5.
  7. H Lu, J Li and Mohsen Guizani, 2014. Secure and Efficient Data Transmission for Cluster-Based Wireless Sensor Network" IEEE transactions on parallel and distributed systems, vol. 25, no. 3.
  8. J. J. Rotman, 1994. An Introduction to the Theory of Groups, fourth ed. Springer-Verlag.
  9. Joseph K. Liu, Joonsang Baek, Jianying Zhou Yanjiang Yang, 2008. Efficient Online/Offline Identity-Based Signature for Wireless Sensor Network.
  10. Kun Zhang, Cong Wang, 2008. A Secure Routing Protocol for Cluster-Based Wireless Sensor Networks Using Group Key Management IEEE.
  11. L. B. Oliveira et al. , 2007. SecLEACH-On the Security of Clustered Sensor Networks, Signal Processing, vol. 87, pp. 2882-2895.
  12. W. Diffie and M. Hellman, 1976. New Directions in Cryptography, IEEE Trans. Information Theory, vol. IT-22, no. 6, pp. 644654.
  13. A. A. Abbasi and M. Younis, 2007. A Survey on Clustering Algorithms for Wireless Sensor Networks, Computer Comm. , vol. 30, nos. 14/15, pp. 2826-2841.
  14. Y Wang, G Attebury,B Ramamurthy,2006, A Survey of Security Issues In Wireless Sensor Networks.
  15. Yongyu Jia, Lian Zhao and Bobby Ma, 2008. A hierarchical clustering-based routing protocol for wireless sensor networks supporting multiple data aggregation qualities, Int. J. Sensor Networks, Vol. 4, Nos. 1/2.
  16. S. Sharma and S. K. Jena, 2011. A Survey on Secure Hierarchical Routing Protocols in Wireless Sensor Networks, Proc. Int'l Conf. Comm. , Computing & Security (ICCCS), pp. 146-151.
  17. D. Boneh and M. Franklin, 2001. Identity-Based Encryption from the Weil Pairing, Proc. 21st Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '01), pp. 213-229.
Index Terms

Computer Science
Information Sciences

Keywords

Wireless Sensor Networks (WSN) High Energy First (HEF) Dempster -Shafer theory Harmonic Search Algorithm (HSA) Cluster Head (CH) Base Station (BS) Cluster based WSN (CWSN)