scholarly journals AR-RBFS: Aware-Routing Protocol Based on Recursive Best-First Search Algorithm for Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Farzad Kiani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Data Transmission ◽  
Search Algorithm ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Second Phase

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.

scholarly journals A hierarchical clustering-based routing protocol applied for wireless sensor networks

2021 ◽  
Author(s):  
Yongyu Jia
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Hierarchical Clustering ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Reference Model ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cross Layer Design

In this thesis, we propose a two-level hierarchical clustering-based routing protocol for wireless sensor networks (WSNs). WSNs consist of hundreds of thousands of energy-limited sensor nodes that are densely deployed in a large geographical region. Once deployed, the replacement of the energy sources of these sensor nodes is usually not feasible. Hence, energy efficiency is always a key design issue that needs to be enhanced in the WSN to improve the life span of the entire network. Each layer of the Open System Interconnect (OSI) Reference Model should be considered when exploiting the energy constrain in the WSN, the routing protocol proposed in this thesis, which is called the Clustering-Based Expanding-Ring Routing Protocol (CBERRP), lies mainly on the network layer. CBERRP gains the preferred performance over two typical clustering-based routing schemes in terms of network lifetime, power consumption and throughput by adopting the concept of cross-layer design. CBERRP is centralized-controlled by the base station and utilizes the two-level hierarchical structure of clusters (level-I) and chains (level-II) to route and forward the sensed data from the WSN to the base station. In addition, CBERRP can be fine-tuned to support multiple Data Aggregation Qualities for the WSN applications. The performance of CBERRP is compared to analogous clustering-based schemes such as Low-Energy Adaptive Clustering Hierarchy (LEACH) and LEACH-centralized (LEACH-C). The simulation results show that CBERRP presents a significant improvement over these two schemes on the performance of overall consumption and the network lifetime by around 50% and 100%, respectively

scholarly journals A hierarchical clustering-based routing protocol applied for wireless sensor networks

2021 ◽  
Author(s):  
Yongyu Jia
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Hierarchical Clustering ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Reference Model ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cross Layer Design

In this thesis, we propose a two-level hierarchical clustering-based routing protocol for wireless sensor networks (WSNs). WSNs consist of hundreds of thousands of energy-limited sensor nodes that are densely deployed in a large geographical region. Once deployed, the replacement of the energy sources of these sensor nodes is usually not feasible. Hence, energy efficiency is always a key design issue that needs to be enhanced in the WSN to improve the life span of the entire network. Each layer of the Open System Interconnect (OSI) Reference Model should be considered when exploiting the energy constrain in the WSN, the routing protocol proposed in this thesis, which is called the Clustering-Based Expanding-Ring Routing Protocol (CBERRP), lies mainly on the network layer. CBERRP gains the preferred performance over two typical clustering-based routing schemes in terms of network lifetime, power consumption and throughput by adopting the concept of cross-layer design. CBERRP is centralized-controlled by the base station and utilizes the two-level hierarchical structure of clusters (level-I) and chains (level-II) to route and forward the sensed data from the WSN to the base station. In addition, CBERRP can be fine-tuned to support multiple Data Aggregation Qualities for the WSN applications. The performance of CBERRP is compared to analogous clustering-based schemes such as Low-Energy Adaptive Clustering Hierarchy (LEACH) and LEACH-centralized (LEACH-C). The simulation results show that CBERRP presents a significant improvement over these two schemes on the performance of overall consumption and the network lifetime by around 50% and 100%, respectively

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 Energy-efficient hierarchical routing in wireless sensor networks based on Fog Computing

2020 ◽  
Author(s):  
Ademola Abidoye ◽  
Boniface Kabaso
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Energy Efficient ◽  
Fog Computing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Routing

Abstract Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the 21st century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize energy consumption of sensor nodes so as to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called Energy-Efficient Hierarchical routing protocol for wireless sensor networks based on Fog Computing (EEHFC). Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of Things applications. In addition, we propose an improved ant colony optimization (ACO) algorithm that can be used to construct optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses and extends the network lifetime

scholarly journals Performance Analysis of Q-Leach Algorithm in WSN

2020 ◽  
Vol 5 (10) ◽  
pp. 1-4
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Short Range ◽  
Sensor Node ◽  
Life Time ◽  
Time Span ◽  
Sensor Nodes ◽  
Wireless Sensor

Sensor nodes are exceedingly energy compelled instrument, since it is battery operated instruments. In wsn network, every node is liable to the data transmission through the wireless mode [1]. Wireless sensor networks (WSN) is made of a huge no. of small nodes with confined functionality. The essential theme of the wireless sensor network is energy helpless and the WSN is collection of sensor. Every sensor terminal is liable to sensing, store and information clan and send it forwards into sink. The communication within the node is done via wireless network [3].Energy efficiency is the main concentration of a desining the better routing protocol. LEACH is a protocol. This is appropriate for short range network, since imagine that whole sensor node is capable of communication with inter alia and efficient to access sink node, which is not always correct for a big network. Hence, coverage is a problem which we attempt to resolve [6]. The main focus within wireless sensor networks is to increase the network life-time span as much as possible, so that resources can be utilizes efficiently and optimally. Various approaches which are based on the clustering are very much optimal in functionality. Life-time of the network is always connected with sensor node’s energy implemented at distant regions for stable and defect bearable observation [10].

