Arash Saber Tehrani

• PhD
• PhD Student at University of Southern California

We provide a lower bound on the expected discovery time of one-way neighbor discovery in multi antenna system. We assume that the scheme allows to use different directional transmission probabilities, which result in different probability of successful discovery between nodes. The proof shows that the lower bound to the expected discovery time, tha...

Neighbor Discovery (ND) is an essential prerequisite for any peer-to-peer communication. In general, minimizing the discovery time is the goal for ND schemes. In this work we study the average discovery time for directional random ND when nodes have prior information about their set of possible neighbors, which also helps identifying the performanc...

Choosing the most profitable wells for steam jobs is of high value given the cost and resources required for the procedure. To find the best candidates, we develop a system with two parts: i) An autoencoder to reduce the dimensionality of input data, ii) A kernel regression to predict the production gain. We show the benefit of application of autoe...

Demand Response (DR) is a widely used technique to minimize the peak to average consumption ratio during high demand periods. We consider the DR problem of achieving a given curtailment target for a set of consumers equipped with a set of discrete curtailment strategies over a given duration. An effective DR scheduling algorithm should minimize the...

Device-to-device communications, where mobile devices communicate directly with each other, can augment device-to-infrastructure communications to greatly improve performance of cellular systems. This chapter provides an overview of the key technical challenges and solutions. It first discusses the propagation channels for direct device links. We t...

We consider the scenario of broadcasting for real-time applications, such as multi-player games and video streaming, and loss recovery via instantly decodable network coding. The source has a single time slot or multiple time slots to broadcast (potentially coded) recovery packet(s), and the application does not need to recover all losses. Our goal...

Gas compressor failures are frequently caused by breakdown of valves. Since production is dependent on rotating equipment, it is useful to minimize downtime caused by such valve failures, and try to predict them in advance. This is a challenging problem, which we address using Big Data analysis of the data gathered by a large number of sensors depl...

We introduce a new neighbor discovery method called “ZigZag”. We present two versions of ZigZag, namely, deterministic and random. We show a close connection between performance of ZigZag and message passing decoding of low density parity check codes over an erasure channel.

We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certain packets. This presents a problem of broadcasting in the presence of side information, and is a generalization of the well-known (and unsolved) index coding problem of information t...

We present the first deterministic measurement matrix construction with an order-optimal number of rows for sparse signal reconstruction. This improves the measurements required in prior constructions and addresses a known open problem in the theory of sparse signal recovery. Our construction uses adjacency matrices of bipartite graphs that have la...

We explicitly construct binary measurement matrices with good sparse approximation guarantees. Specifically, our measurement matrices have an order optimal number of measurements and have ℓ1/ℓ1 approximation guarantee. Our construction uses the progressive edge growth technique. We apply coding theoretic results and rely on a recent connection of c...

We study the problem of neighbor discovery in which each node desires to detect nodes within a single hop. Each node is assigned a unique signature known by all other nodes. The problem can be considered as a compressed sensing problem. We propose a explicit-non-random-construction for the signatures. Further, we suggest the basis pursuit to detect...

We consider the scenario of broadcasting for realtime applications and loss recovery via instantly decodable network coding. Past work focused on minimizing the completion delay, which is not the right objective for real-time applications that have strict deadlines. In this work, we are interested in finding a code that is instantly decodable by th...

We investigate a fundamental wireless broadcast problem called Index coding. We focus on binary linear scalar index coding problems when it is a-priori known that the optimal solution requires three transmissions. For this case, we characterize the relation of the clique cover number of the side information graph G and the optimal index code. This...

We analyze a generalized index coding problem that allows multiple users to request the same packet. For this problem we introduce a novel coding scheme called partition multicast. Our scheme can be seen as a natural generalization of clique cover for directed index coding problems. Further, partition multicast corresponds to an achievable scheme f...

The multiple-access framework of ZigZag decoding (1) is a useful technique for combating interference via multiple repeated transmissions, and is known to be compatible with distributed random access protocols. However, in the presence of noise this type of decoding can magnify errors, particularly when packet sizes are large. We present a simple s...

The multiple-access framework of ZigZag decoding (Gollakota and Katabi 2008) is a useful technique for combating interference via multiple repeated transmissions, and is known to be compatible with distributed random access protocols. However, in the presence of noise this type of decoding can magnify errors, particularly when packet sizes are larg...

We show that girth can be used to certify that sparse compressed sensing matrices have good sparse approximation guarantees. This allows us to present the first deterministic measurement matrix constructions that have an optimal number of measurements for ℓ₁/ℓ₁ approximation. Our techniques are coding theoretic and rely on a r...

We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certain packets. This presents a problem of broadcasting in the presence of side information, and is a generalization of the well known (and unsolved) index coding problem of information t...

We investigate the problem of allocating energy from renewable sources to flexible consumers in electricity markets. We assume there is a renewable energy supplier that provides energy according to a time-varying (and possibly unpredictable) supply process. The plant must serve consumers within a specified delay window, and incurs a cost of drawing...

Acoustic feedback is an annoying problem in several audio applications and especially in hearing aids. Adaptive feedback cancellation techniques have attracted recent attention and show great promise in reducing the deleterious effects of feedback. In this paper, we investigated the performance of a class of adaptive feedback cancellation algorithm...

Different adaptive filter algorithms are used for feedback cancellation in hearing aids. In this paper first, we will explain three different algorithms for feedback cancellation, which are robust against colored input signals. These algorithms are including the Approximated Affine Projection using Gram-Schmidt prediction, the Variable Step-size AP...

The abdominal ECG is a composite signal because it contains both the mother's and the fetus' ECG signals, but the chest ECG is supposed to have only maternal (MECG) component. In this paper, we use three different adaptive algorithms to remove FECG signal from the abdominal ECG. All procedures are applied to real multichannel ECG recordings obtaine...

In this paper, we present the secure routing in sensor networks. Routing protocols in wireless sensor networks (WSNs) are susceptible to a number of attacks depending on the nature of the protocol, its application, and the environment in which the protocol is intended to be used. Routing protocols that do not take the malicious attacks into account...