A Reliable Energy Efficient Wireless Sensor Network Hierarchical Routing Algorithm

2013 ◽  
Vol 475-476 ◽  
pp. 569-572
Author(s):  
Kai Guo Qian ◽  
Lin Ou
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Energy Efficient ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Hierarchical Routing

The existing clustering protocols exists shortages that the nodes with small residual energy may be choose as cluster nodes, which communicate directly with sink causes more energy consumption. Member nodes transmit data directly to cluster head also caused more energy consumption. A reliable energy efficient wireless sensor network hierarchical routing algorithm (REHRA) is proposed to further improve energy efficiency. It introduces residual energy factor for election of heads that makes nodes with more residual energy priority become heads. The data transmission for heads to sink uses flooding algorithm that ensures reliability. Routing tree is formed within local cluster and data delivers from leaf nodes to the cluster head. Performance analysis and simulation experiment shows that the new algorithm provides higher energy efficiency and longer lifetime.

WN-LEACH: A Weighted Residual Energy Based Cluster-Heads Selection Algorithm for Wireless Sensor Network

2013 ◽  
Vol 765-767 ◽  
pp. 980-984
Author(s):  
Xi Rong Bao ◽  
Jia Hua Xie ◽  
Shuang Long Li
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cumulative Number ◽  
Cluster Heads

This article focused on the energy limit property of Wireless Sensor Network, and proposed a residual energy based algorithm WN-LEACH, with the classic network mode of LEACH routing algorithm. The algorithm combines the proportion of residual energy in the total energy with the cumulative number of the normal nodes supported by the cluster heads as a cluster selection reference. In order to balance the energy consumption of each cluster-head, the algorithm took both the different positions of the base station and the initial energy of the network into consideration, and weighted the two factors to balance the energy consumption between transmitting the signals and data fusion. Simulation results show that the algorithm can promote the lifetime of the uneven energy network and does not impair the effects of the LEACH algorithm.

scholarly journals An improved cluster formation process in wireless sensor network to decrease energy consumption

2020 ◽  
Author(s):  
Hamid Reza Farahzadi ◽  
Mostafa Langarizadeh ◽  
Mohammad Mirhosseini ◽  
Seyed Ali Fatemi Aghda
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Information Transfer ◽  
Cluster Head ◽  
High Energy ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Death Time

AbstractWireless sensor network has special features and many applications, which have attracted attention of many scientists. High energy consumption of these networks, as a drawback, can be reduced by a hierarchical routing algorithm. The proposed algorithm is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) and Quadrant Cluster based LEACH (Q-LEACH) protocols. To reduce energy consumption and provide a more appropriate coverage, the network was divided into several regions and clusters were formed within each region. In selecting the cluster head (CH) in each round, the amount of residual energy and the distance from the center of each node were calculated by the base station (including the location and residual energy of each node) for all living nodes in each region. In this regard, the node with the largest value had the highest priority to be selected as the CH in each network region. The base station calculates the CH due to the lack of energy constraints and is also responsible for informing it throughout the network, which reduces the load consumption and tasks of nodes in the network. The information transfer steps in this protocol are similar to the LEACH protocol stages. To better evaluate the results, the proposed method was implemented with LEACH LEACH-SWDN, and Q-LEACH protocols using MATLAB software. The results showed better performance of the proposed method in network lifetime, first node death time, and the last node death time.

scholarly journals Trust-Aware and Low Energy Consumption Security Topology Protocol of Wireless Sensor Network

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zuo Chen ◽  
Min He ◽  
Wei Liang ◽  
Kai Chen
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Low Energy ◽  
Wireless Sensor ◽  
Trust Value ◽  
Low Energy Consumption

Wireless sensor network (WSN) is a kind of distributed and self-organizing networks, in which the sensor nodes have limited communication bandwidth, memory, and limited energy. The topology construction of this network is usually vulnerable when attacked by malicious nodes. Besides, excessive energy consumption is a problem that can not be ignored. Therefore, this paper proposes a secure topology protocol of WSN which is trust-aware and of low energy consumption, called TLES. The TLES considers the trust value as an important factor affecting the behavior of node. In detail, the TLES would take trust value, residual energy of the nodes, and node density into consideration when selecting cluster head nodes. Then, TLES constructs these cluster head nodes by choosing the next hop node according to distance to base station (BS), nodes’ degrees, and residual energy, so as to establish a safe, reliable, and energy saving network. Experimental results show that the algorithm can effectively isolate the malicious node in the network and reduce the consumption of energy of the whole network.

