Enable Efficient Data Aggregation for Region-Based Top-K Queries in Wireless Sensor Networks

2014 ◽  
Vol 556-562 ◽  
pp. 6311-6315
Author(s):  
Yong Qing Wang ◽  
Jing Tian Tang ◽  
Xing Po Ma
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Storage ◽  
Data Aggregation ◽  
Energy Cost ◽  
Sensor Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor

We study data aggregation for region-based top-k queries in wireless sensor networks, which is one kind of internet of things. Because the energy of sensor nodes is limited and a sensor node will die if it has no energy left, one of the important targets for all protocols in wireless sensor networks is to decrease the energy consumption of the sensor nodes. For a sensor node, communication cost is much more than other kinds of energy cost such as energy cost on computation and data storage. Thus, a very efficient way to decrease the energy cost of the sensor nodes is to decrease the quality of the sensing data that will be transmitted to the base station. In this paper, we use the technique of data aggregation to achieve this goal, and propose an algorithm to construct a novel Data Aggregation Tree (DAT) in the query region. To check the efficiency of DAT, we have made a simulation on OMNET, and the results show that DAT can shrink large quality of data when they are transmitted to the base station, and the life time of the sensor networks can thus be prolonged..

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.

scholarly journals Bioinspired Evolutionary Algorithm Based for Improving Network Coverage in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mohammadjavad Abbasi ◽  
Muhammad Shafie Bin Abd Latiff ◽  
Hassan Chizari
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Evolutionary Algorithm ◽  
Sensor Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Target Area ◽  
Network Coverage ◽  
Detection Model

Wireless sensor networks (WSNs) include sensor nodes in which each node is able to monitor the physical area and send collected information to the base station for further analysis. The important key of WSNs is detection and coverage of target area which is provided by random deployment. This paper reviews and addresses various area detection and coverage problems in sensor network. This paper organizes many scenarios for applying sensor node movement for improving network coverage based on bioinspired evolutionary algorithm and explains the concern and objective of controlling sensor node coverage. We discuss area coverage and target detection model by evolutionary algorithm.

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 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 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.

scholarly journals Detecting malicious nodes using data aggregation protocols in wireless sensor networks

2017 ◽  
Vol 7 (1.1) ◽  
pp. 594
Author(s):  
P. Balamurugan ◽  
M. Shyamala Devi ◽  
V. Sharmila
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Data Aggregation ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Malicious Nodes ◽  
Secured Data

At present scenario, sensor devices are used in various fields for gathering information so all those data should be secured safely. Securing data is an important role in Wireless Sensor Networks (WSN). WSN is extremely essential for the purpose of reducing the complete redundancy and energy consumption during gathering data among sensor nodes. Optimized data aggregation is needed at cluster head and Base Station (BS) for secured data transmission. Data aggregation is performed in all routers while forwarding data from source to destination node. The complete life time of sensor networks is reducing because of using energy inefficient nodes for the purpose of aggregation. So this paper introduces the optimized methods for securing data (OMSD) which is trust based weights and also completely about the attacks and some methods for secured data transmission. 

scholarly journals An Energy-Aware and Load-balancing Routing scheme for Wireless Sensor Networks

2018 ◽  
Vol 12 (3) ◽  
pp. 1312 ◽  
Author(s):  
Omar Adil Mahdi ◽  
Yusor Rafid Bahar Al-Mayouf ◽  
Ahmed Basil Ghazi ◽  
Mazin Abed Mohammed ◽  
Ainuddin Wahid Abdul Wahab ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Load Balancing ◽  
Data Aggregation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Routing Scheme ◽  
Limited Energy

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In view of this goal, a link cost function is introduced to assess the quality of the links by considering the new multi-criteria node weight metric, in which energy and load balancing are considered. The node weight is considered in constructing and updating the routing tree to achieve dynamic behavior for event-driven WSNs. The proposed EBR-DA was evaluated and validated by simulation, and the results were compared with those of InFRA and DRINA by using performance metrics for dense static networks.</p>

scholarly journals Detection of Replay Attack through Sequence Number Encryption in EDDK based WSNs

2020 ◽  
Vol 9 (9) ◽  
pp. 593-599
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Replay Attack ◽  
Local Cluster ◽  
Sequence Number ◽  
Replay Attacks

Wireless sensor networks can be used to deliver status information to users in real time. The sensor nodes used in wireless sensor networks are arranged by attaching sensors to acquire necessary information, such as vibration, sound, light, and temperature. Since a sensor node is small in size and inexpensive, it is advantageous for monitoring large areas. When a sensor node senses a change in a situation, this event information is wirelessly communicated with other sensor nodes and transmitted to a base station. However, since the sensor nodes used in wireless sensor networks are small and inexpensive, there are restrictions in terms of their battery life, memory, and computing power. An attacker can easily compromise a sensor node and use a compromised node to attempt message tampering and energy consumption attacks. EDDK is a scheme that detects attacks from compromised nodes through key management. EDDK uses a pairwise key and a local cluster key to defend against various attacks in the network. In addition, EDDK protects against replay attacks by using sequence numbers and guarantees message integrity. However, since the sequence number and sensor node ID are not encrypted, they can be used as an attack element. An attacker can attempt a replay attack by manipulating the sequence number through sniffing. A replay attack that occurs in a wireless sensor network consumes sensor node energy and confuses the user. In order to defend against such an attack, we propose a sequence number encryption scheme. The proposed scheme detects new types of replay attacks and shows about 7% energy improvement.

scholarly journals Data Aggregation Framework on Wireless Sensor Networks

2019 ◽  
Vol 8 (6) ◽  
pp. 97-102
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Stream ◽  
Base Station ◽  
Information Gathering ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Power Performance ◽  
Joint Effort

Sensors are subjectively spread in the flighty conditions. Sensor nodes are self-sufficient, mindful and self-configurable objects for data accumulation and transmission. Sensor nodes are battery-worked devices. The battery reinforcement time depends on the computational capacity and their detecting range. Joint effort is fundamental one where the nodes deal with the data stream in network in vitality productive way. Sensors in WSN are composed to detect the data. The sensors are fit for calculations and contain wireless correspondence parts. Nodes consolidate the data gathered from each sensor hub in network. The gathered data are sent to the base station where it gives helpful data. The objective of the suggested paper is to contrast the efficiency of TAG in regards to power performance in contrast with and also without information gathering in wireless sensor networks as well as to evaluate the viability of the protocol in an atmosphere where sources are restricted.

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.

Sign in / Sign up

Export Citation Format

Share Document