Certain Investigation on Secured Data Transmission in Wireless Sensor Networks

2020 ◽  
pp. 1372-1385
Author(s):  
P. Padmaja ◽  
G.V. Marutheswar
Keyword(s):  
Data Aggregation ◽  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Trust Value ◽  
Security Issues ◽  
Deviation Factor ◽  
Simulation Results ◽  
Secured Data

Wireless Sensor Network (WSN) need to be more secure while transmitting data as well as should be deployed properly to reduce redundancy and energy consumption. WSNs suffer from many constraints, including low computation capability, small memory, limited energy resources, susceptibility to physical capture and the use of insecure wireless communication channels. These constraints make security in WSNs a challenge. In this paper, a survey of security issues in WSNs is presented and a new algorithm TESDA is proposed, which is an optimized energy efficient secured data aggregation technic. The cluster head is rotated based on residual energy after each round of aggregation so that network lifetime increases. Based on deviation factor calculated, the trust weight is assigned, if more deviation, then the trust value is less. Simulation results observed by using NS-2. From network animator and x-graphs the result are analyzed. Among all protocols tesda is an energy efficient secured data aggregation method.

Certain Investigation on Secured Data Transmission in Wireless Sensor Networks

2017 ◽  
Vol 8 (1) ◽  
pp. 48-61
Author(s):  
P. Padmaja ◽  
G.V. Marutheswar
Keyword(s):  
Data Aggregation ◽  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Aggregation Method ◽  
Trust Value ◽  
Security Issues ◽  
Deviation Factor ◽  
Secured Data

Wireless Sensor Network (WSN) need to be more secure while transmitting data as well as should be deployed properly to reduce redundancy and energy consumption. WSNs suffer from many constraints, including low computation capability, small memory, limited energy resources, susceptibility to physical capture and the use of insecure wireless communication channels. These constraints make security in WSNs a challenge. In this paper, a survey of security issues in WSNs is presented and a new algorithm TESDA is proposed, which is an optimized energy efficient secured data aggregation technic. The cluster head is rotated based on residual energy after each round of aggregation so that network lifetime increases. Based on deviation factor calculated, the trust weight is assigned, if more deviation, then the trust value is less. Simulation results observed by using NS-2. From network animator and x-graphs the result are analyzed. Among all protocols tesda is an energy efficient secured data aggregation method.

Quasi Oppositional Glowworm Swarm Optimization Algorithm for Energy Efficient Clustering in Wireless Sensor Networks

2020 ◽  
Vol 17 (12) ◽  
pp. 5447-5456
Author(s):  
R. M. Alamelu ◽  
K. Prabu
Keyword(s):  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Link Quality ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Node Degree ◽  
Swarm Optimization ◽  
Glowworm Swarm Optimization ◽  
Energy Efficient Clustering

Wireless sensor network (WSN) becomes popular due to its applicability in distinct application areas like healthcare, military, search and rescue operations, etc. In WSN, the sensor nodes undergo deployment in massive number which operates autonomously in harsh environment. Because of limited resources and battery operated sensor nodes, energy efficiency is considered as a main design issue. To achieve, clustering is one of the effective technique which organizes the set of nodes into clusters and cluster head (CH) selection takes place. This paper presents a new Quasi Oppositional Glowworm Swarm Optimization (QOGSO) algorithm for energy efficient clustering in WSN. The proposed QOGSO algorithm is intended to elect the CHs among the sensor nodes using a set of parameters namely residual energy, communication cost, link quality, node degree and node marginality. The QOGSO algorithm incorporates quasi oppositional based learning (QOBL) concept to improvise the convergence rate of GSO technique. The QOGSO algorithm effectively selects the CHs and organizes clusters for minimized energy dissipation and maximum network lifetime. The performance of the QOGSO algorithm has been evaluated and the results are assessed interms of distinct evaluation parameters.

A Probability-Based Clustering Algorithm with CH Election for Expanding WSN Life Span

