scholarly journals Location-based key management, data authentication and aggregation in wireless sensor networks

2021 ◽  
Author(s):  
Jie Xiao
Keyword(s):  
Data Aggregation ◽  
Key Management ◽  
Base Station ◽  
Sensor Nodes ◽  
Message Authentication ◽  
Authentication Code ◽  
Data Authentication ◽  
Efficient Data ◽  
Group A ◽  
Previous Design

The first design presents a novel location-based key management and en-route data authentication proposal. It divides the whole sensing area into a number of location cells. A group of location cells consist of a logical group. A pairwise key between two sensor nodes is established based on grid-based bivariate t-degree polynomials. Any valid reading report needs to collect enough message authentication code (MACs) from different neighbours. These pairwise keys used for generating the MAC are forwarded several hops down to the base station for future en-route data authentication. The second design proposes a greedy location-based secure and energy-efficient data aggregation approach. It further utilizes data aggregation based on the previous design by setting up control groups, applying pattern codes, selecting and switching control head nodes dynamically and periodically. In addition, different from the first design, it only requires control head nodes to collect enough MACs in each reading report. Extensive analysis, evaluations and experiments show us that both designs are secure, efficient and resilient.

scholarly journals Location-based key management, data authentication and aggregation in wireless sensor networks

2021 ◽  
Author(s):  
Jie Xiao
Keyword(s):  
Data Aggregation ◽  
Key Management ◽  
Base Station ◽  
Sensor Nodes ◽  
Message Authentication ◽  
Authentication Code ◽  
Data Authentication ◽  
Efficient Data ◽  
Group A ◽  
Previous Design

The first design presents a novel location-based key management and en-route data authentication proposal. It divides the whole sensing area into a number of location cells. A group of location cells consist of a logical group. A pairwise key between two sensor nodes is established based on grid-based bivariate t-degree polynomials. Any valid reading report needs to collect enough message authentication code (MACs) from different neighbours. These pairwise keys used for generating the MAC are forwarded several hops down to the base station for future en-route data authentication. The second design proposes a greedy location-based secure and energy-efficient data aggregation approach. It further utilizes data aggregation based on the previous design by setting up control groups, applying pattern codes, selecting and switching control head nodes dynamically and periodically. In addition, different from the first design, it only requires control head nodes to collect enough MACs in each reading report. Extensive analysis, evaluations and experiments show us that both designs are secure, efficient and resilient.

Energy-Efficient Data-Aggregation Technique for Correlated Spatial and Temporal Data in Cluster-Based Sensor Networks

2020 ◽  
Vol 16 (2) ◽  
pp. 53-68
Author(s):  
Khushboo Jain ◽  
Anoop Kumar
Keyword(s):  
Sensor Networks ◽  
Data Aggregation ◽  
Energy Efficient ◽  
Data Gathering ◽  
Base Station ◽  
Sensor Nodes ◽  
Temporal Data ◽  
Network Applications ◽  
Efficient Data ◽  
Aggregation Technique

Continuous-monitoring applications in sensor network applications require periodic data transmissions to the base-station (BS), which may lead to unnecessary energy depletion. The energy-efficient data aggregation solutions in sensor networks have evolved as one of the favorable fields for such applications. Former research works have recommended many spatial-temporal designs and prototypes for successfully minimizing the data-gathering overheads, but these are constrained to their relevance. This work has proposed a data aggregation technique for homogeneous application set-ups in sensor networks. For this, the authors have employed two ways of model generation for reducing correlated spatial-temporal data in cluster-based sensor networks: one at the Sensor nodes (SNs) and the other at the Cluster heads (CHs). Building on this idea, the authors propose two types of data filtration, first at the SNs for determining temporal redundancies (TRs) in data readings by both relative deviation (RD) and adaptive frame method (AFM) and second at the CHs for determining spatial redundancies (SRs) by both RD and AFM.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

scholarly journals Mobile Device Based Dynamic Key Management Protocols for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Chin-Ling Chen ◽  
Chih-Cheng Chen ◽  
De-Kui Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Direct Access ◽  
Session Key ◽  
Dynamic Key Management ◽  
Dynamic Key

