Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Daniel Halperin is active.

Publication


Featured researches published by Daniel Halperin.


ieee symposium on security and privacy | 2008

Pacemakers and Implantable Cardiac Defibrillators: Software Radio Attacks and Zero-Power Defenses

Daniel Halperin; Thomas S. Heydt-Benjamin; Benjamin Ransford; Shane S. Clark; Benessa Defend; Will Morgan; Kevin Fu; Tadayoshi Kohno; William H. Maisel

Our study analyzes the security and privacy properties of an implantable cardioverter defibrillator (ICD). Introduced to the U.S. market in 2003, this model of ICD includes pacemaker technology and is designed to communicate wirelessly with a nearby external programmer in the 175 kHz frequency range. After partially reverse-engineering the ICDs communications protocol with an oscilloscope and a software radio, we implemented several software radio-based attacks that could compromise patient safety and patient privacy. Motivated by our desire to improve patient safety, and mindful of conventional trade-offs between security and power consumption for resource-constrained devices, we introduce three new zero-power defenses based on RF power harvesting. Two of these defenses are human-centric, bringing patients into the loop with respect to the security and privacy of their implantable medical devices (IMDs). Our contributions provide a scientific baseline for understanding the potential security and privacy risks of current and future IMDs, and introduce human-perceptible and zero-power mitigation techniques that address those risks. To the best of our knowledge, this paper is the first in our community to use general-purpose software radios to analyze and attack previously unknown radio communications protocols.


acm special interest group on data communication | 2011

Tool release: gathering 802.11n traces with channel state information

Daniel Halperin; Wenjun Hu; Anmol Sheth; David Wetherall

We are pleased to announce the release of a tool that records detailed measurements of the wireless channel along with received 802.11 packet traces. It runs on a commodity 802.11n NIC, and records Channel State Information (CSI) based on the 802.11 standard. Unlike Receive Signal Strength Indicator (RSSI) values, which merely capture the total power received at the listener, the CSI contains information about the channel between sender and receiver at the level of individual data subcarriers, for each pair of transmit and receive antennas. Our toolkit uses the Intel WiFi Link 5300 wireless NIC with 3 antennas. It works on up-to-date Linux operating systems: in our testbed we use Ubuntu 10.04 LTS with the 2.6.36 kernel. The measurement setup comprises our customized versions of Intels close-source firmware and open-source iwlwifi wireless driver, userspace tools to enable these measurements, access point functionality for controlling both ends of the link, and Matlab (or Octave) scripts for data analysis. We are releasing the binary of the modified firmware, and the source code to all the other components.


acm/ieee international conference on mobile computing and networking | 2008

Taking the sting out of carrier sense: interference cancellation for wireless LANs

Daniel Halperin; Thomas E. Anderson; David Wetherall

A fundamental problem with unmanaged wireless networks is high packet loss rates and poor spatial reuse, especially with bursty traffic typical of normal use. To address these limitations, we explore the notion of interference cancellation for unmanaged networks - the ability for a single receiver to disambiguate and successfully receive simultaneous overlapping transmissions from multiple unsynchronized sources. We describe a practical algorithm for interference cancellation, and implement it for ZigBee using software radios. In this setting, we find that our techniques can reduce packet loss rate and substantially increase spatial reuse. With carrier sense set to prevent concurrent sends, our approach reduces the packet loss rate during collisions from 14% to 8% due to improved handling of hidden terminals. Conversely, disabling carrier sense reduces performance for only 7% of all pairs of links and increases the delivery rate for the median pair of links in our testbed by a factor of 1.8 due to improved spatial reuse.


acm special interest group on data communication | 2011

Augmenting data center networks with multi-gigabit wireless links

Daniel Halperin; Srikanth Kandula; Jitendra Padhye; Paramvir Bahl; David Wetherall

The 60 GHz wireless technology that is now emerging has the potential to provide dense and extremely fast connectivity at low cost. In this paper, we explore its use to relieve hotspots in oversubscribed data center (DC) networks. By experimenting with prototype equipment, we show that the DC environment is well suited to a deployment of 60GHz links contrary to concerns about interference and link reliability. Using directional antennas, many wireless links can run concurrently at multi-Gbps rates on top-of-rack (ToR) switches. The wired DC network can be used to sidestep several common wireless problems. By analyzing production traces of DC traffic for four real applications, we show that adding a small amount of network capacity in the form of wireless flyways to the wired DC network can improve performance. However, to be of significant value, we find that one hop indirect routing is needed. Informed by our 60GHz experiments and DC traffic analysis, we present a design that uses DC traffic levels to select and adds flyways to the wired DC network. Trace-driven evaluations show that network-limited DC applications with predictable traffic workloads running on a 1:2 oversubscribed network can be sped up by 45% in 95% of the cases, with just one wireless device per ToR switch. With two devices, in 40% of the cases, the performance is identical to that of a non-oversubscribed network.


international conference on management of data | 2014

Demonstration of the Myria big data management service

Daniel Halperin; Victor Teixeira de Almeida; Lee Lee Choo; Shumo Chu; Paraschos Koutris; Dominik Moritz; Jennifer Ortiz; Vaspol Ruamviboonsuk; Jingjing Wang; Andrew Whitaker; Shengliang Xu; Magdalena Balazinska; Bill Howe; Dan Suciu

