Scholarlink

<p>The concept of wireless sensor networks (WSNs) is present in the current digital environment and ties in with the Internet of Things (IoT). This technology has however come with serious challenges including low battery life and short life of sensor nodes. It is important, therefore, to have an efficient routing protocol that will take care of these problems. The paper provides a linked-list-based cluster head node dynamic reassignment (LDCHR) protocol. This protocol is dynamic and uses the proximity of the cluster head nodes to the cluster center, their distance to the base station and their remaining power to select the cluster head nodes. Here a key work is a linked list structure that stores backup CHs for each cluster, allowing constant-time CH switching O(1) when a primary CH’s energy drops below a threshold. The backup list updates in O(n) time without affecting real-time performance, ensuring minimal delay in CH transitions. Simulations has been done using NetSim 14.2 having three case scenario of 64, 100, and 144 nodes. This work is compared to the traditional LEACH protocol. The result shows LDCHR improves throughput by up to 60%, packet reception by up to 10.66%, and energy consumption is reduced by 12.02%, confirming its effectiveness to improve the network life of wireless sensor network.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Optimizing Energy Consumption in Wireless Sensor Networks Through Linked List-Based Dynamic Cluster Head Reassignment (LDCHR)

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月13日

查看全文
  • Linesh Raja,
  • Chandrashekhar Patel,
  • Vaibhav Bhatnagar,
  • Bhanu Priya Yadav,
  • Pragya Vaishnav

摘要

The concept of wireless sensor networks (WSNs) is present in the current digital environment and ties in with the Internet of Things (IoT). This technology has however come with serious challenges including low battery life and short life of sensor nodes. It is important, therefore, to have an efficient routing protocol that will take care of these problems. The paper provides a linked-list-based cluster head node dynamic reassignment (LDCHR) protocol. This protocol is dynamic and uses the proximity of the cluster head nodes to the cluster center, their distance to the base station and their remaining power to select the cluster head nodes. Here a key work is a linked list structure that stores backup CHs for each cluster, allowing constant-time CH switching O(1) when a primary CH’s energy drops below a threshold. The backup list updates in O(n) time without affecting real-time performance, ensuring minimal delay in CH transitions. Simulations has been done using NetSim 14.2 having three case scenario of 64, 100, and 144 nodes. This work is compared to the traditional LEACH protocol. The result shows LDCHR improves throughput by up to 60%, packet reception by up to 10.66%, and energy consumption is reduced by 12.02%, confirming its effectiveness to improve the network life of wireless sensor network.