scholarly journals An Election Energy Threshold Based Multi-Hop Routing Protocol in a Grid-Clustered Wireless Sensor Network

2018 ◽  
pp. 327-336 ◽  
Author(s):  
Funom Samuel Dadah ◽  
Ajayi Ore-Ofe ◽  
Aliyu D Usman ◽  
Y A Mshelia ◽  
M O Babatunde
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Routing Algorithm ◽  
Base Station ◽  
Energy Threshold ◽  
Wireless Sensor ◽  
Data Packets

Owing to the limited energy of sensor nodes (SNs) in a wireless sensor network (WSN), it is important to reduce and balance the energy consumption of the SNs in order to extend the WSN lifetime. Clustering mechanism is a highly efficient and effective mechanism for minimizing the amount of energy that SNs consume during the transmission of data packets. In this paper, an election energy threshold based multi-hop routing protocol (mEEMRP) is presented. In order to minimize energy consumption, this routing protocol uses grid clustering, where the network field is divided into grid clusters. SNs in each grid cluster select a cluster head (CH) based on a weight factor that takes the node location, node’s residual energy (RE) as well as the node’s distance from the base station into consideration. An energy efficient multi-hop routing algorithm is adopted during the transmission of data packets from the cluster heads (CHs) to the base station (BS). This multi-hop routing algorithm uses an election energy threshold value, T­nhCH that takes into consideration the RE of CHs as well as the distance between CHs. Simulation results show a 1.77% and 10.65% improvement in terms of network lifetime for two network field scenarios over Energy Efficient Multi-hop Routing Protocol (EEMRP).

scholarly journals Enhancing Energy Efficiency of Wireless Sensor Network through the Design of Energy Efficient Routing Protocol

2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Noor Zaman ◽  
Low Tang Jung ◽  
Muhammad Mehboob Yasin
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Wireless Sensor ◽  
Cross Layer Design ◽  
Energy Efficient Routing ◽  
Overall Performance

Wireless Sensor Network (WSN) is known to be a highly resource constrained class of network where energy consumption is one of the prime concerns. In this research, a cross layer design methodology was adopted to design an energy efficient routing protocol entitled “Position Responsive Routing Protocol” (PRRP). PRRP is designed to minimize energy consumed in each node by (1) reducing the amount of time in which a sensor node is in an idle listening state and (2) reducing the average communication distance over the network. The performance of the proposed PRRP was critically evaluated in the context of network lifetime, throughput, and energy consumption of the network per individual basis and per data packet basis. The research results were analyzed and benchmarked against the well-known LEACH and CELRP protocols. The outcomes show a significant improvement in the WSN in terms of energy efficiency and the overall performance of WSN.

scholarly journals Research Trends in Energy-Efficient Routing Protocols for Wireless Sensor Network

2020 ◽  
Vol 9 (5) ◽  
pp. 425-431
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing

The technological advances in wireless communication systems and digital data processing techniques has given rise to many innovative intelligent networks. One such network is wireless sensor network (WSN). In recent past, huge growth has been perceived in the applications of WSN. In wireless sensor network, the battery powered sensor nodes are scattered in a monitoring area and it is impossible to replace the batteries of sensor nodes after deployment. Therefore, energy efficiency remains a prime concern in design of WSNs. The routing protocols help to find energy efficient routes and increases the lifetime of WSNs. The cluster-based routing techniques play an important role in design of energy efficient WSNs. However, authors analyzed two types of sensor networks in the literature such as homogeneous and heterogeneous networks. In homogeneous clustering, all sensor nodes possess same level of initial energy and cluster head (CH) formation probability of each node in such networks remains equal. In heterogeneous clustering, the nodes are bifurcated into three energy levels such as normal node, advanced node and super node. Therefore, the CH formation probability of a node in such network depends on the type of node. This paper presented a survey on recent energy efficient routing protocols in homogeneous as well as heterogeneous wireless sensor networks. The energy efficient routing protocols are classified based on some quality of service (QoS) metrics such as energy efficiency, network lifetime, network stability, cluster head selection threshold and heterogeneity levels.

