scholarly journals A Byzantine Sensing Network Based on Majority-Consensus Data Aggregation Mechanism

Sensors ◽  
2021 ◽  
Vol 21 (1) ◽  
pp. 248
Author(s):  
Jenghorng Chang ◽  
Fanpyn Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Function Technique ◽  
Byzantine Fault Tolerance ◽  
Form Complex ◽  
Aggregation Mechanism

In the current Internet of Things era, digital devices form complex interconnections. The statuses of objects of interest are monitored using sensors, and distributed wireless sensor networks are formed from numerous sensor nodes. Many Byzantine fault tolerance mechanisms in wireless sensor networks (WSNs) were proposed from Byzantine agreement which even with a few faulty nodes in a sensor network, most healthy nodes can reach a consensus, perform data transmission tasks, and maintain network operation. In this study, this mechanism was utilized together with the majority function technique; in particular, the proposed method uses original sensor signals to define a threshold to assert a binary value of one or zero, thereby performing data judgment and aggregation. This approach reduces node energy consumption and enables the nodes to quickly reach a consensus. Moreover, the operating performance of the network can be maintained even when problems such as node failure and faults occur within the fault tolerance range. Compared with existing algorithms, the proposed data aggregation mechanism exhibits a better network life cycle and can effectively extend the flexibility of network operations.

CONFLICT-AWARE DATA AGGREGATION SCHEDULING IN WIRELESS SENSOR NETWORKS WITH ADJUSTABLE TRANSMISSION RANGE

2012 ◽  
Vol 04 (03) ◽  
pp. 1250013 ◽  
Author(s):  
YI HONG ◽  
HONGWEI DU ◽  
DEYING LI ◽  
WENPING CHEN
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Base Station ◽  
Sensor Nodes ◽  
Performance Ratio ◽  
Wireless Sensor ◽  
Transmission Range ◽  
Minimum Latency ◽  
Data Aggregation Scheduling

The minimum latency data aggregation schedule is one of the fundamental problems in wireless sensor networks. Most existing works assumed that the transmission ranges of sensor nodes cannot be adjusted. However, sensors with adjustable transmission ranges have advantages in energy saving, reducing transmission interference and latency. In this paper, we study the minimum latency conflict-aware data aggregation scheduling problem with adjustable transmission radii: given locations of sensors along with a base station, all sensors could adjust their transmission radii and each sensor's interference radius is α times of its transmission radius, we try to find a data aggregation schedule in which the data from all sensors can be transmitted to the base station without conflicts, such that the latency is minimized. We first partition the set of all nodes into two parts: the major set and the minor set. Then, we design different scheduling strategies for the two sets, respectively. Finally, we propose an approximation algorithm for the problem and prove the performance ratio of the algorithm is bounded by a nearly constant. Our experimental results evaluate the efficiency of the proposed algorithm.

Pallier Based Homomorphic Encrypted Data Aggregation in Wireless Sensor Networks

2014 ◽  
Vol 543-547 ◽  
pp. 3017-3022 ◽  
Author(s):  
Tristan Daladier Engouang ◽  
Liu Yun ◽  
Zhen Jiang Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Homomorphic Encryption ◽  
New Technology ◽  
Physical World ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Security Measures ◽  
Ongoing Research

Tiny autonomous embedded electronics (sensor nodes) devices able to communicate through wireless channels are ensuring the emission and reception of data through a communication radio between two sensors grouped by hundreds and thousands within Wireless Sensor Networks (WSNs). These amazing new technology with ongoing research worldwide, are merging networking, systems hardware, systems software and programming methodologies thus enabling applications that previously were not practical. Hence numerical simulations on computers can now visualize the physical world phenomena that could be observed through empirical means, as sensors are deployed in a dedicated environment, to fulfill their aim of sensing for any occurrence of the event of interest. The data sensed by these wireless sensors are now very sensitive, thus need to be fully protected by all means, which is why T. D. Engouang et al., argued that securityand reliability and also durability are mandatory when deploying any sensor nodes or hard device. The Pallier based homomorphic encryption data aggregation is proposed with security measures preserving data integrity and privacy.

scholarly journals Security in wireless sensor networks

2019 ◽  
Vol 8 (1) ◽  
pp. 13
Author(s):  
Bahae ABIDI ◽  
Abdelillah JILBAB ◽  
Mohamed EL HAZITI
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Secure Communication ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Aggregated Data ◽  
Secure Data ◽  
Secure Data Aggregation

Even in difficult places to reach, the new networking technique allows the easy deployment of sensor networks, although these wireless sensor networks confront a lot of constraints. The major constraint is related to the quality of information sent by the network. The wireless sensor networks use different methods to achieve data to the base station. Data aggregation is an important one, used by these wireless sensor networks. But this aggregated data can be subject to several types of attacks and provides security is necessary to resist against malicious attacks, secure communication between severely resource constrained sensor nodes while maintaining the flexibility of the topology changes. Recently, several secure data aggregation schemes have been proposed for wireless sensor networks, it provides better security compared with traditional aggregation. In this paper, we try to focus on giving a brief statement of the various approaches used for the purpose of secure data aggregation in wireless sensor networks.

scholarly journals Lifetime enhancement in wireless sensor networks using binary search tree based data aggregation

2018 ◽  
Vol 16 (6) ◽  
Author(s):  
Gopikrishnan S. ◽  
Priakanth P.
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Total Energy ◽  
Data Aggregation ◽  
Routing Algorithm ◽  
Search Tree ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Binary Search Tree ◽  
Total Energy Consumption

Energy efficient data aggregation is a key solution to enhance the lifetime of wireless sensor networks since sensor nodes are battery-powered and deployed in remote environments. This article explore a two-hop data aggregation tree construction algorithm using binary search tree to reduce the total energy consumption of sensor nodes in wireless sensor networks. An adaptive and hybrid routing algorithm for simultaneous data aggregation and exploit the data correlation between nodes using the two-hop data aggregation tree framework is proposed. Routes are chosen based on the shortest response time for the broadcasting request to minimize the total energy expended by the network. This paper also proposes a high secure asymmetric key cryptography algorithm to provide the secure data communication among the network. The data aggregation function that is used in the proposed routing algorithm enhances the lifetime of sensor network by resolving the delay, collision and security issues. Simulations results show that the binary tree based data aggregation can appreciably reduces the total energy consumption and resolves the maximum data aggregation issues in wireless sensor network.  

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.

scholarly journals Building Representative-Based Data Aggregation Tree in Wireless Sensor Networks

2010 ◽  
Vol 2010 ◽  
pp. 1-11 ◽  
Author(s):  
Yanfei Zheng ◽  
Kefei Chen ◽  
Weidong Qiu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Large Scale ◽  
Resource Constraints ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Detection Mechanism ◽  
Aggregation Tree

Data aggregation is an essential operation to reduce energy consumption in large-scale wireless sensor networks (WSNs). A compromised node may forge an aggregation result and mislead base station into trusting a false reading. Efficient and secure aggregation scheme is critical in WSN applications due to the stringent resource constraints. In this paper, we propose a method to build up the representative-based aggregation tree in the WSNs such that the sensing data are aggregated along the route from the leaf cell to the root of the tree. In the cinema of large-scale and high-density sensor nodes, representative-based aggregation tree can reduce the data transmission overhead greatly by directed aggregation and cell-by-cell communications. It also provides security services including the integrity, freshness, and authentication, via detection mechanism in the cells.

Sign in / Sign up

Export Citation Format

Share Document