2020 ◽  
Vol 9 (1) ◽  
pp. 1-14
Author(s):  
Dimitris N. Kanellopoulos ◽  
Pratik Gite
Keyword(s):  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Signal Power ◽  
Aggregated Data ◽  
Simulation Results ◽  
Buffer Length ◽  
Energy Buffer

Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed by several sensors nodes, and one of them is elected as Cluster-head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or another CH. This article proposes a new clustering algorithm (EMESISC) that is based on each node's probability of becoming a CH. This node's probability depends on its residual energy, buffer length, and received signal power. We compared EMESISC with LEACH algorithm. Simulation results showed that EMESISC is superior to LEACH.

scholarly journals Trust-Aware and Low Energy Consumption Security Topology Protocol of Wireless Sensor Network

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zuo Chen ◽  
Min He ◽  
Wei Liang ◽  
Kai Chen
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Low Energy ◽  
Wireless Sensor ◽  
Trust Value ◽  
Low Energy Consumption

Wireless sensor network (WSN) is a kind of distributed and self-organizing networks, in which the sensor nodes have limited communication bandwidth, memory, and limited energy. The topology construction of this network is usually vulnerable when attacked by malicious nodes. Besides, excessive energy consumption is a problem that can not be ignored. Therefore, this paper proposes a secure topology protocol of WSN which is trust-aware and of low energy consumption, called TLES. The TLES considers the trust value as an important factor affecting the behavior of node. In detail, the TLES would take trust value, residual energy of the nodes, and node density into consideration when selecting cluster head nodes. Then, TLES constructs these cluster head nodes by choosing the next hop node according to distance to base station (BS), nodes’ degrees, and residual energy, so as to establish a safe, reliable, and energy saving network. Experimental results show that the algorithm can effectively isolate the malicious node in the network and reduce the consumption of energy of the whole network.

scholarly journals R-bUCRP: A Novel Reputation-Based Uneven Clustering Routing Protocol for Cognitive Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Mingchuan Zhang ◽  
Ruijuan Zheng ◽  
Ying Li ◽  
Qingtao Wu ◽  
Liang Song
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Selfish Nodes ◽  
Simulation Results ◽  
Establishment Phase ◽  
Optimal Cluster

Energy of nodes is an important factor that affects the performance of Wireless Sensor Networks (WSNs), especially in the case of existing selfish nodes, which attracted many researchers’ attention recently. In this paper, we present a reputation-based uneven clustering routing protocol (R-bUCRP) considering both energy saving and reputation assessment. In the cluster establishment phase, we adopt an uneven clustering mechanism which controls the competitive scope of cluster head candidates to save the energy of WSNs. In the cluster heads election phase, the residual energy and reputation value are used as the indexes to select the optimal cluster head, where the reputation mechanism is introduced to support reputation assessment. Simulation results show that the proposed R-bUCRP can save node energy consumption, balance network energy distribution, and prolong network lifetime.

Energy-Efficient Routing Protocol on Mobile Sink in Wireless Sensor Network

2013 ◽  
Vol 787 ◽  
pp. 1050-1055 ◽  
Author(s):  
Zhi Gui Lin ◽  
Hui Qi Zhang ◽  
Xu Yang Wang ◽  
Fang Qin Yao ◽  
Zhen Xing Chen
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Model Simulation ◽  
Cluster Head ◽  
Mobile Sink ◽  
High Energy ◽  
Residual Energy ◽  
Energy Efficient Routing ◽  
Simulation Results

To the disadvantages, such as high energy consumption and the energy consumption imbalance, we proposed an energy-efficient routing protocol on mobile sink (MSEERP) in this paper. In the MSEERP, the network is divided into several square virtual grids based on GAF, each grid is called a cluster, and the cluster head election method of GAF is improved. In addition, the MSEERP introduces a mobile sink in the network, the sink radios in limited number of hops and uses control moving strategy, namely the sink does not collect the information until it moves to a cluster with highest residual energy. We applied NS2 to evaluate its performance and analyze the simulation results by the energy model. Simulation results show that the MSEERP balances the energy consumption of the network, saves nodes energy and extends the network lifetime.

scholarly journals SECURED DATA AGGREGATION METHODS IN WIRELESS SENSOR NETWORKS USING HOMOMORPHIC OPERATION - A REVIEW

2017 ◽  
Vol 10 (13) ◽  
pp. 328
Author(s):  
Shahina K ◽  
Vaidehi Vijayakumar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Homomorphic Encryption ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Security Issues ◽  
Aggregation Methods ◽  
Energy Constrained ◽  
Secured Data

