The false data injection attack is a major security threat in Wireless Sensor Network (WSN) since is
degrades the network capability. The bandwidth efficient cooperative authentication (BECAN) scheme is
used for filtering the false data injection attack. It is used to save energy of sensor nodes in WSN by early
detection and filtering of maximum possible injected false data. Source authentication is a critical security
requirement in wireless sensor networks to identify attacker nodes that injects false data. Solutions based
on Elliptic Curve Cryptography (ECC) have been used for source authentication, but they suffer from
severe energy depletion. This results in high computational and communication overheads. Bloom filter
based Symmetric-key source authentication scheme exhibits low authentication overhead .This avoids the
inherent problems associated with public key cryptography based schemes. The current work demonstrates
the efficiency of bloom filter based source authentication using BECAN scheme by comparing ECC and
Bloom filter based methods in terms of energy consumption
A NOVEL SECURE COSINE SIMILARITY COMPUTATION SCHEME WITH MALICIOUS ADVERSARIESIJNSA Journal
Similarity coefficients play an important role in many aspects. Recently, several schemes were proposed, but these schemes aimed to compute the similarity coefficients of binary data. In this paper, a novel scheme
which can compute the coefficients of integer is proposed. To the best knowledge of us, this is the first scheme which canesist malicious adversaries attack.
Enhanced security for non English users of Wireless Sensor NetworksEswar Publications
Wireless Sensor Networks is an infrastructure less, self-configured, reprogrammable, energy-aware network used
in various applications. Many networks works on security of data including mainly ASCII values but not the non English end users. BDNA cryptography describes how to encrypt non English patterns but which leads to propagation of more bits transmitted means indirectly consumes more energy in WSN. In this we propose new steps to reduce the transmission of more bytes in the network. This gives high propagation speed in the network with minimum hash overhead.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
MEKDA: Multi-Level ECC based Key Distribution and Authentication in Internet ...IJCNCJournal
The Internet of Things (IoT) is an extensive system of networks and connected devices with minimal human interaction and swift growth. The constraints of the System and limitations of Devices pose several challenges, including security; hence billions of devices must protect from attacks and compromises. The resource-constrained nature of IoT devices amplifies security challenges. Thus standard data communication and security measures are inefficient in the IoT environment. The ubiquity of IoT devices and their deployment in sensitive applications increase the vulnerability of any security breaches to risk lives. Hence, IoT-related security challenges are of great concern. Authentication is the solution to the vulnerability of a malicious device in the IoT environment. The proposed Multi-level Elliptic Curve Cryptography based Key Distribution and Authentication in IoT enhances the security by Multi-level Authentication when the devices enter or exit the Cluster in an IoT system. The decreased Computation Time and Energy Consumption by generating and distributing Keys using Elliptic Curve Cryptography extends the availability of the IoT devices. The Performance analysis shows the improvement over the Fast Authentication and Data Transfer method.
A KEY LEVEL SELECTION WITHIN HASH CHAINS FOR THE EFFICIENT ENERGY CONSUMPTION...ijasa
A wireless sensor network is composed of a base station (BS) and numerous sensor nodes. The sensor
nodes lack security because they operate in an open environment, such as the military. In particular, a false
report injection attack captures and compromises sensor nodes. The attack then causes the compromised
nodes to generate forward false reports. Owing to the false report injection attack, not only does the sensor
network have a false alarm, but its limited energy is also drained. In order to defend the false report
injection attack, over the past few years, several studies have been made looking for a solution to the
attack. Ye et al. studied statistical en-route filtering (SEF). SEF is a method of stochastically verifying event
reports in the en-route filtering phase. SEF can filter many false reports early using verification of
intermediate nodes. However, because the number of keys in a sensor node is fixed by the system, the
sensor network cannot control the event report verification probability depending on the circumstances of
the network. Therefore, it is difficult to efficiently consume energy of the sensor network. In order to solve
the problem, we propose a method which controls the event report verification probability by using a key
sequence level of an event report. In the proposed method, when an intermediate node receives an event
report, the node verifies the event report by comparing a key sequence level of the report and its key
sequence level. Elements determining the key sequence level include the density of neighbour nodes in the
sensing range of a center of stimulus (CoS), the number of hops from the CoS to the BS, and the average of
the key sequence level of intermediate nodes in each path. We simulated the proposed method and the SEF
method to evaluate the performance in terms of energy efficiency and security. In the simulation results, the
proposed method consumed an average of 7.9% less energy of the sensor nodes compared to SEF method.
The number of false reports arriving at the BS of the proposed method was also less, by an average of 6.4,
compared to the SEF method. Through the results, we can see that when the number of false report is large
in the sensor network, the proposed method is more energy-efficient and secure than the SEF method.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The document summarizes a master's thesis that proposes secure communication protocols for wireless biosensor networks. It introduces the motivation and problem of developing protocols to securely form clusters in biosensor networks. It then outlines the system model, traditional cluster formation protocol, security flaws, proposed centralized and distributed secure protocols, security analysis, implementation details and conclusions/future work.
Image Based Relational Database Watermarking: A Surveyiosrjce
This document summarizes and analyzes several existing image-based relational database watermarking techniques. It begins with background on database watermarking, including applications, classifications of techniques, desired characteristics of watermarked databases, and types of attacks. It then reviews four specific algorithms that embed image watermarks into database attributes. The algorithms are analyzed for robustness against different attacks like modification, deletion and addition of tuples. The document concludes various image-based techniques are effective for copyright protection and survive attacks while preserving data integrity.
A NOVEL SECURE COSINE SIMILARITY COMPUTATION SCHEME WITH MALICIOUS ADVERSARIESIJNSA Journal
Similarity coefficients play an important role in many aspects. Recently, several schemes were proposed, but these schemes aimed to compute the similarity coefficients of binary data. In this paper, a novel scheme
which can compute the coefficients of integer is proposed. To the best knowledge of us, this is the first scheme which canesist malicious adversaries attack.
Enhanced security for non English users of Wireless Sensor NetworksEswar Publications
Wireless Sensor Networks is an infrastructure less, self-configured, reprogrammable, energy-aware network used
in various applications. Many networks works on security of data including mainly ASCII values but not the non English end users. BDNA cryptography describes how to encrypt non English patterns but which leads to propagation of more bits transmitted means indirectly consumes more energy in WSN. In this we propose new steps to reduce the transmission of more bytes in the network. This gives high propagation speed in the network with minimum hash overhead.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
MEKDA: Multi-Level ECC based Key Distribution and Authentication in Internet ...IJCNCJournal
The Internet of Things (IoT) is an extensive system of networks and connected devices with minimal human interaction and swift growth. The constraints of the System and limitations of Devices pose several challenges, including security; hence billions of devices must protect from attacks and compromises. The resource-constrained nature of IoT devices amplifies security challenges. Thus standard data communication and security measures are inefficient in the IoT environment. The ubiquity of IoT devices and their deployment in sensitive applications increase the vulnerability of any security breaches to risk lives. Hence, IoT-related security challenges are of great concern. Authentication is the solution to the vulnerability of a malicious device in the IoT environment. The proposed Multi-level Elliptic Curve Cryptography based Key Distribution and Authentication in IoT enhances the security by Multi-level Authentication when the devices enter or exit the Cluster in an IoT system. The decreased Computation Time and Energy Consumption by generating and distributing Keys using Elliptic Curve Cryptography extends the availability of the IoT devices. The Performance analysis shows the improvement over the Fast Authentication and Data Transfer method.
A KEY LEVEL SELECTION WITHIN HASH CHAINS FOR THE EFFICIENT ENERGY CONSUMPTION...ijasa
A wireless sensor network is composed of a base station (BS) and numerous sensor nodes. The sensor
nodes lack security because they operate in an open environment, such as the military. In particular, a false
report injection attack captures and compromises sensor nodes. The attack then causes the compromised
nodes to generate forward false reports. Owing to the false report injection attack, not only does the sensor
network have a false alarm, but its limited energy is also drained. In order to defend the false report
injection attack, over the past few years, several studies have been made looking for a solution to the
attack. Ye et al. studied statistical en-route filtering (SEF). SEF is a method of stochastically verifying event
reports in the en-route filtering phase. SEF can filter many false reports early using verification of
intermediate nodes. However, because the number of keys in a sensor node is fixed by the system, the
sensor network cannot control the event report verification probability depending on the circumstances of
the network. Therefore, it is difficult to efficiently consume energy of the sensor network. In order to solve
the problem, we propose a method which controls the event report verification probability by using a key
sequence level of an event report. In the proposed method, when an intermediate node receives an event
report, the node verifies the event report by comparing a key sequence level of the report and its key
sequence level. Elements determining the key sequence level include the density of neighbour nodes in the
sensing range of a center of stimulus (CoS), the number of hops from the CoS to the BS, and the average of
the key sequence level of intermediate nodes in each path. We simulated the proposed method and the SEF
method to evaluate the performance in terms of energy efficiency and security. In the simulation results, the
proposed method consumed an average of 7.9% less energy of the sensor nodes compared to SEF method.
The number of false reports arriving at the BS of the proposed method was also less, by an average of 6.4,
compared to the SEF method. Through the results, we can see that when the number of false report is large
in the sensor network, the proposed method is more energy-efficient and secure than the SEF method.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The document summarizes a master's thesis that proposes secure communication protocols for wireless biosensor networks. It introduces the motivation and problem of developing protocols to securely form clusters in biosensor networks. It then outlines the system model, traditional cluster formation protocol, security flaws, proposed centralized and distributed secure protocols, security analysis, implementation details and conclusions/future work.
Image Based Relational Database Watermarking: A Surveyiosrjce
This document summarizes and analyzes several existing image-based relational database watermarking techniques. It begins with background on database watermarking, including applications, classifications of techniques, desired characteristics of watermarked databases, and types of attacks. It then reviews four specific algorithms that embed image watermarks into database attributes. The algorithms are analyzed for robustness against different attacks like modification, deletion and addition of tuples. The document concludes various image-based techniques are effective for copyright protection and survive attacks while preserving data integrity.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
Toward a statistical framework for source anonymity in sensor networksJPINFOTECH JAYAPRAKASH
This document proposes a new statistical framework for modeling, analyzing, and evaluating anonymity in sensor networks. The framework introduces the notion of "interval indistinguishability" to quantitatively measure anonymity. It maps the source anonymity problem to the statistical problem of binary hypothesis testing with nuisance parameters. Existing solutions are analyzed using this framework, showing how anonymity can be improved by finding an appropriate data transformation to remove nuisance information. Mapping the problem to binary hypothesis testing opens opportunities to apply coding theory to anonymous sensor networks.
UTILIZING XAI TECHNIQUE TO IMPROVE AUTOENCODER BASED MODEL FOR COMPUTER NETWO...IJCNCJournal
Machine learning (ML) and Deep Learning (DL) methods are being adopted rapidly, especially in computer network security, such as fraud detection, network anomaly detection, intrusion detection, and much more. However, the lack of transparency of ML and DL based models is a major obstacle to their implementation and criticized due to its black-box nature, even with such tremendous results. Explainable Artificial Intelligence (XAI) is a promising area that can improve the trustworthiness of these models by giving explanations and interpreting its output. If the internal working of the ML and DL based models is understandable, then it can further help to improve its performance. The objective of this paper is to show that how XAI can be used to interpret the results of the DL model, the autoencoder in this case. And, based on the interpretation, we improved its performance for computer network anomaly detection. The kernel SHAP method, which is based on the shapley values, is used as a novel feature selection technique. This method is used to identify only those features that are actually causing the anomalous behaviour of the set of attack/anomaly instances. Later, these feature sets are used to train and validate the autoencoderbut on benign data only. Finally, the built SHAP_Model outperformed the other two models proposed based on the feature selection method. This whole experiment is conducted on the subset of the latest CICIDS2017 network dataset. The overall accuracy and AUC of SHAP_Model is 94% and 0.969, respectively.
Toward a statistical framework for source anonymity in sensor networksJPINFOTECH JAYAPRAKASH
The document proposes a new statistical framework for modeling, analyzing, and evaluating anonymity in sensor networks. The framework introduces the notion of "interval indistinguishability" to quantitatively measure anonymity. It maps the source anonymity problem to the statistical problem of binary hypothesis testing with nuisance parameters. This transforms the problem from analyzing real-valued samples to binary codes, allowing coding theory techniques to be applied for improving anonymity in sensor networks.
Detecting Misbehavior Nodes Using Secured Delay Tolerant NetworkIRJET Journal
This document proposes a method called Statistical-based Detection of Blackhole and Greyhole attackers (SDBG) to detect misbehaving nodes in delay tolerant networks. SDBG can detect both individual misbehaving nodes as well as nodes that are colluding together. It works by having each node record encounter data with other nodes, including the number of messages sent and received. Individual nodes that drop many messages can be detected based on having a low message forwarding ratio. Colluding nodes can be detected because they will have sent many messages to each other to fake good behavior. The method aims to accurately detect misbehaving nodes while keeping false positives low. Extensive simulations showed it can work well across different network conditions.
Secret key extraction from wireless signal strength in real environmentsMuthu Sybian
Sybian Technologies is a leading IT services provider & custom software development company. We offer full cycle custom software development services, from product idea, offshore software development to outsourcing support & enhancement. Sybian employs a knowledgeable group of software developers coming from different backgrounds. We are able to balance product development efforts & project duration to your business needs.
Sybian Technologies invests extensively in R&D to invent new solutions for ever changing needs of your businesses, to make it future-proof, sustainable and consistent. We work in close collaboration with academic institutions and research labs across the world to design, implement and support latest IT based solutions that are futuristic, progressive and affordable. Our services continue to earn trust and loyalty from its clients through its commitment to the following parameters
Final Year Projects & Real Time live Projects
JAVA(All Domains)
DOTNET(All Domains)
ANDROID
EMBEDDED
VLSI
MATLAB
Project Support
Abstract, Diagrams, Review Details, Relevant Materials, Presentation,
Supporting Documents, Software E-Books,
Software Development Standards & Procedure
E-Book, Theory Classes, Lab Working Programs, Project Design & Implementation
24/7 lab session
Final Year Projects For BE,ME,B.Sc,M.Sc,B.Tech,BCA,MCA
PROJECT DOMAIN:
Cloud Computing
Networking
Network Security
PARALLEL AND DISTRIBUTED SYSTEM
Data Mining
Mobile Computing
Service Computing
Software Engineering
Image Processing
Bio Medical / Medical Imaging
Contact Details:
Sybian Technologies Pvt Ltd,
No,33/10 Meenakshi Sundaram Building,
Sivaji Street,
(Near T.nagar Bus Terminus)
T.Nagar,
Chennai-600 017
Ph:044 42070551
Mobile No:9790877889,9003254624,7708845605
Mail Id:sybianprojects@gmail.com,sunbeamvijay@yahoo.com
Hop by hop message authentication chapter 1Selva Raj
This document discusses hop-by-hop message authentication in wireless sensor networks. It discusses how symmetric-key based approaches have key management and scalability issues and how public-key based approaches have high computational overhead. It then summarizes a proposed source anonymous message authentication scheme that provides hop-by-hop node authentication without threshold limitations and has better performance than symmetric-key based schemes. The scheme is based on optimal modified ElGamal signature and provides source anonymity, compromise resilience, and flexible time authentication.
LOAD BALANCING MANAGEMENT USING FUZZY LOGIC TO IMPROVE THE REPORT TRANSFER SU...cscpconf
A wireless sensor network (WSN) consists of multiple sensor nodes and base stations (BS) that
collect information over widely deployed sensor nodes. Sensor nodes have limited energy source
and low computing power. Due to those features, there is a disadvantage that user's individual
node management is difficult and they are easily captured by attackers. Therefore, efficient
energy allocation of nodes is important and network security protocol is needed. The
Probabilistic Voting Filtering System (PVFS) is a system that prevents false vote injection
attack and false report attack injected from attackers. The reason for the existence of this
protocol is for energy management of nodes through defence against those attacks and in order
to efficiently manage the network based on PVFS, load balancing of nodes should be performed.
In the proposed scheme, fuzzy logic is applied to each cluster head node (CH) to perform load
balancing by determine whether to perform a role as a verification node and an event
forwarding node. The experiment shows that the event detection rate and the report delivery
success rate are improved in proposed scheme compare with original PVFS.
Enhanced Authentication Mechanism in WLAN via MMBSPSRAJESH DUVVURU
The ability to provide a Quality of Service (QoS) is one of the
challenging aspects of any Wireless Network. This paper
concentrates in improvising the speedy authentication
mechanism in Wireless Local Area Network (WLAN). To
fulfill the specified important issue, this work introduces a
novel Multi Merged Bio-Cryptographic Security-Aware
Packet Scheduling (MMBSPS) algorithm. In merging the
different biometric images, it is commenced with the new
merging mechanism called Triple Equally Segmented Bio-
Image (TESB) algorithm and later it is encrypted with the
RSA algorithm for efficient security. Matlab tool is used for
conducting the simulations on Multi Merged Bio-Images
(MMBI) and Bio-Images. The results of MMBSPS algorithm
is presented in contrast with the EMBSPS and EBSPS
algorithms. In the results, it is observed that, MMBSPS
algorithm is working better than existing EMBSPS and
EBSPS algorithms with respect to the speedy authentication
besides assuring security in WLAN. It is also observed the
overall performance of MMBSPS is improved by
approximately 23% in terms of authentication mechanism in
WLAN.
ATMC: Anonymity and Trust Management Scheme Applied to Clustered Wireless Sen...IDES Editor
Wireless Sensor Networks consists of sensor nodes
that are capable of sensing the information and maintaining
security. In this paper, an Anonymity and Trust Management
Scheme applied to Clustered Wireless Sensor Networks
(ATMC) is proposed which enhances the security level. It also
provides a stable path for communication. It is observed that
the performance of the network is better than existing schemes
through simulation
A Novel Classification via Clustering Method for Anomaly Based Network Intrus...IDES Editor
Intrusion detection in the internet is an active
area of research. Intruders can be classified into two
types, namely; external intruders who are unauthorized
users of the computers they attack, and internal
intruders, who have permission to access the system but
with some restrictions. The aim of this paper is to present
a methodology to recognize attacks during the normal
activities in a system. A novel classification via sequential
information bottleneck (sIB) clustering algorithm has
been proposed to build an efficient anomaly based
network intrusion detection model. We have compared
our proposed method with other clustering algorithms
like X-Means, Farthest First, Filtered clusters, DBSCAN,
K-Means, and EM (Expectation-Maximization)
clustering in order to find the suitability of our proposed
algorithm. A subset of KDDCup 1999 intrusion detection
benchmark dataset has been used for the experiment.
Results show that the proposed method is efficient in
terms of detection accuracy, low false positive rate in
comparison to the other existing methods.
WSN performance based on node placement by genetic algorithm at smart home en...TELKOMNIKA JOURNAL
Wireless sensor connectivity is one of several factors that determines the communication reliability of each node. The placement of the node depends on the area that covered by wireless coverage area, so the node placement should be optimally placed. But the other aspect is the sensor coverage area. Sensor coverage area sometimes could be different with wireless sensor coverage area. Based on that situation, it needs to optimize that situation. Genetic Algorithm is an algorithm that utilizes a heuristic approach that uses biological mechanism evolution. It used to evolution the best position of Sensor Node based on Wireless and Sensor coverage area. After the position of each node generated by Genetic Algorithm, it still needs to evaluate the wireless sensor node performance. The performance indicates that the genetic algorithm can be used to determine sensor node placement in the smart home environment. The smart home environment used to monitor event at the house such as wildfire. In this research used Quality of Services (QoS) to measure wireless sensor performance. The experimental testing scenario will be used to place several nodes that generated. The QoS performed systems reliability that produced based on 3, 4 and 5 testing nodes, the minimum and maximum of each: delay is 6.21 and 8.74 milliseconds, jitter is 0.11 and 1.59 Hz and throughput is 68.83 and 90.49 bps. Based on ETSI classification, the performance of sensor node placement is Good and acceptable in real-time systems.
A novel algorithm to protect and manage memory locationsiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
An Enhanced Detection and Energy-Efficient En-Route Filtering Scheme in Wirel...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes (MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%)
AN ENHANCED DETECTION AND ENERGYEFFICIENT EN-ROUTE FILTERING SCHEME IN WIRELE...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a
fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes
(MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network
energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%) against false report attacks in WSNs.
Filtering Schemes for Injected False Data in WsnIOSR Journals
This document summarizes and compares several en-route filtering schemes that aim to detect and drop false data reports injected by compromised nodes in wireless sensor networks. It first describes statistical en-route filtering (SEF), commutative cipher based en-route filtering (CCEF), secure ticket-based en-route filtering (STEF), and dynamic en-route filtering (DEF). It then focuses on the bandwidth efficient cooperative authentication (BECAN) scheme, and proposes adding a hybrid authentication scheme (HAS) based on RSA encryption to increase BECAN's security by preventing compromised nodes from gathering enough signatures to inject false reports. The document implements this approach in NS2 and results show it has lower energy consumption and higher throughput than existing methods
IRJET- Enhanced ID based Data Aggregation and Detection Against Sybil Attack ...IRJET Journal
This document summarizes a research paper that proposes a Challenge-Response Authentication Protocol (CRAP) to detect Sybil attacks in wireless sensor networks. The CRAP generates unique keys for each transmission to provide encrypted communication. It is used to prevent Sybil attacks where an attacker steals node identities during data transmission. The performance of the detection scheme is evaluated using detection ratio. The proposed CRAP involves three phases: 1) nodes are selected and grouped, 2) two nearby nodes transmit packets to detect collisions indicating Sybil nodes, 3) if no hop is detected between Sybil identities, the nodes are confirmed to be under attack. The scheme is analyzed using performance metrics like packet delivery ratio, energy efficiency, and attack detection ratio.
A SECURE CLUSTER BASED COMMUNICATION IN WIRELESS NETWORK USING CRYPTOGRAPHIC ...IJNSA Journal
Mobile Adhoc Networks are becoming very popular in current Wireless Technology, which is been associated to business, socially and in some critical applications like Military etc, The network which is formed by self configuring wireless links which are connected to each other. These applications are categorized by hostile environment that they serve while communicating between nodes. However in such Wireless Network will be more exposed to different types of security attacks. The challenge is to meet secure network communication. In this paper we focus on cluster based secure communication to improve the reliability between clusters. In this scheme the Cluster Members (CM) submits a report to the Cluster Head (CH) and temporarily stores Evidences as a security tokens. The reports contain digital signatures. The CH will verify the consistency of the CM report and updates to Accounting Centre (AC). AC will verify the uniformity of reports and clears the cryptographic operations. For attacker nodes, the security tokens are requested to classify and expel the attacker nodes which submit wrong reports.
A SECURE CLUSTER BASED COMMUNICATION IN WIRELESS NETWORK USING CRYPTOGRAPHIC ...IJNSA Journal
Mobile Adhoc Networks are becoming very popular in current Wireless Technology, which is been
associated to business, socially and in some critical applications like Military etc, The network which is
formed by self configuring wireless links which are connected to each other. These applications are
categorized by hostile environment that they serve while communicating between nodes. However in such
Wireless Network will be more exposed to different types of security attacks. The challenge is to meet
secure network communication. In this paper we focus on cluster based secure communication to improve
the reliability between clusters. In this scheme the Cluster Members (CM) submits a report to the Cluster
Head (CH) and temporarily stores Evidences as a security tokens. The reports contain digital signatures.
The CH will verify the consistency of the CM report and updates to Accounting Centre (AC). AC will verify
the uniformity of reports and clears the cryptographic operations. For attacker nodes, the security tokens
are requested to classify and expel the attacker nodes which submit wrong reports.
A lightweight secure scheme for detecting provenance forgery and packet drop ...Pvrtechnologies Nellore
This document proposes a lightweight scheme for securely transmitting provenance (data history) in wireless sensor networks to detect packet forgery and loss attacks. It introduces an in-packet Bloom filter technique to encode provenance within each data packet in an efficient way. As sensor nodes forward packets, they embed their node IDs into the Bloom filter to record the forwarding path. The base station can then extract and verify the provenance from the Bloom filter to identify compromised or malicious nodes that drop packets. The scheme aims to securely transmit provenance using only low-cost operations like hash functions and message authentication codes, while previous solutions used intensive cryptography. It is evaluated analytically and experimentally to prove its effectiveness and efficiency.
A Lightweight Secure Scheme for Detecting Provenance Forgery and Packet Drop ...1crore projects
This document proposes a lightweight scheme for securely transmitting provenance information in wireless sensor networks. It uses Bloom filters to encode provenance data within data packets in an efficient manner. The scheme allows a base station to extract and verify provenance upon receiving packets, and detect if packet drop attacks occurred. The proposed technique is evaluated analytically and experimentally, demonstrating its effectiveness and efficiency compared to traditional provenance security solutions.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
Toward a statistical framework for source anonymity in sensor networksJPINFOTECH JAYAPRAKASH
This document proposes a new statistical framework for modeling, analyzing, and evaluating anonymity in sensor networks. The framework introduces the notion of "interval indistinguishability" to quantitatively measure anonymity. It maps the source anonymity problem to the statistical problem of binary hypothesis testing with nuisance parameters. Existing solutions are analyzed using this framework, showing how anonymity can be improved by finding an appropriate data transformation to remove nuisance information. Mapping the problem to binary hypothesis testing opens opportunities to apply coding theory to anonymous sensor networks.
UTILIZING XAI TECHNIQUE TO IMPROVE AUTOENCODER BASED MODEL FOR COMPUTER NETWO...IJCNCJournal
Machine learning (ML) and Deep Learning (DL) methods are being adopted rapidly, especially in computer network security, such as fraud detection, network anomaly detection, intrusion detection, and much more. However, the lack of transparency of ML and DL based models is a major obstacle to their implementation and criticized due to its black-box nature, even with such tremendous results. Explainable Artificial Intelligence (XAI) is a promising area that can improve the trustworthiness of these models by giving explanations and interpreting its output. If the internal working of the ML and DL based models is understandable, then it can further help to improve its performance. The objective of this paper is to show that how XAI can be used to interpret the results of the DL model, the autoencoder in this case. And, based on the interpretation, we improved its performance for computer network anomaly detection. The kernel SHAP method, which is based on the shapley values, is used as a novel feature selection technique. This method is used to identify only those features that are actually causing the anomalous behaviour of the set of attack/anomaly instances. Later, these feature sets are used to train and validate the autoencoderbut on benign data only. Finally, the built SHAP_Model outperformed the other two models proposed based on the feature selection method. This whole experiment is conducted on the subset of the latest CICIDS2017 network dataset. The overall accuracy and AUC of SHAP_Model is 94% and 0.969, respectively.
Toward a statistical framework for source anonymity in sensor networksJPINFOTECH JAYAPRAKASH
The document proposes a new statistical framework for modeling, analyzing, and evaluating anonymity in sensor networks. The framework introduces the notion of "interval indistinguishability" to quantitatively measure anonymity. It maps the source anonymity problem to the statistical problem of binary hypothesis testing with nuisance parameters. This transforms the problem from analyzing real-valued samples to binary codes, allowing coding theory techniques to be applied for improving anonymity in sensor networks.
Detecting Misbehavior Nodes Using Secured Delay Tolerant NetworkIRJET Journal
This document proposes a method called Statistical-based Detection of Blackhole and Greyhole attackers (SDBG) to detect misbehaving nodes in delay tolerant networks. SDBG can detect both individual misbehaving nodes as well as nodes that are colluding together. It works by having each node record encounter data with other nodes, including the number of messages sent and received. Individual nodes that drop many messages can be detected based on having a low message forwarding ratio. Colluding nodes can be detected because they will have sent many messages to each other to fake good behavior. The method aims to accurately detect misbehaving nodes while keeping false positives low. Extensive simulations showed it can work well across different network conditions.
Secret key extraction from wireless signal strength in real environmentsMuthu Sybian
Sybian Technologies is a leading IT services provider & custom software development company. We offer full cycle custom software development services, from product idea, offshore software development to outsourcing support & enhancement. Sybian employs a knowledgeable group of software developers coming from different backgrounds. We are able to balance product development efforts & project duration to your business needs.
Sybian Technologies invests extensively in R&D to invent new solutions for ever changing needs of your businesses, to make it future-proof, sustainable and consistent. We work in close collaboration with academic institutions and research labs across the world to design, implement and support latest IT based solutions that are futuristic, progressive and affordable. Our services continue to earn trust and loyalty from its clients through its commitment to the following parameters
Final Year Projects & Real Time live Projects
JAVA(All Domains)
DOTNET(All Domains)
ANDROID
EMBEDDED
VLSI
MATLAB
Project Support
Abstract, Diagrams, Review Details, Relevant Materials, Presentation,
Supporting Documents, Software E-Books,
Software Development Standards & Procedure
E-Book, Theory Classes, Lab Working Programs, Project Design & Implementation
24/7 lab session
Final Year Projects For BE,ME,B.Sc,M.Sc,B.Tech,BCA,MCA
PROJECT DOMAIN:
Cloud Computing
Networking
Network Security
PARALLEL AND DISTRIBUTED SYSTEM
Data Mining
Mobile Computing
Service Computing
Software Engineering
Image Processing
Bio Medical / Medical Imaging
Contact Details:
Sybian Technologies Pvt Ltd,
No,33/10 Meenakshi Sundaram Building,
Sivaji Street,
(Near T.nagar Bus Terminus)
T.Nagar,
Chennai-600 017
Ph:044 42070551
Mobile No:9790877889,9003254624,7708845605
Mail Id:sybianprojects@gmail.com,sunbeamvijay@yahoo.com
Hop by hop message authentication chapter 1Selva Raj
This document discusses hop-by-hop message authentication in wireless sensor networks. It discusses how symmetric-key based approaches have key management and scalability issues and how public-key based approaches have high computational overhead. It then summarizes a proposed source anonymous message authentication scheme that provides hop-by-hop node authentication without threshold limitations and has better performance than symmetric-key based schemes. The scheme is based on optimal modified ElGamal signature and provides source anonymity, compromise resilience, and flexible time authentication.
LOAD BALANCING MANAGEMENT USING FUZZY LOGIC TO IMPROVE THE REPORT TRANSFER SU...cscpconf
A wireless sensor network (WSN) consists of multiple sensor nodes and base stations (BS) that
collect information over widely deployed sensor nodes. Sensor nodes have limited energy source
and low computing power. Due to those features, there is a disadvantage that user's individual
node management is difficult and they are easily captured by attackers. Therefore, efficient
energy allocation of nodes is important and network security protocol is needed. The
Probabilistic Voting Filtering System (PVFS) is a system that prevents false vote injection
attack and false report attack injected from attackers. The reason for the existence of this
protocol is for energy management of nodes through defence against those attacks and in order
to efficiently manage the network based on PVFS, load balancing of nodes should be performed.
In the proposed scheme, fuzzy logic is applied to each cluster head node (CH) to perform load
balancing by determine whether to perform a role as a verification node and an event
forwarding node. The experiment shows that the event detection rate and the report delivery
success rate are improved in proposed scheme compare with original PVFS.
Enhanced Authentication Mechanism in WLAN via MMBSPSRAJESH DUVVURU
The ability to provide a Quality of Service (QoS) is one of the
challenging aspects of any Wireless Network. This paper
concentrates in improvising the speedy authentication
mechanism in Wireless Local Area Network (WLAN). To
fulfill the specified important issue, this work introduces a
novel Multi Merged Bio-Cryptographic Security-Aware
Packet Scheduling (MMBSPS) algorithm. In merging the
different biometric images, it is commenced with the new
merging mechanism called Triple Equally Segmented Bio-
Image (TESB) algorithm and later it is encrypted with the
RSA algorithm for efficient security. Matlab tool is used for
conducting the simulations on Multi Merged Bio-Images
(MMBI) and Bio-Images. The results of MMBSPS algorithm
is presented in contrast with the EMBSPS and EBSPS
algorithms. In the results, it is observed that, MMBSPS
algorithm is working better than existing EMBSPS and
EBSPS algorithms with respect to the speedy authentication
besides assuring security in WLAN. It is also observed the
overall performance of MMBSPS is improved by
approximately 23% in terms of authentication mechanism in
WLAN.
ATMC: Anonymity and Trust Management Scheme Applied to Clustered Wireless Sen...IDES Editor
Wireless Sensor Networks consists of sensor nodes
that are capable of sensing the information and maintaining
security. In this paper, an Anonymity and Trust Management
Scheme applied to Clustered Wireless Sensor Networks
(ATMC) is proposed which enhances the security level. It also
provides a stable path for communication. It is observed that
the performance of the network is better than existing schemes
through simulation
A Novel Classification via Clustering Method for Anomaly Based Network Intrus...IDES Editor
Intrusion detection in the internet is an active
area of research. Intruders can be classified into two
types, namely; external intruders who are unauthorized
users of the computers they attack, and internal
intruders, who have permission to access the system but
with some restrictions. The aim of this paper is to present
a methodology to recognize attacks during the normal
activities in a system. A novel classification via sequential
information bottleneck (sIB) clustering algorithm has
been proposed to build an efficient anomaly based
network intrusion detection model. We have compared
our proposed method with other clustering algorithms
like X-Means, Farthest First, Filtered clusters, DBSCAN,
K-Means, and EM (Expectation-Maximization)
clustering in order to find the suitability of our proposed
algorithm. A subset of KDDCup 1999 intrusion detection
benchmark dataset has been used for the experiment.
Results show that the proposed method is efficient in
terms of detection accuracy, low false positive rate in
comparison to the other existing methods.
WSN performance based on node placement by genetic algorithm at smart home en...TELKOMNIKA JOURNAL
Wireless sensor connectivity is one of several factors that determines the communication reliability of each node. The placement of the node depends on the area that covered by wireless coverage area, so the node placement should be optimally placed. But the other aspect is the sensor coverage area. Sensor coverage area sometimes could be different with wireless sensor coverage area. Based on that situation, it needs to optimize that situation. Genetic Algorithm is an algorithm that utilizes a heuristic approach that uses biological mechanism evolution. It used to evolution the best position of Sensor Node based on Wireless and Sensor coverage area. After the position of each node generated by Genetic Algorithm, it still needs to evaluate the wireless sensor node performance. The performance indicates that the genetic algorithm can be used to determine sensor node placement in the smart home environment. The smart home environment used to monitor event at the house such as wildfire. In this research used Quality of Services (QoS) to measure wireless sensor performance. The experimental testing scenario will be used to place several nodes that generated. The QoS performed systems reliability that produced based on 3, 4 and 5 testing nodes, the minimum and maximum of each: delay is 6.21 and 8.74 milliseconds, jitter is 0.11 and 1.59 Hz and throughput is 68.83 and 90.49 bps. Based on ETSI classification, the performance of sensor node placement is Good and acceptable in real-time systems.
A novel algorithm to protect and manage memory locationsiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
An Enhanced Detection and Energy-Efficient En-Route Filtering Scheme in Wirel...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes (MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%)
AN ENHANCED DETECTION AND ENERGYEFFICIENT EN-ROUTE FILTERING SCHEME IN WIRELE...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a
fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes
(MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network
energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%) against false report attacks in WSNs.
Filtering Schemes for Injected False Data in WsnIOSR Journals
This document summarizes and compares several en-route filtering schemes that aim to detect and drop false data reports injected by compromised nodes in wireless sensor networks. It first describes statistical en-route filtering (SEF), commutative cipher based en-route filtering (CCEF), secure ticket-based en-route filtering (STEF), and dynamic en-route filtering (DEF). It then focuses on the bandwidth efficient cooperative authentication (BECAN) scheme, and proposes adding a hybrid authentication scheme (HAS) based on RSA encryption to increase BECAN's security by preventing compromised nodes from gathering enough signatures to inject false reports. The document implements this approach in NS2 and results show it has lower energy consumption and higher throughput than existing methods
IRJET- Enhanced ID based Data Aggregation and Detection Against Sybil Attack ...IRJET Journal
This document summarizes a research paper that proposes a Challenge-Response Authentication Protocol (CRAP) to detect Sybil attacks in wireless sensor networks. The CRAP generates unique keys for each transmission to provide encrypted communication. It is used to prevent Sybil attacks where an attacker steals node identities during data transmission. The performance of the detection scheme is evaluated using detection ratio. The proposed CRAP involves three phases: 1) nodes are selected and grouped, 2) two nearby nodes transmit packets to detect collisions indicating Sybil nodes, 3) if no hop is detected between Sybil identities, the nodes are confirmed to be under attack. The scheme is analyzed using performance metrics like packet delivery ratio, energy efficiency, and attack detection ratio.
A SECURE CLUSTER BASED COMMUNICATION IN WIRELESS NETWORK USING CRYPTOGRAPHIC ...IJNSA Journal
Mobile Adhoc Networks are becoming very popular in current Wireless Technology, which is been associated to business, socially and in some critical applications like Military etc, The network which is formed by self configuring wireless links which are connected to each other. These applications are categorized by hostile environment that they serve while communicating between nodes. However in such Wireless Network will be more exposed to different types of security attacks. The challenge is to meet secure network communication. In this paper we focus on cluster based secure communication to improve the reliability between clusters. In this scheme the Cluster Members (CM) submits a report to the Cluster Head (CH) and temporarily stores Evidences as a security tokens. The reports contain digital signatures. The CH will verify the consistency of the CM report and updates to Accounting Centre (AC). AC will verify the uniformity of reports and clears the cryptographic operations. For attacker nodes, the security tokens are requested to classify and expel the attacker nodes which submit wrong reports.
A SECURE CLUSTER BASED COMMUNICATION IN WIRELESS NETWORK USING CRYPTOGRAPHIC ...IJNSA Journal
Mobile Adhoc Networks are becoming very popular in current Wireless Technology, which is been
associated to business, socially and in some critical applications like Military etc, The network which is
formed by self configuring wireless links which are connected to each other. These applications are
categorized by hostile environment that they serve while communicating between nodes. However in such
Wireless Network will be more exposed to different types of security attacks. The challenge is to meet
secure network communication. In this paper we focus on cluster based secure communication to improve
the reliability between clusters. In this scheme the Cluster Members (CM) submits a report to the Cluster
Head (CH) and temporarily stores Evidences as a security tokens. The reports contain digital signatures.
The CH will verify the consistency of the CM report and updates to Accounting Centre (AC). AC will verify
the uniformity of reports and clears the cryptographic operations. For attacker nodes, the security tokens
are requested to classify and expel the attacker nodes which submit wrong reports.
A lightweight secure scheme for detecting provenance forgery and packet drop ...Pvrtechnologies Nellore
This document proposes a lightweight scheme for securely transmitting provenance (data history) in wireless sensor networks to detect packet forgery and loss attacks. It introduces an in-packet Bloom filter technique to encode provenance within each data packet in an efficient way. As sensor nodes forward packets, they embed their node IDs into the Bloom filter to record the forwarding path. The base station can then extract and verify the provenance from the Bloom filter to identify compromised or malicious nodes that drop packets. The scheme aims to securely transmit provenance using only low-cost operations like hash functions and message authentication codes, while previous solutions used intensive cryptography. It is evaluated analytically and experimentally to prove its effectiveness and efficiency.
A Lightweight Secure Scheme for Detecting Provenance Forgery and Packet Drop ...1crore projects
This document proposes a lightweight scheme for securely transmitting provenance information in wireless sensor networks. It uses Bloom filters to encode provenance data within data packets in an efficient manner. The scheme allows a base station to extract and verify provenance upon receiving packets, and detect if packet drop attacks occurred. The proposed technique is evaluated analytically and experimentally, demonstrating its effectiveness and efficiency compared to traditional provenance security solutions.
A SECURITY PERIOD UPDATE METHOD USING EVALUATION FUNCTION FOR IMPROVING ENERG...csandit
In recent years, Wireless Sensor Networks(WSNs) research has been carried out with the goals
of achieving high security and energy efficiency. In a WSN, sensor nodes are vulnerable to
physical attacks because they are deployed in an open environment. An attacker can inject a
false report into networks using these vulnerabilities. F. Ye et al. proposed statistical en-route
filtering to prevent false report injection attacks. In order to effectively use their scheme,
techniques for determining thresholds using fuzzy logic have been studied. To effectively apply
these techniques to the network, an appropriate update period should be set according to the
network environments. In this paper, we propose a security period update method in order to
improve the lifetime of the network in the statistical en-route filtering approach based on a
wireless sensor network of the cluster environment. The experimental results show that up to an
11.96% improvement of the energy efficiency can be achieved when the security threshold is set
to the optimal period.
Fuzzy-Based Multiple Path Selection Method for Improving Energy Efficiency in...aciijournal
In wireless sensor networks, adversaries can easily compromise sensors because the sensor resources are
limited. The compromised nodes can inject false data into the network injecting false data attacks. The
injecting false data attack has the goal of consuming unnecessary energy in en-route nodes and causing
false alarms in a sink. A bandwidth-efficient cooperative authentication scheme detects this attack based on
the random graph characteristics of sensor node deployment and a cooperative bit-compressed
authentication technique. Although this scheme maintains a high filtering probability and high reliability in
the sensor network, it wastes energy in en-route nodes due to a multireport solution. In this paper, our
proposed method effectively selects a number of multireports based on the fuzzy rule-based system. We
evaluated the performance in terms of the security level and energy savings in the presence of the injecting
false data attacks. The experimental results indicate that the proposed method improves the energy
efficiency up to 10% while maintaining the same security level as compared to the existing scheme.
Iaetsd a survey on enroute filtering scheme inIaetsd Iaetsd
This document discusses enroute filtering schemes in wireless sensor networks to prevent false data injection attacks. It provides an overview of existing statistical enroute filtering and location-based resilient security schemes that have limitations such as threshold restrictions. The document then proposes using a cluster-based compromise resilient enroute filtering scheme where sensor nodes are organized into clusters. In this scheme, cluster heads aggregate and transmit data to base stations through forwarding nodes. This is said to provide higher security than other filtering schemes by overcoming prior limitations and disadvantages related to compromised node thresholds, non-resilience to attacks, and dependency on node localization.
Wireless sensor networks collect data through collaborative communication between sensor nodes. sensor nodes of wireless sensor networks are deployed in open environments. Hence, an attacker can easily compromise the node. An attacker can compromise a node to generate false reports and inject into the network. This causes unnecessary energy consumption in the process of transmitting false alarm messages and false data reports to the system. If the attacker keeps repeatedly attacking thereby causing problems such as reduction in the entire network life or disabling the networks. Yu and Guan proposed a dynamic en-route filtering scheme to detect and drop these false reports before reaching to the Base station. In the dynamic en-route filtering, the energy waste of the intermediate nodes occurs until it is detected early. In this paper, we propose a method to save the energy of the intermediate nodes by searching for the compromised node and blocking the reports generated at that node. When verifying a false report at the verification node, it can know report information. The base station is able to find the cluster of compromised nodes using that information. In particular, the base station can know the location of the node that has been compromised, we can block false alarms and energy losses by blocking reports generated in that cluster.
PREVENTION METHOD OF FALSE REPORT GENERATION IN CLUSTER HEADS FOR DYNAMIC EN-...ijcsit
Wireless sensor networks collect data through collaborative communication between sensor nodes. sensor nodes of wireless sensor networks are deployed in open environments. Hence, an attacker can easily compromise the node. An attacker can compromise a node to generate false reports and inject into the network. This causes unnecessary energy consumption in the process of transmitting false alarm messages and false data reports to the system. If the attacker keeps repeatedly attacking thereby causing problems such as reduction in the entire network life or disabling the networks. Yu and Guan proposed a dynamic en-route filtering scheme to detect and drop these false reports before reaching to the Base station. In the dynamic en-route filtering, the energy waste of the intermediate nodes occurs until it is detected early. In this paper, we propose a method to save the energy of the intermediate nodes by searching for the compromised node and blocking the reports generated at that node. When verifying a false report at the verification node, it can know report information. The base station is able to find the cluster of compromised nodes using that information. In particular, the base station can know the location of the node that has been compromised, we can block false alarms and energy losses by blocking reports
generated in that cluster.
Wireless sensor networks collect data through collaborative communication between sensor nodes. sensor
nodes of wireless sensor networks are deployed in open environments. Hence, an attacker can easily
compromise the node. An attacker can compromise a node to generate false reports and inject into the
network. This causes unnecessary energy consumption in the process of transmitting false alarm messages
and false data reports to the system. If the attacker keeps repeatedly attacking thereby causing problems
such as reduction in the entire network life or disabling the networks. Yu and Guan proposed a dynamic
en-route filtering scheme to detect and drop these false reports before reaching to the Base station. In the
dynamic en-route filtering, the energy waste of the intermediate nodes occurs until it is detected early. In
this paper, we propose a method to save the energy of the intermediate nodes by searching for the
compromised node and blocking the reports generated at that node. When verifying a false report at the
verification node, it can know report information. The base station is able to find the cluster of
compromised nodes using that information. In particular, the base station can know the location of the
node that has been compromised, we can block false alarms and energy losses by blocking reports
generated in that cluster.
Three Tire Proxy Re - Encryption Secret Key (PRESK) Generation for Secure Tr...Karthikeyan Ece venkatesan
This document summarizes a research paper that proposes a three-tier security architecture for wireless body area networks (WBANs). The architecture consists of three tiers: 1) Proxy re-encryption is used between biomedical sensors to establish the first tier; 2) Data is encrypted using DES when sent from sensors to a network controller/coordinator to form the second tier; 3) The third tier uses AODV routing to encrypt data being sent from a home access point to a hospital gateway. The goal is to securely transmit biosignals in WBANs using an efficient key management approach based on existing cryptographic algorithms.
Accelerated broadcast authentication with signature amortization for wsnseSAT Publishing House
This document proposes a novel broadcast authentication scheme for wireless sensor networks that uses elliptic curve digital signature algorithm (ECDSA) with signature amortization. It splits broadcast messages into blocks and extends each block with an authenticator, generating extended blocks. A single ECDSA signature authenticates an entire group of messages by authenticating the authenticator in the first extended block, which then authenticates subsequent blocks and messages. However, ECDSA signature verification is slower than generation. To address this, the scheme uses cooperation among sensor nodes, allowing nodes with high energy to share intermediate verification results to accelerate the process. Simulation results show this reduces overhead and verification delay significantly compared to traditional approaches.
Fuzzy Logic-based Efficient Message Route Selection Method to Prolong the Net...IJCNCJournal
Recently, sensor networks have been used in a wide range of applications, and interest in sensor node performance has increased. A sensor network is composed of tiny nodes with limited resources. The sensor network communicates between nodes in a configured network through self-organization. An energyefficient security protocol with a hierarchy structure with various advantages has been proposed to prolong the network lifetime of sensor networks. But due to structural problems in traditional protocols, nodes located upstream tend to consume relatively high energy compared to other nodes. A network protocol should be considered to provide minimal security and efficient allocation of energy consumption by nodes to increase the network lifetime. In this paper, we introduce a solution to solve the bottleneck problem through an efficient message route selection method. The proposed method selects an efficient messaging path using GA and fuzzy logic composed of multiple rules. Message route selection plays an important role in controlling the load balancing of nodes. A principal benefit of the proposed scheme is the potential portability of the clustering-based protocol. In addition, the proposed method is updated to find the optimal path through the genetic algorithm to respond to various environments. We demonstrated the effectiveness of the proposed method through an experiment in which the proposed method is applied to a probabilistic voting-based filtering scheme that is one of the cluster-based security schemes.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
- The document discusses a fuzzy logic-based method for efficient message routing in wireless sensor networks to prolong the network lifetime. It aims to balance energy load across nodes by selectively tagging nodes at risk of energy exhaustion and rerouting messages around them.
- It proposes using fuzzy logic to evaluate nodes based on their potential importance, energy level, and event occurrence frequency to determine tagging. Tagged nodes avoid routing traffic but still detect and generate reports.
- The method was tested by applying it to a probabilistic voting-based filtering security scheme and was shown to improve energy efficiency, node survival rate, and report transmission success compared to not tagging nodes.
An authentication framework for wireless sensor networks using Signature Base...ijsrd.com
Authentication in Wireless Sensor Networks (WSNs) is a challenging process. Providing authentication for the Nodes in WSN is a vital issue in Secure Group communication among WSNs. Massive group of tiny sensor Nodes forms WSNs and these are placed in open, unattended milieu. Due to this reason, Nodes in WSN can endure exclusive encounters. WSNs are more vulnerable to active and passive attacks than wired ones due to their broadcasting nature, limitations in resources and unrestrained environments. However, security will be a significant factor for their complete implementation. In this proposal, a new approach has been introduced to achieve secure authentication among Nodes in WSNs.
Wireless sensor networks provide ubiquitous computing systems in various open environments. In the
environment, sensor nodes can easily be compromised by adversaries to generate injecting false data
attacks. The injecting false data attack not only consumes unnecessary energy in en-route nodes, but also
causes false alarms at the base station. To detect this type of attack, a bandwidth-efficient cooperative
authentication (BECAN) scheme was proposed to achieve high filtering probability and high reliability
based on random graph characteristics and cooperative bit-compressed authentication techniques. This
scheme may waste energy resources in en-route nodes due to the fixed number of forwarding reports. In
this paper, our proposed method effectively selects a dynamic number of forwarding reports in the source
nodes based on an evaluation function. The experimental results indicate that our proposed method
enhances the energy savings while maintaining security levels as compared to BECAN.
Similar to AN EVALUATION OF ENERGY EFFICIENT SOURCE AUTHENTICATION METHODS FOR FALSE DATA FILTERING IN WSN (20)
The Microsoft 365 Migration Tutorial For Beginner.pptxoperationspcvita
This presentation will help you understand the power of Microsoft 365. However, we have mentioned every productivity app included in Office 365. Additionally, we have suggested the migration situation related to Office 365 and how we can help you.
You can also read: https://www.systoolsgroup.com/updates/office-365-tenant-to-tenant-migration-step-by-step-complete-guide/
The Department of Veteran Affairs (VA) invited Taylor Paschal, Knowledge & Information Management Consultant at Enterprise Knowledge, to speak at a Knowledge Management Lunch and Learn hosted on June 12, 2024. All Office of Administration staff were invited to attend and received professional development credit for participating in the voluntary event.
The objectives of the Lunch and Learn presentation were to:
- Review what KM ‘is’ and ‘isn’t’
- Understand the value of KM and the benefits of engaging
- Define and reflect on your “what’s in it for me?”
- Share actionable ways you can participate in Knowledge - - Capture & Transfer
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
This talk will cover ScyllaDB Architecture from the cluster-level view and zoom in on data distribution and internal node architecture. In the process, we will learn the secret sauce used to get ScyllaDB's high availability and superior performance. We will also touch on the upcoming changes to ScyllaDB architecture, moving to strongly consistent metadata and tablets.
Dandelion Hashtable: beyond billion requests per second on a commodity serverAntonios Katsarakis
This slide deck presents DLHT, a concurrent in-memory hashtable. Despite efforts to optimize hashtables, that go as far as sacrificing core functionality, state-of-the-art designs still incur multiple memory accesses per request and block request processing in three cases. First, most hashtables block while waiting for data to be retrieved from memory. Second, open-addressing designs, which represent the current state-of-the-art, either cannot free index slots on deletes or must block all requests to do so. Third, index resizes block every request until all objects are copied to the new index. Defying folklore wisdom, DLHT forgoes open-addressing and adopts a fully-featured and memory-aware closed-addressing design based on bounded cache-line-chaining. This design offers lock-free index operations and deletes that free slots instantly, (2) completes most requests with a single memory access, (3) utilizes software prefetching to hide memory latencies, and (4) employs a novel non-blocking and parallel resizing. In a commodity server and a memory-resident workload, DLHT surpasses 1.6B requests per second and provides 3.5x (12x) the throughput of the state-of-the-art closed-addressing (open-addressing) resizable hashtable on Gets (Deletes).
What is an RPA CoE? Session 1 – CoE VisionDianaGray10
In the first session, we will review the organization's vision and how this has an impact on the COE Structure.
Topics covered:
• The role of a steering committee
• How do the organization’s priorities determine CoE Structure?
Speaker:
Chris Bolin, Senior Intelligent Automation Architect Anika Systems
Northern Engraving | Nameplate Manufacturing Process - 2024Northern Engraving
Manufacturing custom quality metal nameplates and badges involves several standard operations. Processes include sheet prep, lithography, screening, coating, punch press and inspection. All decoration is completed in the flat sheet with adhesive and tooling operations following. The possibilities for creating unique durable nameplates are endless. How will you create your brand identity? We can help!
"Frontline Battles with DDoS: Best practices and Lessons Learned", Igor IvaniukFwdays
At this talk we will discuss DDoS protection tools and best practices, discuss network architectures and what AWS has to offer. Also, we will look into one of the largest DDoS attacks on Ukrainian infrastructure that happened in February 2022. We'll see, what techniques helped to keep the web resources available for Ukrainians and how AWS improved DDoS protection for all customers based on Ukraine experience
"Scaling RAG Applications to serve millions of users", Kevin GoedeckeFwdays
How we managed to grow and scale a RAG application from zero to thousands of users in 7 months. Lessons from technical challenges around managing high load for LLMs, RAGs and Vector databases.
Monitoring and Managing Anomaly Detection on OpenShift.pdfTosin Akinosho
Monitoring and Managing Anomaly Detection on OpenShift
Overview
Dive into the world of anomaly detection on edge devices with our comprehensive hands-on tutorial. This SlideShare presentation will guide you through the entire process, from data collection and model training to edge deployment and real-time monitoring. Perfect for those looking to implement robust anomaly detection systems on resource-constrained IoT/edge devices.
Key Topics Covered
1. Introduction to Anomaly Detection
- Understand the fundamentals of anomaly detection and its importance in identifying unusual behavior or failures in systems.
2. Understanding Edge (IoT)
- Learn about edge computing and IoT, and how they enable real-time data processing and decision-making at the source.
3. What is ArgoCD?
- Discover ArgoCD, a declarative, GitOps continuous delivery tool for Kubernetes, and its role in deploying applications on edge devices.
4. Deployment Using ArgoCD for Edge Devices
- Step-by-step guide on deploying anomaly detection models on edge devices using ArgoCD.
5. Introduction to Apache Kafka and S3
- Explore Apache Kafka for real-time data streaming and Amazon S3 for scalable storage solutions.
6. Viewing Kafka Messages in the Data Lake
- Learn how to view and analyze Kafka messages stored in a data lake for better insights.
7. What is Prometheus?
- Get to know Prometheus, an open-source monitoring and alerting toolkit, and its application in monitoring edge devices.
8. Monitoring Application Metrics with Prometheus
- Detailed instructions on setting up Prometheus to monitor the performance and health of your anomaly detection system.
9. What is Camel K?
- Introduction to Camel K, a lightweight integration framework built on Apache Camel, designed for Kubernetes.
10. Configuring Camel K Integrations for Data Pipelines
- Learn how to configure Camel K for seamless data pipeline integrations in your anomaly detection workflow.
11. What is a Jupyter Notebook?
- Overview of Jupyter Notebooks, an open-source web application for creating and sharing documents with live code, equations, visualizations, and narrative text.
12. Jupyter Notebooks with Code Examples
- Hands-on examples and code snippets in Jupyter Notebooks to help you implement and test anomaly detection models.
Conversational agents, or chatbots, are increasingly used to access all sorts of services using natural language. While open-domain chatbots - like ChatGPT - can converse on any topic, task-oriented chatbots - the focus of this paper - are designed for specific tasks, like booking a flight, obtaining customer support, or setting an appointment. Like any other software, task-oriented chatbots need to be properly tested, usually by defining and executing test scenarios (i.e., sequences of user-chatbot interactions). However, there is currently a lack of methods to quantify the completeness and strength of such test scenarios, which can lead to low-quality tests, and hence to buggy chatbots.
To fill this gap, we propose adapting mutation testing (MuT) for task-oriented chatbots. To this end, we introduce a set of mutation operators that emulate faults in chatbot designs, an architecture that enables MuT on chatbots built using heterogeneous technologies, and a practical realisation as an Eclipse plugin. Moreover, we evaluate the applicability, effectiveness and efficiency of our approach on open-source chatbots, with promising results.
"Choosing proper type of scaling", Olena SyrotaFwdays
Imagine an IoT processing system that is already quite mature and production-ready and for which client coverage is growing and scaling and performance aspects are life and death questions. The system has Redis, MongoDB, and stream processing based on ksqldb. In this talk, firstly, we will analyze scaling approaches and then select the proper ones for our system.
Skybuffer SAM4U tool for SAP license adoptionTatiana Kojar
Manage and optimize your license adoption and consumption with SAM4U, an SAP free customer software asset management tool.
SAM4U, an SAP complimentary software asset management tool for customers, delivers a detailed and well-structured overview of license inventory and usage with a user-friendly interface. We offer a hosted, cost-effective, and performance-optimized SAM4U setup in the Skybuffer Cloud environment. You retain ownership of the system and data, while we manage the ABAP 7.58 infrastructure, ensuring fixed Total Cost of Ownership (TCO) and exceptional services through the SAP Fiori interface.
Main news related to the CCS TSI 2023 (2023/1695)Jakub Marek
An English 🇬🇧 translation of a presentation to the speech I gave about the main changes brought by CCS TSI 2023 at the biggest Czech conference on Communications and signalling systems on Railways, which was held in Clarion Hotel Olomouc from 7th to 9th November 2023 (konferenceszt.cz). Attended by around 500 participants and 200 on-line followers.
The original Czech 🇨🇿 version of the presentation can be found here: https://www.slideshare.net/slideshow/hlavni-novinky-souvisejici-s-ccs-tsi-2023-2023-1695/269688092 .
The videorecording (in Czech) from the presentation is available here: https://youtu.be/WzjJWm4IyPk?si=SImb06tuXGb30BEH .
High performance Serverless Java on AWS- GoTo Amsterdam 2024Vadym Kazulkin
Java is for many years one of the most popular programming languages, but it used to have hard times in the Serverless community. Java is known for its high cold start times and high memory footprint, comparing to other programming languages like Node.js and Python. In this talk I'll look at the general best practices and techniques we can use to decrease memory consumption, cold start times for Java Serverless development on AWS including GraalVM (Native Image) and AWS own offering SnapStart based on Firecracker microVM snapshot and restore and CRaC (Coordinated Restore at Checkpoint) runtime hooks. I'll also provide a lot of benchmarking on Lambda functions trying out various deployment package sizes, Lambda memory settings, Java compilation options and HTTP (a)synchronous clients and measure their impact on cold and warm start times.
High performance Serverless Java on AWS- GoTo Amsterdam 2024
AN EVALUATION OF ENERGY EFFICIENT SOURCE AUTHENTICATION METHODS FOR FALSE DATA FILTERING IN WSN
1. International Journal of Security, Privacy and Trust Management ( IJSPTM) vol 2, No 2, April 2013
DOI : 10.5121/ijsptm.2013.2203 33
AN EVALUATION OF ENERGY EFFICIENT SOURCE
AUTHENTICATION METHODS FOR FALSE DATA
FILTERING IN WSN
Syama M and Deepti C
Department of Information Science Engineering,
The Oxford College of Engineering, Bangalore, India.
syama.mk@gmail.com
deeptic82@gmail.com
ABSTRACT
The false data injection attack is a major security threat in Wireless Sensor Network (WSN) since is
degrades the network capability. The bandwidth efficient cooperative authentication (BECAN) scheme is
used for filtering the false data injection attack. It is used to save energy of sensor nodes in WSN by early
detection and filtering of maximum possible injected false data. Source authentication is a critical security
requirement in wireless sensor networks to identify attacker nodes that injects false data. Solutions based
on Elliptic Curve Cryptography (ECC) have been used for source authentication, but they suffer from
severe energy depletion. This results in high computational and communication overheads. Bloom filter
based Symmetric-key source authentication scheme exhibits low authentication overhead .This avoids the
inherent problems associated with public key cryptography based schemes. The current work demonstrates
the efficiency of bloom filter based source authentication using BECAN scheme by comparing ECC and
Bloom filter based methods in terms of energy consumption.
KEYWORDS
False data, Elliptical Curve Cryptography, Bloom filter, WSN.
1. INTRODUCTION
Wireless sensor networks are used in a wide range of applications such as battlefield surveillance,
traffic control, management of commercial inventory, home monitoring and habitat monitoring
[1-5]. Wireless sensor networks are usually deployed at environments where human intervention
is difficult. In WSNs, the base station sends commands to the sensor nodes within its coverage
area. These nodes report detected events to the base station.
An adversary can easily compromise nodes or inject false data into the wireless communication.
These attacks are difficult to detect since the networks are broadcast in nature. An adversary can
eavesdrop, intercept, inject, and eventually transmit data. Thus, it is important to ensure that the
information transmitted within the wireless sensor networks is sent by an authenticated source.
For a false data injection attack, an adversary first compromises several sensor nodes through
access of all keying materials stored in the nodes. It then takes control of these compromised
nodes to inject false information. This information is then sent to the sink to cause upper-level
error decisions. This also leads to high energy wastage in en-route nodes. Sometimes an
adversary could also construct a wildfire event or send wrong location information of the wildfire
to the sink. Expensive resources wastage will happen by taking rescue actions to a non-existing
2. International Journal of Security, Privacy and Trust Management ( IJSPTM) vol 2, No 2, April 2013
34
wildfire location. Therefore, it is critical to filter the false data as early as possible in wireless
sensor networks. At the same time, if the entire false data flood into the sink simultaneously, the
sink will face high verification burdens. This results in rapid paralyzation of the whole network.
Therefore, filtering false data should be a high priority task. Few false data filtering techniques
[5-10] have been developed for handling this issue. The comparison of these filtering mechanisms
illustrates that once a node is compromised, it is difficult to identify the compromised node
through symmetric key technique for source authentication. Hence this leads to the degradation of
the performance of the filtering mechanisms.
The primary need for avoiding false data injection by an adversary is to authenticate the source.
Source authentication defines that a receiver validates that the received data is sent by a legitimate
source. There are two approaches which are used for source authentication. The first approach
uses symmetric cryptography and the second uses asymmetric cryptography. BECAN scheme
based on asymmetric key cryptography is an efficient filtering method for false data injection
attack [13]. This paper deals with efficient source authentication using asymmetric cryptography
implemented using bloom filter mechanism.
2. RELATED WORK
Recent studies in the area of false data filtering in wireless sensor networks are presented below.
Location-Based Resilient Secrecy (LBRS) proposed by Yang et al. [6] adopts location key
binding mechanism to reduce the damages caused by node compromise. This mechanism controls
the false data generation in wireless sensor networks. Ren et al [7]. Proposes more efficient
location-aware end-to-end data security design (LEDS). LEDS includes efficient en-route false
data filtering capability and assurance on data availability, but it also requires location-aware key
management to achieve en-routing filtering since it is based on symmetric key method. Hence
each node should share at least one authentication key with a node in its upstream/downstream
cell. Zhang et al [8] presents a public key based solution. It binds private keys of individual nodes
to both their IDs and geographic locations. This results in 20 bytes of authentication overheads to
achieve en-routing filtering. In bandwidth-efficient cooperative authentication (BECAN) scheme
[9] the cooperative bit-compressed authentication technique is used. BECAN scheme is energy
efficient by early detecting and filtering maximum of injected false data with minor overheads at
the en-route nodes. In addition, only a very small fraction of injected false data needs to be
checked by the sink, which thus largely reduces the burden of the sink. But still the energy is
wasted since it is using Elliptical curve cryptography (ECC) [10] for source authentication.
ECC based schemes suffer from high energy consumption as well as significant communication
and computation costs. A Bloom filter is a space-efficient randomized data structure which
represents a set in order to support membership queries. Although Bloom filters allow false
positives, for many applications the space savings outweigh this drawback when the probability
of an error is sufficiently low.
3. International Journal of Security, Privacy and Trust Management ( IJSPTM) vol 2, No 2, April 2013
35
3. SYSTEM DESIGN
Bloom filter [11], is a space efficient probabilistic data structure that briefly represents a set that
supports queries about membership. It has been used in areas such as web cache sharing [12] and
distributed storage system [13] due to its space advantages and excellent distributed properties.
3.1. Properties of Bloom Filter
There is no false negative in the Bloom filter membership verification. An element which tests
negative within a Bloom filter is definitely not a legitimate member of the set. On the other hand,
Bloom filter may yield false positive, a member outside the set can pass membership verification
by the Bloom filter. The probability of a false positive for an element (i.e., false positive
probability) can be calculated in a straightforward manner.
3.2. Implementation of Bloom Filter
Bloom filter is implemented as a bit-array consists of ' m ' bits associated with ' h ' different hash
functions. Each of the hash function maps an element to one of the m array positions in a
uniformly random manner. In an initial Bloom filter all elements are set to 0 (represents an empty
set). To insert an element ' a ' into a Bloom filter ' BF ', h array positions are calculated by
applying hash functions on e and the bits at those positions in BF are set to 1. When it is required
to check the membership of an element ' b ' within the Bloom filter BF, hash functions are applied
to the element 'b' which outputs h array positions. If any of this position is having a 0 bit, then
element b does not belong to the BF, otherwise the element is a member of the set.
4. BLOOM FILTER BASED SOURCE AUTHENTICATION SCHEME
Bloom filter scheme is based on multi-level key chains in order to enhance scalability in terms of
receivers. Two-level key chains are used here. The two-level key chains consist of a high-level
key chain and multiple low-level key chains. The low-level key chains are used for authenticating
broadcast messages, while the high-level key chain is used to authenticate commitments (or first
key) of the low-level key chains. The low-level key chains have short enough intervals so that the
delay between the reception and the verification of the messages is tolerable.
In order to use a low level key chain <ki,0> during the time interval Ti, sensor nodes must
authenticate the commitment Ki,0 before Ti. To achieve this, the sender broadcasts a commitment
distribution message (CDMi) during each time interval Ti.
CDMi = i | ki+2 | MAC (k'i|i|ki+2) | ki-1
where the ‘|’ symbol denotes message concatenation, and k’i is derived from key ki with a pseudo
random function. Commitment Distribution Message (CDM) packets are essential for key
authentication. The key ki is generated in time interval Ti.
The sender broadcasts a data packet generated in time interval Ti
Pi,j= level_number | index | Mi,j | MAC(ki,Mi,j) | ki-d
4. International Journal of Security, Privacy and Trust Management ( IJSPTM) vol 2, No 2, April 2013
36
Where level_number represents the level of the hash chain, ki-d represents the disclosure key in
time interval Ti that was generated in Ti-d, d represents the key disclosure delay.
Bloom filter is used in order to test membership queries. To represent a set E= e1, e2, ..., en of n
elements, a bloom vector V of m bits can be used .The m bits are initially all set to 0. Moreover,
this structure needs k independent hash functions h1... hk. These k hash functions range between 0
and m-1, and each element is mapped to [0, ..., m-1]. For each element e in E, the bits hi(e) are set
to 1 for 1 ≤ I ≤ k.In order to verify if an item x is in E, tests have to be performed to check
whether all bits hi(x) are set to 1. If yes, x is assumed to be a member of E. A Bloom Filter may at
times suggest that an element x is in E even though it is not (false positive). The probability of a
false positive f is then, f = (1-e –kn/m
) k
.
4.1. Network Model
A large spatially distributed WSN consists of one Base Station and a large number of sensor
nodes. The sensor nodes have resource-constraints with respect to memory space, computation
capability, bandwidth, and power supply.
The Base Station is assumed to be more powerful than sensor nodes in terms of computation and
communication capabilities. The Base Station broadcasts queries/commands through sensor
nodes. It expects replies that reflect the latest information/measurements. Here it is assumed that
the Base Station is always trustworthy but the sensor nodes are subject to compromise.
4.2. Adversary Model
This model assumes that the adversary is able to compromise a limited number of sensor nodes.
4.3. Communication model
The sender sends CDM packets in order to distribute and authenticate the commitments of lower
level chains. The jth data packet generated in Ti is constructed as follows:
Pi,j= level_number |index|Mi,j |MAC (ki,Mi,j)|MAC(ki-1,Mi,j)| MAC(ki-2,Mi,j)| …..|MAC (ki-d-
1,Mi,j)| ki-d
In fact, in time interval Ti, the sender generates d message authentication codes for each data
packet, and constructs the set E.
E = <MAC(ki,Mi,j), MAC(ki-1,Mi,j),..., MAC(ki-d-1,Mi,j) >
• the elements of E (each with |MAC| bytes) are mapped to an m-bit vector V with V= v0v1...vm.
Therefore m is made less tan d⋅|MAC| to reduce the filter size and m is kept reater tan k⋅d to have
a small probability of a false positive. k represents the number of hash functions used in the bloom
filter. The k hash functions are known by every node as well as the base station. vi=1 if there exists
a hash function hl(MACj)=i. Figure 1 illustrates how d MACs of each data packet are mapped into
a bloom filter vector using k hash functions.
5. International Journal of Security, Privacy and Trust Management ( IJSPTM) vol 2, No 2, April 2013
37
• Choice of the parameters of the Bloom Filter : Given the number of MACs generated for a data
packet 'd' and concatenated in one packet, alon wit the storage space of m bits (bloom filter size)
for a single Bloom filter, the minimum probability of a false positive f that can be achieved is
f = (0.6185) m/d
Table 1 illustrates the probability of a false positive by applying various values for Bloom filter size and
key disclosure delay. Fig. 2 represents the corresponding graphical representation. This probability
decreases as the fraction (m/d) increases.
For example m = 16 bits, k = 3 and d = 3, then the minimum probability of a false positive is f =
0,077.
To send a data packet Pi,j during a time interval, the sender generates d MACs which are then
mapped to a bloom filter vector vi,j. The data packet sent is then constructed as:
Pi,j = level_number | index| Mi,j | vi,j| ki-d
Figure 1. Mapping d MACs into a Bloom Filter Vector
On receiving the data packet, the receiver tries to do the following operations:
• Verify if the number of one bits is less than or equal to d⋅k bits in the vector. If it is not,
the packet is dropped else, the receiver computes the message authentication code MAC'
with the correspondent key.
• Verify if the computed message authentication code is in the bloom filter vi,j. In fact, for
each hash function hi (with 1≤ i≤ k) used in the bloom filter, it verifies if hi (MAC') is
0
1
1
…
.
1
0
0
1
1
MAC (k i, M ij)
MAC (k i-1, M ij)
MAC (k i-2, M ij)
MAC (k i-3, M ij)
…….
MAC (k i-d-1, M ij)
h 1 (*)
h 2 (*)
h 3 (*)
…..
h k (*)
m-bitvector
6. International Journal of Security, Privacy and Trust Management ( IJSPTM) vol 2, No 2, April 2013
38
between 0 and m-1. If all the corresponding bits in the vector are set to one, then the
packet is assumed to be partially authenticated and it is degraded to the lower levels of
the buffer until all the correspondent MACs are verified. Else, the verification fails and
the packet is dropped.
Figure 2. The probability of a false positive with respect of m (bits).
5. PERFORMANCE EVALUATION
A quantitative analysis of the energy consumption due to communicational and computational overhead is
carried out here by focusing only on data packets.
5.1. End-to-End Energy
Table 1. The false positive probability for different values of m and d.
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
10 20 30 40 50
f(Theprobabilityofafalsepositive)
m (Size of Bloom Filter)
bits
d=4 d=3
d=2
Size of Bloom filter d = 2 d = 3 d = 4
10 0.1 0.2 0.3
20 0.01 0.09 0.1
30 0 0.02 0.03
40 0 0 0.01
50 0 0 0
7. International Journal of Security, Privacy and Trust Management ( IJSPTM) vol 2, No 2, April 2013
39
Total energy consumed for all the protocols is directly proportional to the number of transmissions, which
is the sum of the number of data packets sent and the number of control packets sent per node.
Table 2 illustrates the experimental result in terms of energy utilization for the source authentication by
ECC based scheme and Bloom filter based scheme on different values of network size. Fig 3 provides the
graphical representation of the values obtained in the experiment. It's clearly visible that energy efficiency
is very much increased by the usage of bloom filter.
Figure 3. Graph showing energy utilization for ECC and bloom filter based source authentication schemes
6. CONCLUSION
The focus of this paper is the problem of source authentication in false data injection filtering
scheme for WSNs. The asymmetric-key based solutions are energy consuming due to the
communication and computation cost of the messages which can lead to severe energy-depletion
Table 2. Experimental result in terms of energy utilization by ECC based scheme and Bloom filter based
scheme on different values of network size.
0
200
400
600
800
1000
1200
0 1000 4000 8000 16000 24000
Energyconsumptionin
communication
Network size
scheme with ECC
scheme with bloom filter
Network size Scheme with ECC Scheme with bloom filter
0 0 0
1000 25 15
4000 85 35
8000 150 85
16000 325 150
24000 650 325
8. International Journal of Security, Privacy and Trust Management ( IJSPTM) vol 2, No 2, April 2013
40
DoS attacks also. Here an effective symmetric key based scheme using bloom filter is used to
address the problem. Communication cost is minimized through a novel integration of a bloom
filter and symmetric key cryptography. A quantitative energy consumption analysis demonstrates
the efficiency of the bloom filter based scheme.
REFERENCES
[1] Lokesh Sharma, Jaspreet Singh, Swati Agnihotri, "Connectivity and Coverage Preserving
Schemes for Surveillance Applications in WSN " , International Journal of Computer Applications
(0975 – 8887).
[2] Khalil M. Yousef, Jamal N. Al-Karaki and Ali M. Shatnawi, " Intelligent traffic light flow control
system using wireless sensors networks", Journal of Information Science and Engineering 26, 753-
768 (2010).
[3] N. Bulusu, J. Heidemann, and D. Estrin, “GPSless low-cost outdoor localization for very small
devices”, IEEE Wireless Commun., vol. 7, pp. 28-34, Oct. 2000.
[4] Zatout, Y, Campo. E, Llibre, J.-F, " WSN-HM: Energy efficient Wireless Sensor Network for
home monitoring", Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP),
2009 5th International Conference on 7-10 Dec. 2009.
[5] R. Szewczky, A. Mainwaring, J. Anderson, and D. Culler, “An Analysis of a Large Scale Habit
Monitoring Application,” Proc. Second ACM Int’l Conf. Embedded Networked Sensor Systems
(Sensys ’04), 2004.
[6] H. Yang, F. Ye, Y. Yuan, S. Lu, and W. Arbaugh, “Toward Resilient Security in Wireless Sensor
Networks,” Proc. Sixth ACM Int’l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc
’05), pp. 34-45, 2005.
[7] K. Ren, W. Lou, and Y. Zhang, “LEDS: Providing Location-Aware End-to-End Data Security in
Wireless Sensor Networks,” Proc. IEEE INFOCOM ’06, Apr. 2006.
[8] Y. Zhang, W. Liu, W. Lou, and Y. Fang, “Location-Based Compromise-Tolerant Security
Mechanisms for Wireless Sensor Networks,” IEEE J. Selected Areas in Comm., vol. 24, no. 2, pp.
247- 260, Feb. 2006.
[9] Rongxing Lu, Xiaodong Lin," BECAN: A Bandwidth-Efficient Cooperative Authentication
Scheme for Filtering Injected False Data in Wireless Sensor Networks", IEEE transactions on
parallel and distributed systems, vol. 23, no. 1, january 2012.
[10] Moncef Amara and Amar Siad, "Elliptic Curve Cryptographyand its Applications",2011 7th
International Workshop on Systems, Signal Processing and their Applications (WOSSPA).
[11] B. H. Bloom, Space/time trade-o_s in hash coding with allowable errors," Communications of the
ACM, vol. 13, no. 7, pp. 422{426, 1970.
[12] L. Fan, P. Cao, J. Almeida, and A. Z. Broder, Summary cache: a scalable wide-area web cache
sharing protocol," IEEE/ACM Transactions on Networking, vol. 8, no. 3, pp. 281{293, 2000.
[13] F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes,
and R. E. Gruber, Bigtable: a distributed storage system for structured data," in Proceedings of the
7th USENIX Symposium on Operating Systems Design and Implementation, vol. 7. Seattle, WA:
USENIX Association, 2006.
9. International Journal of Security, Privacy and Trust Management ( IJSPTM) vol 2, No 2, April 2013
41
Authors
Ms Syama M received her Bachelor of Engineering in Computer Science and
Engineering from CUSAT University in 2011. She is pursuing her M. Tech in Computer
Networking from Visvesyaraya Technological University. Her area of interest is security
in wireless networks and communication in WSN.
Mrs. Deepti C received her Bachelor of Engineering in Electronics and Communication
in 2004. She received her M. Tech in Computer Network Engineering with distinction
from Visvesvaraya Tec hnological University in 2009.She is a PhD student in
Electronics and Communication Engineering at Christ University, Bangalore. Currently
she also holds a faculty position as Assistant Professor, Department of ISE, The Oxford
College of Engineering. Her main research interests are signal processing, wireless
sensor networks and wireless network security.