scholarly journals Evidence-Efficient Multihop Clustering Routing Scheme for Large-Scale Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-14 ◽  
Author(s):  
Zhihua Li ◽  
Ping Xin
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Routing Scheme ◽  
Reliable Transmission ◽  
Transmission Reliability ◽  
Aggregation Tree ◽  
Rotation Strategy

Energy consumption and transmission reliability are the most common issues in wireless sensor networks (WSNs). By studying the broadcast nature of data transmission in WSNs, the mechanism of guaranteeing reliable transmission is abstracted as propagation of responsibility and availability. The responsibility and availability represent the accumulated evidence of nodes to support reliable transmission. Based on the developed mechanism, an evidence-efficient cluster head rotation strategy and algorithm are presented. Furthermore, backbone construction algorithm is studied to generate the minimum aggregation tree inside the candidate cluster heads. A minimum aggregation tree-based multihop routing scheme is also investigated, which allows the elected cluster heads to choose the optimally main path to forward data locally and dynamically. As a hybridization of the above, an evidence-efficient multihop clustering routing (EEMCR) method is proposed. The EEMCR method is simulated, validated, and compared with some previous algorithms. The experimental results show that EEMCR outperforms them in terms of prolonging network lifetime, improving transmission reliability, postponing emergence of death nodes, enhancing coverage preservation, and degrading energy consumption.

scholarly journals Calculating the Number of Cluster Heads Based on the Rate-Distortion Function in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Mingxin Yang ◽  
Jingsha He ◽  
Yuqiang Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Fusion ◽  
Rate Distortion ◽  
Distortion Function ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Sensor Nodes ◽  
Cluster Heads

Due to limited resources in wireless sensor nodes, energy efficiency is considered as one of the primary constraints in the design of the topology of wireless sensor networks (WSNs). Since data that are collected by wireless sensor nodes exhibit the characteristics of temporal association, data fusion has also become a very important means of reducing network traffic as well as eliminating data redundancy as far as data transmission is concerned. Another reason for data fusion is that, in many applications, only some of the data that are collected can meet the requirements of the sink node. In this paper, we propose a method to calculate the number of cluster heads or data aggregators during data fusion based on the rate-distortion function. In our discussion, we will first establish an energy consumption model and then describe a method for calculating the number of cluster heads from the point of view of reducing energy consumption. We will also show through theoretical analysis and experimentation that the network topology design based on the rate-distortion function is indeed more energy-efficient.

scholarly journals An Enhanced Heterogeneous Gateway-Based Energy-Aware Multi-hop Routing Protocol for Wireless Sensor Networks

2022 ◽  
Author(s):  
Fuseini Jibreel ◽  
Emmanuel Tuyishimire ◽  
I M Daabo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Base Station ◽  
Communication Strategy ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Routing Scheme

Wireless Sensor Networks (WSNs) continue to provide essential services for various applications such as surveillance, data gathering, and data transmission from the hazardous environments to safer destinations. This has been enhanced by the energy-efficient routing protocols that are mostly designed for such purposes. Gateway-based Energy-Aware Multi-hop Routing protocol (MGEAR) is one of the homogenous routing schemes that was recently designed to more efficiently reduce the energy consumption of distant nodes. However, it has been found that the protocol has a high energy consumption rate, lower stability period, less data transmission to the Base station (BS). In this paper, an enhanced Heterogeneous Gateway-based Energy-Aware multi-hop routing protocol ( HMGEAR) is proposed. The proposed routing scheme is based on the introduction of heterogeneous nodes in the existing scheme, selection of the head based on the residual energy, introduction of multi-hop communication strategy in all the regions of the network, and implementation of energy hole elimination technique. Results show that the proposed routing scheme outperforms two existing ones.

scholarly journals An Integrated Approach for Constructing Cluster-based Virtual Backbone with Mobile Sink

2019 ◽  
Vol 13 (01) ◽  
pp. 53
Author(s):  
Khalil Al-shqeerat
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Spanning Tree ◽  
Integrated Approach ◽  
Mobile Sink ◽  
Wireless Sensor ◽  
Virtual Backbone ◽  
Cluster Heads ◽  
Reduce Energy Consumption

