Energy Efficient Clustering Routing Protocol and ACO Algorithm in WSN

2021 ◽  
pp. 68-80
Author(s):  
Shalini Subramani ◽  
M. Selvi ◽  
S. V. N. Santhosh Kumar ◽  
A. Kannan
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Energy Efficient Clustering

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.

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 Multi-Population Ensemble Particle Swarm Optimizer based Energy Efficient Clustering Algorithms for IOT Applications

2021 ◽  
pp. 81-85
Author(s):  
Roshnee Adlak ◽  
Pooja Meena
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
New Technologies ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Particle Swarm ◽  
Energy Utilization ◽  
Particle Swarm Optimizer ◽  
Energy Efficient Clustering ◽  
The Internet Of Things

With the growth of wireless sensor networks (WSN), new technologies like the Internet-of-Things (IoT) are being created. There may be challenges that come because when implementing these application areas in practice. The primary issue is energy utilization while data transmission between these resource restricted sensors. In this work, we present a cluster-based routing protocol for IoT to anticipate energy utilization. Furthermore, for cluster head selection and cluster updation, we presented a multi-population ensemble particle swarm optimizer. The simulation was carried out using the MATLAB platform and demonstrates its superiority over different approaches.

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 An Energy-Efficient Clustering Routing Protocol Based on a High-QoS Node Deployment with an Inter-Cluster Routing Mechanism in WSNs

Sensors ◽  
2019 ◽  
Vol 19 (12) ◽  
pp. 2752 ◽  
Author(s):  
Kaida Xu ◽  
Zhidong Zhao ◽  
Yi Luo ◽  
Guohua Hui ◽  
Liqin Hu
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Base Station ◽  
Dijkstra Algorithm ◽  
Node Deployment ◽  
Deployment Strategy ◽  
Routing Mechanism ◽  
Energy Efficient Clustering ◽  
Information Integrity

Currently, wireless sensor network (WSN) protocols are mainly used to achieve low power consumption of the network, but there are few studies on the quality of services (QoS) of these networks. Coverage can be used as a measure of the WSN’s QoS, which can further reflect the quality of data information. Additionally, the coverage requirements of regional monitoring target points are different in real applications. On this basis, this paper proposes an energy-efficient clustering routing protocol based on a high-QoS node deployment with an inter-cluster routing mechanism (EECRP-HQSND-ICRM) in WSNs. First, this paper proposes formula definitions for information integrity, validity, and redundancy from the coverage rate and introduces a node deployment strategy based on twofold coverage. Then, in order to satisfy the uniformity of the distribution of cluster heads (CHs), the monitoring area is divided into four small areas centered on the base station (BS), and the CHs are selected in the respective cells. Finally, combined with the practical application of the WSN, this paper optimizes the Dijkstra algorithm, including: (1) nonessential paths neglecting considerations, and (2) a simultaneous introduction of end-to-end weights and path weights, achieving the selection of optimal information transmission paths between the CHs. The simulation results show that, compared with the general node deployment strategies, the deployment strategy of the proposed protocol has higher information integrity and validity, as well as lower redundancy. Meanwhile, compared with some classic protocols, this protocol can greatly reduce and balance network energy consumption and extend the network lifetime.

Sign in / Sign up

Export Citation Format

Share Document