scholarly journals Random Secure Comparator Selection Based Privacy-Preserving MAX/MIN Query Processing in Two-Tiered Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Hua Dai ◽  
Tianyi Wei ◽  
Yue Huang ◽  
Jia Xu ◽  
Geng Yang
Keyword(s):  
Sensor Networks ◽  
Query Processing ◽  
Privacy Preserving ◽  
Base Station ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Experimental Result ◽  
Master Node ◽  
Minimal Set ◽  
Query Result

Privacy-preserving data queries for wireless sensor networks (WSNs) have drawn much attention recently. This paper proposes a privacy-preserving MAX/MIN query processing approach based on random secure comparator selection in two-tiered sensor network, which is denoted by RSCS-PMQ. The secret comparison model is built on the basis of the secure comparator which is defined by 0-1 encoding and HMAC. And the minimal set of highest secure comparators generating algorithm MaxRSC is proposed, which is the key to realize RSCS-PMQ. In the data collection procedures, the sensor node randomly selects a generated secure comparator of the maximum data into ciphertext which is submitted to the nearby master node. In the query processing procedures, the master node utilizes the MaxRSC algorithm to determine the corresponding minimal set of candidate ciphertexts containing the query results and returns it to the base station. And the base station obtains the plaintext query result through decryption. The theoretical analysis and experimental result indicate that RSCS-PMQ can preserve the privacy of sensor data and query result from master nodes even if they are compromised, and it has a better performance on the network communication cost than the existing approaches.

scholarly journals Detection and Location of Malicious Nodes Based on Homomorphic Fingerprinting in Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhiming Zhang ◽  
Yu Yang ◽  
Wei Yang ◽  
Fuying Wu ◽  
Ping Li ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Evaluation Model ◽  
Original Data ◽  
Base Station ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Malicious Node ◽  
Malicious Nodes ◽  
Trust Value

The current detection schemes of malicious nodes mainly focus on how to detect and locate malicious nodes in a single path; however, for the reliability of data transmission, many sensor data are transmitted by multipath in wireless sensor networks. In order to detect and locate malicious nodes in multiple paths, in this paper, we present a homomorphic fingerprinting-based detection and location of malicious nodes (HFDLMN) scheme in wireless sensor networks. In the HFDLMN scheme, using homomorphic fingerprint and coding technology, the original data is divided into n packets and sent to the base station along n paths, respectively; the base station determines whether there are malicious nodes in each path by verifying the validity of the packets; if there are malicious nodes in one or more paths, the location algorithm of the malicious node is implemented to locate the specific malicious nodes in the path; if all the packets are valid, the original data is recovered. The HFDLMN scheme does not need any complex evaluation model to evaluate and calculate the trust value of the node, nor any monitoring nodes. Theoretical analysis results show that the HFDLMN scheme is secure and effective. The simulation results demonstrate promising outcomes with respect to key parameters such as the detection probability of the malicious path and the locating probability of the malicious node.

scholarly journals An Efficient Top-kQuery Processing with Result Integrity Verification in Two-Tiered Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Ruiliang He ◽  
Hua Dai ◽  
Geng Yang ◽  
Taochun Wang ◽  
Jingjing Bao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Processing Scheme ◽  
Integrity Verification ◽  
Sensing Data ◽  
Query Result ◽  
Sequence Relationship

In two-tiered wireless sensor networks, storage nodes take charge of both storing the sensing data items and processing the query request issued by the base station. Due to their important role, storage nodes are more attractive to adversaries in a hostile environment. Once a storage node is compromised, attackers may falsify or abandon the data when answering the query issued by the base station, which will make the base station get incorrect or incomplete result. This paper proposes an efficient top-kquery processing scheme with result integrity verification named as ETQ-RIV in two-tiered sensor networks. According to the basic idea that sensor nodes submit some encoded message containing the sequence relationship as proof information for verification along with their collected sensing data items, a data binding and collecting protocol and a verifiable query response protocol are proposed and described in detail. Detailed quantitative analysis and evaluation experiments show that ETQ-RIV performs better than the existing work in both communication cost and query result redundancy rate.

scholarly journals EGCIR: Energy-Aware Graph Clustering and Intelligent Routing Using Supervised System in Wireless Sensor Networks

Energies ◽  
2020 ◽  
Vol 13 (16) ◽  
pp. 4072
Author(s):  
Tanzila Saba ◽  
Khalid Haseeb ◽  
Ikram Ud Din ◽  
Ahmad Almogren ◽  
Ayman Altameem ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Graph Clustering ◽  
Base Station ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Intelligent Routing