<p class="Abstract">In Wireless Sensor Networks, no physical backbone infrastructure used while all sensor nodes are energy constrained and impractical to recharge. The behavior of networks becomes unstable once the first node dies. The key challenge in such networks is how to reduce energy consumption to increase the network lifetime, especially with the different amount of energy in heterogeneity environments.</p><p class="Abstract">In this paper, the virtual backbone routing solution is suggested to reduce energy consumption in a wireless sensor network. An integrated approach combines both advantages of hierarchical cluster-based architecture and shortest spanning tree topology for constructing a virtual backbone with a mobile sink. The clustering solution is used to divide the network into clusters and reduces the number of nodes included in the communication. On the other hand, the shortest spanning tree technique is used to construct a backbone among all cluster heads and mobile sink every time the sink traverses to a new location. The proposed approach aims to construct an efficient data aggregation spanning tree used to send or receive data between the mobile sink and elected cluster heads in wireless sensor networks. It constructs an efficient virtual backbone to decrease the energy consumption and prolong the lifetime of the network.</p>Performance evaluation results demonstrate how the proposed approach prolongs the lifetime of wireless sensor networks compared to some conventional clustering protocols.

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.

scholarly journals A DISTRIBUTED ENERGY EFFICIENT CLUSTERING ALGORITHM FOR DATA AGGREGATION IN WIRELESS SENSOR NETWORKS

2018 ◽  
Vol 19 (1) ◽  
pp. 72-90
Author(s):  
Seyed Mohammad Bagher Musavi Shirazi ◽  
Maryam Sabet ◽  
Mohammad Reza Pajoohan
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Clustering Algorithm ◽  
Base Station ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Cluster Heads ◽  
Energy Efficient Clustering

Wireless sensor networks (WSNs) are a new generation of networks typically consisting of a large number of inexpensive nodes with wireless communications. The main purpose of these networks is to collect information from the environment for further processing. Nodes in the network have been equipped with limited battery lifetime, so energy saving is one of the major issues in WSNs. If we balance the load among cluster heads and prevent having an extra load on just a few nodes in the network, we can reach longer network lifetime. One solution to control energy consumption and balance the load among nodes is to use clustering techniques. In this paper, we propose a new distributed energy-efficient clustering algorithm for data aggregation in wireless sensor networks, called Distributed Clustering for Data Aggregation (DCDA). In our new approach, an optimal transmission tree is constructed among sensor nodes with a new greedy method. Base station (BS) is the root, cluster heads (CHs) and relay nodes are intermediate nodes, and other nodes (cluster member nodes) are the leaves of this transmission tree. DCDA balances load among CHs in intra-cluster and inter-cluster data communications using different cluster sizes. For efficient inter-cluster communications, some relay nodes will transfer data between CHs. Energy consumption, distance to the base station, and cluster heads’ centric metric are three main adjustment parameters for the cluster heads election. Simulation results show that the proposed protocol leads to the reduction of individual sensor nodes’ energy consumption and prolongs network lifetime, in comparison with other known methods. ABSTRAK: Rangkaian sensor wayarles (WSN) adalah rangkaian generasi baru yang terdiri daripada nod-nod murah komunikasi wayarles. Tujuan rangkaian-rangkaian ini adalah bagi mengumpul maklumat sekeliling untuk proses seterusnya. Nod dalam rangkaian ini dilengkapi bateri kurang jangka hayat, jadi simpanan tenaga adalah satu isu besar dalam WSN. Jika beban diimbang antara induk kelompok dan lebihan beban dihalang pada setiap rangkaian iaitu hanya sebilangan kecil nod pada tiap-tiap kelompok,  jangka hayat dapat dipanjangkan pada sesebuah rangkaian. Satu penyelesaian adalah dengan mengawal penggunaan tenaga dan mengimbangi beban antara nod menggunakan teknik berkelompok. Kajian ini mencadangkan kaedah baru pembahagian tenaga berkesan secara algoritma berkelompok bagi pembahagian data dalam WSN, dikenali sebagai Pembahagian Kelompok Kumpulan Data (DCDA). Melalui pendekatan baru ini, pokok transmisi optimum dibina antara nod sensor melalui kaedah baru. Stesen utama (BS) ialah akar, induk kelompok-kelompok (CHs) dan nod penyiar ialah nod perantara, dan nod-nod lain (nod-nod ahli kelompok) ialah daun bagi pokok trasmisi. DCDA mengimbangi beban CHs antara-kelompok dan dalam-kelompok komunikasi data daripada kelompok berbeza saiz. Bagi komunikasi berkesan dalam-kelompok, sebahagian nod penyampai akan memindahkan data antara CHs. Penggunaan tenaga, jarak ke stesen utama dan induk kelompok metrik sentrik adalah tiga parameter pelaras bagi pemilihan induk kelompok. Keputusan simulasi protokol yang dicadang menunjukkan pengurangan penggunaan tenaga pada nod-nod sensor individu dan memanjangkan jangka hayat rangkaian, berbanding kaedah-kaedah lain yang diketahui.

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.