scholarly journals Energy Efficient Trust Node Based Routing Protocol (EETRP) to Maximize the Lifetime of Wireless Sensor Networks in Plateaus

2019 ◽  
Vol 15 (06) ◽  
pp. 113 ◽  
Author(s):  
Nandoori Srikanth ◽  
Muktyala Sivaganga Prasad
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Energy Limitation

<p>Wireless Sensor Networks (WSNs) can extant the individual profits and suppleness with regard to low-power and economical quick deployment for numerous applications. WSNs are widely utilized in medical health care, environmental monitoring, emergencies and remote control areas. Introducing of mobile nodes in clusters is a traditional approach, to assemble the data from sensor nodes and forward to the Base station. Energy efficiency and lifetime improvements are key research areas from past few decades. In this research, to solve the energy limitation to upsurge the network lifetime, Energy efficient trust node based routing protocol is proposed. An experimental validation of framework is focused on Packet Delivery Ratio, network lifetime, throughput, energy consumption and network loss among all other challenges. This protocol assigns some high energy nodes as trusted nodes, and it decides the mobility of data collector.  The energy of mobile nodes, and sensor nodes can save up to a great extent by collecting data from trusted nodes based on their trustworthiness and energy efficiency.  The simulation outcome of our evaluation shows an improvement in all these parameters than existing clustering and Routing algorithms.<strong></strong></p>

scholarly journals A PSO-Based Uneven Dynamic Clustering Multi-Hop Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Energy Efficient Routing

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.

Performance Analysis of Multi-Hop Routing Protocol With Optimized Grid-Based Clustering for Wireless Sensor Network

2020 ◽  
pp. 254-282
Author(s):  
Saloni Dhiman ◽  
Deepti Kakkar ◽  
Gurjot Kaur
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Performance Analysis ◽  
Sensor Network ◽  
Routing Protocol ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Grid Based

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.

scholarly journals Energy-Efficient Unequal Chain Length Clustering for Wireless Sensor Networks in Smart Cities

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Mohammad Baniata ◽  
Jiman Hong
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Chain Length ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Smart Cities ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor

The recent advances in sensing and communication technologies such as wireless sensor networks (WSN) have enabled low-priced distributed monitoring systems that are the foundation of smart cities. These advances are also helping to monitor smart cities and making our living environments workable. However, sensor nodes are constrained in energy supply if they have no constant power supply. Moreover, communication links can be easily failed because of unequal node energy depletion. The energy constraints and link failures affect the performance and quality of the sensor network. Therefore, designing a routing protocol that minimizes energy consumption and maximizes the network lifetime should be considered in the design of the routing protocol for WSN. In this paper, we propose an Energy-Efficient Unequal Chain Length Clustering (EEUCLC) protocol which has a suboptimal multihop routing algorithm to reduce the burden on the cluster head and a probability-based cluster head selection algorithm to prolong the network lifetime. Simulation results show that the EEUCLC mechanism enhanced the energy balance and prolonged the network lifetime compared to other related protocols.

scholarly journals MQoSR: A Multiobjective QoS Routing Protocol for Wireless Sensor Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Hind Alwan ◽  
Anjali Agarwal
Keyword(s):  
Wireless Sensor Networks ◽  
Quality Of Service ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Data Transmission ◽  
Qos Routing ◽  
Wireless Sensor ◽  
Data Delivery

With the growing demand for quality-of-service (QoS) aware routing protocol in wireless networks, QoS-based routing has emerged as an interesting research topic. Quality of service guarantee in wireless sensor networks (WSNs) is difficult and more challenging due to the fact that the available resources of sensors and the various applications running over these networks have different constraints in their nature and requirements. In this paper, we present a heuristic neighbor selection mechanism in WSNs that uses the geographic routing mechanism combined with the QoS requirements to provide multiobjective QoS routing (MQoSR) for different application requirements. The problem of providing QoS routing is formulated as link, and path-based metrics. The link-based metrics are partitioned in terms of reliability, delay, distance to sink, and energy, and the path-based metrics are presented in terms of end-to-end delay, reliability of data transmission, and network lifetime. The simulation results demonstrate that MQoSR protocol is able to achieve the delay requirements, and due to optimum path selection process, the achieved data delivery ratio is always above the required one. MQoSR protocol outperforms the existing model in the literature remarkably in terms of reliable data transmission, time data delivery, and routing overhead and underlines the importance of energy-efficient solution to enhance network lifetime.

Sign in / Sign up

Export Citation Format

Share Document