scholarly journals CLUSTER BASED ROUTING PROTOCOLS IN WSN SENSOR

2021 ◽  
Vol 9 (1) ◽  
pp. 198-206
Author(s):  
Kanak Prabha Lila Ramani, Dr. Abhishek Badholia
Keyword(s):  
Sensor Network ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Selection Process ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Sleep Mode ◽  
Local Monitoring ◽  
Intelligent Routing

Over the past few years we can observe the WSNs or Wireless Sensor Network applications in various fields increasing immensely. The energy efficiency, network lifetime and clustering process prime goal is the working network's optimization is the focus of many of the routing algorithm. Keeping in mind the network homogeneity, for network performance reinforcement we suggest instead of single path to use multiple paths. For WSNs, Reinforcement Intelligence Routing Protocol (RIRP)[1]. In the multihop wireless sensor networks an efficient and effective method for security improvements local monitoring has worked well [2]. But taking in consideration the power consumption in the current practice of local monitoring is costly. For ensuring long-lived operations in the sensor network reinforcement intelligent routing protocol is critical [3]. For ensuring both the aspects improvement in security and long-lived operations, the development of mechanism that is effective and incorporated with the Reinforcement protocol is an open problem. With the help of local monitoring to solve this issue, section of the traffic going in and out of its neighbors is supervised by each node to keep a check on any suspicious behavior like unlikely long delays in packet forwarding [4]. To integrate the existing reinforcement protocol of the network and without any niggardly in the consumption of energy in the local monitoring with the help of a protocol [5]. In comparison to other protocols in this protocol the region of instability starts later. At a constant rate the nodes of the RIRP or Reinforcement Intelligent Routing Protocol dies. Few problems such as cluster head selection process, network lifetime and network stability are evaluated and worked in the technique proposed here [6]. To reduce the overload consumption as much as possible the nodes switches in between the active and sleep mode.

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 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 and Improvement about LEACH Routing Protocol for Wireless Sensor Networks

2012 ◽  
Vol 241-244 ◽  
pp. 1028-1032
Author(s):  
Li Wang ◽  
Qi Lin Zhu
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Selection Algorithm ◽  
Energy Factor ◽  
Random Cluster ◽  
Simulation Results ◽  
Node Energy

In recent years, as the development of wireless sensor network, people do some deep researches on cluster-based protocol, most around the prolongation of the lifetime of WSN and decline of energy consumed by the sensors. This paper analyses of classical clustering routing protocol based on LEACH, aiming at the node energy foot presents energy improved clustering routing algorithm, the random cluster head selection algorithm of threshold to be changed, lowering the threshold, in the original threshold increases the node's remaining energy factor, reduces the communication load of cluster nodes, and simulation. The simulation results show that the LEACH-E improved algorithm, energy saving, reducing balance node energy consumption, effectively prolongs the network lifetime.

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.

Power Layer Energy Efficient Routing Protocol in Wireless Sensor Network (PLRP)

2013 ◽  
Vol 5 (1) ◽  
pp. 57-68 ◽  
Author(s):  
Sardjoeni Moedjiono ◽  
Aries Kusdaryono
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Sensor Node ◽  
Base Station ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Energy Efficient Routing

Preserving energy of sensor node in wireless sensor network is an effort to prolong the lifetime of network. Energy of sensor node is very crucial because battery powered and irreplaceable. Energy conservation of sensor node is an effort to reduce energy consumption in order to preserve resource for network lifetime. It can be achieved through efficient energy usage by reducing consumption of energy or decrease energy usage while achieving a similar outcome. In this paper, the authors propose power layer energy efficient routing protocol in wireless sensor network, named PLRP, which use power control and multi-hop routing protocol to control overhead of sensor node and create clustering to distribute energy dissipation and increase energy efficiency of all sensor node. The main idea of PLRP is the use of power control, which divide sensor node into group by base station uses layer of energy and maximize the computation energy in base station to reduce computational energy in sensor node for conservation of network lifetime. The performance of PLRP compared to BCDCP and BIDRP based of hierarchical routing protocol. The simulation results show that PLRP achieve 25% and 30% of improvement on network lifetime.

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.

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 Trust-based energy-efficient routing protocol for Internet of things–based sensor networks

2020 ◽  
Vol 16 (10) ◽  
pp. 155014772096435 ◽  
Author(s):  
Muhammad Ilyas ◽  
Zahid Ullah ◽  
Fakhri Alam Khan ◽  
Muhammad Hasanain Chaudary ◽  
Muhammad Sheraz Arshed Malik ◽  
...  
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Internet Of Things ◽  
Sensor Network ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Network Throughput ◽  
Link Quality ◽  
Wireless Sensor ◽  
Packet Latency

Internet of things grew swiftly and many services, software, sensors-embedded electronic devices and related protocols were developed and still in progress with full swing. Internet of things enabling physically existing things to see, hear, think and perform a notable task by allowing them to talk to each other and share useful information while making decision and caring-on/out their important tasks. Internet of things is greatly promoted by wireless sensor network as it becomes a perpetual layer for it. Wireless sensor network works as a base-stone for most of the Internet of things applications. There are severe general and specific threats and technical challenges to Internet of things–based sensor networks which must overcome to ensure adaptation and diffusion of it. Most of the limitations of wireless sensor networks are due to its resource constraint objects nature. The specified open research challenges in Internet of things–based sensor network are power consumption, network lifespan, network throughput, routing and network security. To overcome aforementioned problems, this work aimed to prolong network lifetime, improve throughput, decrease packet latency/packet loss and further improvise in encountering malicious nodes. To further tune the network lifetime in terms of energy, wireless harvesting energy is suggested in proposed three-layer cluster-based wireless sensor network routing protocol. The proposed mechanism is a three-tier clustering technique with implanted security mechanism to encounter malicious activities of sensor nodes and to slant them into blacklist. It is a centred-based clustering protocol, where selection of cluster head and grid head is carried out by sink node based on the value of its cost function. Moreover, hardware-based link quality estimators are used to check link effectiveness and to further improve routing efficiency. At the end, excessive experiments have been carried out to check efficacy of the proposed protocol. It outperforms most of its counterpart protocols such as fuzzy logic–based unequal clustering and ant colony optimization–based routing hybrid, Artificial Bee Colony-SD, enhanced three-layer hybrid clustering mechanism and energy aware multi-hop routing in terms of network lifetime, network throughput, average energy consumption and packet latency.

scholarly journals Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

Sign in / Sign up

Export Citation Format

Share Document