S
Sadaf Zahedi
Researcher at University of California, Los Angeles
Publications - 24
Citations - 2690
Sadaf Zahedi is an academic researcher from University of California, Los Angeles. The author has contributed to research in topics: Wireless sensor network & Fault detection and isolation. The author has an hindex of 13, co-authored 24 publications receiving 2511 citations.
Papers
More filters
Journal ArticleDOI
Power management in energy harvesting sensor networks
TL;DR: In this paper, the authors have developed abstractions to characterize the complex time varying nature of such sources with analytically tractable models and use them to address key design issues.
Journal ArticleDOI
Sensor network data fault types
Kevin Ni,Nithya Ramanathan,Mohamed Nabil Hajj Chehade,Laura Balzano,Sheela Nair,Sadaf Zahedi,Eddie Kohler,Greg Pottie,Mark Hansen,Mani Srivastava +9 more
TL;DR: This tutorial draws from current literature, the own experience, and data collected from scientific deployments to develop a set of commonly used features useful in detecting and diagnosing sensor faults.
Proceedings ArticleDOI
Adaptive duty cycling for energy harvesting systems
TL;DR: An adaptive duty cycling algorithm that allows energy harvesting sensor nodes to autonomously adjust their duty cycle according to the energy availability in the environment is presented and a model that enables harvesting sensor node nodes to predict future energy opportunities based on historical data is presented.
Proceedings ArticleDOI
Heliomote: enabling long-lived sensor networks through solar energy harvesting
Kris Lin,Jennifer Yu,Jason Hsu,Sadaf Zahedi,David Lee,Jonathan Friedman,Aman Kansal,Vijay Raghunathan,Mani Srivastava +8 more
Proceedings ArticleDOI
Compressive Oversampling for Robust Data Transmission in Sensor Networks
Zainul Charbiwala,Supriyo Chakraborty,Sadaf Zahedi,Ting He,Chatschik Bisdikian,Younghun Kim,Mani Srivastava +6 more
TL;DR: It is shown that CS erasure encoding (CSEC) with random sampling is efficient for handling missing data in erasure channels, paralleling the performance of BCH codes, with the added benefit of graceful degradation of the reconstruction error even when the amount of missing data far exceeds the designed redundancy.