scholarly journals Metode Routing Protokol LEACH pada Jaringan Sensor Nirkabel Studi Kasus Sistem Pemantauan Suhu dan Kelembaban Udara

2019 ◽  
Vol 9 (1) ◽  
pp. 87
Author(s):  
Raden Sumiharto ◽  
Rosyidatul Ilma ◽  
Rif’Atunnisa Rif’Atunnisa
Keyword(s):  
Energy Efficiency ◽  
Network Lifetime ◽  
Sensor Node ◽  
Selection Process ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Change Mechanism ◽  
Ch Selection

Wireless Sensor Network (WSN) is a wireless network consisting of a group of nodes scattered in a certain area. Each node has the ability to gather data around it and communicate with other nodes. In WSN, energy efficiency is important to maintain the lifetime of a network. A WSN consisting of several clusters and having a Cluster Head (CH) in each cluster requires a CH change mechanism in each cluster so that the network lifetime is longer.The LEACH algorithm is implemented on a system consisting of 9 sensor nodes and 1 sink node. Each sensor node monitors the temperature and humidity of the surrounding air. System testing is done by varying the number of data snippets per CH selection process in each LEACH cycle. Based on the results of testing, the application of the LEACH algorithm can increase network lifetime. The LEACH algorithm with 70 data snippets is an optimal state that results in a network lifetime of 7,387 seconds, whereas with the same number of data snippets when using a non-LEACH algorithm the network lifetime can only reach 5,565 seconds. 

scholarly journals Qualification of Cluster Header and Cluster Member in Wireless Sensor Networks

2019 ◽  
Vol 8 (2S6) ◽  
pp. 101-105
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Sensor Node ◽  
Data Transfer ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node

Many researches have been proposed for efficiency of data transmission from sensor nodes to sink node for energy efficiency in wireless sensor networks. Among them, cluster-based methods have been preferred In this study, we used the angle formed with the sink node and the distance of the cluster members to calculate the probability of cluster head. Each sensor node sends measurement values to header candidates, and the header candidate node measures the probability value of the header with the value received from its candidate member nodes. To construct the cluster members, the data transfer direction is considered. We consider angle, distance, and direction as cluster header possibility value. Experimental results show that data transmission is proceeding in the direction of going to the sink node. We calculated and displayed the header possibility value of the neighbor nodes of the sensor node and confirmed the candidates of the cluster header for data transfer as the value. In this study, residual energy amount of each sensor node is not considered. In the next study, we calculate the value considering the residual energy amount of the node when measuring the header possibility value of the cluster.

Level and Cluster Based Routing for Wireless Sensor Network

2013 ◽  
Vol 321-324 ◽  
pp. 515-522 ◽  
Author(s):  
Kou Lin Yuan ◽  
Lin Qiao ◽  
Lei Han
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Sensor Node ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Method ◽  
Sink Node ◽  
Head Node ◽  
Cluster Based Routing

This paper proposes a level and cluster based routing approach for a wireless sensor network. Nodes in the network are divided into several levels according to their hops to sink node. Every sensor node has a level number. Using level information, a sensor node can send messages to a sink node in a more efficient way, and a sink node can easily locate other sensor nodes. To make network more balanced, the paper introduces a cluster method, which splits nodes in the same level into different clusters, and chooses a cluster head for every cluster, to switch nodes in the cluster to work in turn. Unlike all other cluster routing methods, a cluster head node takes schedule jobs of sensor nodes in the cluster according to their energy left, instead of sensing. The paper also presents several algorithms for constructing a wireless sensor network, querying and scheduling. The simulation experiment shows that the scalability of our method is approximately linear.

scholarly journals LOCATION AWARE CLUSTER BASED ROUTING IN WIRELESS SENSOR NETWORKS

2015 ◽  
pp. 36-41
Author(s):  
S. JERUSHA ◽  
K. KULOTHUNGAN ◽  
A Kannan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Network ◽  
Network Lifetime ◽  
Minimum Distance ◽  
Sensor Node ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor

Wireless sensor nodes are usually embedded in the physical environment and report sensed data to a central base station. Clustering is one of the most challenging issues in wireless sensor networks. This paper proposes a new cluster scheme for wireless sensor network by modified the K means clustering algorithm. Sensor nodes are deployed in a harsh environment and randomly scattered in the region of interest and are deployed in a flat architecture. The transmission of packet will reduce the network lifetime. Thus, clustering scheme is required to avoid network traffic and increase overall network lifetime. In order to cluster the sensor nodes that are deployed in the sensor network, the location information of each sensor node should be known. By knowing the location of the each sensor node in the wireless sensor network, clustering is formed based on the highest residual energy and minimum distance from the base station. Among the group of nodes, one node is elected as a cluster head using centroid method. The minimum distance between the cluster node’s and the centroid point is elected as a cluster head. Clustering of nodes can minimize the residual energy and maximize the network performance. This improves the overall network lifetime and reduces network traffic.

WSN Lifetime and Reliability Analysis From the Death Criterion Perspective

