scholarly journals Construction of a minimum energy broadcast backbone with bounded delay in heterogeneous wireless sensor networks

2017 ◽  
Author(s):  
Karla Breschi ◽  
Julien Bernard
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Minimum Energy ◽  
Wireless Sensor ◽  
Bounded Delay ◽  
Heterogeneous Wireless Sensor Networks

scholarly journals Efficient Node Deployment of Large-Scale Heterogeneous Wireless Sensor Networks

2021 ◽  
Vol 11 (22) ◽  
pp. 10924
Author(s):  
Fatma H. Elfouly ◽  
Rabie A. Ramadan ◽  
Ahmed Y. Khedr ◽  
Ahmad Taher Azar ◽  
Kusum Yadav ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Large Scale ◽  
Smart Cities ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
High Coverage ◽  
Heterogeneous Wireless Sensor Networks

 Wireless Sensor Networks (WSNs) became essential in developing many applications, including smart cities and Internet of Things (IoT) applications. WSN has been used in many critical applications such as healthcare, military, and transportation. Such applications depend mainly on the performance of the deployed sensor nodes. Therefore, the deployment process has to be perfectly arranged. However, the deployment process for a WSN is challenging due to many of the constraints to be taken into consideration. For instance, mobile nodes are already utilized in many applications, and their localization needs to be considered during the deployment process. Besides, heterogeneous nodes are employed in many recent applications due to their efficiency and cost-effectiveness. Moreover, the development areas might have different properties due to their importance. Those parameters increase the deployment complexity and make it hard to reach the best deployment scheme. This work, therefore, seeks to discover the best deployment plan for a WSN, considering these limitations throughout the deployment process. First, the deployment problem is defined as an optimization problem and mathematically formulated using Integer Linear Programming (ILP) to understand the problem better. The main objective function is to maximize the coverage of a given field with a network lifetime constraint. Nodes’ mobility and heterogeneity are added to the deployment constraints. The importance of the monitored field subareas is also introduced in this paper, where some subareas could have more importance than others. The paper utilizes Swarm Intelligence as a heuristic algorithm for the large-scale deployment problem. Simulation experiments show that the proposed algorithm produces efficient deployment schemes with a high coverage rate and minimum energy consumption compared to some recent algorithms. The proposed algorithm shows more than a 30% improvement in coverage and network lifetime. 

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.

EAGBRP: A Gateway Based Routing Protocol for Heterogeneous Wireless Sensor Networks

2021 ◽  
Vol 13 (2) ◽  
pp. 467-481
Author(s):  
M. M. Hoque ◽  
M. G. Rashed ◽  
M. H. Kabir ◽  
A. F. M. Z. Abadin ◽  
M. I. Pramanik
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Performance Analysis ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Minimum Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Heterogeneous Wireless Sensor Networks ◽  
Cluster Based Routing

In most of the cluster-based routing protocols for wireless sensor networks (WSNs), cluster heads (CHs) are selected from the normal sensors which may expire rapidly due to fast energy diminution for such an additional workload. As a consequence, the network lifetime of such cluster-based routing protocol reduces drastically. To resolve these constraints, in this study, we proposed a gateway-based routing protocol-namely Energy-Aware Gateway Based Routing Protocol (EAGBRP) for WSNs. In our proposed protocol, the deployed sensor nodes of a WSN were divided into five logical regions based on their location in the sensing field. The base station (BS) was installed out of the sensing area, and two gateway nodes were inaugurated at two predefined regions of the sensing area. The CH in each region is independent of the other regions and selected based on a weighted election probability. We implemented our proposed routing protocol through simulations. To evaluate the performance of our EAGBRP, we simulated SEP, M-GEAR, and MGBEHA (4GW) protocols. The network lifetime, throughput, and residual energy parameters are utilized for performance analysis. It is revealed from the performance analysis results that WSNs with EAGBRP achieve maximum network lifetime and throughput over other considered protocols with minimum energy consumption.

Energy Efficient Group Based Linear Wireless Sensor Networks for Application in Pipeline Monitoring

2020 ◽  
Vol 10 ◽  
Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Remote Monitoring ◽  
Linear Array ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Pipeline Monitoring

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.

Sign in / Sign up

Export Citation Format

Share Document