An Improvement Routing Protocol Based LEACH for Wireless Sensor Networks

2014 ◽  
Vol 614 ◽  
pp. 472-475 ◽  
Author(s):  
Jin Gang Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Base Station ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Number Of Clusters ◽  
Cluster Heads

Due to limited energy, computing ability, and memory of Wireless sensor Networks(WSN), routing issue is one of the key factors for WSN. LEACH is the first clustering routing protocol, which can efficiently reduce the energy consumption and prolong the lifetime of WSN, but it also has some disadvantage. This paper proposed an improvement based LEACH, called LEACH-T. According to different number of clusters, LEACH-T uses variable time slot for different clusters in steady-state phase, and single-hop or multi-hop to transmit data between cluster heads and Base Station. Also it considered residual energy of sensor nodes and the optimal number of clusters during selection of the cluster heads. The simulation results show that LEACH-T has better performance than LEACH for prolonging the lifetime and reducing the energy consumption.

scholarly journals An Improved Threshold-Sensitive Stable Election Routing Energy Protocol for Heterogeneous Wireless Sensor Networks

Information ◽  
2019 ◽  
Vol 10 (4) ◽  
pp. 125 ◽  
Author(s):  
Liquan Zhao ◽  
Qi Tang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Minimum Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Networks ◽  
Heterogeneous Wireless Sensor Network ◽  
Stable Election Protocol

In the Threshold-Sensitive Stable Election Protocol, sensors are randomly deployed in the region without considering the balanced energy consumption of nodes. If a node that has been selected as a cluster head is located far away from the base station, it will affect the efficiency of the network due to its early death. This paper proposes an improved energy efficient routing protocol named Improved Threshold-Sensitive Stable Election protocol (ITSEP) for heterogeneous wireless sensor networks. Firstly, we use a node state transformation mechanism to control the number of cluster heads in high-density node areas. Secondly, the proposed protocol improves the threshold formula by considering the distance from the node to the base station, the number of neighbor nodes, its residual energy, and the average distance between nodes. In addition, an optimal route with minimum energy consumption for cluster heads has been selected throughout data transmission. Simulation results show that this algorithm has achieved a longer lifetime than the stable election protocol algorithm, modified stable election protocol algorithm, and threshold-sensitive stable election protocol algorithm for the heterogeneous wireless sensor network.

scholarly journals Delay optimal opportunistic pipeline routing scheme for cognitive radio sensor networks

2018 ◽  
Vol 14 (4) ◽  
pp. 155014771877253 ◽  
Author(s):  
Anfeng Liu ◽  
Wei Chen ◽  
Xiao Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Cognitive Radio ◽  
Sensor Networks ◽  
Duty Cycle ◽  
Data Transmission ◽  
Transmission Delay ◽  
Wireless Sensor ◽  
Cognitive Radio Sensor Networks ◽  
Routing Scheme

In order to solve the problem of spectrum scarcity in wireless sensor networks, cognitive radio technology can be introduced into wireless sensor networks, giving rising to cognitive radio sensor networks. Delay-sensitive data applications in cognitive radio sensor networks require efficient real-time communication. Opportunistic pipeline routing is a potential technology to reduce the delay, which can use nodes outside the main forwarding path forward data opportunistically when the transmission fails. However, the energy efficiency of cognitive radio sensor networks with opportunistic pipeline routing is low, and the data transmission delay can be further optimized. In view of this situation, we propose the delay optimal opportunistic pipeline routing scheme named Variable Duty Cycle for Opportunistic Pipeline Routing (VDCOPR). In the Variable Duty Cycle for Opportunistic Pipeline Routing scheme, the nodes employ high duty cycle in the area far from the sink, and low duty cycle in the area near to the sink, which can achieve the balance of energy consumption and reduce the data transmission delay while not affecting network lifetime. The theoretical analysis and experimental results show that, compared with previous opportunistic pipeline routing, energy consumption of network is relatively balanced and the data transmission delay can be reduced by 36.6% in the Variable Duty Cycle for Opportunistic Pipeline Routing scheme.

Sign in / Sign up

Export Citation Format

Share Document