Data Security in WSN Research Papers (original) (raw)

Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and databases to the centralized large data centers, where the management of the data and services may not be... more

Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and databases to the centralized large data centers, where the management of the data and services may not be fully trustworthy. This unique paradigm brings about many new security challenges, which have not been well understood. This work studies the problem of ensuring the integrity of data storage in Cloud Computing. In particular, we consider the task of allowing a third party auditor (TPA), on behalf of the cloud client, to verify the integrity of the dynamic data stored in the cloud. The introduction of TPA eliminates the involvement of client through the auditing of whether his data stored in the cloud is indeed intact, which can be important in achieving economies of scale for Cloud Computing. The support for data dynamics via the most general forms of data operation, such as block modification, insertion and deletion, is also a significant step toward practicality, since services in Cloud Computing are not limited to archive or backup data only. While prior works on ensuring remote data integrity often lacks the support of either public verifiability or dynamic data operations, this paper achieves both. We first identify the difficulties and potential security problems of direct extensions with fully dynamic data updates from prior works and then show how to construct an elegant verification scheme for seamless integration of these two salient features in our protocol design. In particular, to achieve efficient data dynamics, we improve the Proof of Retrievability model [1] by manipulating the classic Merkle Hash Tree (MHT) construction for block tag authentication. Extensive security and performance analysis show that the proposed scheme is highly efficient and provably secure.

Routing protocols in wireless sensor networks (WSN) have been substantially investigated by researches. Most state-of-the-art surveys have focused on reviewing the different routing schemes that have been proposed for WSN and classifying... more

Routing protocols in wireless sensor networks (WSN) have been substantially investigated by researches. Most state-of-the-art surveys have focused on reviewing the different routing schemes that have been proposed for WSN and classifying them based on the network's type and protocol's operation. Security aspects in routing protocols have not been given enough attention, since most of the routing protocols in WSNs have not been designed with security requirements in mind. However, taking into consideration that WSN applications need to support critical infrastructures (i.e., military, healthcare, environmental, etc.), security becomes an issue. And since these infrastructures are highly depended on the availability of resources, focus has especially been given to support a secure, resilient and reliable environment, with multipath routing being one of the added functionalities. The need for security in sensitive WSN application has lead researchers to design secure multipath routing protocols from the beginning or design security extensions for existing protocols. This paper surveys the current state-of-the-art of secure multipath routing protocols in WSNs, classifies the protocols in categories according to their security-related operational objectives, defines a new threat model in the routing procedure and identifies open research issues in the area.

Image Steganography is a thriving researcharea of information security where secret data is embedded in images to hide its existence while getting the minimum possible statistical detectability. This paper proposes a novel magic least... more

Image Steganography is a thriving researcharea of information security where secret
data is embedded in images to hide its existence while getting the minimum possible statistical
detectability. This paper proposes a novel magic least significant bit substitution method (M-LSBSM) for RGB images. The proposed method is based on the achromatic component (I-plane) of
the hue-saturation-intensity (HSI) color model and multi-level encryption (MLE) in the spatial
domain. The input image is transposed and converted into an HSI color space. The I-plane is
divided into four sub-images of equal size, rotating each sub-image with a different angle using a
secret key. The secret information is divided intofour blocks, which are then encrypted using an
MLE algorithm (MLEA). Each sub-block of the message is embedded into one of the rotated subimages based on a specific pattern using magic LSB substitution. Experimental results validate that
the proposed method not only enhances the visual quality of stego images but also provides good
imperceptibility and multiple security levels as compared to several existing prominent methods.

A recent research thread focused on Unattended Wireless Sensor Networks (UWSNs), that are characterized by the intermittent presence of the sink. An adversary can take advantage of this behavior trying to erase a piece of information... more

A recent research thread focused on Unattended Wireless Sensor Networks (UWSNs), that are characterized by the intermittent presence of the sink. An adversary can take advantage of this behavior trying to erase a piece of information sensed by the network before the sink collects it. Therefore, without a mechanism in place to assure data availability, the sink will not ever know that a datum has been compromised. In this paper, we adopt data replication to assure data survivability in UWSNs. In particular, we revisit an epidemic model and show that, even if the data replication process can be modelled as the spreading of a disease in a finite population, new problems that have not been discovered before arise: optimal parameters choice for the model do not assure the intended data survivability. The problem is complicated by the fact that it is driven by two conflicting parameters: On the one hand the flooding of the datum has to be avoided-due to the sensor resource constraints-, while on the other hand data survivability depends on the data replication rate. Using advanced probabilistic tools we achieve a theoretically sound result that assures at the same time: Data survivability, an optimal usage of sensors resources, and a fast and predictable collecting time. These results have been achieved in both the full visibility and the geometrical model. Finally, extensive simulation results support our findings.

