scholarly journals Pengembangan mekanisme grid based clustering untuk peningkatan kinerja LEACH pada lingkungan Wireless Sensor Network

2019 ◽  
Vol 5 (2) ◽  
pp. 164
Author(s):  
Kristoforus Fallo ◽  
Waskitho Wibisono ◽  
Kun Nursyaful Priyo Pamungkas
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Cluster Center ◽  
Adaptive Clustering ◽  
Leach Protocol ◽  
Grid Based

Development of a grid-based clustering mechanism to improve LEACH performance in the Wireless Sensor Network environmentLow Energy Adaptive Clustering Hierarchy (LEACH) merupakan algoritma routing pada Wireless Sensor Network (WSN) berbasis cluster. LEACH memilih sebuah node sebagai cluster head (CH) yang tugasnya untuk melakukan komunikasi dengan sink maupun guna mengumpulkan data dari member node. Persebaran CH pada LEACH yang dikatakan acak, kadang mengalami masalah mengingat rumus probabilitas pada tiap round. Hal ini akan menyebabkan CH yang terpilih bisa berada di tepi area, juga terjadinya pemborosan energi karena jalur yang terbentuk akan menjadi panjang. Oleh karena itu, kami ingin mengembangkan routing protocol G-LEACH menggunakan teknik merge CH dalam suatu area (grid) disertai beberapa parameter yang relevan, seperti posisi node, node dengan sisa energi terbesar, dan jarak yang dihitung dalam tiga jarak yaitu jarak node menuju cluster center, jarak node menuju merge CH, dan jarak merge CH menuju sink. Hasil pengujian menunjukan bahwa dengan menggabungkan cluster (merge CH) pada transmisi data menuju sink pada protokol G-LEACH dapat menghasilkan masa hidup jaringan yang lebih lama pada seluruh operasi node, energi yang dibutuhkan pada semua node lebih rendah, dan lebih banyak paket data yang dikirim dan diterima oleh sink. Low Energy Adaptive Clustering Hierarchy (LEACH) is a routing algorithm in a cluster-based Wireless Sensor Network (WSN). LEACH selects a node as a cluster head (CH) whose responsibility is for communicating with sinks and collect data from the node members. The distribution of CH on LEACH, which is basically random, sometimes has a problem in remembering the probability formula on each round. This may make the selected CH on the edge of the area as well as generate energy waste because the pathway formed will be lengthy. Therefore, we would like to develop the G-LEACH routing protocol using a merge CH technique in one area (grid) with several relevant parameters, such as the position of the node, the node with the largest remaining energy, and the distance calculated in three distances: the distance of the node to the clustercenter, the distance of the node to the merge CH, and the distance of the merge CH to the sink. The test result showed that combining clusters (merge CH) in the data transmission to the sink in the G-LEACH protocol could produce a longer network life on all node operations, lower energy required for all nodes, and more data package sent and received by the sink.

Research on Routing Protocol for Wireless Sensor Network Based on Ant-Colony Algorithm

2013 ◽  
Vol 411-414 ◽  
pp. 716-720
Author(s):  
Lei Sang ◽  
Duo Long
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Destination Node ◽  
Head Node

Routing protocol is mainly responsible for seeking optimized path between source node and destination node and forwarding data package along the optimized path in a right way, which is a core link in wireless sensor network. In this thesis, a research on WSN routing algorithm based on ant-colony algorithm is done, targeting the features of WSN and on the basis of the analysis of classic routing protocol. Comparison and analysis of the path and convergence rate of cluster head node are done by means of emulated analysis, which is to some extent innovative and significant to research.

scholarly journals An Energy-Balanced Routing Protocol for a Wireless Sensor Network

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Lin Li ◽  
Donghui Li
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Cluster Head ◽  
Low Energy ◽  
Fuzzy Rules ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Energy Balanced Routing

The wireless sensor network is an intelligent self-organizing network which consists of many sensor nodes deployed in the monitoring area. The greatest challenge of designing a wireless sensor network is to balance the energy consumption and prolong the lifetime of the network, seeing that the nodes can be powered only by batteries in most conditions. An energy-balanced routing protocol (EBRP) for wireless sensor networks is proposed in this paper. In EBRP, we divide the network into several clusters by using K-means++ algorithm and select the cluster head by using the fuzzy logical system (FLS). Since the previous researches did not demonstrate how to get the fuzzy rules for different networks, we propose a genetic algorithm (GA) to obtain the fuzzy rules. We code the rules as a chromosome, and the lifetime of the network is treated as a fit function. Then, through the selection, crossover, and mutation of each generation, the best offspring can be decoded as the best rule for each network model. Through the simulation, comparing with the existing routing protocols such as low-energy adaptive clustering hierarchy (LEACH), low-energy adaptive clustering hierarchy-centralized (LEACH-C), and stable election protocol (SEP), the EBRP prolongs the network lifetime (first node dies) by 57%, 63%, and 63%, respectively.

Improvement on LEACH Protocol of Wireless Sensor Network

2013 ◽  
Vol 347-350 ◽  
pp. 1738-1742 ◽  
Author(s):  
Xiao Wen Ma ◽  
Xiang Yu
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Routing ◽  
Leach Protocol ◽  
Steady State Simulation

Wireless sensor networks comprise of minor battery driven devices with restricted energy resources.Once installed,the minor sensor nodes are usually unapproachable to the operator, and thus auxiliary of the energy source is not practicable.Hence,energy proficiency is a vital design issue that needs to be boosted in order to increase the lifetime of the network. LEACH is a popular hierarchical routing protocol which efficiently maintains the energy storage of nodes in Wireless Sensor Network (WSN).The nodes using LEACH are divided into clusters.The advantage of LEACH is that each node has the equal probability to be a cluster head,which makes the energy dissipation of each node be relatively balanced. This paper studies LEACH protocol, and focuses on how to decide the next hop nodes more reasonable when the data are transmitted at the steady state. Simulation has been done in NS2 and the results show that the algorithm after improved is more energy-efficient than LEACH protocol.

scholarly journals Unequal Clustering Multipath Routing Algorithm for Wireless Sensor Network based on Clustering and Ant Colony

2021 ◽  
Vol 3 (3) ◽  
pp. 156-160
Author(s):  
Jin Yong-xian
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Multipath Routing ◽  
Cluster Head ◽  
Optimal Number ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Selection Probability ◽  
Factor Node

To improve the energy efficiency of the wireless sensor network (WSN), and extend the network life. This paper proposes an improved unequal clustering multipath routing algorithm (UCMRA). The algorithm improves the formula of cluster head selection probability and competition radius, and considers the energy factor, node density, optimal number of cluster heads, etc. Experimental results show that, compared with the traditional algorithm, UCMRA has more stable cluster head distribution, less energy consumption and longer network lifetime.

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.

Sign in / Sign up

Export Citation Format

Share Document