Wireless sensor networks are energy constrained. Data aggregation is an important mechanism for achieving energy efficiency in such networks. The aggregation reduces redundancy in data transmission which results in improved energy usage. Several security issues are there in data aggregation, which includes data confidentiality, data integrity, availability, and freshness. Such issues become complex since WSN is deployed in hostile and unattended environment. So the sensor nodes may fail and compromised by adversaries. Secured data aggregation in sensor network is a topic of research.  Many solutions are proposed for secured data aggregation, using different encryption methods. Homomorphic encryption is one of such technique. In homomorphic encryption, all the nodes participate in the aggregation. Here, nodes can’t see any intermediate or final result but the aggregation is efficient. In this paper, secured data aggregation methods are classified and the performance is compared in terms of integrity and confidentiality.

Energy Balance Routing Algorithm Based on Energy Heterogeneous WSN

2014 ◽  
Vol 687-691 ◽  
pp. 3976-3979 ◽  
Author(s):  
Ming Xin Liu ◽  
Xiao Meng Wang
Keyword(s):  
Energy Balance ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Energy Balancing ◽  
Network Nodes ◽  
Cluster Head Election ◽  
Balancing Energy ◽  
Simulation Results

Balancing energy load is a key problem in wireless sensor network (WSN) research. For balancing node energy consumption and prolong the network lifetime, this paper proposes an improved routing algorithm EBRA (Energy Balancing Routing Algorithm) based on energy heterogeneous WSN. To maximize the energy efficiency of network nodes, the EBRA weights the probability of cluster head election. According to the estimate value of the network average remaining energy and the residual energy of network nodes, we can calculate the new cluster head election threshold. The simulation results show that the utilization of energy balance of EBRA algorithm is improved 74%, 30% and 23%, compare with LEACH, SEP and DCHS, respectively.

An Enforcing Integrity and Privacy-Preserving Data Aggregation Protocol in Wireless Sensor Network

2014 ◽  
Vol 543-547 ◽  
pp. 3248-3251
Author(s):  
Da Peng Man ◽  
Ya Qiong Yang ◽  
Wu Yang ◽  
Wei Wang ◽  
Shi Chang Xuan
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Data Aggregation ◽  
Cluster Head ◽  
Privacy Preserving ◽  
Wireless Sensor ◽  
Head Node ◽  
High Efficient ◽  
Simulation Results

It is important to ensure the integrity of the aggregation result and quality of communication among node in wireless sensor network in the condition of high-efficient privacy-preserving data aggregation mechanism. In this paper, we propose a method based on reputation model to solve this problem. During the process of data aggregation, the cluster head node will choose the node with max reputation value as collaborative node to accomplish the aggregation process. To show the efficacy and efficiency of this method, we present the simulation results. The simulation results show that our method iE-CPDA(enforced Integrity Energy-efficient Cluster-based Privacy-preserving Data Aggregation) has less communication and computation and higher accuracy than iCPDA.

An Algorithm with Efficiently Collecting and Aggregating Data for Wireless Sensor Networks

2021 ◽  
Author(s):  
Peng Xiong ◽  
Qinggang Su
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Battery Capacity

Due to the resource constraint, in wireless sensor network, the node processing ability, wireless bandwidth and battery capacity and other resources are scarcer. For improving the energy efficient and extend the lifetime of the network, this paper proposes a novel algorithm with the distributed and energy-efficient for collecting and aggregating data of wireless sensor network. In the proposed protocol, nodes can autonomously compete for the cluster head based on its own residual energy and the signal strength of its neighbouring nodes. To reduce the energy overhead of cluster head nodes, with a multi-hop way among cluster heads, the collected data from cluster heads is sent to a designated cluster head so as to further send these data to a base station. For improving the performance of the proposed protocol, a new cluster coverage method is proposed to fit the proposed protocol so that when the node density increases, network lifetime can be increased linearly as the number of nodes is increased. Simulations experiments show that network lifetime adopting the proposed protocol is sharply increased. And, the proposed protocol makes all the nodes die (network lifetime is defined as the death of last one node) in the last 40 rounds so that networks adopting the proposed protocol have higher reliability than networks adopting compared protocols.

Sign in / Sign up

Export Citation Format

Share Document