Low power and limited processing are characteristics of nodes in Wireless sensor networks. Therefore, optimal consumption of energy for WSN protocols seems essential. In a number of WSN applications, sensor nodes sense data periodically... more

Low power and limited processing are characteristics of nodes in Wireless sensor networks. Therefore, optimal
consumption of energy for WSN protocols seems essential. In a number of WSN applications, sensor nodes sense data
periodically from environment and transfer it to the sink. Because of limitation in energy and selection of best route,
for the purpose of increasing network remaining energy a node with most energy level will be used for transmission
of data. The most part of energy in nodes is wasted on radio transmission; thus decreasing number of transferred
packets in the network will result in increase in node and network lifetimes. In algorithms introduced for data
transmission in such networks up to now, a single route is used for data transmissions that results in decrease in
energy of nodes located on this route which in turn results in increasing of remaining energy. In this paper a new
method is proposed for selection of data transmission route that is able to solve this problem. This method is based
on learning automata that selects the route with regard to energy parameters and the distance to sink. In this method
energy of network nodes finishes rather simultaneously preventing break down of network into two separate parts.
This will result in increased lifetime. Simulation results show that this method has been very effective in increasing of
remaining energy and it increases network lifetime.

This work focuses on the development of relatively simple, low cost, autonomous and feasible wireless sensor network and related embedded system combination to be integrated with AMATEUR UAV and unmanned ground vehicle (UGV) management... more

This work focuses on the development of relatively
simple, low cost, autonomous and feasible wireless sensor
network and related embedded system combination to be
integrated with AMATEUR UAV and unmanned ground vehicle
(UGV) management system both at inter and intra level
communication and networking for different modules and
different vehicles. What we describe here is our progress in a
ongoing live project. We also make fresh implementable
proposals to integrate autonomous Amateur UAV and share
plans to implement it for vehicle management system using
intelligent communication and networked system approach. We
envision the capability of modern sensing network where
communication between different sensors and embedded system combination enable user to have a closer view over larger area and provide potent capability of acting autonomously.

Recently, the applications scope of Wireless Sensor Networks (WSNs) has been broadened. WSN communication security is important because sensor nodes are vulnerable to various security attacks when deployed in an open environment. An... more

Recently, the applications scope of Wireless Sensor Networks (WSNs) has been broadened. WSN communication security is important because sensor nodes are vulnerable to various security attacks when deployed in an open environment. An adversary could exploit this vulnerability to inject false reports into the network. En-route filtering techniques have been researched to block false reports. The CFFS scheme filters the false report by collaboratively validating the report by clustering the nodes. However, CFFS is not considered effective against repetitive attacks. Repeated attacks have a significant impact on network lifetime. In this paper, we propose a method to detect repetitive attacks with cluster-based false data filtering and to identify the compromised nodes and quickly block them. The proposed scheme uses fuzzy logic to determine the distribution of additional keys according to the network conditions, thereby improving energy efficiency.

The secret sharing schemes are the important tools in cryptography that are used as building blocks in many secured protocols. It is a method used for distributing a secret among the participants in a manner that only the threshold number... more

The secret sharing schemes are the important tools in cryptography that are used as building blocks in many secured protocols. It is a method used for distributing a secret among the participants in a manner that only the threshold number of participants together can recover the secret and the remaining set of participants cannot get any information about the secret. Secret sharing schemes are absolute for storing highly sensitive and important information. In a secret sharing scheme, a secret is divided into several shares. These shares are then distributed to the participants’ one each and thus only the threshold (t) number of participants can recover the secret. In this paper we have used Mignotte’s Sequence based Secret Sharing for distribution of shares to the participants. A (k, m) Mignotte's sequence is a sequence of pair wise co-prime positive integers. We have proposed a new method for reconstruction of secret even with t-1 shares using the SMT solver.