2017 ◽  
Vol 8 (3) ◽  
pp. 37-51
Author(s):  
Sara Nouh ◽  
Nada Elgaml ◽  
Ahmed Khattab ◽  
Samy S. Soliman ◽  
Ramez M. Daoud ◽  
...  
Keyword(s):  
Energy Efficiency ◽  
Network Lifetime ◽  
Selection Process ◽  
The Other ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wsn Lifetime ◽  
The One ◽  
The Impact ◽  
Node Failures

Wireless Sensor Networks (WSNs) are widely used in numerous critical applications, and require the network to have a prolonged lifetime and high tolerance to failures. However, the battery-operated sensor nodes used in WSNs cause the network to be resource-constrained. On the one hand, there is a continuous urge to efficiently exploit the WSN energy, and hence, prolong the network lifetime. On the other hand, WSN node failures are not only attributed to battery drain. Node failures can be caused by hardware or software malfunctioning. In this article, the authors assess the impact of the death criterion on the network lifetime and reliability. It is related how the data from the different sensors are aggregated to the death criterion. Additionally, the impact of the number of sensing cycles per network master on the network lifetime and energy efficiency for the different considered death criteria. The effect of the network master selection process on the energy efficiency is also examined. Finally, the impact of the death criterion on the reliability of the WSN is evaluated.

Clustering Algorithms for Wireless Sensor Networks Survey

2020 ◽  
Vol 18 (2) ◽  
pp. 143-149
Author(s):  
Sathyapriya Loganathan ◽  
Jawahar Arumugam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Sensor Node ◽  
Cluster Formation ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node

This paper aims to discuss a comprehensive survey on clustering algorithms for wireless sensor networks (WSN). The several real-time applications adopted the WSN with the advance features. But the capacity and size of the battery used in the sensor nodes are limited. Battery replacement or recharging is very difficult in most outdoor applications. Hence handling this kind of network is one of the issues. One of the best solutions to the energy issue is Clustering. Clustering is to balance the energy consumption of the whole network by cluster-based architecture to prolong the network lifetime. Sensor nodes grouped into clusters; one sensor node selects as the cluster head for each cluster. The cluster head sensor node collects the data from their sensor member nodes and forwards them to the sink node. In cluster-based architecture, cluster formation and the selection of the cluster head node decides the network lifetime. The paper discusses the for and against various clustering algorithms. It suggests the vital parameters for developing energy-efficient clustering algorithms and steps to overcome the limitations.

scholarly journals Optimization of Energy Efficient Advance Leach Protocol

2021 ◽  
Vol 9 (5) ◽  
pp. 07-16
Author(s):  
Sandeep Kaur ◽  
Dr. Rajeev Bedi ◽  
Mohit Marwaha
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Conservation ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Sensor Node ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Leach Protocol

In WSNs, the only source to save life for the node is the battery consumption. During communication with other area nodes or sensing activities consumes a lot of power energy in processing the data and transmitting the collected/selected data to the sink. In wireless sensor networks, energy conservation is directly to the network lifetime and energy plays an important role in the cluster head selection. A new threshold has been formulated for cluster head selection, which is based on remaining energy of the sensor node and the distance from the base station. Proposed approach selects the cluster head nearer to base station having maximum remaining energy than any other sensor node in multi-hop communication. The multi hop approach minimizing the inter cluster communication without effecting the data reliability.

A Node Authentication Model in Wireless Sensor Networks With Locked Cluster Generation

2021 ◽  
pp. 236-250
Author(s):  
C. R. Bharathi ◽  
Alapati Naresh ◽  
Arepalli Peda Gopi ◽  
Lakshman Narayana Vejendla
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Cluster Formation ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Generation ◽  
Secure Network

In wireless sensor networks (WSN), the majority of the inquiries are issued at the base station. WSN applications frequently require collaboration among countless sensor nodes in a network. One precedent is to persistently screen a region and report occasions. A sensor node in a WSN is initially allocated with an energy level, and based on the tasks of that sensor node, energy will be reduced. In this chapter, two proposed methods for secure network cluster formation and authentication are discussed. When a network is established then all the nodes in it must register with cluster head and then authentication is performed. The selection of cluster head is done using a novel selection algorithm and for authenticating the nodes. Also, a novel algorithm for authentication is used in this chapter. The validation and authorization of nodes are carried over by managing the keys in WSN. The results have been analyzed using NS2 simulator with an aid of list of relevant parameters.

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>

Salp

2020 ◽  
pp. 41-56 ◽  
Author(s):  
Vrajesh Kumar Chawra ◽  
Govind P. Gupta
Keyword(s):  
Wireless Sensor Networks ◽  
Network Lifetime ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Research Issue ◽  
Energy Hole ◽  
Node Clustering

The formation of the unequal clusters of the sensor nodes is a burning research issue in wireless sensor networks (WSN). Energy-hole and non-uniform load assignment are two major issues in most of the existing node clustering schemes. This affects the network lifetime of WSN. Salp optimization-based algorithm is used to solve these problems. The proposed algorithm is used for cluster head selection. The performance of the proposed scheme is compared with the two-node clustering scheme in the term of residual energy, energy consumption, and network lifetime. The results show the proposed scheme outperforms the existing protocols in term of network lifetime under different network configurations.

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.

Sign in / Sign up

Export Citation Format

Share Document