scholarly journals A Energy-Efficient Clustering Routing Algorithm Based on Distance and Residual Energy for Wireless Sensor Networks

2012 ◽  
Vol 29 ◽  
pp. 1882-1888 ◽  
Author(s):  
Zhu Yong ◽  
Qing Pei
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Energy Efficient Clustering

scholarly journals Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) in Wireless Sensor Networks

2019 ◽  
Author(s):  
Muhammad Inam ◽  
Zhou Li ◽  
Zulfiqar Ali Zardari ◽  
Fawaz Mahiuob Mohammed Mokbal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Shortest Path ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Residual Energy ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Shortest Path Routing ◽  
Energy Efficient Clustering

The sensor nodes have limited computation, sensing, communication capabilities and generally operated by batteries in a harsh atmosphere with non-replenish able power sources. These limitations force the sensor network subject to failure because most of the energy is spent on sensing, computing and data transmission. This paper introduces an Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) to assist Wireless Sensor Networks (WSNs) by (a) extending the lifespan of the network (b) effectively using the battery power (c) decreasing the network overhead and (d) ensuring a high packet transmission ratio with minimal delay. The delay time-based Cluster Head (CH) is elected based on the node degree, residual energy and Received Signal Strength (RSS) to accomplish the goal. Additionally, the RSS-based network partitioning is implemented to evaluate the gradient based on demand routing between source (sensing node) and destination (BS). Whenever the current CH residual energy goes under the threshold level, the proposed protocol performs the clustering process, reducing the exchange of control packets. However, the BS periodically gathers the data from every single CH which helps to reduce the collision and Medium Access Control (MAC) layer conflict. From the simulation results, it is the evident that the proposed protocol performance in terms of average end-to-end latency, packet delivery ratio, average energy consumption and control overhead is better than the well-known current protocols.

An Efficient Multi-Hop Clustering Routing Algorithm in Wireless Sensor Networks

2010 ◽  
Vol 34-35 ◽  
pp. 932-936
Author(s):  
Li Jun Xu ◽  
Guo Hong Gao ◽  
Xue Yong Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Routing Algorithm ◽  
Network Design Problem ◽  
Wireless Sensor ◽  
Clustering Methods ◽  
Distributed Energy ◽  
Energy Efficient Clustering

Since the energy supply of a sensor node is limited, energy optimization should be considered as the key objective when studying the overall network design problem in wireless sensor networks (WSNs). In this paper, we proposed a distributed energy-efficient clustering algorithm in WSNs based on multi-hop theory. We compare the proposed algorithm with different clustering methods used in the WSNs. The simulation results show that the proposed algorithm has the better performances of energy-efficiency, higher throughput and low delay.

A Node Overhaul Scheme for Energy Efficient Clustering in Wireless Sensor Networks

2021 ◽  
Vol 5 (4) ◽  
pp. 1-4
Author(s):  
Jaspreet Singh ◽  
Satyendra Singh Yadav ◽  
Vinay Kanungo ◽  
Yogita ◽  
Vipin Pal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Wireless Sensor ◽  
Energy Efficient Clustering
Sign in / Sign up

Export Citation Format

Share Document