In recent years, wireless sensor network (WSN) applications have tended to transmit data hop by hop, from sensor nodes through cluster nodes to the base station. As a result, users must collect data from the base station. This study considers two different applications: hop by hop transmission of data from cluster nodes to the base station and the direct access to cluster nodes data by mobile users via mobile devices. Due to the hardware limitations of WSNs, some low-cost operations such as symmetric cryptographic algorithms and hash functions are used to implement a dynamic key management. The session key can be updated to prevent threats of attack from each communication. With these methods, the data gathered in wireless sensor networks can be more securely communicated. Moreover, the proposed scheme is analyzed and compared with related schemes. In addition, an NS2 simulation is developed in which the experimental results show that the designed communication protocol is workable.

scholarly journals An Energy Efficient Secure Data Aggregation in Wireless Sensor Networks

2021 ◽  
Author(s):  
Jenice Prabu A ◽  
Hevin Rajesh D
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Communication ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Malicious Nodes ◽  
Aggregated Data

Abstract In Wireless sensor network, the major issues are security and energy consumption. There may be several numbers of malicious nodes present in sensor networks. Several techniques have been proposed by the researchers to identify these malicious nodes. WSNs contain many sensor nodes that sense their environment and also transmit their data via multi-hop communication schemes to the base station. These sensor nodes provides power supply using battery and the energy consumption of these batteries must be low. Securing the data is to avoid attacks on these nodes and data communication. The aggregation of data helps to minimize the amount of messages transmitted within the network and thus reduces overall network energy consumption. Moreover, the base station may distinguish the encrypted and aggregated data based on the encryption keys during the decryption of the aggregated data. In this paper, two aspects of the problem is concerned, we investigate the efficiency of data aggregation: first, how to develop cluster-based routing algorithms to achieve the lowest energy consumption for aggregating data, and second, security issues in wsn. By using Network simulator2 (NS2) this scheme is simulated. In the proposed scheme, energy consumption, packet delivery ratio and throughput is analyzed. The proposed clustering, routing, and protection protocol based on the MCSDA algorithm shows significant improvement over the state-of - the-art protocol.

The Gamification in Education, Healthcare, and Industry

2021 ◽  
pp. 206-232
Author(s):  
Puvvadi Baby Maruthi
Keyword(s):  
Data Aggregation ◽  
Mobile Element ◽  
Mobile Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Aggregated Data ◽  
Three Layer Architecture ◽  
Save Energy ◽  
Aggregation Technique ◽  
Entire Network

Wireless sensor networks (WSN) consist of large numbers of sensor nodes, which are limited in battery power and communication range and have multi-modal sensing capabilities. In this chapter, energy-efficient data aggregation technique is proposed to improve the lifetime of the sensor. Here, the author has used three layer architecture by deploying mobile element/node, which can periodically visit cluster heads (CHs) at which first level data aggregation has been applied to eliminate redundancy. After collecting data from all CHs, mobile element itself will perform second level of data aggregation to eliminate further redundancy. After collecting data from CHs, mobile element will move towards base station/sink and transmits data to base station/sink in order to save energy of entire network. Here, the author has made an attempt to prove that in WSN during data gathering if mobile elements are used to collect the aggregated data from CHs, energy consumption of the entire network will be reduced. The proposed data aggregation with mobile node helps in improving the lifetime of the WSN.

scholarly journals Efficient Implementation of a Crypto Library Using Web Assembly

Electronics ◽  
2020 ◽  
Vol 9 (11) ◽  
pp. 1839
Author(s):  
BoSun Park ◽  
JinGyo Song ◽  
Seog Chung Seo
Keyword(s):  
Key Agreement ◽  
Timing Analysis ◽  
Scalar Multiplication ◽  
Message Authentication ◽  
Authentication Code ◽  
Web Based ◽  
Atomic Block ◽  
Data Authentication ◽  
Improved Performance ◽  
Block Based

