CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Enhanced Unequal Clustering Scheme for Wireless Sensor Networks

by G. Vennira Selvi, R. Manoharan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 75 - Number 4
Year of Publication: 2013
Authors: G. Vennira Selvi, R. Manoharan
10.5120/13100-0398

G. Vennira Selvi, R. Manoharan . Enhanced Unequal Clustering Scheme for Wireless Sensor Networks. International Journal of Computer Applications. 75, 4 ( August 2013), 24-28. DOI=10.5120/13100-0398

@article{ 10.5120/13100-0398,
author = { G. Vennira Selvi, R. Manoharan },
title = { Enhanced Unequal Clustering Scheme for Wireless Sensor Networks },
journal = { International Journal of Computer Applications },
issue_date = { August 2013 },
volume = { 75 },
number = { 4 },
month = { August },
year = { 2013 },
issn = { 0975-8887 },
pages = { 24-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume75/number4/13100-0398/ },
doi = { 10.5120/13100-0398 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:43:23.568761+05:30
%A G. Vennira Selvi
%A R. Manoharan
%T Enhanced Unequal Clustering Scheme for Wireless Sensor Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 75
%N 4
%P 24-28
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In wireless sensor networks, the lifetime of a sensor network is a hottest research topic. Clustering provides an efficient method for increasing the network lifetime. Existing clustering algorithms selects the cluster head with high residual energy and rotates the cluster head periodically to distribute the energy among the nodes in each cluster. Cluster head has the responsibility for collecting data from its cluster members and then it forwards them to the base station. As a result, each node spends more energy for re-electing the cluster head frequently and gathering data from its cluster members. The hot spot problem and distributing the energy consumption among the nodes are the major issues in clustering. To mitigate the hot spot issue and preserve energy for multihop data forwarding, an enhanced clustering scheme namely EUCS is proposed. It constructs the clusters of unequal size and clusters closer to the base station have smaller in size. The cluster head can be re-elected when the energy level of current cluster head reaches to its predefined threshold value which reduces the frequent re-election of cluster head. In addition, to preserve some more energy, data from the sensor nodes are directly transferred to the nearest cluster heads which forwards them to the base station to avoid data gathering in the cluster head. The simulation results show that our algorithm increases the network lifetime effectively.

References
  1. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A Survey on Sensor Networks", IEEE Communications Magazine, vol. 40, no. 8, pp. 102-114, 2002.
  2. O. Younis and S. Fahmy, "HEED: a hybrid, energy-efficient, distributed clustering approach for Ad hoc sensor networks," IEEE Transactions onMobile Computing, vol. 3, no. 4, pp. 366–379, 2004.
  3. Yick J, Mukherjee B, Ghosal D. Wireless sensor network survey. Computer Networks 2008; 52(12): 2292--2330.
  4. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "An Application-Specific Protocol Architecture for Wireless Microsensor Networks", IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660-670, 2002.
  5. B. Krishnamachari, D. Estrin, and S. Wicker, "The Impact of Data Aggregation in Wireless Sensor Networks", in Proceedings of IEEE Int'l Conference on Distributed Computing Systems Workshops (ICDCSW), 2002, pp. 575-578.
  6. C. F. Li, M. Ye, G. H. Chen, and J. Wu, "An energy-efficient unequal clustering mechanism for wireless sensor networks," in Proceedings of the IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, pp. 1–8, IEEE Press, Washington, DC, USA, November.
  7. S, Heinzelman WB. Prolonging the lifetime of wireless sensor networks via unequal clustering. Proceedings ofParallel and Distributed Processing Symposium, 2005.
  8. Chen G, Li C, Ye M, Wu J. An unequal cluster-based routing protocol in wireless sensor networks. Wireless Networks Journal 2009; 15(2): 193--207.
  9. Yang J, Zhang D. An energy-balancing unequal clustering protocol for wireless sensor networks. Information Technology Journal 2009; 8: 57--63.
  10. Yu, J. , Qi, Y. , and Wang, G. (2011). An energy-driven unequal clustering protocol for heterogeneous wireless sensor networks. Journal of Control Theory and Applications, 30(12):133–139
  11. Bencan Gong, Layuan Li, Shaorong Wang, Xuejun Zhou. Multihop Routing Protocol with Unequal Clustering for Wireless sensor Networks. IEEE,2008,pp552-556
  12. Ever, R. Luchmun, L. Mostarda, A. Navarra and P. Shah, (2012), "UHEED - an Unequal Clustering Algorithm for Wireless Sensor Networks", In Proceedings of the 1st International conference on sensor networks (SENSORNETS 2012). Rome, Italy February 24-26. 185-193
  13. Sungju Lee, Jangsoo Lee , Hongjoong Sin, Seunghwan Yoo, Sanghyuck Lee, Jaesik Lee, Yongjun Lee, and Sungchun Kim. An Energy-Efficient Distributed Unequal Clustering Protocol for Wireless Sensor Networks, World Academy of Science, Engineering and Technology 48 2008.
Index Terms

Computer Science
Information Sciences

Keywords

Hot spot problem Network Lifetime

Powered by PhDFocusTM