The Research of Routing Algorithm Based on Shortest Path Tree in WSNs

2013 ◽  
Vol 347-350 ◽  
pp. 3899-3902
Author(s):  
Yu Hua Liu ◽  
Zhen Rong Luo ◽  
Ke Xu ◽  
Cui Xu
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Shortest Path ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Shortest Path Tree ◽  
Hierarchical Topology

This article poses an algorithm of the hierarchical topology in wireless sensor network based on shortest path tree algorithm to cover the shortage of LAC Routing Algorithm (LAC-T), which based on SPT(Shortest Path Tree). LAC-T algorithm elects cluster head by the remaining energy of nodes and the distance between node and base station. Meanwhile, it uses SPT to communicate among cluster heads in WSNs. The result of stimulation shows that LAC-T algorithm is not only easy to achieve, but could be better balance the energy consumption of each node, extend the lifespan of WSN (Wireless Sensor Network).

A New Clustering Routing Algorithm of Wireless Sensor Network

2014 ◽  
Vol 986-987 ◽  
pp. 2095-2098
Author(s):  
Li Qiang Chen
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Large Area ◽  
Cluster Heads

In wireless sensor network, node’s energy is limited. The energy consumption of transmission a bit is larger than that of handle a bit. If it adopt effective routing algorithm, it can greatly improve the energy efficiency of wireless sensor network. In order to improve the energy efficiency of wireless sensor network in the large area, we propose a clustering routing algorithm based on energy, the algorithm realize the multi-hops communication between cluster heads by dividing the WSN area into concentric rings, and reduce the size of radius of the clusters gradually when the nodes’ energy is decreasing slowly. The results of simulation show that the algorithm can effectively prolong the network lifetime.

Improvement on LEACH Protocol of Wireless Sensor Network

2013 ◽  
Vol 347-350 ◽  
pp. 1738-1742 ◽  
Author(s):  
Xiao Wen Ma ◽  
Xiang Yu
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Routing ◽  
Leach Protocol ◽  
Steady State Simulation

Wireless sensor networks comprise of minor battery driven devices with restricted energy resources.Once installed,the minor sensor nodes are usually unapproachable to the operator, and thus auxiliary of the energy source is not practicable.Hence,energy proficiency is a vital design issue that needs to be boosted in order to increase the lifetime of the network. LEACH is a popular hierarchical routing protocol which efficiently maintains the energy storage of nodes in Wireless Sensor Network (WSN).The nodes using LEACH are divided into clusters.The advantage of LEACH is that each node has the equal probability to be a cluster head,which makes the energy dissipation of each node be relatively balanced. This paper studies LEACH protocol, and focuses on how to decide the next hop nodes more reasonable when the data are transmitted at the steady state. Simulation has been done in NS2 and the results show that the algorithm after improved is more energy-efficient than LEACH protocol.

An Algorithm with Efficiently Collecting and Aggregating Data for Wireless Sensor Networks

2021 ◽  
Author(s):  
Peng Xiong ◽  
Qinggang Su
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Battery Capacity

Due to the resource constraint, in wireless sensor network, the node processing ability, wireless bandwidth and battery capacity and other resources are scarcer. For improving the energy efficient and extend the lifetime of the network, this paper proposes a novel algorithm with the distributed and energy-efficient for collecting and aggregating data of wireless sensor network. In the proposed protocol, nodes can autonomously compete for the cluster head based on its own residual energy and the signal strength of its neighbouring nodes. To reduce the energy overhead of cluster head nodes, with a multi-hop way among cluster heads, the collected data from cluster heads is sent to a designated cluster head so as to further send these data to a base station. For improving the performance of the proposed protocol, a new cluster coverage method is proposed to fit the proposed protocol so that when the node density increases, network lifetime can be increased linearly as the number of nodes is increased. Simulations experiments show that network lifetime adopting the proposed protocol is sharply increased. And, the proposed protocol makes all the nodes die (network lifetime is defined as the death of last one node) in the last 40 rounds so that networks adopting the proposed protocol have higher reliability than networks adopting compared protocols.

Sign in / Sign up

Export Citation Format

Share Document