An Improvement of LEACH Protocol Based on Motes’ Location Information

2010 ◽  
Vol 108-111 ◽  
pp. 1176-1181
Author(s):  
Yu Jiang ◽  
Yan Chun Liang ◽  
Li Li He ◽  
Ying Hui Cao ◽  
Cheng Quan Hu
Keyword(s):  
Wireless Sensor Networks ◽  
Life Cycle ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Base Station ◽  
Experimental Results ◽  
Wireless Sensor ◽  
Location Information ◽  
Leach Protocol ◽  
Entire Network

Network’s life cycle and the energy expending rates of mote are important performance criterions for wireless sensor networks (WSN). An improved routing protocol based on LEACH was proposed in this paper to prolong the network’s life cycle. The improved routing protocol took the circumstance into consideration, that is every mote knows the location information of its own and that of the base station. We analyzed that how to use these location information to extend the mote’s life cycle. And then the extension of the entire network life cycle was achieved. Simulation on the NS2-environment was conducted. And the experimental results show that the whole network’s life cycle was extended greatly.

Research and Improvement of LEACH Protocol for Wireless Sensor Networks

2012 ◽  
Vol 562-564 ◽  
pp. 1304-1308 ◽  
Author(s):  
Qing Hui Wang ◽  
Hong Yan Guo ◽  
Yong Huan Ji
Keyword(s):  
Wireless Sensor Networks ◽  
Computer Simulation ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transfer ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Leach Protocol ◽  
Optimal Cluster

The data transfer of wireless sensor network (WSN) can not be separated with routing protocol, Energy efficiency is one of the most important factors in wireless sensor networks. In this paper based on the uneven distribution of the LEACH cluster head and the different lengths and base station communications, we present a improved LEACH algorithm which refers to remaining energy and optimal cluster heads. Computer simulation using NS2 reveals that the proposed protocol reduces the energy consumption compared with the existing LEACH protocol.

Dynamic Multi-Hop Routing Protocol in Wireless Sensor Networks

2013 ◽  
Vol 442 ◽  
pp. 532-537
Author(s):  
Xian Li Li ◽  
Jia Wei Zhang ◽  
Liang Bing Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Dominant Set ◽  
Leach Protocol ◽  
Balance Energy ◽  
Entire Network

Considering the shortage of LEACH protocol, a novel dynamic multi-hop routing protocol named Balance Energy-efficient and Real-time with Reliable communication protocol based on Connected Dominant Set (BERR-CDS) is proposed in this paper. BERR-CDS protocol fully takes account of the energy consumption of an individual node and entire network, a rational transmission path from source node to sink node is searched, aiming at the network topology changes which are caused by the death of cluster head, the invalidation of cluster member nodes and new nodes joining, BERR-CDS designs the corresponding valid mechanism to respond, and it can rapidly adapt to the topology change of network. Simulation results show that BERR-CDS protocol has better performances in term of energy consumption, network lifetime and reliability, it is an ideal routing protocol in wireless sensor networks.

scholarly journals An Improved Energy-Efficient Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (20) ◽  
pp. 4579 ◽  
Author(s):  
Yang Liu ◽  
Qiong Wu ◽  
Ting Zhao ◽  
Yong Tie ◽  
Fengshan Bai ◽  
...  
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Base Station ◽  
Wireless Sensor ◽  
Leach Protocol

Cluster-based hierarchical routing protocols play an essential role in decreasing the energy consumption of wireless sensor networks (WSNs). A low-energy adaptive clustering hierarchy (LEACH) has been proposed as an application-specific protocol architecture for WSNs. However, without considering the distribution of the cluster heads (CHs) in the rotation basis, the LEACH protocol will increase the energy consumption of the network. To improve the energy efficiency of the WSN, we propose a novel modified routing protocol in this paper. The newly proposed improved energy-efficient LEACH (IEE-LEACH) protocol considers the residual node energy and the average energy of the networks. To achieve satisfactory performance in terms of reducing the sensor energy consumption, the proposed IEE-LEACH accounts for the numbers of the optimal CHs and prohibits the nodes that are closer to the base station (BS) to join in the cluster formation. Furthermore, the proposed IEE-LEACH uses a new threshold for electing CHs among the sensor nodes, and employs single hop, multi-hop, and hybrid communications to further improve the energy efficiency of the networks. The simulation results demonstrate that, compared with some existing routing protocols, the proposed protocol substantially reduces the energy consumption of WSNs.

PERFORMANCE EVALUATION ANALYSIS OF WIRELESS SENSOR NETWORKS ROUTING PROTOCOLS IN SMART GRIDS

2016 ◽  
Vol 26 (1) ◽  
pp. 17
Author(s):  
Carlos Deyvinson Reges Bessa
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Smart Grids ◽  
Network Routing ◽  
Base Station ◽  
Wireless Sensor ◽  
Delay Jitter ◽  
La Red

