• Publications
  • Influence
MediaBench: a tool for evaluating and synthesizing multimedia and communications systems
TLDR
MediaBench is presented, a benchmark suite that has been designed to fill a gap between the compiler community and embedded applications developers and has been constructed through a three-step process: intuition and market driven initial selection, experimental measurement to establish uniqueness, and integration with system synthesis algorithms to establish usefulness.
Power efficient organization of wireless sensor networks
TLDR
The experimental results demonstrate that by using only a subset of sensor nodes at each moment, the system achieves a significant energy savings while fully preserving coverage.
Coverage problems in wireless ad-hoc sensor networks
TLDR
This work establishes the main highlight of the paper-optimal polynomial time worst and average case algorithm for coverage calculation, which answers the questions about quality of service (surveillance) that can be provided by a particular sensor network.
Exposure in wireless Ad-Hoc sensor networks
TLDR
This work has developed an efficient and effective algorithm for exposure calculation in sensor networks, specifically for finding minimal exposure paths and provides an unbounded level of accuracy as a function of run time and storage.
Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination
TLDR
The problem formulation for solving the multiple constant multiplication (MCM) problem is introduced where first the minimum number of shifts that are needed is computed, and then the number of additions is minimized using common subexpression elimination.
Temporal properties of low power wireless links: modeling and implications on multi-hop routing
TLDR
This work studied one-to-one routing schemes and developed new routing algorithms that consider autocorrelation, and reverse link and consecutive same path link lagged correlations, and a generalized Dijkstra algorithm with centralized execution and a localized distributed probabilistic algorithm.
Lightweight secure PUFs
To ensure security and robustness of the next generation of Physically Unclonable Functions (PUFs), we have developed a new methodology for PUF design. Our approach employs integration of three key
Optimizing power using transformations
TLDR
The results indicate that more than an order of magnitude reduction in power can be achieved over current-day design methodologies while maintaining the system throughput; in some cases this can be accomplished while preserving or reducing the implementation area.
Worst and best-case coverage in sensor networks
TLDR
This work establishes the main highlight of the paper - an optimal polynomial time worst and average case algorithm for coverage calculation for homogeneous isotropic sensors for wireless ad hoc sensor networks.
Statistical model of lossy links in wireless sensor networks
TLDR
This work uses an iterative improvement-based optimization procedure to generate network instances that are statistically similar to empirically observed networks, and studies individual link properties and their correlation with respect to common transmitters, receivers and geometrical location.
...
...