In this demonstration, we will showcase Myria, our novel cloud service for big data management and analytics designed to improve productivity. Myrias goal is for users to simply upload their data and for the system to help them be self-sufficient data science experts on their data -- self-serve analytics. Using a web browser, Myria users can upload data, author efficient queries to process and explore the data, and debug correctness and performance issues. Myria queries are executed on a scalable, parallel cluster that uses both state-of-the-art and novel methods for distributed query processing. Our interactive demonstration will guide visitors through an exploration of several key Myria features by interfacing with the live system to analyze big datasets over the web.


acm special interest group on data communication | 2010

802.11 with multiple antennas for dummies

Daniel Halperin; Wenjun Hu; Anmol Sheth; David Wetherall

The use of multiple antennas and MIMO techniques based on them is the key feature of 802.11n equipment that sets it apart from earlier 802.11a/g equipment. It is responsible for superior performance, reliability and range. In this tutorial, we provide a brief introduction to multiple antenna techniques. We describe the two main classes of those techniques, spatial diversity and spatial multiplexing. To ground our discussion, we explain how they work in 802.11n NICs in practice.


very large data bases | 2015

Asynchronous and fault-tolerant recursive datalog evaluation in shared-nothing engines

Jingjing Wang; Magdalena Balazinska; Daniel Halperin

We present a new approach for data analytics with iterations. Users express their analysis in Datalog with bag-monotonic aggregate operators, which enables the expression of computations from a broad variety of application domains. Queries are translated into query plans that can execute in shared-nothing engines, are incremental, and support a variety of iterative models (synchronous, asynchronous, different processing priorities) and failure-handling techniques. The plans require only small extensions to an existing shared-nothing engine, making the approach easily implementable. We implement the approach in the Myria big-data management system and use our implementation to empirically study the performance characteristics of different combinations of iterative models, failure handling methods, and applications. Our evaluation uses workloads from a variety of application domains. We find that no single method outperforms others but rather that application properties must drive the selection of the iterative query execution model.


international conference on data mining | 2013

Scalable Flow-Based Community Detection for Large-Scale Network Analysis

Seung-Hee Bae; Daniel Halperin; Jevin D. West; Martin Rosvall; Bill Howe

Community-detection is a powerful approach to uncover important structures in large networks. Since networks often describe flow of some entity, flow-based community-detection methods are particularly interesting. One such algorithm is called Info map, which optimizes the objective function known as the map equation. While Info map is known to be an effective algorithm, its serial implementation cannot take advantage of multicore processing in modern computers. In this paper, we propose a novel parallel generalization of Info map called Relax Map. This algorithm relaxes concurrency assumptions to avoid lock overhead, achieving 70% parallel efficiency in shared-memory multicore experiments while exhibiting similar convergence properties and finding similar community structures as the serial algorithm. We evaluate our approach on a variety of real graph datasets as well as synthetic graphs produced by a popular graph generator used for benchmarking community detection algorithms. We describe the algorithm, the experiments, and some emerging research directions in high-performance community detection on massive graphs.


global communications conference | 2010

Investigation into the Doppler Component of the IEEE 802.11n Channel Model

Eldad Perahia; Anmol Sheth; Thomas J. Kenney; Robert J. Stacey; Daniel Halperin

Simulations show that the Doppler component of the IEEE 802.11n channel model results in a dramatic decrease in transmit beamforming gain within only 20 ms delay, even though the model is intended for indoor WLAN environment with stationary devices. However, new measurements collected in an office environment show that degradation to transmit beamforming gain is much less sensitive to delay. With normal environmental conditions in the office environment, it was found that on average there was only a 22% decrease in transmit beamforming gain after 200 ms delay. Even with highly exaggerated motion, reasonable gain is maintained with over 100 ms of delay. Measurements with a moving device were also conducted with resulting sensitivity to delay similar to the 802.11n model. The measurements indicate that the Doppler component of the 802.11n channel model is more comparable to a moving device rather than a stationary device. The use of transmit beamforming in an indoor WLAN environment is more practical than simulations based on the IEEE 802.11n channel models would imply.


eurographics | 2015

Perfopticon: visual query analysis for distributed databases

Dominik Moritz; Daniel Halperin; Bill Howe; Jeffrey Heer

Distributed database performance is often unpredictable due to issues such as system complexity, network congestion, or imbalanced data distribution. These issues are difficult for users to assess in part due to the opaque mapping between declaratively specified queries and actual physical execution plans. Database developers currently must expend significant time and effort scanning log files to isolate and debug the root causes of performance issues. In response, we present Perfopticon, an interactive query profiling tool that enables rapid insight into common problems such as performance bottlenecks and data skew. Perfopticon combines interactive visualizations of (1) query plans, (2) overall query execution, (3) data flow among servers, and (4) execution traces. These views coordinate multiple levels of abstraction to enable detection, isolation, and understanding of performance issues. We evaluate our design choices through engagements with system developers, scientists, and students. We demonstrate that Perfopticon enables performance debugging for real‐world tasks.

Collaboration


Dive into the Daniel Halperin's collaboration.

Top Co-Authors

Avatar

Bill Howe

University of Washington

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Dominik Moritz

University of Washington

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Jennifer Ortiz

University of Washington

View shared research outputs
Top Co-Authors

Avatar

Jeremy Hyrkas

University of Washington

View shared research outputs
Top Co-Authors

Avatar

Jingjing Wang

University of Washington

View shared research outputs
Researchain Logo
Decentralizing Knowledge