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

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.

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang

Since wireless sensor networks (WSNs) are powered by energy-constrained batteries, many energy-efficient routing protocols have been proposed to extend the network lifetime. However, most of the protocols do not well balance the energy consumption of the WSNs. The hotspot problem caused by unbalanced energy consumption in the WSNs reduces the network lifetime. To solve the problem, this paper proposes a PSO (Particle Swarm Optimization)-based uneven dynamic clustering multi-hop routing protocol (PUDCRP). In the PUDCRP protocol, the distribution of the clusters will change dynamically when some nodes fail. The PSO algorithm is used to determine the area where the candidate CH (cluster head) nodes are located. The adaptive clustering method based on node distribution makes the cluster distribution more reasonable, which balances the energy consumption of the network more effectively. In order to improve the energy efficiency of multi-hop transmission between the BS (Base Station) and CH nodes, we also propose a connecting line aided route construction method to determine the most appropriate next hop. Compared with UCCGRA, multi-hop EEBCDA, EEMRP, CAMP, PSO-ECHS and PSO-SD, PUDCRP prolongs the network lifetime by between 7.36% and 74.21%. The protocol significantly balances the energy consumption of the network and has better scalability for various sizes of network.


Author(s):  
Saloni Dhiman ◽  
Deepti Kakkar ◽  
Gurjot Kaur

Wireless sensor networks (WSNs) consist of several sensor nodes (SNs) that are powered by battery, so their lifetime is limited, which ultimately affects the lifespan and hence performance of the overall networks. Till now many techniques have been developed to solve this problem of WSN. Clustering is among the effective technique used for increasing the network lifespan. In this chapter, analysis of multi-hop routing protocol based on grid clustering with different selection criteria is presented. For analysis, the network is divided into equal-sized grids where each grid corresponds to a cluster and is assigned with a grid head (GH) responsible for collecting data from each SN belonging to respective grid and transferring it to the base station (BS) using multi-hop routing. The performance of the network has been analyzed for different position of BS, different number of grids, and different number of SNs.


2021 ◽  
Vol 10 (12) ◽  
pp. 25453-25458
Author(s):  
Mr. Dinesh Prabhu. M ◽  
Dr. Dinesh Senduraja

In Wireless sensor Network, several researchers have provided different routing protocol for sensor networks, particularly routing protocols depending on clusters protocols. Reliability of nodes is necessary parameter in effective sensor networks. We use MAC protocol for controlling the network packets. This is because the usage of cluster based routing has several merits like minimized control messages, re-usability of bandwidth and enhanced power control.  Different cluster based routing protocol is proposed by many researchers for the purpose of reducing the consumption energy in wireless sensor networks. Those techniques reduces the energy consumption but with several disadvantages like lack of QoS, inefficient transmission, etc., To overcome those problems, modified QoS enhanced base station controlled in Mistrial Approach (flooding Technique) for wireless sensor networks is proposed in this work.  Here we reduce the number of retransmission and detect the overlay packets in networks using proposed approach. Simulation results show the better energy consumption, Maximum Life time & Efficient Bandwidth is achieved by flooding management when compared to the conventional techniques


2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Farzad Kiani

Energy issue is one of the most important problems in wireless sensor networks. They consist of low-power sensor nodes and a few base station nodes. They must be adaptive and efficient in data transmission to sink in various areas. This paper proposes an aware-routing protocol based on clustering and recursive search approaches. The paper focuses on the energy efficiency issue with various measures such as prolonging network lifetime along with reducing energy consumption in the sensor nodes and increasing the system reliability. Our proposed protocol consists of two phases. In the first phase (network development phase), the sensors are placed into virtual layers. The second phase (data transmission) is related to routes discovery and data transferring so it is based on virtual-based Classic-RBFS algorithm in the lake of energy problem environments but, in the nonchargeable environments, all nodes in each layer can be modeled as a random graph and then begin to be managed by the duty cycle method. Additionally, the protocol uses new topology control, data aggregation, and sleep/wake-up schemas for energy saving in the network. The simulation results show that the proposed protocol is optimal in the network lifetime and packet delivery parameters according to the present protocols.


