To see the other types of publications on this topic, follow the link: Sensor attacks.
Dissertations / Theses on the topic 'Sensor attacks'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Sensor attacks.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Subramanian, Venkatachalam. "Proximity-based attacks in wireless sensor networks." Thesis, Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47610.
Full textAbstract:
The nodes in wireless sensor networks (WSNs) utilize the radio frequency (RF) channel to communicate. Given that the RF channel is the primary communication channel, many researchers have developed techniques for securing that
channel. However, the RF channel is not the only interface into a sensor. The sensing components, which are primarily designed to sense characteristics about the outside world, can also be used (or misused) as a communication (side)
channel. In our work, we aim to characterize the side channels for various sensory components (i.e., light sensor, acoustic sensor, and accelerometer). While previous work has focused on the use of these side channels to improve the
security and performance of a WSN, we seek to determine if the side channels have enough capacity to potentially be used for malicious activity. Specifically, we evaluate the feasibility and practicality of the side channels using today's sensor technology and illustrate that these channels have enough capacity to enable the transfer of common, well-known malware. Given that a significant number of modern robotic systems depend on the external side channels for navigation and environment-sensing, they become potential targets for side-channel attacks. Therefore, we demonstrate
this relatively new form of attack which exploits the uninvestigated but predominantly used side channels to trigger malware residing in real-time robotic systems such as the iRobot Create.
The ultimate goal of our work is to show the impact of this new class of attack and also to motivate the need for an intrusion detection system (IDS) that not only monitors the RF channel, but also monitors the values returned by the sensory components.
2
Czarlinska, Aleksandra. "Stealthy attacks and defense strategies in competing sensor networks." [College Station, Tex. : Texas A&M University, 2008. http://hdl.handle.net/1969.1/ETD-TAMU-2946.
Full text
3
Alnifie, Ghada Matooq. "A multi-channel defense against communication denial-of-service attacks in wireless networks." Fairfax, VA : George Mason University, 2008. http://hdl.handle.net/1920/3347.
Full textAbstract:
Thesis (Ph.D.)--George Mason University, 2008.Vita: p. 152. Thesis director: Robert Simon. Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science. Title from PDF t.p. (viewed Jan. 8, 2009). Includes bibliographical references (p. 144-151). Also issued in print.
4
Umsonst, David. "Tuning of Anomaly Detectors in the Presence of Sensor Attacks." Licentiate thesis, KTH, Reglerteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-259553.
Full textAbstract:
Critical infrastructures, such as the power grid and water distribution networks, are the backbone of our modern society. With the integration of computational devices and communication networks in critical infrastructures, they have become more efficient, but also more vulnerable to cyberattacks. Due to the underlying physical process, these cyberattacks can not only have a financial and ecological impact, but also cost human lives. Several reported cyberattacks on critical infrastructures show that it is vital to protect them from these attacks. Critical infrastructures typically rely on accurate sensor measurements for optimal performance. In this thesis, we, therefore, look into attacks that corrupt the measurements. The first part of the thesis is concerned with the feasibility of a worst-case sensor attack. The attacker's goal is to maximize its impact, while remaining undetected by an anomaly detector. The investigated worst-case attack strategy needs the exact controller state for its execution. Therefore, we start by looking into the feasibility of estimating the controller state by an attacker that has full model knowledge and access to all sensors. We show that an unstable controller prevents the attacker from estimating the controller state exactly and, therefore, makes the attack non-executable. Since unstable controllers come with their own issues, we propose a defense mechanism based on injecting uncertainty into the controller. Next, we examine the confidentiality of the anomaly detector. With access to the anomaly detector state, the attacker can design a more powerful attack. We show that, in the case of a detector with linear dynamics, the attacker is able to obtain an accurate estimate of the detector’s state. The second part of the thesis is concerned with the performance of anomaly detectors under the investigated attack in the first part. We use a previously proposed metric to compare the performance of a χ2, cumulative sum (CUSUM), and multivariate exponentially weighted moving average (MEWMA) detectors. This metric depends on the attack impact and average time between false alarms. For two different processes, we observe that the CUSUM and MEWMA detectors, which both have internal dynamics, can mitigate the attack impact more than the static χ2 detector. Since this metric depends on the attack impact, which is usually hard to determine, we then propose a new metric. The new metric depends on the number of sensors, and the size of an invariant set guaranteeing that the attack remains undetected. The new metric leads to similar results as the previously proposed metric, but is less dependent on the attack modeling. Finally, we formulate a Stackelberg game to tune the anomaly detector thresholds in a cost-optimal manner, where the cost depends on the number of false alarms and the impact an attack would cause.Kritiska infrastrukturer, så som elnätet eller vattenförsörjningssystemet, är ryggraden i vårt moderna samhälle. Effektiviteten av kritiska infrastrukturerhar ökats genom integration med beräkningsenheter och kommunikationsnätverk, men detta har medfört att de också har blivit mer sårbara för cyberattacker. På grund av den underliggande fysikaliska processen kan dessa cyberattacker inte bara ha ekonomiska och ekologiska effekter, utan de kan också kosta människoliv. Flera rapporterade cyberattacker mot kritiska infrastrukturer visar att det är viktigt att skydda dem från dessa attacker. Kritiska infrastrukturer förlitar sig vanligtvis på noggranna sensormätningar för optimal prestanda. I denna avhandling undersöker vi därför attacker som korrumperar mätningar. Den första delen av avhandlingen handlar om genomförandet av en sensorattack i ett värstafallsscenario. Angriparens mål är att maximera verkan av attacken, medan den förblir oupptäckt av en feldetektor. Den undersökta värstafallstrategin behöver exakt information av regulatorns tillstånd för att kunna användas. Därför börjar vi med att titta på möjligheten att en angripare ska kunna uppskatta regulatorns tillstånd samtidigt som den känner till modellen och har tillgång till alla sensorer. Vi visar att en instabil regulator förhindrar angriparen från att exakt uppskatta regulatorns tillstånd och därmed förhindrar attacken. Eftersom instabila regulatorer introducerar andra problem, föreslår vi en försvarsmekanism baserad på injektion av osäkerhet i regulatorn. Därefter undersöker vi feldetektorns konfidentialitet. Med kännedom om feldetektorns tillstånd kan angriparen skapa en kraftfullare attack. Vi visar att angriparen kan få en noggrann uppskattning av detektorns tillstånd när detektorn har linjär dynamik. Den andra delen av avhandlingen behandlar feldetektorers prestanda medan de utsätts för de attacker som introducerades i första delen. Vi använder en tidigare föreslagen metrik för att jämföra prestandan av detektorer baserade på χ2-fördelningen, kumulativ summa (CUSUM), och multivariat exponentiellt viktat glidande medelvärde (MEWMA). Denna metrik beror på verkan av attacken och genomsnittlig tid mellan falska larm. Vi observerar att CUSUM- och MEWMA-detektorerna, där båda har intern dynamik, kan begränsa verkan av attacker bättre än vad den statiska χ2-detektorn kan för två olika processer. Eftersom denna metrik beror på attackens verkan, vilket vanligtvis är svårt att fastställa, föreslår vi en ny metrik. Den nya metriken beror på antalet sensorer och storleken på en invariant mängd som garanterar att attacken förblir oupptäckt. Den nya metriken leder till liknande resultat somden tidigare föreslagna metriken, men är mindre beroende av en modell av angriparen. Slutligen formulerar vi ett Stackelberg-spel för att ställa in trösklar för feldetektorn på ett kostnadsoptimalt sätt, där kostnaden beror på antalet falska larm och potentiell verkan av attacker.
5
Khanapure, Vishal. "Memory efficient distributed detection of node replication attacks in wireless sensor networks." [Gainesville, Fla.] : University of Florida, 2009. http://purl.fcla.edu/fcla/etd/UFE0025072.
Full text
6
Cai, Hang. "Detecting Data Manipulation Attacks on Physiological Sensor Measurements in Wearable Medical Systems." Digital WPI, 2018. https://digitalcommons.wpi.edu/etd-dissertations/502.
Full textAbstract:
Recent years have seen the dramatic increase of wearable medical systems (WMS) that have demonstrated promise for improving health monitoring and overall well-being. Ensuring that the data collected are secure and trustworthy is crucial. This is especially true in the presence of adversaries who want to mount data manipulation attacks on WMS, which aim to manipulate the sensor measurements with fictitious data that is plausible but not accurate. Such attacks force clinicians or any decision support system AI analyzing the WMS data, to make incorrect diagnosis and treatment decisions about the user’s health.
Given that there are different possible vulnerabilities found in WMS that can lead to data manipulation attacks, we take a different angle by developing an attack-agnostic approach, called Signal Interrelationship CApture for Physiological-process (SICAP), to detect data manipulation attacks on physiological sensor measurements in a WMS. SICAP approach leverages the idea that different physiological signals in the user’s body driven by the same underlying physiological process (e.g., cardiac process) are inherently related to each other. By capturing the interrelationship patterns between the related physiological signals, it can detect if any signal is maliciously altered. This is because the incorrect user data introduced by adversaries will have interrelationship patterns that are uncharacteris- tic of the individual’s physiological process and hence quite different from the ones SICAP expects. We demonstrate the efficacy of our approach in detecting data manipulation attacks by building different detection solutions for two commonly measured physiological sensor measurements in a WMS environment – electrocardiogram and arterial blood pressure.
The advantage of using this approach is that it allows for detection of data manipulation attacks by taking advantage of different types of physiological sensors, which already exist in typical WMS, thus avoiding the need of redundant sensors of the same type. Furthermore, SICAP approach is not designed to be stand-alone but provides the last line of defense for WMS. It is complementary to, and coexist with, any existing or future security solutions that may be introduced to protect WMS against data manipulation attacks.
7
Shaon, Mohammad. "A computationally intelligent approach to the detection of wormhole attacks in wireless sensor networks." World Comp,14th International Conference on Wireless Networks, 2015, 2015. http://hdl.handle.net/1993/31981.
Full textAbstract:
This thesis proposes an innovative wormhole detection scheme to detect wormhole attacks using computational intelligence and an artificial neural network (ANN). The aim of the proposed research is to develop a detection scheme that can detect wormhole attacks (In-band, out of band, hidden wormhole attack, active wormhole attack) in both uniformly and non-uniformly distributed sensor networks. Furthermore, the proposed research does not require any special hardware and causes no significant network overhead throughout the network. Most importantly, the probable location of the wormhole nodes can be tracked down by the proposed ANN-based detection scheme.
We evaluate the efficacy of the proposed detection scheme in terms of detection accuracy, false positive rate, and false negative rate. The performance of the proposed model is also compared with other machine learning techniques (i.e. SVM and regularized nonlinear logistic regression (LR) based detection models) based detection schemes. The simulation results show that proposed ANN-based detection model outperforms the SVM and LR based detection schemes in terms of detection accuracy, false positive rate, and false negative rates.February 2017
8
JUNG, SANG SHIN. "Attacking and Securing Beacon-Enabled 802.15.4 Networks." Digital Archive @ GSU, 2011. http://digitalarchive.gsu.edu/cs_theses/74.
Full textAbstract:
The IEEE 802.15.4 has attracted time-critical applications in wireless sensor networks (WSNs) because of its beacon-enabled mode and guaranteed timeslots (GTSs). However, the GTS scheme’s security still leave the 802.15.4 MAC vulnerable to attacks. Further, the existing techniques in the literature for securing 802.15.4 either focus on non beacon-enabled 802.15.4 or cannot defend against insider attacks for beacon-enabled 802.15.4. In this thesis, we illustrate this by demonstrating attacks on the availability and integrity of the beacon-enabled 802.15.4. To proof the attacks, we implement the attacks using Tmote Sky motes for a malicious node along with regular nodes. We show that the malicious node can freely exploit the beacon frames to compromise the integrity and availability of the network. For the defense, we present beacon-enabled MiniSec (BCN-MiniSec) and analyze its cost.
9
Mouton, Francois. "Digital forensic readiness for wireless sensor network environments." Diss., University of Pretoria, 2012. http://hdl.handle.net/2263/24955.
Full textAbstract:
The new and upcoming field of wireless sensor networking is unfortunately still lacking in terms of both digital forensics and security. All communications between different nodes (also known as motes) are sent out in a broadcast fashion. These broadcasts make it quite difficult to capture data packets forensically and, at the same time, retain their integrity and authenticity. The study presents several attacks that can be executed successfully on a wireless sensor network, after which the dissertation delves more deeply into the flooding attack as it is one of the most difficult attacks to address in wireless sensor networks. Furthermore, a set of factors is presented to take into account while attempting to achieve digital forensic readiness in wireless sensor networks. The set of factors is subsequently discussed critically and a model is proposed for implementing digital forensic readiness in a wireless sensor network. The proposed model is next transformed into a working prototype that is able to provide digital forensic readiness to a wireless sensor network. The main contribution of this research is the digital forensic readiness prototype that can be used to add a digital forensics layer to any existing wireless sensor network. The prototype ensures the integrity and authenticity of each of the data packets captured from the existing wireless sensor network by using the number of motes in the network that have seen a data packet to determine its integrity and authenticity in the network. The prototype also works on different types of wireless sensor networks that are in the frequency range of the network on which the prototype is implemented, and does not require any modifications to be made to the existing wireless sensor network. Flooding attacks pose a major problem in wireless sensor networks due to the broadcasting of communication between motes in wireless sensor networks. The prototype is able to address this problem by using a solution proposed in this dissertation to determine a sudden influx of data packets within a wireless sensor network. The prototype is able to detect flooding attacks while they are occurring and can therefore address the flooding attack immediately. Finally, this dissertation critically discusses the advantages of having such a digital forensic readiness system in place in a wireless sensor network environment. CopyrightDissertation (MSc)--University of Pretoria, 2012.
Computer Science
unrestricted
10
Ben, Jaballah Wafa. "Securing wireless sensor and vehicular networks." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0013/document.
Full textAbstract:
Les Réseaux de Capteurs Sans Fils (RCSFs) et les réseaux véhiculaires sont de plus en plus répandus, et déployés dans des domaines d’applications variés tels que la santé, la surveillance environnementale, les applications d’alerte d’accident, et les applications militaires. Cependant, ces réseaux peuvent être sujets à des attaques, ce qui empêche leur utilisation à grande échelle. Cette thèse étudie la sécurité des communications pour les réseaux de capteurs sans fils, et les communications inter-véhiculaires. Dans ce but, nous abordons quatre aspects importants. La première étude porte sur l’authentification des messages diffusés dans les réseaux de capteurs. Nous nous concentrons sur les principaux schémas à base de divulgation de clés d’authentification. Nous démontrons que le délai de divulgation de clé induit un délai d’authentification, ce qui pourrait conduire à une attaque de mémoire de déni de service. Nous proposons ensuite deux protocoles d’authentification de la source dans les RCSFs, pour surmonter la vulnérabilité des solutions existantes. Les schémas proposés garantissent la gestion efficace de la mémoire tampon du récepteur, en utilisant un mécanisme d’authentification par niveau, et une structure de Filtre de Bloom afin de réduire le coût de communication. Ensuite, nous validons nos protocoles en utilisant l’outil de vérification AVISPA, et nous les évaluons avec des expérimentations dans l’environment TinyOS. Nous confirmons que ces protocoles fournissent un service d’authentification de la source tout en respectant les contraintes de RCSFs. La seconde étude porte sur le problème de stockage au niveau des capteurs. Nous considérons en particulier l’attaque d’authentification différée “Delayed Authentication Compromise” (DAC) dans les RCSFs, qui permet à un attaquant d’utiliser une clé déjà divulguée pour signer d’autres messages. Nous montrons d’abord que les systèmes récemment proposés qui sont résistants également à l’attaque DAC sont vulnérables aussi à deux types d’attaques: attaque de permutation de commandes (où un adversaire prétend “permuter” deux messages au fil du temps), et l’attaque de rejet de commandes (où un adversaire semble “cacher” un message envoyé par la station de base). Nous proposons ensuite une nouvelle solution d’authentification. Notre analyse montre que notre solution est efficace pour détecter à la fois l’attaque de permutation de commandes et l’attaque de rejet de commandes, — et en même temps — est plus efficace (en termes de communication et de calcul) que les solutions existantes. xxiDans la troisième étude, nous considérons le problème de la sécurité de la gestion des clés dans les réseaux de capteurs. Nous présentons de nouveaux schémas d’authentification à base de clés symétriques qui présentent un faible coût d’authentification et de communication. Nos systèmes sont construits en intégrant un mécanisme de réputation, un filtre de Bloom, et un arbre binaire de clés pour la distribution et la mise à jour des clés d’authentification. Nos schémas d’authentification sont efficaces en matière de communication et de consommation de l’énergie. La quatrième étude porte sur la sécurité des communications véhiculaires. Nous nous concentrons sur les applications d’alerte d’accident. Nous analysons les menaces pour un ensemble d’algorithmes. Nous démontrons que ces systèmes sont vulnérables à l’attaque d’injection d’une fausse position, à l’attaque de rejeu de message d’alerte, et à l’attaque d’interruption de message d’alerte. Ensuite, nous proposons des contre-mesures à ces menaces. Nous avons donc proposé une solution qui est à la fois rapide et sécurisée pour les applications d’alerte d’accident : Un algorithme rapide et sécurisé pour la diffusion des messages en multi-saut (FS-MBA). Enfin, nous confirmons l’efficacité et la faisabilité des différents protocoles en effectuant un ensemble de simulations sous le simulateur NS-2Wireless sensor and vehicular networks play an important role in critical military and civil applications, and pervade our daily life. However, security concerns constitute a potential stumbling block to the impeding wide deployment of sensor networks and vehicular communications. This dissertation studies communication security for Wireless Sensor Networks (WSNs), and vehicular communication. To this aim, we address four important aspects. The first study addresses broadcast authentication in WSNs. We focus on key disclosure based schemes. We demonstrate that key disclosure delay induces an authentication delay, which could lead to a memory DoS attack. We then propose two broadcastauthentication protocols for WSNs, which overcome the security vulnerability of existingsolutions. The proposed schemes guarantee the efficient management of receiver’s buffer, by employing a staggered authentication mechanism, and a Bloom filter data structure to reduce the communication overhead. We also validate our protocols under the AVISPA model checking tool, and we evaluate them with experiments under TinyOS. Our findings are that these protocols provide source authentication service while respecting the WSN constraints.The second study addresses the storage issue in WSNs, in particular the Delayed AuthenticationCompromise attack (DAC). We first demonstrate that recently proposed schemes, which also address the DAC issue are vulnerable to two kinds of attacks: switch command attack (where an adversary pretends to “switch” two messages over time), and drop command attack (where an adversary just pretends to “hide” a message sent from the broadcaster). As a countermeasure against these attacks, we propose a new solution for broadcast authentication. Our analysis shows that our solution is effective in detecting both switch command and drop command attack, and—at the same time—is more efficient (in terms of both communication and computation) than the state of the art solutions.In the third study, we address key management security in WSNs. We present novel symmetric-key-based authentication schemes which exhibit low computation and communication authentication overhead. Our schemes are built upon the integration of a reputation mechanism, a Bloom filter, and a key binary tree for the distribution and updating of the auxviii thentication keys. Our schemes are lightweight and efficient with respect to communication and energy overhead. The fourth study addresses security in vehicular communications. We focus on fast multi hop broadcast applications. We analyze the security threats of state of the art vehicular based safety applications. We demonstrate that these schemes are vulnerable to the position cheating attack, the replay broadcast message attack, and the interrupting forwarding attack. Then, we propose countermeasures for these threats. We hence propose a complete solution which is both fast and secure in broadcasting safety related messages: Fast and Secure Multi-hop Broadcast Algorithm (FS-MBA). Finally, we confirm the efficiency and feasibility of our proposals using an extensive set of simulations under NS-2 Simulator
11
Francillon, Aurélien. "Attacking and Protecting Constrained Embedded Systems from Control Flow Attacks." Phd thesis, Grenoble INPG, 2009. http://tel.archives-ouvertes.fr/tel-00540371.
Full textAbstract:
La sécurité des systèmes embarqués très contraints est un domaine qui prend de l'importance car ceux-ci ont tendance à être toujours plus connectés et présents dans de nombreuses applications industrielles aussi bien que dans la vie de tous les jours. Cette thèse étudie les attaques logicielles dans le contexte des systèmes embarqués communicants par exemple de type réseaux de capteurs. Ceux-ci, reposent sur diverses architectures qui possèdent souvent, pour des raisons des coût, des capacités de calcul et de mémoire très réduites. Dans la première partie de cette thèse nous montrons la faisabilité de l'injection de code dans des micro-contrôleurs d'architecture Harvard, ce qui était, jusqu'à présent, souvent considéré comme impossible. Dans la seconde partie nous étudions les protocoles d'attestation de code. Ceux-ci permettent de détecter les équipements compromis dans un réseau de capteurs. Nous présentons plusieurs attaques sur les protocoles d'attestation de code existants. De plus nous proposons une méthode améliorée permettant d'éviter ces attaques. Finalement, dans la dernière partie de cette thèse, nous proposons une modification de l'architecture mémoire d'un micro-contrôleur. Cette modification permet de prévenir les attaques de manipulation du flot de contrôle, tout en restant très simple a implémenter.
12
Houssain, Hilal. "Elliptic curve cryptography algorithms resistant against power analysis attacks on resource constrained devices." Thesis, Clermont-Ferrand 2, 2012. http://www.theses.fr/2012CLF22286/document.
Full textAbstract:
Les systèmes de cryptographie à base de courbe elliptique (ECC) ont été adoptés comme des systèmes standardisés de cryptographie à clé publique (PKC) par l'IEEE, ANSI, NIST, SEC et WTLS. En comparaison avec la PKC traditionnelle, comme RSA et ElGamal, l'ECC offre le même niveau de sécurité avec des clés de plus petites tailles. Cela signifie des calculs plus rapides et une consommation d'énergie plus faible ainsi que des économies de mémoire et de bande passante. Par conséquent, ECC est devenue une technologie indispensable, plus populaire et considérée comme particulièrement adaptée à l’implémentation sur les dispositifs à ressources restreintes tels que les réseaux de capteurs sans fil (WSN). Le problème majeur avec les noeuds de capteurs chez les WSN, dès qu'il s'agit d’opérations cryptographiques, est les limitations de leurs ressources en termes de puissance, d'espace et de temps de réponse, ce qui limite la capacité du capteur à gérer les calculs supplémentaires nécessaires aux opérations cryptographiques. En outre, les mises en oeuvre actuelles de l’ECC sur WSN sont particulièrement vulnérables aux attaques par canaux auxiliaires (SCA), en particulier aux attaques par analyse de consommation (PAA), en raison de l'absence de la sécurité physique par blindage, leur déploiement dans les régions éloignées et le fait qu’elles soient laissées sans surveillance. Ainsi, les concepteurs de crypto-processeurs ECC sur WSN s'efforcent d'introduire des algorithmes et des architectures qui ne sont pas seulement résistants PAA, mais également efficaces sans aucun supplément en termes de temps, puissance et espace. Cette thèse présente plusieurs contributions dans le domaine des cryptoprocesseurs ECC conscientisés aux PAA, pour les dispositifs à ressources limitées comme le WSN. Premièrement, nous proposons deux architectures robustes et efficaces pour les ECC conscientisées au PAA. Ces architectures sont basées sur des algorithmes innovants qui assurent le fonctionnement de base des ECC et qui prévoient une sécurisation de l’ECC contre les PAA simples (SPA) sur les dispositifs à ressources limitées tels que les WSN. Deuxièmement, nous proposons deux architectures additionnelles qui prévoient une sécurisation des ECC contre les PAA différentiels (DPA). Troisièmement, un total de huit architectures qui incluent, en plus des quatre architectures citées ci-dessus pour SPA et DPA, deux autres architectures dérivées de l’architecture DPA conscientisée, ainsi que deux architectures PAA conscientisées. Les huit architectures proposées sont synthétisées en utilisant la technologie des réseaux de portes programmables in situ (FPGA). Quatrièmement, les huit architectures sont analysées et évaluées, et leurs performances comparées. En plus, une comparaison plus avancée effectuée sur le niveau de la complexité du coût (temps, puissance, et espace), fournit un cadre pour les concepteurs d'architecture pour sélectionner la conception la plus appropriée. Nos résultats montrent un avantage significatif de nos architectures proposées par rapport à la complexité du coût, en comparaison à d'autres solutions proposées récemment dans le domaine de la rechercheElliptic Curve Cryptosystems (ECC) have been adopted as a standardized Public Key Cryptosystems (PKC) by IEEE, ANSI, NIST, SEC and WTLS. In comparison to traditional PKC like RSA and ElGamal, ECC offer equivalent security with smaller key sizes, in less computation time, with lower power consumption, as well as memory and bandwidth savings. Therefore, ECC have become a vital technology, more popular and considered to be particularly suitable for implementation on resource constrained devices such as the Wireless Sensor Networks (WSN). Major problem with the sensor nodes in WSN as soon as it comes to cryptographic operations is their extreme constrained resources in terms of power, space, and time delay, which limit the sensor capability to handle the additional computations required by cryptographic operations. Moreover, the current ECC implementations in WSN are particularly vulnerable to Side Channel Analysis (SCA) attacks; in particularly to the Power Analysis Attacks (PAA), due to the lack of secure physical shielding, their deployment in remote regions and it is left unattended. Thus designers of ECC cryptoprocessors on WSN strive to introduce algorithms and architectures that are not only PAA resistant, but also efficient with no any extra cost in terms of power, time delay, and area. The contributions of this thesis to the domain of PAA aware elliptic curve cryptoprocessor for resource constrained devices are numerous. Firstly, we propose two robust and high efficient PAA aware elliptic curve cryptoprocessors architectures based on innovative algorithms for ECC core operation and envisioned at securing the elliptic curve cryptoprocessors against Simple Power Analysis (SPA) attacks on resource constrained devices such as the WSN. Secondly, we propose two additional architectures that are envisioned at securing the elliptic curve cryptoprocessors against Differential Power Analysis (DPA) attacks. Thirdly, a total of eight architectures which includes, in addition to the two SPA aware with the other two DPA awareproposed architectures, two more architectures derived from our DPA aware proposed once, along with two other similar PAA aware architectures. The eight proposed architectures are synthesized using Field Programmable Gate Array (FPGA) technology. Fourthly, the eight proposed architectures are analyzed and evaluated by comparing their performance results. In addition, a more advanced comparison, which is done on the cost complexity level (Area, Delay, and Power), provides a framework for the architecture designers to select the appropriate design. Our results show a significant advantage of our proposed architectures for cost complexity in comparison to the other latest proposed in the research field
13
Sandström, Marie. "Liveness Detection in Fingerprint Recognition Systems." Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2397.
Full textAbstract:
Biometrics deals with identifying individuals with help of their biological data. Fingerprint scanning is the most common method of the biometric methods available today. The security of fingerprint scanners has however been questioned and previous studies have shown that fingerprint scanners can be fooled with artificial fingerprints, i.e. copies of real fingerprints. The fingerprint recognition systems are evolving and this study will discuss the situation of today.
Two approaches have been used to find out how good fingerprint recognition systems are in distinguishing between live fingers and artificial clones. The first approach is a literature study, while the second consists of experiments.
A literature study of liveness detection in fingerprint recognition systems has been performed. A description of different liveness detection methods is presented and discussed. Methods requiring extra hardware use temperature, pulse, blood pressure, electric resistance, etc., and methods using already existent information in the system use skin deformation, pores, perspiration, etc.
The experiments focus on making artificial fingerprints in gelatin from a latent fingerprint. Nine different systems were tested at the CeBIT trade fair in Germany and all were deceived. Three other different systems were put up against more extensive tests with three different subjects. All systems werecircumvented with all subjects'artificial fingerprints, but with varying results. The results are analyzed and discussed, partly with help of the A/R value defined in this report.
14
Karaaslan, Ibrahim. "Anti-sensor Network: Distortion-based Distributed Attack In Wireless Sensor Networks." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12609276/index.pdf.
Full textAbstract:
In this thesis, a novel anti-sensor network paradigm is introduced against wireless sensor networks (WSN). Anti-sensor network (ASN) aims to destroy application reliability by adaptively and anonymously introducing adequate level of artificial distortion into the communication of the event features transported from the sensor nodes (SN) to the sink. ASN is composed of anti-sensor nodes (aSN) randomly distributed
over the sensor network field. aSNs pretend to be SNs tomaintain anonymity and so improve resiliency against attack detection and prevention mechanisms. Performance
evaluations via mathematical analysis and simulation experiments show that ASN can effectively reduce the application reliability of WSN.
15
Gerbert, Oscar. "Attack on the Chaos Sensor Network Protocol." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-260480.
Full textAbstract:
As the demand for wireless sensor networks increases the need for new protocols with specific ways of distributing data emerges. Chaos is one of those protocols. Chaos has no native security countermeasures implemented, therefore it is important to test how vulnerable it is against attacks. In this thesis I present four novel attacks to test the robustness of Chaos. Experiments show that a Drizzle-attack was the most effective attack, strategic placement of the nodes was the key to a more efficient attack.
16
Barb, Daniel, Bryan Freeman, Mark Jackson, Douglas Mount, and William Newcomb. "Joint Terminal Attack Controllers Sensors and Lasers Modernization." Thesis, Monterey, California. Naval Postgraduate School, 2012. http://hdl.handle.net/10945/17456.
Full textAbstract:
Systems Engineering Project ReportApproved for public release, distribution unlimited
Inconsistencies exist among components of current ground targeting equipment because they were all fielded at different times and with different Concepts of Operations. This has caused an impractical design trade space resulting in unclear requirements that are inconsistent with either state of the art technology or a threat analysis of all possible combat situations. The Joint Terminal Attack Controller Sensors and Lasers Modernization capstone project was started to provide models, trade spaces, and a technology roadmap/modernization plan that will guide future development of equipment belonging to the Tactical Air Control Party suite of equipment. The process used for the project was to gather all of the requirements in one consolidated list and prioritize it based upon user representative feedback. This list, with current Science and Technology efforts, was used to provide data points corresponding to future technology improvements and determine whether or not those improvements will add value to the end user. Based upon this project it was found, somewhat surprisingly, that the most valued system characteristic is Target Location Error, followed by Weight and Target Designation Range. It was also found that both Mid Wave Infrared and Short Wave Infrared technologies are most promising compared to Long Wave Infrared.
17
Tan, Hailun Computer Science & Engineering Faculty of Engineering UNSW. "Secure network programming in wireless sensor networks." Awarded By:University of New South Wales. Computer Science & Engineering, 2010. http://handle.unsw.edu.au/1959.4/44835.
Full textAbstract:
Network programming is one of the most important applications in Wireless Sensor Networks as It provides an efficient way to update program Images running on sensor nodes without physical access to them. Securing these updates, however, remains a challenging and important issue, given the open deployment environment of sensor nodes. Though several security schemes have been proposed to impose the authenticity and Integrity protection on network programming applications, they are either energy Inefficient as they tend to use digital signature or lacks the data confidentiality. In addition, due to the absence of secure memory management in the current sensor hardware, the attacker could inject malicious code into the program flash by exploiting buffer overflow In the memory despite the secure code dissemination. The contribution of this thesis Is to provide two software-based security protocols and one hardware-based remote attestation protocol for network programming application. Our first protocol deploys multiple one-way key chains for a multi-hop sensor network. The scheme Is shown to be lower In computational, power consumption and communication costs yet still able to secure multi??hop propagation of program images. Our second protocol utilizes an Iterative hash structure to the data packets in network programming application, ensuring the data confidentiality and authenticity. In addition, we Integrated confidentiality and DoS-attack-resistance in a multi??hop code dissemination protocol. Our final solution is a hardware-based remote attestation protocol for verification of running codes on sensor nodes. An additional piece of tamper-proof hardware, Trusted Platform Module (TPM), is imposed into the sensor nodes. It secures the sensitive information (e.g., the session key) from attackers and monitors any platform environment changes with the Internal registers. With these features of TPM, the code Injection attack could be detected and removed when the contaminated nodes are challenged in our remote attestation protocol. We implement the first two software-based protocols with Deluge as the reference network programming protocol in TinyOS, evaluate them with the extensive simulation using TOSSIM and validate the simulation results with experiments using Tmote. We implement the remote attestation protocol on Fleck, a sensor platform developed by CSIRO that Integrates an Atmel TPM chip.
18
Gujar, Surabhi Satyajit. "Detecting Electromagnetic Injection Attack on FPGAs Using In Situ Timing Sensors." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/97006.
Full textAbstract:
Nowadays, security is one of the foremost concerns as the confidence in a system is mostly dependent on its ability to protect itself against any attack. The area of Electromagnetic Fault Injection (EMFI) wherein attackers can use electromagnetic (EM) pulses to induce faults has started garnering increasing attention. It became crucial to understand EM attacks and find the best countermeasures. In this race to find countermeasures, different researchers proposed their ideas regarding the generation of EM attacks and their detection. However, it is difficult to see a universal agreement on the nature of these attacks.
In this work, we take a closer look at the analysis of the primary EMFI fault models suggested earlier. Initial studies had shown that EM glitches caused timing violations, but recently it was proposed that EM attacks can create bit sets and bit resets. We performed a detailed experimental evaluation of the existing detection schemes on two different FPGA platforms. We present their comparative design analysis concerning their accuracy, precision, and cost. We propose an in situ timing sensor to overcome the disadvantages of the previously proposed detection approaches. This sensor can successfully detect most of the electromagnetic injected faults with high precision. We observed that the EM attack behaves like a localized timing attack in FPGAs which can be identified using the in situ timing sensors.MS
19
Gottumukkala, Venkata Praneeth Varma. "Providing Location Privacy to Base Station in Wireless Sensor Networks." University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1353100851.
Full text
20
Engvall, Christoffer. "Security in Wireless Sensor Networks for Open Controller." Thesis, Linköpings universitet, Databas och informationsteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-91089.
Full textAbstract:
In this thesis we develop, evaluate and implement a security solution for Open Controllers wireless sensor network platform. A scenario is used to describe an exemplar application showing how our system is supposed to function. The security of the platform is analyzed using a well-established threat modeling process and attack trees which result in the identification of a number of risks, which could be security weaknesses. These attack trees visualize the security weaknesses in an easy to access way even for individuals without special security expertise. We develop a security solution to counter these identified risks. The developed security solution consists of three different security levels together with a number of new security policies. Each additional level applies different security mechanisms to provide increasingly improved security for the platform. The new security policies ensure that the security solution is continuously secure during its operating time. We implement part of the security solution in the Contiki operating system to assess its function in practice. Finally we evaluate the developed security solution by looking back to the previously identified weaknesses and the implementation proving that the security solution mitigates the risks.
21
Chen, Xiangqian. "Defense Against Node Compromise in Sensor Network Security." FIU Digital Commons, 2007. http://digitalcommons.fiu.edu/etd/7.
Full textAbstract:
Recent advances in electronic and computer technologies lead to wide-spread deployment of wireless sensor networks (WSNs). WSNs have wide range applications, including military sensing and tracking, environment monitoring, smart environments, etc. Many WSNs have mission-critical tasks, such as military applications. Thus, the security issues in WSNs are kept in the foreground among research areas. Compared with other wireless networks, such as ad hoc, and cellular networks, security in WSNs is more complicated due to the constrained capabilities of sensor nodes and the properties of the deployment, such as large scale, hostile environment, etc. Security issues mainly come from attacks. In general, the attacks in WSNs can be classified as external attacks and internal attacks. In an external attack, the attacking node is not an authorized participant of the sensor network. Cryptography and other security methods can prevent some of external attacks. However, node compromise, the major and unique problem that leads to internal attacks, will eliminate all the efforts to prevent attacks. Knowing the probability of node compromise will help systems to detect and defend against it. Although there are some approaches that can be used to detect and defend against node compromise, few of them have the ability to estimate the probability of node compromise. Hence, we develop basic uniform, basic gradient, intelligent uniform and intelligent gradient models for node compromise distribution in order to adapt to different application environments by using probability theory. These models allow systems to estimate the probability of node compromise. Applying these models in system security designs can improve system security and decrease the overheads nearly in every security area. Moreover, based on these models, we design a novel secure routing algorithm to defend against the routing security issue that comes from the nodes that have already been compromised but have not been detected by the node compromise detecting mechanism. The routing paths in our algorithm detour those nodes which have already been detected as compromised nodes or have larger probabilities of being compromised. Simulation results show that our algorithm is effective to protect routing paths from node compromise whether detected or not.
22
Qayoom, Mohamad. "An Energy-Efficient Medium Access Control Protocol for Wireless Sensor Networks "V-MAC"." ScholarWorks@UNO, 2008. http://scholarworks.uno.edu/td/704.
Full textAbstract:
Wireless sensor networks (WSNs) are composed of hundreds of wireless sensors which collaborate to perform a common task. Because of the small size of wireless sensors, they have some serious limitations including very low computation capability and battery reserve. Such resource limitations require that WSN protocols to be extremely efficient. In this thesis, we focus on the Medium Access Control (MAC) layer in WSNs. We propose a MAC scheme, V-MAC, for WSNs that extends that lifetime of the network. We compare V-MAC with other MAC schemes. V-MAC uses a special mechanism to divide sensors in different groups and then all the members of a group go to sleep at the same time. V-MAC protects WSNs against denial of sleep and broadcast attacks. We present the V-MAC scheme in details and evaluate it with simulations. Our simulations show that V-MAC enjoys significantly higher throughput and network lifetime compared to other schemes.
23
Haberlin, Richard J. "Analysis of unattended ground sensors in theater Missile Defense Attack Operations." Thesis, Monterey, California. Naval Postgraduate School, 1997. http://hdl.handle.net/10945/26369.
Full textAbstract:
Approved for public release; distribution is unlimitedUnattended ground sensors have a tremendous potential for improving Tactical Ballistic Missile Attack Operations. To date, however, this potential has gone unrealized primarily due to a lack of confidence in the systems and a lack of tactical doctrine for their employment. This thesis provides analyses to demonstrate the effective use of sensor technology and provides recommendations as to how they may best be employed. The probabilistic decision model reports the optimal size array for each of the candidate array locations. It also provides an optimal policy for determining the likelihood that the target is a Time Critical Target based on the number of sensors in agreement as to its identity. This policy may vary with each candidate array. Additionally, recommendations are made on the placement of the arrays within the theater of operations and their optimal configuration to maximize information gained while minimizing the likelihood of compromise. Specifics include, inter-sensor spacing, placement patterns, array locations, and off-road distance
24
Yildiz, Kursad. "Electronic attack and sensor fusion techniques for boot-phase defense against multiple ballistic threat missiles." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Jun%5FYildiz.pdf.
Full textAbstract:
Thesis (M.S. in Systems Engineering)--Naval Postgraduate School, June 2005.Thesis Advisor(s): Phillip E. Pace, Murali Tummala. Includes bibliographical references (p.155-158). Also available online.
25
Lu, Jingyang. "A Study on False Information Injection Attack on Dynamic State Estimation in Multi-Sensor Systems." VCU Scholars Compass, 2015. http://scholarscompass.vcu.edu/etd/3789.
Full textAbstract:
In this thesis, the impact of false information injection is investigated for linear dynamic systems with multiple sensors. It is assumed that the Kalman filter system is unaware of the existence of false information and the adversary is trying to maximize the negative effect of the false information on the Kalman filter's estimation performance. First, a brief introduction to the Kalman filter is shown in the thesis. We mathematically characterize the false information attack under different conditions. For the adversary, many closed-form results for the optimal attack strategies that maximize the Kalman filter's estimation error are theoretically derived. It is shown that by choosing the optimal correlation coefficients among the bias noises and allocating power optimally among sensors, the adversary could significantly increase the Kalman filter's estimation errors. To be concrete, a target tracking system is used as an example in the thesis. From the adversary's point of view, the best attack strategies are obtained under different scenarios, including a single-sensor system with both position and velocity measurements, and a multi-sensor system with position and velocity measurements. Under a constraint on the total power of the injected bias noises, the optimal solutions are solved from two perspectives: trace and determinant of the mean squared error matrix. Numerical results are also provided in order to illustrate the negative effect which the proposed attack strategies could inflict on the Kalman filter.
26
Ren, Kui. "Communication security in wireless sensor networks." Worcester, Mass. : Worcester Polytechnic Institute, 2007. http://www.wpi.edu/Pubs/ETD/Available/etd-040607-174308/.
Full text
27
Lu, Huabo. "Sender cover traffic to counter an improved Statistical Disclosure Attack." Thesis, Wichita State University, 2011. http://hdl.handle.net/10057/5040.
Full textAbstract:
The statistical disclosure attack (SDA) is quite an effective method for attackers
to go against an anonymity system and to reveal the information behind it. It targets
at a particular anonymity system user, tries to find its sending/receiving relationship with
others after a long term observation. In this thesis, we first make an improvement for SDA,
using weighted mean instead of the orginal arithmetic mean to calculate the cumulative
observed receiver popularity in order to get a more precise value of the attack result. Second,
we present an analysis for the effectiveness of the sender generated cover traffic, showing
that employing this kind of cover traffic helps little on protecting anonymity system users
against a sophisticated attacker. The analysis also validates an earlier empirical result of the
ineffectiveness of sender generated cover traffic.Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science
28
Erdene-Ochir, Ochirkhand. "Résilience et application aux protocoles de routage dans les réseaux de capteurs." Phd thesis, INSA de Lyon, 2013. http://tel.archives-ouvertes.fr/tel-00862710.
Full textAbstract:
Les réseaux de capteurs sans fil sont constitués d'un grand nombre de nœuds, déployés pour collecter des données du monde physique (température, humidité, pollution etc.) et les transmettre, de manière autonome, vers un ou plusieurs points de collectes appelés "puits". Dans cette thèse, nous nous focalisons sur la sécurité des protocoles de routage multi-sauts, plus particulièrement, sur la notion de résilience aux attaques. Les domaines d'applications des réseaux de capteurs sont variés, allant du suivi médical à la surveillance environnementale en passant par le bâtiment intelligent ou le monitoring urbain (éclairage, pollution, relevé de compteurs d'eau/électricité/gaz etc.). Dans ces applications, les capteurs sont souvent déployés dans des environnements ouverts et accessibles permettant aux éventuels attaquants de les détruire ou de les capturer afin d'en extraire les données sensibles (clés de chiffrement, identité, adresse, etc.). La compromission des nœuds est un problème majeur pour la sécurité de réseaux de capteurs, puisqu'un adversaire peut s'introduire à l'intérieur du périmètre de sécurité. Les méthodes traditionnelles, basées sur la cryptographie, permettent d'obtenir une sécurité de base (authentification, confidentialité, intégrité, non répudiation etc.), mais ne permettent pas toujours de se prémunir contre les attaques dues à la compromission des nœuds (réplication des nœuds, Sybil, Selective forwarding, Blackhole, Sinkhole, Wormhole etc.). Dans le but d'apporter des solutions algorithmiques complémentaires aux solutions cryptographiques, nous étudions la résilience des protocoles de communication en présence d'adversaires internes visant à perturber le routage de l'information à travers le réseau. Dans un premier temps, nous introduisons le concept de résilience. Notre objectif est de proposer une définition explicitant le terme de résilience dans notre contexte et une métrique, permettant de comparer efficacement les protocoles de routage. L'originalité de cette métrique est d'utiliser à la fois une représentation graphique et une méthode de calcul quantitative liée à celle-ci. La représentation graphique à deux dimensions permet une vision synthétique de la résilience des protocoles selon plusieurs paramètres de performance. La méthode de calcul quantitative liée à cette représentation graphique agrège les valeurs des paramètres et permet de classifier les protocoles en termes de résilience. Grâce à cet outil, nous avons évalué la résilience de plusieurs protocoles de routage classiques de différentes catégories. Cette étude nous a permis d'identifier les mécanismes permettant d'améliorer la résilience des protocoles. Dans un second temps, nous proposons les mécanismes résilients de routage pour les réseaux de capteurs. Les mécanismes résilients que nous proposons consistent en trois éléments : (i) introduire un comportement aléatoire (ii) limiter la longueur des routes (iii) ajouter de la réplication de paquets. Les comportements aléatoires augmentent l'incertitude pour les adversaires, rendant les protocoles moins prévisibles, les réplications des données permettent de bénéficier la diversification des routes créées entre les sources et le puits, en améliorant ainsi le succès et l'équité de livraison et la limitation de la longueur des routes est nécessaire pour diminuer la probabilité qu'un paquet tombe sur un nœud attaquant en route. La connexité entre les capteurs et le puits est ainsi augmentée. Grâce à notre métrique de résilience, nous avons proposé une nouvelle taxonomie de résilience. Selon cette taxonomie, le routage par gradient et la marche aléatoire biaisée avec les mécanismes proposés sont les plus résilients. Nous avons donc évalué par la suite le routage par gradient en cas d'attaques combinées pour approfondir notre étude, mais aussi pour savoir si ces mécanismes proposés permettent d'augmenter la résilience même en cas d'attaques plus complexes, visant différents aspects du routage (construction des routes, paquets de contrôle, etc.). Nous avons introduit plusieurs valeurs de biais aux variantes aléatoires du routage par gradient pour étudier l'influence de l'entropie et nous les avons comparées à sa version classique. Nous avons également évalué leur résilience en introduisant deux types de réplications (uniformes et adaptatives). Sans attaques, ce sont les variantes les plus biaisées sans réplications qui sont les plus performantes. En cas d'attaques peu importantes, les réplications uniformes sont plus efficaces, tandis qu'en cas d'attaques plus intenses, ce sont les réplications adaptatives qui se montrent les plus efficaces. Les études menées jusqu'à ici étaient produites par des simulations et nous avions donc besoin d'une justification théorique. Nous avons donc proposé une étude théorique de la marche aléatoire biaisée en cas d'attaques de non-retransmission des paquets. Nous avons évalué l'influence du biais, mais aussi les deux réplications que nous avions évaluées précédemment par des simulations. En premier lieu, nous avons étudié le succès de livraison et la consommation d'énergie pour tous les scénarios. Ensuite, nous les avons évalués selon notre métrique de résilience. Cette étude a permit de confirmer les résultats d'étude par simulations et elle a montré que le biais est indispensable pour la résilience et le seuil d'entropie bénéfique à la résilience est e=0.7 quand la réplication de données est introduite. En dessous de cette valeur, la marche aléatoire est inefficace à cause de la longueur de chemins trop importante. L'ensemble des travaux réalisés dans cette thèse se concentre autour de la résilience. Ce concept reste assez nouveau, en particulier dans le domaine des réseaux et télécommunications. À travers cette thèse, nous avons voulu donner notre vision sur ce thème en nous concentrant sur les problématiques de sécurité des protocoles de routage dans le contexte des réseaux de capteurs.
29
Yanase, Yoshiyuki. "Development of Acoustic Emission and Gas Monitoring Methods for Nondestructive Detection of Termite Attack on Wooden Structures." Kyoto University, 2013. http://hdl.handle.net/2433/179364.
Full text
30
Le, Moigne Yann. "Adaptive Mesh Refinement and Simulations of Unsteady Delta-Wing Aerodynamics." Doctoral thesis, KTH, Aeronautical and Vehicle Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3786.
Full textAbstract:
This thesis deals with Computational Fluid Dynamics (CFD)simulations of the flow around delta wings at high angles ofattack. These triangular wings, mainly used in militaryaircraft designs, experience the formation of two vortices ontheir lee-side at large angles of attack. The simulation ofthis vortical flow by solving the Navier-Stokes equations isthe subject of this thesis. The purpose of the work is toimprove the understanding of this flow and contribute to thedesign of such a wing by developing methods that enable moreaccurate and efficient CFD simulations.
Simulations of the formation, burst and disappearance of thevortices while the angle of attack is changing are presented.The structured flow solver NSMB has been used to get thetime-dependent solutions of the flow. Both viscous and inviscidresults of a 70°-swept delta wing pitching in anoscillatory motion are reported. The creation of the dynamiclift and the hysteresis observed in the history of theaerodynamic forces are well reproduced.
The second part of the thesis is focusing on automatic meshrefinement and its influence on simulations of the delta wingleading-edge vortices. All the simulations to assess the gridquality are inviscid computations performed with theunstructured flow solver EDGE. A first study reports on theeffects of refining thewake of the delta wing. A70°-swept delta wing at a Mach number of 0.2 and an angleof attack of 27° where vortex breakdown is present abovethe wing, is used as testcase. The results show a strongdependence on the refinement, particularly the vortex breakdownposition, which leads to the conclusion that the wake should berefined at least partly. Using this information, a grid for thewing in the wind tunnel is created in order to assess theinfluence of the tunnel walls. Three sensors for automatic meshrefinement of vortical flows are presented. Two are based onflow variables (production of entropy and ratio of totalpressures) while the third one requires an eigenvalue analysisof the tensor of the velocity gradients in order to capture theposition of the vortices in the flow. These three vortexsensors are successfully used for the simulation of the same70° delta wing at an angle of attack of 20°. Acomparison of the sensors reveals the more local property ofthe third one based on the eigenvalue analysis. This lattertechnique is applied to the simulation of the wake of a deltawing at an angle of attack of 20°. The simulations on ahighly refined mesh show that the vortex sheet shed from thetrailing-edge rolls up into a vortex that interacts with theleading-edge vortex. Finally the vortex-detection technique isused to refine the grid around a Saab Aerosystems UnmannedCombat Air Vehicle (UCAV) configuration and its flight dynamicscharacteristics are investigated.
Key words:delta wing, high angle of attack, vortex,pitching, mesh refinement, UCAV, vortex sensor, tensor ofvelocity gradients.
31
Blackwood-Brown, Carlene G. "An Empirical Assessment of Senior Citizens’ Cybersecurity Awareness, Computer Self-Efficacy, Perceived Risk of Identity Theft, Attitude, and Motivation to Acquire Cybersecurity Skills." Diss., NSUWorks, 2018. https://nsuworks.nova.edu/gscis_etd/1047.
Full textAbstract:
Cyber-attacks on Internet users have caused billions of dollars in losses annually. Cybercriminals launch attacks via threat vectors such as unsecured wireless networks and phishing attacks on Internet users who are usually not aware of such attacks. Senior citizens are one of the most vulnerable groups who are prone to cyber-attacks, and this is largely due to their limited cybersecurity awareness and skills. Within the last decade, there has been a significant increase in Internet usage among senior citizens. It was documented that senior citizens had the greatest rate of increase in Internet usage over all the other age groups during the past decade. However, whenever senior citizens use the Internet, they are being targeted and exploited particularly for financial crimes, with estimation that one in five becoming a victim of financial fraud, costing more than $2.6 billion per year. Increasing the cybersecurity awareness and skills levels of Internet users have been recommended to mitigate the effects of cyber-attacks. However, it is unclear what motivates Internet users, particularly senior citizens, to acquire cybersecurity skills so that they can identify as well as mitigate the effects of the cyber-attacks. It is also not known how effective cybersecurity awareness training are on the cybersecurity skill level of senior citizens. Therefore, the main goal of this quantitative study was to empirically investigate the factors that contributed to senior citizens’ motivation to acquire cybersecurity skills so that they would be able to identify and mitigate cyber-attacks, as well as assess their actual cybersecurity skills level. This was done by assessing a model of contributing factors identified in prior literature (senior citizens’ cybersecurity awareness, computer self-efficacy, perceived risk of identity theft, & older adults’ computer technology attitude) on the motivation of senior citizens to acquire cybersecurity skills. This study utilized a Web-based survey to measure the contributing factors and a hands-on scenarios-based iPad app called MyCyberSkills™ that was developed and empirically validated in prior research to measure the cybersecurity skills level of the senior citizens. All study measures were done before and after cybersecurity awareness training (pre- & post-test) to uncover if there were any differences on the assessed models and scores due to such treatment. The study included a sample of 254 senior citizens with a mean age of about 70 years.
Path analyses using Smart PLS 3.0 were done to assess the pre- and post-test models to determine the contributions of each contributing factor to senior citizens’ motivation to acquire cybersecurity skills. Additionally, analysis of variance (ANOVA) and analysis of covariance (ANCOVA) using SPSS were done to determine significant mean difference between the pre-and post-test levels of the senior citizens’ cybersecurity skill level. The path analysis results indicate that while all paths on both models were significant, many of the paths had very low path coefficients, which in turn, indicated weak relationships among the assessed paths. However, although the path coefficients were lower than expected, the findings suggest that both intrinsic and extrinsic motivation, along with antecedents such as senior citizens’ cybersecurity awareness, computer self-efficacy, perceived risk of identity theft, and older adults’ computer technology attitude significantly impact the cybersecurity skill levels of senior citizens. The analysis of variance results indicated that there was a significant increase in the mean cybersecurity skills scores from 59.67% to 64.51% (N=254) as a result of the cybersecurity awareness training. Hence, the cybersecurity awareness training was effective in increasing the cybersecurity skill level of the senior citizens, and empowered them with small but significant improvement in the requisite skills to take mitigating actions against cyberattacks.
The analysis of covariance results indicated that, except for years using computers, all the other demographic indicators were not significant. Contributions from this study add to the body of knowledge by providing empirical results on the factors that motivate senior citizens to acquire cybersecurity skills, and thus, may help in reducing some of the billions of dollars in losses accrued to them because of cyber-attacks. Senior citizens will also benefit in that they will be better able to identify and mitigate the effects of cyber-attacks should they attend cybersecurity awareness trainings. Additionally, the recommendations from this study can be useful to law enforcement and other agencies that work with senior citizens in reducing the number of cases relating to cybersecurity issues amongst senior citizens, and thus, free up resources to fight other sources of cybercrime for law enforcement agencies.
32
Lapinskas, Vytautas. "Sklandytuvo atakos ir slydimo kampų matavimo metodų tyrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2011. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2011~D_20110615_175706-86724.
Full textAbstract:
Baigiamajame magistro darbe atliekamas sklandytuvo atakos ir slydimo kampo matavimo metodų tyrimas. Pirmoje darbo dalyje apžvelgiami atakos kampo matuokliai: virvutė, pritvirtinta ant stiklinio gaubto, atakos – slydimo kampo matuoklis su vėjarodžiu ir Pitoto vamzdelio tipo daviklis. Davikliai palyginami, aprašomi jų privalumai ir trūkumai lyginant su kitais davikliais. Antroje dalyje aprašomi alfa ir beta kampų matavimo metodai: matavimas vamzdelio tipo davikliu ir metodas, kai nenaudojami specialūs atakos, slydimo kampo davikliai. Toliau apžvelgiami veiksniai, turintys įtakos matavimo tikslumui. Pateikiamos kelių vamzdelio tipo daviklių kalibravimo kreivės. Paskutinėje dalyje programa Matlab kuriamas matematinis-dinaminis sklandytuvo modelis. Modeliu, pagal nustatytas sąlygas, skaičiuojami atakos ir slydimo kampai, analizuojami grafikai.The thesis made the glider’s attack and slip angle measurement methods for the investigation. The first part gives an overview of measuring devices of angle of attack and slip angle: The side string, attached to the side of the canopy, vane mounted AOA sensor, Pitot-tube type sensor. The sensors are compared, describes their advantages and disadvantages compared with other sensors. The second part describes the alpha and beta angle measurement methods: measurement with the tube-type sensor, and the method without using the specific attack, slip angle sensors. The following gives an overview of factors affecting the measurement accuracy. Several tube-type sensor calibration curves are presented. The last part of thesis presents development of mathematical – dynamic model of the glider using Matlab software. The model calculates the angle of attack and slip using set conditions of flight.
33
Gill, Rupinder S. "Intrusion detection techniques in wireless local area networks." Queensland University of Technology, 2009. http://eprints.qut.edu.au/29351/.
Full textAbstract:
This research investigates wireless intrusion detection techniques for detecting attacks on IEEE 802.11i Robust Secure Networks (RSNs). Despite using a variety of comprehensive preventative security measures, the RSNs remain vulnerable to a number of attacks. Failure of preventative measures to address all RSN vulnerabilities dictates the need for a comprehensive monitoring capability to detect all attacks on RSNs and also to proactively address potential security vulnerabilities by detecting security policy violations in the WLAN. This research proposes novel wireless intrusion detection techniques to address these monitoring requirements and also studies correlation of the generated alarms across wireless intrusion detection system (WIDS) sensors and the detection techniques themselves for greater reliability and robustness. The specific outcomes of this research are: A comprehensive review of the outstanding vulnerabilities and attacks in IEEE 802.11i RSNs. A comprehensive review of the wireless intrusion detection techniques currently available for detecting attacks on RSNs. Identification of the drawbacks and limitations of the currently available wireless intrusion detection techniques in detecting attacks on RSNs. Development of three novel wireless intrusion detection techniques for detecting RSN attacks and security policy violations in RSNs. Development of algorithms for each novel intrusion detection technique to correlate alarms across distributed sensors of a WIDS. Development of an algorithm for automatic attack scenario detection using cross detection technique correlation. Development of an algorithm to automatically assign priority to the detected attack scenario using cross detection technique correlation.
34
Makke, Ali. "Détection d'attaques dans un système WBAN de surveillance médicale à distance." Thesis, Paris 5, 2014. http://www.theses.fr/2014PA05S006/document.
Full textAbstract:
L'un des défis majeurs du monde de ces dernières décennies a été l'augmentation continue de la population des personnes âgées dans les pays développés. D’où la nécessité de fournir des soins de qualité à une population en croissance rapide, tout en réduisant les coûts des soins de santé. Dans ce contexte, de nombreux travaux de recherche portent sur l’utilisation des réseaux de capteurs sans fil dans les systèmes WBAN (Wireless Body Area Network), pour faciliter et améliorer la qualité du soin et de surveillance médicale à distance. Ces réseaux WBAN soulèvent de nouveaux défis technologiques en termes de sécurité et de protection contre les anomalies et les attaques. Le mode de communication sans fil utilisé entre ces capteurs et l’unité de traitement accentue ces vulnérabilités. En effet les vulnérabilités dans un système WBAN se décomposent en deux parties principales. La première partie se compose des attaques possibles sur le réseau des capteurs médicaux et sur le médium de communications sans fils entre ces capteurs et l’unité de traitement. La deuxième partie se compose des attaques possibles sur les communications à haut débit entre le système WBAN et le serveur médical. L’objectif de cette thèse est de répondre en partie aux problèmes de détection des attaques dans un système WBAN de surveillance médicale à distance. Pour atteindre cet objectif, nous avons proposé un algorithme pour détecter les attaques de brouillage radio (jamming attack) qui visent le médium de communications sans fils entre les capteurs et l’unité de traitement. Ainsi nous avons proposé une méthode de mesure de divergence pour détecter les attaques de type flooding qui visent les communications à haut débit entre le système WBAN et le serveur médicalOne of the major challenges of the world in recent decades is the continued increase in the elderly population in developed countries. Hence the need to provide quality care to a rapidly growing population while reducing the costs of health care is becoming a strategic challenge. In this context, many researches focus on the use of wireless sensor networks in WBAN (Wireless Body Area Network) systems to facilitate and improve the quality of medical care and remote monitoring. These WBAN systems pose new technological challenges in terms of security and protection against faults and attacks. The wireless communication mode used between the sensors and the collection node accentuates these vulnerabilities. Indeed vulnerabilities in a WBAN system are divided into two main parts. The first part consists of the possible attacks on the network of medical sensors and on the wireless communications medium between the sensors and the processing unit. The second part consists of possible attacks on high-speed communications between the WBAN system and the medical server. The objective of this thesis is to meet some of the problems of detecting attacks in a WBAN system for remote medical monitoring. To achieve this goal, we propose an algorithm to detect the jamming attacks targeting the wireless communications medium between the sensors and the processing unit. In addition we propose a method of measuring divergence to detect the flooding attacks targeting the high-speed communications between the WBAN system and the medical server
35
Megahed, Mohamed Helmy Mostafa. "SurvSec Security Architecture for Reliable Surveillance WSN Recovery from Base Station Failure." Thèse, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/31154.
Full textAbstract:
Surveillance wireless sensor networks (WSNs) are highly vulnerable to the failure of the base station (BS) because attackers can easily render the network useless for relatively long periods of time by only destroying the BS. The time and effort needed to destroy the BS is much less than that needed to destroy the numerous sensing nodes.
Previous works have tackled BS failure by deploying a mobile BS or by using multiple BSs, which requires extra cost. Moreover, despite using the best electronic countermeasures, intrusion tolerance systems and anti-traffic analysis strategies to protect the BSs, an adversary can still destroy them. The new BS cannot trust the deployed sensor nodes. Also, previous works lack both the procedures to ensure network reliability and security during BS failure such as storing then sending reports concerning security threats against nodes to the new BS and the procedures to verify the trustworthiness of the deployed sensing nodes. Otherwise, a new WSN must be re-deployed which involves a high cost and requires time for the deployment and setup of the new WSN. In this thesis, we address the problem of reliable recovery from a BS failure by proposing a new security architecture called Surveillance Security (SurvSec).
SurvSec continuously monitors the network for security threats and stores data related to node security, detects and authenticates the new BS, and recovers the stored data at the new BS. SurvSec includes encryption for security-related information using an efficient dynamic secret sharing algorithm, where previous work has high computations for dynamic secret sharing. SurvSec includes compromised nodes detection protocol against collaborative work of attackers working at the same time where previous works have been inefficient against collaborative work of attackers working at the same time.
SurvSec includes a key management scheme for homogenous WSN, where previous works assume heterogeneous WSN using High-end Sensor Nodes (HSN) which are the best target for the attackers. SurvSec includes efficient encryption architecture against quantum computers with a low time delay for encryption and decryption, where previous works have had high time delay to encrypt and decrypt large data size, where AES-256 has 14 rounds and high delay. SurvSec consists of five components, which are:
1. A Hierarchical Data Storage and Data Recovery System.
2. Security for the Stored Data using a new dynamic secret sharing algorithm.
3. A Compromised-Nodes Detection Algorithm at the first stage.
4. A Hybrid and Dynamic Key Management scheme for homogenous network.
5. Powerful Encryption Architecture for post-quantum computers with low time delay.
In this thesis, we introduce six new contributions which are the followings:
1. The development of the new security architecture called Surveillance Security (SurvSec) based on distributed Security Managers (SMs) to enable distributed network security and distributed secure storage.
2. The design of a new dynamic secret sharing algorithm to secure the stored data by using distributed users tables.
3. A new algorithm to detect compromised nodes at the first stage, when a group of attackers capture many legitimate nodes after the base station destruction. This algorithm is designed to be resistant against a group of attackers working at the same time to compromise many legitimate nodes during the base station failure.
4. A hybrid and dynamic key management scheme for homogenous network which is called certificates shared verification key management.
5. A new encryption architecture which is called the spread spectrum encryption architecture SSEA to resist quantum-computers attacks.
6. Hardware implementation of reliable network recovery from BS failure.
The description of the new security architecture SurvSec components is done followed by a simulation and analytical study of the proposed solutions to show its performance.
36
Krauß, Christoph. "Handling Insider Attacks in Wireless Sensor Networks." Phd thesis, 2010. https://tuprints.ulb.tu-darmstadt.de/2158/1/Dissertation_ckrauss.pdf.
Full textAbstract:
Wireless sensor networks are a relatively new technology for information gathering and processing. A sensor network usually consists of many, resource constrained sensor nodes. These nodes perform measurements of some physical phenomena, process data, generate reports, and send these reports via multihop communication to a central information processing unit called sink. Depending on the scenario, information gathering and processing is collaboratively performed by multiple sensor nodes, e.g., to determine the average temperature in a certain area. Sensor networks can be used in a plethora of application scenarios. Emerging from military research, e.g., sensor networks for target tracking in a battlefield, sensor networks are nowadays used more and more in civil applications such as critical infrastructure monitoring. For ensuring the functionality of a sensor network, especially in malicious environments, security mechanisms are essential for all sensor networks. However, sensor networks differ from classical (wireless) networks and this consequently makes it harder to secure them. Reasons for this are resource constraints of the sensor nodes, the wireless multihop communication, and the possibility of node compromise. Since sensor nodes are often deployed in unattended or even hostile environments and are usually not equipped with tamper-resistant hardware, it is relatively easy to compromise a sensor node. By compromising a sensor node, an adversary gets access to all data stored on the node, such as cryptographic keys. Thus, deployed security mechanisms such as node-based authentication become ineffective and an adversary is able to perform attacks as a "legitimate" member of the network. Such attacks are denoted as insider attacks and pose a serious threat for wireless sensor networks. In this thesis, we develop concepts and mechanisms to cope with insider attacks in wireless sensor networks. The contribution of this thesis is twofold. First, we propose a new general classification to classify the different approaches to protect against insider attacks. Second, we propose several security protocols to protect against insider attacks. In our classification, approaches to protect against insider attacks are first distinguished by the implemented security strategy. The respective strategies are further subclassified by the applied mechanisms. Related work is integrated in the classification to systematically identify open problems and specific properties in the respective areas. The results may be a basis for future protocol design. The protocols, proposed in the second part of this thesis encompass different areas. First, we propose a protocol to protect against a serious Denial-of-Service attack where an adversary injects or replays a large amount of false messages to overload many message forwarding nodes and to (totally) waste their scarce energy resources. Proposed approaches usually apply threshold-based mechanisms to filter such messages out. The drawback of this approach is that messages are not filtered out immediately and if the threshold of compromised nodes is reached, the attack becomes again possible. Our protocol is able to immediately filter such messages while tolerating an arbitrary number of compromised sensor nodes. Further mechanisms are required to additionally protect against an insider attack where an adversary injects false reports to deceive the sink. Usually a redundancy-based approach is used where a report is only valid if it has been collaboratively generated by multiple sensor nodes. However, previously proposed protocols are susceptible to an insider attack where an adversary that has compromised only a single node might be able to impede a successful report generation. So far, only one protocol has been proposed to cope with this issue. However, it is a specific enhancement for a particular protocol and the attacking nodes cannot be identified and excluded. In this thesis, we propose two protocols which protect against the injection of false reports and also enable the detection and exclusion of nodes trying to disrupt the collaborative report generation. In addition, our protocols can be used in combination with or as an extension to any other protocol. In addition, we investigate a general approach to prevent insider attacks and to detect compromised nodes in certain scenarios. We propose to use tamper-resistant hardware in form of the Trusted Platform Module (TPM). Due to cost reasons, the TPM is integrated only in some special sensor nodes that perform some special tasks such as key management, localization or time synchronization in the sensor network. These nodes are a valuable target for an adversary. To detect tampering attempts on these nodes, we propose two efficient attestation protocols. In contrast to attestation protocols proposed for "classical" networks, our protocols have a low communication and computational overhead. They do not require expensive public key operations on the verifying nodes and the few exchanged messages are very short. In addition, compared to software-based attestation, our protocols have the advantage to enable attestation along multiple hops which is of high concern in sensor networks. Using our approach, it is possible to verify the trustworthiness of certain sensor nodes even in unattended or hostile environments making them suitable to perform special tasks.
37
Mulpuru, Venkata M. "Detecting selective forwarding attacks in wireless sensor networks." 2008. http://digital.library.okstate.edu/etd/umi-okstate-2638.pdf.
Full text
38
Hsu, Sung-Chien, and 許嵩健. "Detecting Wormhole Attacks on IPv6 Wireless Sensor Networks." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/fx5895.
Full textAbstract:
碩士國立中山大學
資訊管理學系研究所
104
Recently, with the development of IPv6 and Internet, wireless sensor network becomes more popular in Internet of thing. ZigBee Alliance announced ZigBee IP specification in 2013, which upgraded the protocol of wireless sensor network from IPv4 to IPv6, and solved the issue of the insufficient IP addresses. However, IPv6 wireless sensor network still faces wormhole attacks. The Wormhole attacks generate a wormhole tunnel, and cause neighbors to go through it. Which means the attackers can sniff, modify, or drop packets. There are still some limitations in detecting method of wormhole attack in researches. For example, some researches require GPS support or precise synchronized time in the system. This paper proposes wormhole detection system. Without any other hardware and system support, our solution analyst packets through RPL standard routing protocol only. We have a good detection rate, according to our experimental results.
39
Sheshachalam, Karthikram. "Energy consumption during attacks and countermeasures in sensor networks." 2006. http://digital.library.okstate.edu/etd/umi-okstate-1881.pdf.
Full text
40
Chang, Wen-Chung, and 張文中. "Detecting Sybil Attacks with Neighboring Information in Wireless Sensor Networks." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/86053560474594668082.
Full textAbstract:
碩士國立成功大學
電腦與通信工程研究所
95
As widely used in the military and civilians, security has become an important issue in Wireless Sensor Networks (WSNs). The Sybil attack is a notorious attack in sensor and peer-to-peer networks. In the Sybil attack, a malicious node illegitimately claims a lot of identities to other nodes and try to disturb the networks by those forged identities. Most previous solutions focus on authentication-based mechanisms which share some encryption keys and verify the identities of each other. Different from previous solutions, this thesis proposed a method which need not share any keys or keep any secret information to authenticate the node's identities. The idea is to verify the differences in neighboring nodes of each node. The mathematical analysis results showed that the mechanism performs well while the node density is high enough and the simulation results also showed that the method could identify more than 99% Sybil nodes with little false detection.
41
Wu, Kung-Han, and 吳恭漢. "Study on Detection of Sybil Attacks in Wireless Sensor Networks." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/15845731698494670648.
Full textAbstract:
碩士國立臺北教育大學
資訊科學系碩士班
104
The advent of the digital age has brought explosive development of communication technologies and mobile computing devices, such as smart phone and tablet PC, are widely used. These devices are usually embedded with multiple sensors, such as GPS and digital compass sensors. These new technologies can be used to collect data from the surrounding environment to a central controller so as to develop different applications. Therefore, security is an important issue in wireless sensor networks. Wireless sensor network mainly suffers security threats from a variety of attacks. This is because that mostly the wireless sensor devices are deployed in a non-controlled area. Furthermore, the diverse nature of wireless communication makes it vulnerable to attacks. This study focuses on the detection and analysis of Sybil attacks in wireless sensor networks. Sybil attacks were first proposed by the Microsoft researcher J. R. Douceur. A Sybil attack node will disguise its identity and transmit false information to the other nodes or the central controller. The proposed Sybil attack detection scheme is based on the analysis of the received signal strength between nodes, the traffic volume and the network topology. Usually, there will be multiple nodes with different identities in the same position if there are Sybil attacks in the wireless Sensor network. Also, a Sybil attack node will have abnormal traffics in comparison with other regular nodes. Besides, a Sybil attack node may have a different position or network identity that have been recorded in the central controller, which has the knowledge about the topology of the network. Thus, the schemes for detecting Sybil attacks are developed as follows. Assume that a Sybil attack node stays in a fixed location. The location of a node in the network can be computed by utilizing the RSSI values between nodes. If a node with multiple identities but has a fixed location, then it is considered as a Sybil attack node. Besides, the central controller can record all the traffic of all nodes in the network and derive the average traffic volume of a node. If a certain node has different traffic volume for a certain period of time, it is considered as a Sybil attack node. Furthermore, since the central controller can record and track the location of a node in the network, if a data reporting node has the same ID as some previous one but is far away from that node, then this node is considered as a Sybil attack node. The above three schemes were verified by simulation experiments. The simulation results showed that the proposed schemes can effectively detect Sybil attacks. Thus, the detrimental effects of Sybil attacks on the network performance can be reduced and the security of the wireless sensor networks can be enhanced as well.
42
Xu, Wenyuan Veronica. "Defending wireless networks from radio interference attacks." 2007. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16800.
Full text
43
Krauß, Christoph [Verfasser]. "Handling insider attacks in wireless sensor networks / vorgelegt von Christoph Krauß." 2010. http://d-nb.info/1003545335/34.
Full text
44
Lee, Wei-Teng, and 李維騰. "A Study of Defending Compromised Nodes Attacks in Wireless Sensor Networks." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/76388365970593299702.
Full textAbstract:
碩士國立中興大學
資訊管理學系所
102
Recently, Wireless Sensor Networks (WSNs) are rapidly used to many areas. A WSN is composed of a number of resource-constrained sensor nodes which are often deployed in unattended environments. Therefore, the low cost sensor nodes can be easily compromised by an intruder. An intruder randomly captures a legitimate sensor node, and collects all secret elements. Then, an intruder inserts the secret element in his malicious sensor nodes and deploys the malicious sensor nodes into the network. An intruder can use malicious nodes to eavesdrop on the communication of other sensors, or inject false data reports that make a server misjudge. In this thesis, it focuses on defending compromised nodes attacks in wireless sensor networks. We classify the defending compromised nodes attacks into three topics: (1) detecting node replication attacks, (2) deterministic sequence-number-based group rekeying scheme and (3) detecting a false data report filtering scheme in wireless sensor networks. Our purpose is to survey the previous researches of these three topics and analyze the previous researches and demonstrate contributions of the existent literatures in detail. Finally, we also mention the future work related to these three topics.
45
Wang, Hou-Jie, and 王厚傑. "A Countermeasure to Prevent Traffic Analysis Attacks in Wireless Sensor Networks." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/82551045838421510608.
Full textAbstract:
碩士國立臺灣科技大學
資訊工程系
96
In a typical wireless sensor network application, the sensor nodes collect environmental data and forward it back to the base station via multi-hop communications. Therefore, the traffic load on the nodes close to the base station is relatively heavier that an adversary may identify the location of the base station and cause security breaches by analyzing the traffic. In this thesis, we create traffic decoys that also sustain higher communication traffic to mask the location of the base station. Compared with previous approaches, our method provides defenses against adversaries with the global monitoring capability, and the true location of the base station is better protected.
46
Chen, Yingying. "Securing wireless localization against signal strength attacks." 2007. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15800.
Full text
47
Radhakrishnan, Preetha. "Enhanced routing protocol for graceful degradation in wireless sensor networks during attacks." Thesis, 2005. http://hdl.handle.net/10057/778.
Full textAbstract:
With the deployment of Sensor networks gaining some popularity, researchers are now focusing on solving the issues concerned with making sensor networks more feasible and viable. As Sensor networks have various constraints in terms of limited resources available, not many researchers come forward to work on the security issues for this stringent environment. Lately, it has been realized that these sensor networks which have found application in many trivial situations need to be secured. And though this security comes with the expense of some portion of its resources, it has been proved to be essential for the survival of sensor networks to serve their purpose. LEACH (Low Energy Adaptive Clustering Hierarchy) is an architecture for remote microsensor networks that combine the concept of energy efficient cluster based routing and media access, together with application specific data aggregation to achieve good performance in terms of system lifetime and latency. This approach has been proved to improve system lifetime by an order of magnitude, compared to general purpose approach when the node energy is limited. Though LEACH has several good qualities which have been widely accepted for various researches in the field of WSN, it has a hitch attached to it like any other WSN when we consider security factor. As control is distributed through out the network of making self organization possible, the cluster head nodes play an important role in the network. (Abstract shortened by UMI.)Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering.
"December 2005."
48
Radhakrishnan, Preetha Pendse Ravindra. "Enhanced routing protocol for graceful degradation in wireless sensor networks during attacks." Diss., 2005. http://il.proquest.com/products_umi/dissertations.
Full textAbstract:
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering."December 2005." Title from PDF title page (viewed on April 23, 2007). Thesis adviser: Ravi Pendse. UMI Number: AAT 1436580 Includes bibliographic references (leaves 48-50).
49
Govender, Servapalan. "A framework for evaluating countermeasures against sybil attacks in wireless sensor networks." Diss., 2011. http://hdl.handle.net/2263/26241.
Full textAbstract:
Although Wireless Sensor Networks (WSNs) have found a niche in numerous applications, they are constrained by numerous factors. One of these important factors is security in WSNs. There are various types of security attacks that WSNs are susceptible to. The focus of this study is centred on Sybil attacks, a denial of service attack. In this type of attack, rogue nodes impersonate valid nodes by falsely claiming to possess authentic identities, thereby rendering numerous core WSN operations ineffective. The diverse nature of existing solutions poses a difficult problem for system engineers wanting to employ a best fit countermeasure. This problem is the largely unanswered question posed to all system engineers and developers alike whose goal is to design/develop a secure WSN. Resolving this dilemma proves to be quite a fascinating task, since there are numerous factors to consider and more especially one cannot assume that every application is affected by all identified factors. A framework methodology presented in this study addresses the abovementioned challenges by evaluating countermeasure effectiveness based on theoretical and practical security factors. Furthermore, a process is outlined to determine the application’s engineering requirements and the framework also suggests what security components the system engineer ought to incorporate into the application, depending on the application’s risk profile. The framework then numerically aligns these considerations, ensuring an accurate and fairly unbiased best fit countermeasure selection. Although the framework concentrates on Sybil countermeasures, the methodology can be applied to other classes of countermeasures since it answers the question of how to objectively study and compare security mechanisms that are both diverse and intended for different application environments. The report documents the design and development of a comparative framework that can be used to evaluate countermeasures against Sybil attacks in wireless sensor networks based on various criteria that will be discussed in detail. This report looks briefly at the aims and description of the research. Following this, a literature survey on the body of knowledge concerning WSN security and a discussion on the proposed methodology of a specific design approach are given. Assumptions and a short list of factors that were considered are then described. Metrics, the taxonomy for WSN countermeasures, the framework and a formal model are developed. Risk analysis and the best fit methodology are also discussed. Finally, the results and recommendations are shown for the research, after which the document is concluded.Dissertation (MEng)--University of Pretoria, 2011.
Electrical, Electronic and Computer Engineering
unrestricted
50
Chen, Yi-Jyun, and 陳怡君. "Location-Aware Pairwise Key Predistribution Scheme for Wireless Sensor Networks Against Colluding Attacks." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/64676145675167596054.
Full textAbstract:
碩士國立嘉義大學
資訊工程學系研究所
95
Wireless sensor networks (WSNs) are composed of sensor nodes which have limited computations and communication capabilities. Sensor nodes can collect information needed, and transmit data to the base station through Internet. Then the base station analyzes the sensing information. The first application of wireless sensor networks is for military purpose, that is, sensor nodes are deployed in hostile environment and collect information needed. The applications of wireless sensor networks are currently extended popularly so that the security issues are more and more important. Pairwise key establishment is a necessary security service in wireless sensor networks for secure communication between any two nodes. Due to the limited resources of the sensor nodes, traditional security protocols such as public key cryptography and centralized key distribution are not suitable for wireless sensor networks. Recently, many security protocols of wireless sensor networks have been proposed. In this paper, we presents a novel key predistribution scheme for establishing pairwise key between nodes and efficiently rekeying the compromised keys to revoke the compromised nodes. Compared with the previous schemes, our scheme has a high probability to establish the pairwise keys whatever the nodes are placed in the same group or in the neighboring groups. A powerful procedure for the tolerance of node capture, and an efficient strategy to prevent the compromised nodes from colluding attacks are also discussed in this thesis.