A STATISTICAL APPROACH TOWARDS SECURE LOCATION VERIFICATION IN NOISY WIRELESS CHANNELS

2014 ◽  
Vol 25 (05) ◽  
pp. 563-584 ◽  
Author(s):  
PARTHA SARATHI MANDAL ◽  
ANIL K. GHOSH
Keyword(s):  
Statistical Approach ◽  
Probability Model ◽  
Distance Estimation ◽  
Sensor Nodes ◽  
Noisy Channel ◽  
Malicious Nodes ◽  
Noisy Channels ◽  
Location Verification ◽  
Limited Precision ◽  
Very High

Location verification in wireless sensor networks (WSNs) is quite challenging in the presence of malicious sensor nodes, which are called attackers. These attackers try to break the verification protocol by reporting their incorrect locations during the verification stage. In the literature of WSNs, most of the existing methods of location verification use a set of trusted verifiers, which are vulnerable to attacks by malicious nodes. These existing methods also use some distance estimation techniques, which are not accurate in noisy channels. In this article, we adopt a statistical approach for secure location verification to overcome these limitations. Our proposed method does not rely on any trusted entities and it takes care of the limited precision in distance estimation by using a suitable probability model for the noise. The resulting verification scheme detects and filters out all malicious nodes from the network with a very high probability even when it is in a noisy channel.

Detection of Malicious Spatial-Domain Steganography over Noisy Channels Using Convolutional Neural Networks

2020 ◽  
Vol 2020 (4) ◽  
pp. 76-1-76-7
Author(s):  
Swaroop Shankar Prasad ◽  
Ofer Hadar ◽  
Ilia Polian
Keyword(s):  
State Of The Art ◽  
Visual Quality ◽  
Channel Noise ◽  
Detection Accuracy ◽  
Noisy Channel ◽  
Noisy Channels ◽  
Reliable Transmission ◽  
Reliable Detection ◽  
Natural Noise ◽  
Will Force

Image steganography can have legitimate uses, for example, augmenting an image with a watermark for copyright reasons, but can also be utilized for malicious purposes. We investigate the detection of malicious steganography using neural networkbased classification when images are transmitted through a noisy channel. Noise makes detection harder because the classifier must not only detect perturbations in the image but also decide whether they are due to the malicious steganographic modifications or due to natural noise. Our results show that reliable detection is possible even for state-of-the-art steganographic algorithms that insert stego bits not affecting an image’s visual quality. The detection accuracy is high (above 85%) if the payload, or the amount of the steganographic content in an image, exceeds a certain threshold. At the same time, noise critically affects the steganographic information being transmitted, both through desynchronization (destruction of information which bits of the image contain steganographic information) and by flipping these bits themselves. This will force the adversary to use a redundant encoding with a substantial number of error-correction bits for reliable transmission, making detection feasible even for small payloads.

Security based on Received Signal Strength in Localization for Underwater Sensor Networks

2016 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Karamjeet Kaur ◽  
Gianetan Singh Sekhon
Keyword(s):  
Sensor Networks ◽  
Threshold Value ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Research Subjects ◽  
Malicious Nodes ◽  
Intermediate Node ◽  
End To End Delay ◽  
End To End

Underwater sensor networks are envisioned to enable a broad category of underwater applications such as pollution tracking, offshore exploration, and oil spilling. Such applications require precise location information as otherwise the sensed data might be meaningless. On the other hand, security critical issue as underwater sensor networks are typically deployed in harsh environments. Localization is one of the latest research subjects in UWSNs since many useful applying UWSNs, e.g., event detecting. Now day’s large number of localization methods arrived for UWSNs. However, few of them take place stability or security criteria. In purposed work taking up localization in underwater such that various wireless sensor nodes get localize to each other. RSS based localization technique used remove malicious nodes from the communication intermediate node list based on RSS threshold value. Purposed algorithm improves more throughput and less end to end delay without degrading energy dissipation at each node. The simulation is conducted in MATLAB and it suggests optimal result as comparison of end to end delay with and without malicious node.

scholarly journals Phylogeographic Structure of White Oaks Throughout the European Continent

Genetics ◽  
1997 ◽  
Vol 146 (4) ◽  
pp. 1475-1487 ◽  
Author(s):  
S Dumolin-Lapègue ◽  
B Demesure ◽  
S Fineschi ◽  
V Le Come ◽  
R J Petit
Keyword(s):  
Statistical Approach ◽  
Restriction Analysis ◽  
Phylogeographic Structure ◽  
White Oak ◽  
European Continent ◽  
The Balkans ◽  
Left Behind ◽  
The Difference ◽  
Mantel’S Test ◽  
Very High

Patterns of chloroplast DNA (cpDNA) variation were studied in eight white oak species by sampling 345 populations throughout Europe. The detection of polymorphisms by restriction analysis of PCR-amplified cpDNA fragments allowed the identification of 23 haplotypes that were phylogenetically ordered. A systematic hybridization and introgression between the eight species studied is evident. The levels of subdivision for unordered (G  ST) and ordered (N  ST) alleles are very high and close (0.83 and 0.85). A new statistical approach to the quantitative study of phylogeography is presented, which relies on the coefficients of differentiation G  ST and N  ST and the Mantel's test. Based on pairwise comparisons between populations, the significance of the difference between both coefficients is evaluated at a global and a local scale. The mapped distribution of the haplotypes indicates the probable routes of postglacial recolonization followed by oak populations that had persisted in southern refugia, especially in the Iberian peninsula, Italy and the Balkans. Most cpDNA polymorphisms appear to be anterior to the befinnina of the last recolonization. A subset of the preexisting haplotypes have merely expanded north, while others were left behind in the south.

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.

