scholarly journals Detection of Compromised Nodes in Wireless Sensor Networks using GPSR Protocol and Iterative Filtering Algorithm

2016 ◽  
Vol 1 (3) ◽  
pp. 141-148
Author(s):  
R. Ramalakshmi ◽  
S. Subash Prabhu ◽  
C. Balasubramanian
Keyword(s):  
Sensor Node ◽  
Cluster Head ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Surrounding Area ◽  
Filtering Algorithm ◽  
Iterative Filtering ◽  
Time And Energy

The sensor network is used to observe surrounding area gathered and spread the information to other sink. The advantage of this network is used to improve life time and energy. The first sensor node or group of sensor nodes in the network runs out of energy. The aggregator node can send aggregate value to the base station. The sensor node can be used to assign initial weights for each node. This sensor node calculates weight for each node. Which sensor node weight should be lowest amount they can act as a cluster head. The joint node can send false data to the aggregator node and then these node controls to adversary. The dependability at any given instant represents an comprehensive behavior of participate to be various types of defects and misconduct. The adversary can send information to aggregator node then complexity will be occurred. These nodes are used to reduce the energy and band width.

scholarly journals Detection of Compromised Nodes in Wireless Sensor Networks using GPSR Protocol and Iterative Filtering Algorithm

2020 ◽  
Vol 1 (3) ◽  
pp. 141-148
Author(s):  
R. Ramalakshmi ◽  
S. Subash Prabhu ◽  
C. Balasubramanianb
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Node ◽  
Cluster Head ◽  
Life Time ◽  
Base Station ◽  
Wireless Sensor ◽  
Surrounding Area ◽  
Filtering Algorithm ◽  
Iterative Filtering ◽  
Time And Energy

The sensor network is used to observe surrounding area gathered and spread the information to other sink.The advantage of this network is used to improve life time and energy. The first sensor node or group of sensor nodesin the network runs out of energy. The aggregator node can send aggregate value to the base station. The sensornode can be used to assign initial weights for each node. This sensor node calculates weight for each node. Whichsensor node weight should be lowest amount they can act as a cluster head. The joint node can send false data to theaggregator node and then these node controls to adversary. The dependability at any given instant represents ancomprehensive behavior of participate to be various types of defects and misconduct. The adversary can sendinformation to aggregator node then complexity will be occurred. These nodes are used to reduce the energy andband width.

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.

Design of Hybridized Wireless Sensor Network using K-Means Clustering and Genetic Algorithm

2017 ◽  
Vol 2 (5) ◽  
pp. 1-6
Author(s):  
M. D. Gbolagade ◽  
R. G. Jimoh ◽  
K. A. Gbolagade ◽  
O. V. Mejabi
Keyword(s):  
Data Transfer ◽  
Cluster Head ◽  
Simulated Data ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Battery Life ◽  
Cluster Heads ◽  
Main Challenge

Prolonging the network lifetime in wireless sensor networks (WSNs), Clustering has been recognized has one of the significant methods in achieving this, It entails grouping of sensor nodes into clusters and electing cluster heads (CHs) for all the clusters. CH’s accept data from relevant cluster’s nodes and forward the aggregate data to base station. A main challenge in WSNs is the selection of appropriate cluster heads. This work proposes a system that is efficient, scalable and load balanced. The proposed scheme combines two known algorithms namely k-means clustering and genetic algorithms based on the weaknesses identified in the two. The simulated data is obtained through the enhancement of clustering by the cluster head (base station) that helps in locating the nearest node that is important in the data transfer instead of transferring to a node that is not necessary, thereby wasting time and resources. The obtained simulation results indicate that this approach is efficient and last longer in elongating the battery life time than the conventional method by 60%.

Clustering Algorithm to Reduce Power Consumptions for Wireless Sensor Networks

2012 ◽  
Vol 433-440 ◽  
pp. 5228-5232
Author(s):  
Mohammad Ahmadi ◽  
Hamid Faraji ◽  
Hossien Zohrevand
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Cluster Heads

A sensor network has many sensor nodes with limited energy. One of the important issues in these networks is the increase of the life time of the network. In this article, a clustering algorithm is introduced for wireless sensor networks that considering the parameters of distance and remaining energy of each node in the process of cluster head selection. The introduced algorithm is able to reduce the amount of consumed energy in the network. In this algorithm, the nodes that have more energy and less distance from the base station more probably will become cluster heads. Also, we use algorithm for finding the shortest path between cluster heads and base station. The results of simulation with the help of Matlab software show that the proposed algorithm increase the life time of the network compared with LEACH algorithm.

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.

scholarly journals A Secure Data Aggregation Technique for Wireless Sensor Networks Using Iterative Filtering