2021 ◽  
Vol 11 (22) ◽  
pp. 10924
Author(s):  
Fatma H. Elfouly ◽  
Rabie A. Ramadan ◽  
Ahmed Y. Khedr ◽  
Ahmad Taher Azar ◽  
Kusum Yadav ◽  
...  

 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. 


Information ◽  
2019 ◽  
Vol 10 (4) ◽  
pp. 125 ◽  
Author(s):  
Liquan Zhao ◽  
Qi Tang

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.


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Jia Yanfei ◽  
Chen Guangda ◽  
Zhao Liquan

In heterogeneous wireless sensor networks, sensor nodes are randomly distributed in some regions. In some applications, they may be randomly distributed in different regions. Besides, nodes with the same type have almost the same probability to be selected as cluster head. The cluster head will consume much more energy to receive and transmit data than the other nodes. If nodes with little residual energy have been elected as cluster heads, it will affect the efficiency of the network due to its early death. An improved energy-efficient routing protocol is proposed for heterogeneous wireless sensor networks. Firstly, it supposes that the different types of nodes are distributed in different zones. Secondly, by improving the threshold, nodes with large residual energy have a greater possibility of becoming cluster heads. In the end, it designs a mixed data transmission method. The cluster heads of supper nodes and advance nodes directly transmit data to the base station. The normal nodes adopt single hops and multiple hops mixed methods to transmit data. This can minimize the energy of the communication from cluster head to base station. Simulation results show that this algorithm has achieved a longer lifetime for the wireless sensor network than stable election protocol and threshold-sensitive stable election protocol algorithm.


2021 ◽  
Vol 7 ◽  
pp. e463
Author(s):  
Walid Osamy ◽  
Ahmed Aziz ◽  
Ahmed M Khedr

Data acquisition problem in large-scale distributed Wireless Sensor Networks (WSNs) is one of the main issues that hinder the evolution of Internet of Things (IoT) technology. Recently, combination of Compressive Sensing (CS) and routing protocols has attracted much attention. An open question in this approach is how to integrate these techniques effectively for specific tasks. In this paper, we introduce an effective deterministic clustering based CS scheme (DCCS) for fog-supported heterogeneous WSNs to handle the data acquisition problem. DCCS employs the concept of fog computing, reduces total overhead and computational cost needed to self-organize sensor network by using a simple approach, and then uses CS at each sensor node to minimize the overall energy expenditure and prolong the IoT network lifetime. Additionally, the proposed scheme includes an effective algorithm for CS reconstruction called Random Selection Matching Pursuit (RSMP) to enhance the recovery process at the base station (BS) side with a complete scenario using CS. RSMP adds random selection process during the forward step to give opportunity for more columns to be selected as an estimated solution in each iteration. The results of simulation prove that the proposed technique succeeds to minimize the overall network power expenditure, prolong the network lifetime and provide better performance in CS data reconstruction.


Recent advances in electronics and wireless telecommunications provide the opportunity to design and manufacture wireless sensors with low power consumption, small size, appropriate price and various applications. These small sensors which are capable of sensing environmental data, processing and transmitting information have led to a novel idea for developing networks called wireless sensor networks (WSNs). WSNs are contains a various number of tiny small-cost, resource limited and limited energy devices that can sense, compute, store, and transmit data of surrounding environment with limited capabilities across the network to the base station. But these resource and battery limitations have direct effect on the life span of wireless sensor networks. So, authors aim to minimize the transmission energy of the network through minimizing the communication distance between each sensor nodes of the network. They proposed to improve Multi-Hop LEACH routing protocol. The network in the proposed work incorporates homogeneous types of sensors nodes randomly deployed in different portion of an environment to gather data about the environment that they are deployed. The sensors are organized in cluster-based structure to sense the different physical parameters of the environment and route the readings to a BS for visualization and data management purpose. The proposed work improved the existing routing protocol which is Multi-Hop LEACH cluster-based routing protocol by integrating the communication way of existing appropriate routing protocols. Such as: Minimum Transmission Energy and Multi-Hop LEACH cluster-based routing protocol for WSN. Authors have implemented the proposed routing protocol for WSN and the performance is evaluated using MATLAB simulation tool. Finally, Researchers present numerical results that validate the feasibility of the proposed technique. The proposed protocol achieves significant improvement in terms of network lifetime and provides improved performance energy efficiency for WSN.


Sign in / Sign up

Export Citation Format

Share Document