Analytical failure probability model for generic gravity dam classes

2017 ◽  
Vol 231 (5) ◽  
pp. 546-557 ◽  
Author(s):  
Mohammad Amin Hariri-Ardebili
Keyword(s):  
Failure Probability ◽  
Safety Assessment ◽  
Statistical Approach ◽  
Probability Model ◽  
Gravity Dam ◽  
Preliminary Design ◽  
Failure Model ◽  
Proposed Model ◽  
Dimensional Gravity ◽  
Demand And Capacity

Risk analysis of concrete dams and quantification of the failure probability are important tasks in dam safety assessment. The conditional probability of demand and capacity is usually estimated by numerical simulation and Monte Carlo technique. However, the estimated failure probability (or the reliability index) is dam-dependent which makes its application limited to some case studies. This article proposes an analytical failure model for generic gravity dam classes which is optimized based on large number of nonlinear finite element analyses. A hybrid parametric–probabilistic–statistical approach is used to estimate the failure probability as a function of dam size, material distributional models and external hydrological hazard. The proposed model can be used for preliminary design and evaluation of two-dimensional gravity dam models.

Probabilistic secret sharing through noise quantum channe

2012 ◽  
Vol 12 (3&4) ◽  
pp. 253-261
Author(s):  
Satyabrata Adhikari ◽  
Indranil Chakrabarty ◽  
Pankaj Agrawal
Keyword(s):  
Quantum Information ◽  
Secret Sharing ◽  
Mixed State ◽  
Pure State ◽  
Noisy Channel ◽  
Noisy Channels ◽  
Superdense Coding ◽  
Classical Information ◽  
Phase Damping ◽  
Realistic Situation

In a realistic situation, the secret sharing of classical or quantum information will involve the transmission of this information through noisy channels. We consider a three qubit pure state. This state becomes a mixed-state when the qubits are distributed over noisy channels. We focus on a specific noisy channel, the phase-damping channel. We propose a protocol for secret sharing of classical information with this and related noisy channels. This protocol can also be thought of as cooperative superdense coding. We also discuss other noisy channels to examine the possibility of secret sharing of classical information.

scholarly journals Convolutional technique for enhancing security in wireless sensor networks against malicious nodes

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
Turki Ali Alghamdi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Computational Complexity ◽  
Convolutional Codes ◽  
Time Instant ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Malicious Nodes ◽  
Security Issues ◽  
Network Operation

Abstract Wireless sensor networks (WSNs) comprise tiny devices known as sensors. These devices are frequently employed in short-range communications and can perform various operations such as monitoring, collecting, analyzing, and processing data. WSNs do not require any infrastructure, are reliable, and can withstand adverse conditions. Sensor networks are autonomous structures in which the sensor nodes can enter or leave the network at any time instant. If the entering node is attacker node it will monitor the network operation and can cause security issues in the network that can affect communication. Existing literature presents security improvements in such networks in the form of cryptography, asymmetric techniques, key distribution, and various protocols. However, these techniques may not be effective in the case of autonomous structures and can increase computational complexity. In this paper, a convolutional technique (CT) is proposed that generates security bits using convolutional codes to prevent malicious node attacks on WSNs. Different security codes are generated at different hops and the simulation results demonstrate that the proposed technique enhances network security and reduces computational complexity compared to existing approaches.

A statistical approach to identifying closed object boundaries in images

1994 ◽  
Vol 26 (4) ◽  
pp. 831-854 ◽  
Author(s):  
Jeffrey D. Helterbrand ◽  
Noel Cressie ◽  
Jennifer L. Davidson
Keyword(s):  
Prior Probability ◽  
Statistical Approach ◽  
Transition Probability ◽  
Probability Model ◽  
Monte Carlo Algorithm ◽  
Structural Components ◽  
Stationary Model ◽  
Boundary Estimate ◽  
Image Domain ◽  
Statistical Approaches

In this research, we present a statistical theory, and an algorithm, to identify one-pixel-wide closed object boundaries in gray-scale images. Closed-boundary identification is an important problem because boundaries of objects are major features in images. In spite of this, most statistical approaches to image restoration and texture identification place inappropriate stationary model assumptions on the image domain. One way to characterize the structural components present in images is to identify one-pixel-wide closed boundaries that delineate objects. By defining a prior probability model on the space of one-pixel-wide closed boundary configurations and appropriately specifying transition probability functions on this space, a Markov chain Monte Carlo algorithm is constructed that theoretically converges to a statistically optimal closed boundary estimate. Moreover, this approach ensures that any approximation to the statistically optimal boundary estimate will have the necessary property of closure.

A Trust-Aware and Location-Based Secure Routing Protocol for WSN

2013 ◽  
Vol 373-375 ◽  
pp. 1931-1934 ◽  
Author(s):  
Yi Min Zhou ◽  
La Yuan Li
Keyword(s):  
Routing Protocol ◽  
Trust Management ◽  
Large Scale ◽  
Resource Constraints ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Malicious Nodes ◽  
Distributed Sensor ◽  
Trust Management System ◽  
Secure Routing Protocol

The Wireless Sensor Network applications has widely been used over the last few years. WSN is a novel self-organization wireless network which is made up of randomly distributed sensor Nodes. Due to some resource constraints, the design of security in WSN encounters a great many of new challenges. It is vulnerable to attack, which is harmful for availability of WSN. In this paper we propose a trust-aware and location-based secure routing protocol which protects WSN against routing attacks, and also supports large-scale WSN deployments. The proposed protocol is extended from GPSR protocol, which imports security mechanism that depends on a distributed trust management system. The solution has been shown to efficiently detect and avoid malicious nodes.

Sign in / Sign up

Export Citation Format

Share Document