ABSTRACTThis work aims to study which wireless sensor network routing protocol is more suitable for Smart Grids applications, through simulation of AODV protocols, AOMDV, DSDV and HTR in the NS2 simulation environment. Was simulated a network based on a residential area with 47 residences, with one node for each residence and one base station, located about 25m from the other nodes. Many parameters, such as packet loss, throughput, delay, jitter and energy consumption were tested.  The network was increased to 78 and 93 nodes in order to evaluate the behavior of the protocols in larger networks. The tests proved that the HTR is the routing protocol that has the best results in performance and second best in energy consumption. The DSDV had the worst performance according to the tests.Key words.- Smart grid, QoS analysis, Wireless sensor networks, Routing protocols.RESUMENEste trabajo tiene como objetivo estudiar el protocolo de enrutamiento de la red de sensores inalámbricos es más adecuado para aplicaciones de redes inteligentes, a través de la simulación de protocolos AODV, AOMDV, DSDV y HTR en el entorno de simulación NS2. Se simuló una red basada en una zona residencial con 47 residencias, con un nodo para cada residencia y una estación base, situada a unos 25 metros de los otros nodos. Muchos parámetros, tales como la pérdida de paquetes, rendimiento, retardo, jitter y el consumo de energía se probaron. La red se incrementó a 78 y 93 nodos con el fin de evaluar el comportamiento de los protocolos de redes más grandes. Las pruebas demostraron que el HTR es el protocolo de enrutamiento que tiene los mejores resultados en el rendimiento y el segundo mejor en el consumo de energía. El DSDV tuvo el peor desempeño de acuerdo a las pruebas.Palabras clave.- redes inteligentes, análisis de calidad de servicio, redes de sensores inalámbricas, protocolos de enrutamiento.

scholarly journals Fuzzy Logic-Based Geographic Routing Protocol for Dynamic Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (1) ◽  
pp. 196 ◽  
Author(s):  
Xing Hu ◽  
Linhua Ma ◽  
Yongqiang Ding ◽  
Jin Xu ◽  
Yan Li ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Fuzzy Logic ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Geographic Routing ◽  
Wireless Sensor ◽  
Location Information ◽  
Destination Node ◽  
Routing Overhead ◽  
Geographic Routing Protocol

The geographic routing protocol only requires the location information of local nodes for routing decisions, and is considered very efficient in multi-hop wireless sensor networks. However, in dynamic wireless sensor networks, it increases the routing overhead while obtaining the location information of destination nodes by using a location server algorithm. In addition, the routing void problem and location inaccuracy problem also occur in geographic routing. To solve these problems, a novel fuzzy logic-based geographic routing protocol (FLGR) is proposed. The selection criteria and parameters for the assessment of the next forwarding node are also proposed. In FLGR protocol, the next forward node can be selected based on the fuzzy location region of the destination node. Finally, the feasibility of the FLGR forwarding mode is verified and the performance of FLGR protocol is analyzed via simulation. Simulation results show that the proposed FLGR forwarding mode can effectively avoid the routing void problem. Compared with existing protocols, the FLGR protocol has lower routing overhead, and a higher packet delivery rate in a sparse network.

scholarly journals Distributed Beacon Drifting Detection for Localization in Unstable Environments

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Ming Xia ◽  
Peiliang Sun ◽  
Xiaoyan Wang ◽  
Yan Jin ◽  
Qingzhang Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Detection Algorithm ◽  
Experimental Results ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Information ◽  
Detection Accuracy ◽  
Research Issue ◽  
Fundamental Research

Localization is a fundamental research issue in wireless sensor networks (WSNs). In most existing localization schemes, several beacons are used to determine the locations of sensor nodes. These localization mechanisms are frequently based on an assumption that the locations of beacons are known. Nevertheless, for many WSN systems deployed in unstable environments, beacons may be moved unexpectedly; that is, beacons are drifting, and their location information will no longer be reliable. As a result, the accuracy of localization will be greatly affected. In this paper, we propose a distributed beacon drifting detection algorithm to locate those accidentally moved beacons. In the proposed algorithm, we designed both beacon self-scoring and beacon-to-beacon negotiation mechanisms to improve detection accuracy while keeping the algorithm lightweight. Experimental results show that the algorithm achieves its designed goals.

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 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.

Energy-Efficient Opportunistic Routing Protocol in Wireless Sensor Networks

2014 ◽  
Vol 610 ◽  
pp. 797-807
Author(s):  
Zhen Yu Zhang ◽  
Shao Jie Wen ◽  
Wen Zhong Yang ◽  
Fei Zhao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Multicast Routing ◽  
Optimal Path ◽  
Opportunistic Routing ◽  
Wireless Sensor ◽  
Network Nodes ◽  
Multicast Routing Protocol ◽  
Entire Network

The paper presents energy-efficiency opportunistic multicast routing protocol (EOMR) for the multicast energy consumption minimization problem in wireless sensor networks. The protocol divides the network into single grids, so each node determines their own coordinates according to the grid, which they locate in a certain period of time. The nodes only need to know the topology of their own grid, instead of the topology of the entire network. Nodes in the same grid determine the priority in light of the upstream and downstream links metrics, and use the opportunistic routing to send messages to the next hop. The destinations calculate the optimal path in accordance with the hops and links cost, and transmission acknowledgement to source along the optimal path selected. If all nodes in the current grid transmission messages failure, the neighbor grids are in charge of retransmission. The results of simulation show that, compared with traditional multicast routing, EOMR is effective in reducing the consumption of links cost, so that it improves the link reliability and reduces the delay.

Sign in / Sign up

Export Citation Format

Share Document