We implement a cryptographic library using Web Assembly. Web Assembly is expected to show better performance than Javascript. The proposed library provides comprehensive algorithm sets including revised CHAM, Hash Message Authentication Code (HMAC), and ECDH using the NIST P-256 curve to provide confidentiality, data authentication, and key agreement functions. To optimize the performance of revised CHAM in the proposed library, we apply an existing method that is a four-round combining method and additionally propose the precomputation method to CHAM-64/128. The proposed revised CHAM showed an approximate 2.06 times (CHAM-64/128), approximate 2.13 times (CHAM-128/128), and approximate 2.63 times (CHAM-128/256) performance improvement in Web Assembly compared to JavaScript. In addition, CHAM-64/128 applying the precomputation method showed an improved performance by approximately 1.2 times more than the existing CHAM-64/128. For the ECDH using P-256 curve, the naive implementation of ECDH is vulnerable to side-channel attacks (SCA), e.g., simple power analysis (SPA), and timing analysis (TA). Thus, we apply an SPA and TA resistant scalar multiplication method, which is a core operation in ECDH. We present atomic block-based scalar multiplication by revising the previous work. Existing atomic blocks show a performance overhead of 55%, 23%, and 37%, but atomic blocks proposed to use only P=(X,Y,Z) show 18%, 6%, and 11% performance overhead. The proposed Web Assembly-based crypto library provides enhanced performance and resistance against SCA thus, it can be used in various web-based applications.

scholarly journals Irrelevant data elimination based on a k-means clustering algorithm for efficient data aggregation and human activity classification in smart home sensor networks

2020 ◽  
Vol 16 (6) ◽  
pp. 155014772092982
Author(s):  
Siriporn Pattamaset ◽  
Jae Sung Choi
Keyword(s):  
Human Activity ◽  
Data Aggregation ◽  
Smart Home ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Original Data ◽  
Base Station ◽  
Sensor Nodes ◽  
Activity Classification ◽  
Successful Operation

For the successful operation of smart home environments, it is important to know the state or activity of an occupant. A large number of sensors can be deployed and embedded in places or things. All sensor nodes measure the physical world and send data to the base station for processing. However, the processing of all collected data from every sensor node can consume significant energy and time. In order to enhance the sensor network in smart home applications, we propose the irrelevant data elimination based on k-means clustering algorithm to enhance data aggregation. This approach embeds the cluster head–based algorithm into cluster heads to omit irrelevant data from the base station. The pattern of measured data in each room can be clustered as an active pattern when human activity happens in that room and a stable pattern when human activity does not happen in the room. The irrelevant data elimination based on k-means clustering algorithm approach can reduce 55.94% of the original data with similar results in human activity classification. This study proves that the proposed approach can eliminate meaningless data and intelligently aggregate data by delivering only data from rooms in which human activity likely occurs.

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.

scholarly journals A Secure Privacy-Preserving Data Aggregation Model in Wearable Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Changlun Zhang ◽  
Chao Li ◽  
Jian Zhang
Keyword(s):  
Data Aggregation ◽  
Privacy Preservation ◽  
Rapid Development ◽  
Cluster Head ◽  
Privacy Preserving ◽  
Base Station ◽  
Sensor Nodes ◽  
Mixed Data ◽  
Communication Overhead ◽  
Aggregation Model

With the rapid development and widespread use of wearable wireless sensors, data aggregation technique becomes one of the most important research areas. However, the sensitive data collected by sensor nodes may be leaked at the intermediate aggregator nodes. So, privacy preservation is becoming an increasingly important issue in security data aggregation. In this paper, we propose a security privacy-preserving data aggregation model, which adopts a mixed data aggregation structure. Data integrity is verified both at cluster head and at base station. Some nodes adopt slicing technology to avoid the leak of data at the cluster head in inner-cluster. Furthermore, a mechanism is given to locate the compromised nodes. The analysis shows that the model is robust to many attacks and has a lower communication overhead.

Sign in / Sign up

Export Citation Format

Share Document