Results 1 - 10
of
56
Jamming-resistant key establishment using uncoordinated frequency hopping
- in IEEE Symposium on Security and Privacy
"... We consider the following problem: how can two devices that do not share any secrets establish a shared secret key over a wireless radio channel in the presence of a communication jammer? An inherent challenge in solving this problem is that known anti-jamming techniques (e.g., frequency hopping or ..."
Abstract
-
Cited by 83 (7 self)
- Add to MetaCart
(Show Context)
We consider the following problem: how can two devices that do not share any secrets establish a shared secret key over a wireless radio channel in the presence of a communication jammer? An inherent challenge in solving this problem is that known anti-jamming techniques (e.g., frequency hopping or direct-sequence spread spectrum) which should support device communication during the key establishment require that the devices share a secret spreading key (or code) prior to the start of their communication. This requirement creates a circular dependency between antijamming spread-spectrum communication and key establishment, which has so far not been addressed. In this work, we propose an Uncoordinated Frequency Hopping (UFH) scheme that breaks this dependency and enables key establishment in the presence of a communication jammer. We perform a detailed analysis of our UFH scheme and show its feasibility, both in terms of execution time and resource requirements. 1.
An Empirical Study of Low-Power Wireless
, 2010
"... We present empirical measurements of the packet delivery performance of the latest sensor platforms: Micaz and Telos motes. In this article, we present observations that have implications to a set of common assumptions protocol designers make while designing sensornet protocols— specifically—the MAC ..."
Abstract
-
Cited by 51 (1 self)
- Add to MetaCart
We present empirical measurements of the packet delivery performance of the latest sensor platforms: Micaz and Telos motes. In this article, we present observations that have implications to a set of common assumptions protocol designers make while designing sensornet protocols— specifically—the MAC and network layer protocols. We first distill these common assumptions in to a conceptual model and show how our observations support or dispute these assumptions. We also present case studies of protocols that do not make these assumptions. Understanding the implications of these observations to the conceptual model can improve future protocol designs.
Randomized Differential DSSS: Jamming-Resistant Wireless Broadcast Communication
"... Abstract—Jamming resistance is crucial for applications where reliable wireless communication is required. Spread spectrum techniques such as Frequency Hopping Spread Spectrum (FHSS) and Direct Sequence Spread Spectrum (DSSS) have been used as countermeasures against jamming attacks. Traditional ant ..."
Abstract
-
Cited by 50 (10 self)
- Add to MetaCart
(Show Context)
Abstract—Jamming resistance is crucial for applications where reliable wireless communication is required. Spread spectrum techniques such as Frequency Hopping Spread Spectrum (FHSS) and Direct Sequence Spread Spectrum (DSSS) have been used as countermeasures against jamming attacks. Traditional antijamming techniques require that senders and receivers share a secret key in order to communicate with each other. However, such a requirement prevents these techniques from being effective for anti-jamming broadcast communication, where a jammer may learn the shared key from a compromised or malicious receiver and disrupt the reception at normal receivers. In this paper, we propose a Randomized Differential DSSS (RD-DSSS) scheme to achieve anti-jamming broadcast communication without shared keys. RD-DSSS encodes each bit of data using the correlation of unpredictable spreading codes. Specifically, bit “0 ” is encoded using two different spreading codes, which have low correlation with each other, while bit “1 ” is encoded using two identical spreading codes, which have high correlation. To defeat reactive jamming attacks, RD-DSSS uses multiple spreading code sequences to spread each message and rearranges the spread output before transmitting it. Our theoretical analysis and simulation results show that RD-DSSS can effectively defeat jamming attacks for anti-jamming broadcast communication without shared keys. I.
Anti-jamming timing channels for wireless networks
- In Proceedings of the first ACM conference on Wireless network security (WiSec ’08
, 2008
"... Wireless communication is susceptible to radio interference, which prevents the reception of communications. Although evasion strategies have been proposed, such strategies are costly or ineffective against broadband jammers. In this paper, we explore an alternative to evasion strategies that involv ..."
Abstract
-
Cited by 26 (3 self)
- Add to MetaCart
(Show Context)
Wireless communication is susceptible to radio interference, which prevents the reception of communications. Although evasion strategies have been proposed, such strategies are costly or ineffective against broadband jammers. In this paper, we explore an alternative to evasion strategies that involves the establishment of a timing channel that exists in spite of the presence of jamming. The timing channel is built using failed packet reception times. We first show that it is possible to detect failed packet events in spite of jamming. We then explore single sender and multi-sender timing channel constructions that may be used to build a low-rate overlay link-layer. We discuss implementation issues that we have overcome in constructing such jammingresistant timing channel, and present the results of validation efforts using the MICA2 platform. Finally, we examine additional error correction and authentication mechanisms that may be used to cope with adversaries that both jam and seek to corrupt our timing channel.
Mitigation of control channel jamming under node capture attacks
, 2008
"... Availability of service in many wireless networks depends on the ability for network users to establish and maintain communication channels using control messages from base stations and other users. An adversary with knowledge of the underlying communication protocol can mount an efficient denial of ..."
Abstract
-
Cited by 22 (3 self)
- Add to MetaCart
(Show Context)
Availability of service in many wireless networks depends on the ability for network users to establish and maintain communication channels using control messages from base stations and other users. An adversary with knowledge of the underlying communication protocol can mount an efficient denial of service attack by jamming the communication channels used to exchange control messages. The use of spread spectrum techniques can deter an external adversary from such control channel jamming attacks. However, malicious colluding insiders or an adversary who captures or compromises system users are not deterred by spread spectrum, as they know the required spreading sequences. For the case of internal adversaries, we propose a framework for control channel access schemes using the random assignment of cryptographic keys to hide the location of control channels. We propose and evaluate metrics to quantify the probabilistic availability of service under control channel jamming by malicious or compromised users and show that the availability of service degrades gracefully as the number of colluding insiders or compromised users increases. We propose an algorithm called GUIDE for the identification of compromised users in the system based on the set of control channels that
Treemac: Localized tdma mac protocol for real-time high-data-rate sensor networks
- Pervasive and Mobile Computing
"... Abstract—Earlier sensor network MAC protocols focus on energy conservation in low-duty cycle applications, while some recent applications involve real-time high-data-rate signals. This motivates us to design an innovative localized TDMA MAC protocol to achieve high throughput and low congestion in d ..."
Abstract
-
Cited by 19 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Earlier sensor network MAC protocols focus on energy conservation in low-duty cycle applications, while some recent applications involve real-time high-data-rate signals. This motivates us to design an innovative localized TDMA MAC protocol to achieve high throughput and low congestion in data collection sensor networks, besides energy conservation. TreeMAC divides a time cycle into frames and frame into slots. Parent determines children’s frame assignment based on their relative bandwidth demand, and each node calculates its own slot assignment based on its hop-count to the sink. This innovative 2-dimensional frame-slot assignment algorithm has the following nice theory properties. Firstly, given any node, at any time slot, there is at most one active sender in its neighborhood (includ-ing itself). Secondly, the packet scheduling with TreeMAC is bufferless, which therefore minimizes the probability of network congestion. Thirdly, the data throughput to gateway is at least 1/3 of the optimum assuming reliable links. Our experiments on a 24 node test bed demonstrate that TreeMAC protocol significantly improves network throughput and energy efficiency, by comparing to the TinyOS’s default CSMA MAC protocol and a recent TDMA MAC protocol Funneling-MAC [8]. 1 I.
An Empirical Study of Low Power Wireless
- IN SING TECH REPORT, SING-0803
, 2008
"... We present empirical measurements of the packet delivery performance of the latest sensor platforms: Micaz and Telos motes. In this paper, we present observations that have implications to a set of common assumptions protocol designers make while designing sensornet protocols – specifically – the MA ..."
Abstract
-
Cited by 18 (0 self)
- Add to MetaCart
(Show Context)
We present empirical measurements of the packet delivery performance of the latest sensor platforms: Micaz and Telos motes. In this paper, we present observations that have implications to a set of common assumptions protocol designers make while designing sensornet protocols – specifically – the MAC and network layer protocols. We first distill these common assumptions in to a conceptual model and show how our observations support or dispute these assumptions. We also present case studies of protocols that do not make these assumptions. Understanding the implications of these observations to the conceptual model can improve future protocol designs.
Defending DSSS-based Broadcast Communication against Insider Jammers via Delayed Seed-Disclosure
- ACSAC '10
, 2010
"... Spread spectrum techniques such as Direct Sequence Spread Spectrum (DSSS) and Frequency Hopping (FH) have been commonly used for anti-jamming wireless communication. However, traditional spread spectrum techniques require that sender and receivers share a common secret in order to agree upon, for ex ..."
Abstract
-
Cited by 16 (4 self)
- Add to MetaCart
(Show Context)
Spread spectrum techniques such as Direct Sequence Spread Spectrum (DSSS) and Frequency Hopping (FH) have been commonly used for anti-jamming wireless communication. However, traditional spread spectrum techniques require that sender and receivers share a common secret in order to agree upon, for example, a common hopping sequence (in FH) or a common spreading code sequence (in DSSS). Such a requirement prevents these techniques from being effective for anti-jamming broadcast communication, where a jammer may learn the key from a compromised receiver and then disrupt the wireless communication. In this paper, we develop a novel Delayed Seed-Disclosure DSSS (DSD-DSSS) scheme for efficient anti-jamming broadcast communication. DSD-DSSS achieves its anti-jamming capability through randomly generating the spreading code sequence for each message using a random seed and delaying the disclosure of the seed at the end of the message. We also develop an effective protection mechanism for seed disclosure using content-based code subset selection. DSD-DSSS is superior to all previous attempts for anti-jamming spread spectrum broadcast communication without shared keys. In particular, even if a jammer possesses real-time online analysis capability to launch reactive jamming attacks, DSD-DSSS can still defeat the jamming attacks with a very high probability. We evaluate DSD-DSSS through both theoretical analysis and a prototype implementation based on GNU Radio; our evaluation results demonstrate that DSD-DSSS is practical and have superior security properties.
A survey on jamming attacks and countermeasures in WSNs
- IEEE Communications Surveys & Tutorials
, 2009
"... Abstract—Jamming represents the most serious security threat in the field of Wireless Sensor Networks (WSNs), as it can easily put out of order even WSNs that utilize strong high-layer security mechanisms, simply because it is often ignored in the initial WSN design. The objective of this article is ..."
Abstract
-
Cited by 15 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Jamming represents the most serious security threat in the field of Wireless Sensor Networks (WSNs), as it can easily put out of order even WSNs that utilize strong high-layer security mechanisms, simply because it is often ignored in the initial WSN design. The objective of this article is to provide a general overview of the critical issue of jamming in WSNs and cover all the relevant work, providing the interested researcher pointers for open research issues in this field. We provide a brief overview of the communication protocols typically used in WSN deployments and highlight the characteristics of contemporary WSNs, that make them susceptible to jamming attacks, along with the various types of jamming which can be exercised against WSNs. Common jamming techniques and an overview of various types of jammers are reviewed and typical countermeasures against jamming are also analyzed. The key ideas of existing security mechanisms against jamming attacks in WSNs are presented and open research issues, with respect to the defense against jamming attacks are highlighted. I.
Wireless jamming localization by exploiting nodes hearing ranges
- in Distributed Computing in Sensor Systems, ser. Lecture Notes in Computer Science
"... Abstract. Jamming attacks are especially harmful when ensuring the dependability of wireless communication. Finding the position of a jammer will enable the network to actively exploit a wide range of defense strategies. Thus, in this paper, we focus on developing mechanisms to localize a jammer. We ..."
Abstract
-
Cited by 10 (2 self)
- Add to MetaCart
(Show Context)
Abstract. Jamming attacks are especially harmful when ensuring the dependability of wireless communication. Finding the position of a jammer will enable the network to actively exploit a wide range of defense strategies. Thus, in this paper, we focus on developing mechanisms to localize a jammer. We first conduct jamming effect analysis to examine how a hearing range, e.g., the area from which a node can successfully receive and decode the packet, alters with the jammer’s location and transmission power. Then, we show that the affected hearing range can be estimated purely by examining the network topology changes caused by jamming attacks. As such, we solve the jammer location estimation by constructing a least-squares problem, which exploits the changes of the hearing ranges. Compared with our previous iterativesearch-based virtual force algorithm, our proposed hearing-range-based algorithm exhibits lower computational cost (i.e., one-step instead of iterative searches) and higher localization accuracy. 1
