🕔 Call For Paper — Vol. 12  |  Issue 3  |  September 2026  |  Deadline: 20-Sep-2026
Track Paper Submit Paper Contact

Paper Details

Home Archives Paper Details
← Back to Issue
Vol. 4  No. 9 (2018) · Articles

Cluster Head Selection Using Gradient Descent Algorithm for Wireless Sensor Network

Shilpa Mohindra
ME student , IN

Kanika Sharma
ME student , IN

📅 Published: September 2018

Keywords: WSN, Gradient Descent, Threshold, Clustering.

📄 View / Download PDF ⬇ Download

Abstract

Wireless Sensor Network (WSN) consists of large number of small size sensor nodes having limited battery and power resources. They are used in various applications like health care, military, home and environmental sensing for real time operations. Energy efficiency and network lifetime are main concern of WSN. Clustering is one of most efficient routing algorithm to solve issues of network. Selection of cluster head is one of the main concerns for WSN. Different algorithms have been proposed to find best-suited cluster head with low energy consumption. In this paper, Gradient Descent approach has been used and is compared with modified LEACH. MATLAB 2015a simulation results show improvement in terms of number of dead nodes, optimal number of cluster head and number of packets transmitted to base station.

How to Cite

Shilpa Mohindra, Kanika Sharma, “Cluster Head Selection Using Gradient Descent Algorithm for Wireless Sensor Network,” International Journal of Technical Innovation in Modern Engineering & Science, vol. 4, no. 9, pp. 62-69, September 2018.

References

NA

🔒 Content is protected — © IJTIMES