ECRPW: Energy-Efficient Clustering Routing Protocol Based on Weight for WSNs

2012 ◽  
Vol 182-183 ◽  
pp. 823-828
Author(s):  
Xiang Ping Gu ◽  
Rong Lin Hu
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Distance Threshold ◽  
Cluster Heads ◽  
Cluster Scheme ◽  
Energy Efficient Clustering ◽  
Routing Tree ◽  
Better Than

ECRPW (energy-efficient clustering routing protocol based on weight) routing protocol is presented to avoid the characteristic of limited energy for wireless sensor networks. It takes nodes’ residual energy into consideration during the process of cluster heads being elected. The constraint of distance threshold is used to optimize cluster scheme. Furthermore, it also sets up the routing tree based on cluster heads’ weight. We simulate and analyze LEACH and ECRPW in NS2. The results show that the performance of ECRPW is better than LEACH.

scholarly journals Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks Based on Yellow Saddle Goatfish Algorithm

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1515 ◽  
Author(s):  
Alma Rodríguez ◽  
Carolina Del-Valle-Soto ◽  
Ramiro Velázquez
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Cluster Structure ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Energy Efficient Clustering

The usage of wireless sensor devices in many applications, such as in the Internet of Things and monitoring in dangerous geographical spaces, has increased in recent years. However, sensor nodes have limited power, and battery replacement is not viable in most cases. Thus, energy savings in Wireless Sensor Networks (WSNs) is the primary concern in the design of efficient communication protocols. Therefore, a novel energy-efficient clustering routing protocol for WSNs based on Yellow Saddle Goatfish Algorithm (YSGA) is proposed. The protocol is intended to intensify the network lifetime by reducing energy consumption. The network considers a base station and a set of cluster heads in its cluster structure. The number of cluster heads and the selection of optimal cluster heads is determined by the YSGA algorithm, while sensor nodes are assigned to its nearest cluster head. The cluster structure of the network is reconfigured by YSGA to ensure an optimal distribution of cluster heads and reduce the transmission distance. Experiments show competitive results and demonstrate that the proposed routing protocol minimizes the energy consumption, improves the lifetime, and prolongs the stability period of the network in comparison with the stated of the art clustering routing protocols.

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.

Quasi Oppositional Glowworm Swarm Optimization Algorithm for Energy Efficient Clustering in Wireless Sensor Networks

2020 ◽  
Vol 17 (12) ◽  
pp. 5447-5456
Author(s):  
R. M. Alamelu ◽  
K. Prabu
Keyword(s):  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Link Quality ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Node Degree ◽  
Swarm Optimization ◽  
Glowworm Swarm Optimization ◽  
Energy Efficient Clustering

Wireless sensor network (WSN) becomes popular due to its applicability in distinct application areas like healthcare, military, search and rescue operations, etc. In WSN, the sensor nodes undergo deployment in massive number which operates autonomously in harsh environment. Because of limited resources and battery operated sensor nodes, energy efficiency is considered as a main design issue. To achieve, clustering is one of the effective technique which organizes the set of nodes into clusters and cluster head (CH) selection takes place. This paper presents a new Quasi Oppositional Glowworm Swarm Optimization (QOGSO) algorithm for energy efficient clustering in WSN. The proposed QOGSO algorithm is intended to elect the CHs among the sensor nodes using a set of parameters namely residual energy, communication cost, link quality, node degree and node marginality. The QOGSO algorithm incorporates quasi oppositional based learning (QOBL) concept to improvise the convergence rate of GSO technique. The QOGSO algorithm effectively selects the CHs and organizes clusters for minimized energy dissipation and maximum network lifetime. The performance of the QOGSO algorithm has been evaluated and the results are assessed interms of distinct evaluation parameters.

Energy-Efficient Routing Protocol of Wireless Sensor Network for Industrial Application

2013 ◽  
Vol 579-580 ◽  
pp. 732-739
Author(s):  
Zhi Yan Ma ◽  
Guang You Yang ◽  
Jing Jing Zhou ◽  
Xiong Gan
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Time Slot ◽  
Data Gathering ◽  
Base Station ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Death Time ◽  
Leach Protocol ◽  
Energy Efficient Clustering

An energy-efficient wireless sensor routing protocol (Energy-efficient clustering hierarchy routing protocol, EECH) for industrial field is proposed based on LEACH protocol according to the energy inefficiency of existing routing protocols and the characteristics of industrial field applications. The EECH protocol takes full advantages of the node clustering and time slot distribution in LEACH and implements the functions such as clustering, multi hop time slot distribution, node sleeping and data gathering. The cluster heads can be evenly distributed in the area with the geography location information of the wireless nodes, so that the optimal data gathering path can be established. Meanwhile, the EECH protocol can reduce the conflict in data receiving/transmitting and the energy consumption of the nodes, and extend the network lifetime through the multi hop time slot distribution and node sleep mechanism. The simulation results have shown that the death time of the first node in EECH protocol is extended double time than that of LEACH protocol. When most of the nodes dies, the amount of received data of the base station node is more than twice as much as the LEACH protocol, which has verified the energy efficiency characteristic of the EECH protocol.

scholarly journals Cooperative Game Theory Approach for Energy-Efficient Node Clustering in Wireless Sensor Network

2020 ◽  
Vol 20 (2) ◽  
pp. 76
Author(s):  
Chaeriah Bin Ali Wael ◽  
Nasrullah Armi ◽  
Arumjeni Mitayani ◽  
Suyoto Suyoto ◽  
Salita Ulitia Prini ◽  
...  
Keyword(s):  
Game Theory ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Cooperative Game ◽  
Energy Efficient ◽  
Cooperative Game Theory ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Theory Approach ◽  
Energy Efficient Clustering

Energy consumption is one of the critical challenges in designing wireless sensor network (WSN) since it is typically composed of resource-constrained devices. Many studies have been proposed clustering to deal with energy conservation in WSN. Due to its predominance in coordinating the behaviors of many players, game theory has been considered for improving energy efficiency in WSN. In this paper, we evaluate the performance of cooperative game theoretic clustering (CGC) algorithm which employs cooperative game theory in a form of 3-agent cost sharing game for energy-efficient clustering in WSN. Furthermore, we compared its performance to a well-known traditional clustering method, low-energy adaptive clustering hierarchy (LEACH), in terms of network lifetime and stability, and total residual energy. The simulation results show that CGC has better performance compared to LEACH due to the cooperation among cluster heads in coalition. CGC has higher alive nodes with stability improvement of first node dies (FND) by 65%, and the improvement by 52.4% for half node dies (HND). However, with the increasing of the number of nodes, the performance of LEACH is getting better compared to CGC.

scholarly journals A Cluster-Head Rotating Election Routing Protocol for Energy Consumption Optimization in Wireless Sensor Networks

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhengkun He ◽  
Xunyang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Cluster Head Election

Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.

Sign in / Sign up

Export Citation Format

Share Document