In recent times, the field of wireless sensor networks (WSNs) has attained a growing popularity in observing the environment due to its dynamic factors. Sensor data are gathered and forwarded to the base station (BS) through a wireless transmission medium. The data from the BS is further distributed to end-users using the Internet for their post analysis and operations. However, all sensors except the BS have limited constraints in terms of memory, energy and computational resources that degrade the network performance concerning the network lifetime and trustworthy routing. Therefore, improving energy efficiency with reliable and secure transmissions is a valuable debate among researchers for critical applications based on low-powered sensor nodes. In addition, security plays a significant cause to achieve responsible communications among sensors due to their unfixed and variable infrastructures. Keeping in view the above-mentioned issues, this paper presents an energy-aware graph clustering and intelligent routing (EGCIR) using a supervised system for WSNs to balance the energy consumption and load distribution. Moreover, a secure and efficient key distribution in a hierarchy-based mechanism is adopted by the proposed solution to improve the network efficacy in terms of routes and links integrity. The experimental results demonstrated that the EGCIR protocol enhances the network throughput by an average of 14%, packet drop ratio by an average of 50%, energy consumption by an average of 13%, data latency by an average of 30.2% and data breaches by an average of 37.5% than other state-of-the-art protocols.

scholarly journals CDARGA: Cluster-Based Data Aggregation with Genetic Routing Algorithm in Wireless Sensor Networks

2020 ◽  
Vol 8 (6) ◽  
pp. 2976-2982
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Search Algorithm ◽  
Fitness Function ◽  
Base Station ◽  
Wireless Sensor ◽  
Experimental Result ◽  
Genetic Search

In the wireless sensor networks (WSNs), the upholding the energy and routing formation at every sensor node is the major issues. The distance from base station and internal node mainly has imbalanced in the energy consumption during transformation of the data. To reduce the energy upholding and the data aggregation routing issues in Centralized Clustering-Task Scheduling for wireless sensor networks (WSNs), this paper focuses on a Cluster-Based Data Aggregation Routing with Genetic search Algorithm (CDARGA) , which reduces the energy consumption in a hyper round model. The proposed data aggregation routing protocol using the Genetic Algorithm (GA) estimates the fitness function using the three key parameters distance, energy, and Hyper round policy. The proposed methods were compared with RP-MAC and the experimental result shows that the proposed protocol is superior to RP-MAC protocol and the proposed algorithm improves the network lifetime which can used in real time application.

Energy-Efficient and Secure Data Forwarding Mechanism for Balancing Cluster Lifetime for Huge Size Wireless Sensor Networks

2019 ◽  
Vol 16 (9) ◽  
pp. 3961-3964
Author(s):  
Charu Sharma ◽  
Rohit Vaid
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Energy Efficient ◽  
Base Station ◽  
Packet Transmission ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor

In designing Wireless Sensor Networks, energy efficiency and security should be considered very critically. Energy efficiency is achieved through data aggregation which eliminates the transmission of redundant data while security is achieved by preserving confidentiality among sensor node and the base station. In this paper, an energy efficient and secure cluster based aggregation mechanism is presented. In this model, for energy efficiency the network is divided into tracks and sectors so the cluster head’s are uniformly selected from the whole network. To achieve security the cluster head’s perform data aggregation with the help of some pattern codes and only distinctive data is transmitted from sensor nodes in encrypted form. To perform aggregation, the sensor nodes do not need to know about the actual sensor data therefore there is no need to use any encryption or decryption schemes between nodes and cluster head. Performance evaluation shows proposed model works better to enhance the network lifetime, security, average residual energy, and average packet transmission ratio than conventional data aggregation models.

A Study on the Implementation of Dynamic Routing Algorithm to Improve Efficiency for Wireless Sensor Networks

2013 ◽  
Vol 284-287 ◽  
pp. 2021-2026
Author(s):  
Won Hyuck Choi ◽  
Min Seok Jie
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Sensor Network ◽  
Dynamic Routing ◽  
Base Station ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Routing Method

The development of wireless communication and electronic technology leads to wireless sensor networks in various fields. Wireless sensor networks can exchange the data that generated from near environment field observation between other sensor nodes. Generally, Wireless sensor networks consist of multi sensor nodes and one or more sink nodes The sensor sensing data that nodes detected transmit from sensor networks to base station and deliver to users through internet. However sensor networks are restricted in the aspects of communication, processing data and energy consumption. Because of the low capacity batteries with devices of sensor networks, it is important to increase the lifespan operation life of sensor nodes by using energy efficiently. In this kind of sensor nodes, the energy consumption for message sending and receiving is very important for the maintenance of sensor nodes. In the existing static routing method, it consumes more energy for the maintenance of sensor network than dynamic routing method because data transmits repeatedly when the sensor data begin to spread. In this study, based on the difference in the cycle of information gathering in accordance with the characteristic of the sensor in sensor network and the cycle of demands from the sink in accordance with the characteristic of application layer, dynamic routing of wireless sensor network is proposed which actively responds to its various needs.

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

Sign in / Sign up

Export Citation Format

Share Document