2018 ◽  
Vol 11 (1) ◽  
pp. 284
Author(s):  
Jyothi R ◽  
Nagaraj G Cholli
Keyword(s):  
Data Aggregation ◽  
Cluster Head ◽  
Computation Time ◽  
Life Time ◽  
Base Station ◽  
Wireless Sensor ◽  
Data Traffic ◽  
Time Data ◽  
Efficient Manner ◽  
Iterative Filtering

<p>Wireless sensor system are accumulation of sensor hubs which send the detected information to sink hub. As sensor hubs are constrained to computational power and vitality asset, a vitality proficient usage of assets are basic keeping in mind the end goal to utilize organize for longer length. Hence data traffic inside network and large amount of data sending to base station need to be reduced. The main goal of data aggregation is to enhance the network life time by gathering an aggregate data in an energy efficient manner. Iterative Filtering algorithm are more reliable and efficient compared to existing method and it provides the way for aggregating the data at secure level and data trustworthiness. In order to strengthen security levels at cluster head cryptographic algorithm such as RSA algorithm is used to encrypt the aggregated data by   using public key and decrypt data at base station by using its own private key. Where this method is responsible for securing the information that is aggregated at cluster head and also secures the information passed through the networks. The simulation results shows that proposed method consumes less computation time, data transmitting, high security and   has a good storage capacity than compared to existing algorithm.</p>

ROUTING PATH OPTIMIZAION TO MAXIMIZE THE LIFETIME OF WIRELESS SENSOR NETWORK

2009 ◽  
Vol 16 (06) ◽  
pp. 509-520
Author(s):  
P. MANJUNATHA ◽  
A. K. VERMA ◽  
A. SRIVIDYA
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Sensor Node ◽  
Minimum Energy ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing

Wireless sensor network (WSN) consists of a large number of sensor nodes which are able to sense their environment and communicate with each other using wireless interface. However these sensor nodes are constrained in energy capacity. The lifetimes of sensor node and sensor network mainly depends upon these energy resources. To increase the life time of sensor network, many approaches have been proposed to optimize the energy usage. All these proposed protocols mainly use minimum hop or minimum energy path. Continuously using the shortest path will deplete energy of the nodes at a much faster rate and causes network partition. This paper proposes an energy efficient routing protocol to extend the network lifetime for delay constrained network. Each sensor node selects the optimized path for forwarding packets to the base station based on routing metrics. Proposed studies and simulation results shows that the protocol put forward in the paper can achieve higher network lifetime by striking a balance between the delay and power consumption in comparison to other routing protocols.

Performance Analysis of RNC Clustering Protocol in Wireless Sensor Network

2019 ◽  
Vol 10 ◽  
Author(s):  
Piyush Rawat ◽  
Siddhartha Chauhan
Keyword(s):  
Energy Consumption ◽  
Network Performance ◽  
Energy Levels ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Threshold Function ◽  
Efficient Manner ◽  
Clustering Protocol

Background and Objective: The functionalities of wireless sensor networks (WSN) are growing in various areas, so to handle the energy consumption of network in an efficient manner is a challenging task. The sensor nodes in the WSN are equipped with limited battery power, so there is a need to utilize the sensor power in an efficient way. The clustering of nodes in the network is one of the ways to handle the limited energy of nodes to enhance the lifetime of the network for its longer working without failure. Methods: The proposed approach is based on forming a cluster of various sensor nodes and then selecting a sensor as cluster head (CH). The heterogeneous sensor nodes are used in the proposed approach in which sensors are provided with different energy levels. The selection of an efficient node as CH can help in enhancing the network lifetime. The threshold function and random function are used for selecting the cluster head among various sensors for selecting the efficient node as CH. Various performance parameters such as network lifespan, packets transferred to the base station (BS) and energy consumption are used to perform the comparison between the proposed technique and previous approaches. Results and Discussion: To validate the working of the proposed technique the simulation is performed in MATLAB simulator. The proposed approach has enhanced the lifetime of the network as compared to the existing approaches. The proposed algorithm is compared with various existing techniques to measure its performance and effectiveness. The sensor nodes are randomly deployed in a 100m*100m area. Conclusion: The simulation results showed that the proposed technique has enhanced the lifespan of the network by utilizing the node’s energy in an efficient manner and reduced the consumption of energy for better network performance.

scholarly journals Energy Consumption Based Low Energy Aware Gateway (LEAG) Protocol in Wireless Sensor Networks

2019 ◽  
Vol 8 (5S3) ◽  
pp. 128-132 ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Low Energy ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware

Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).

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.

Sign in / Sign up

Export Citation Format

Share Document