9 citations · 21 across the 14 of their papers we have counts for
26 papers
On Cost-Aware Designs for Sequential Hypothesis Testing
George Vershinin, Asaf Cohen, Omer Gurewitz
We introduce Cost-Aware (CA) Sequential Hypothesis Testing (CASHT), in which an active decision-maker selects sensing actions with different, random costs to identify the true hypo…
Active Sequential Hypothesis Testing with Non-Homogeneous Costs
George Vershinin, Asaf Cohen, Omer Gurewitz
We study the Non-Homogeneous Sequential Hypothesis Testing (NHSHT), where a single active Decision-Maker (DM) selects actions with heterogeneous positive costs to identify the true…
Iterative Hypothesis Pruning and Distribution-based Early Labeling for Sequential Hypothesis Testing
George Vershinin, Asaf Cohen, Omer Gurewitz
We consider the framework of Sequential Hypothesis Testing (SHT), in which a decision maker (DM) selects actions that generate samples from known, action-dependent distributions, w…
Multi-Stage Active Sequential Hypothesis Testing with Clustered Hypotheses
George Vershinin, Asaf Cohen, Omer Gurewitz
We consider the problem where an active Decision-Maker (DM) is tasked to identify the true hypothesis using as few as possible observations while maintaining accuracy. The DM colle…
Order-optimal Joint Transmission and Identification in Massive Multi-User MIMO via Group Testing
George Vershinin, Asaf Cohen, Omer Gurewitz
The number of wireless devices which are connected to a single Wireless Local Area Network continues to grow each year. As a result, the orchestration of so many devices becomes a…
Compute-and-Forward in Large Relaying Systems: Limitations and Asymptotically Optimal Scheduling
Ori Shmuel, Asaf Cohen, Omer Gurewitz
Compute and Forward (CF) is a coding scheme which enables receivers to decode linear combinations of simultaneously transmitted messages while exploiting the linear properties of l…
Private Information Retrieval Over Gaussian MAC
Ori Shmuel, Asaf Cohen
Consider the problem of Private Information Retrieval (PIR), where a user wishes to retrieve a single message from non-communicating and non-colluding databases (servers). All…
Multi-Antenna Jamming in Covert Communication
Ori Shmuel, Asaf Cohen, Omer Gurewitz
Covert communication conceals transmission of messages from Alice to Bob out of a watchful adversary, Willie, who tries to determine if a transmission took place or not. While cove…
Secure Adaptive Group Testing
Alejandro Cohen, Asaf Cohen, Omer Gurewitz
\emph{Group Testing} (GT) addresses the problem of identifying a small subset of defective items from a large population, by grouping items into as few test pools as possible. In \…
Asymptotically Optimal Scheduling for Compute-and-Forward
Ori Shmuel, Asaf Cohen, Omer Gurewitz
Consider a Compute and Forward (CF) relay network with users and a single relay. The relay tries to decode a linear function of the transmitted signals. For such a network, let…
Efficient Data Collection Over Multiple Access Wireless Sensors Network
Alejandro Cohen, Asaf Cohen, Omer Gurewitz
Data collection in Wireless Sensor Networks (WSN) draws significant attention, due to emerging interest in technologies raging from Internet of Things (IoT) networks to simple "Pre…
Integer Forcing: Effective SNR Distribution and Practical Block-Based Schemes
Ron Meiry, Omer Gurewitz, Asaf Cohen
Integer Forcing (IF) is a novel linear receiver architecture, where instead of separating the codewords sent by each transmitter, and decoding them individually, forces integer-val…
Distributed Scheduling in Time Dependent Environments: Algorithms and Analysis
Ori Shmuel, Asaf Cohen, Omer Gurewitz
Consider the problem of a multiple access channel in a time dependent environment with a large number of users. In such a system, mostly due to practical constraints (e.g., decodin…
Secure Multi-Source Multicast
Alejandro Cohen, Asaf Cohen, Muriel Medard +1
The principal mission of Multi-Source Multicast (MSM) is to disseminate all messages from all sources in a network to all destinations. MSM is utilized in numerous applications. In…
The Necessity of Scheduling in Compute-and-Forward
Ori Shmuel, Asaf Cohen, Omer Gurewitz
Compute and Forward (CF) is a promising relaying scheme which, instead of decoding single messages or forwarding/amplifying information at the relay, decodes linear combinations of…
VM Scaling and Load Balancing via Cost Optimal MDP Solution
Mark Shifrin, Roy Mitrany, Erez Biton +1
We address a cost optimization problem faced by a user who runs instances of applications in a remote cloud configuration constructed of multiple virtual machines (VMs). Each VM ru…
An SMDP Approach to Optimal PHY Configuration in Wireless Networks
Mark Shifrin, Daniel S. Menasché, Asaf Cohen +2
In this work, we study the optimal configuration of the physical layer in wireless networks by means of Semi-Markov Decision Process (SMDP) modeling. In particular, assume the phys…
Secure Group Testing
Alejandro Cohen, Asaf Cohen, Omer Gurewitz
The principal goal of Group Testing (GT) is to identify a small subset of "defective" items from a large population, by grouping items into as few test pools as possible. The test…
On Secrecy Rates and Outage in Multi-User Multi-Eavesdroppers MISO Systems
Joseph Kampeas, Asaf Cohen, Omer Gurewitz
In this paper, we study the secrecy rate and outage probability in Multiple-Input-Single-Output (MISO) Gaussian wiretap channels at the limit of a large number of legitimate users…
Optimal Dynamic Routing for the Wireless Relay Channel
Asaf Cohen, Dennis Goeckel, Omer Gurewitz +2
Consider a communication network with a source, a relay and a destination. Each time interval, the source may dynamically choose between a few possible coding schemes, based on the…
Capacity and performance analysis for multi-user system under distributed opportunistic scheduling in a time dependent channel
Ori Shmuel, Asaf Cohen, Omer Gurewitz
Consider the problem of a multi-user multiple access channel. While several multi-user coding techniques exist, in practical scenarios, not all users can be scheduled simultaneousl…
Asymptotic Analysis for Reliable Data Dissemination in Shared loss Multicast Trees
Ron Yadgar, Asaf Cohen, Omer Gurewitz
The completion time for the dissemination (or alternatively, aggregation) of information from all nodes in a network plays a critical role in the design and analysis of communicati…
Coded Retransmission in Wireless Networks Via Abstract MDPs: Theory and Algorithms
Mark Shifrin, Asaf Cohen, Omer Gurewitz +1
Consider a transmission scheme with a single transmitter and multiple receivers over a faulty broadcast channel. For each receiver, the transmitter has a unique infinite stream of…
The Ergodic Capacity of the Multiple Access Channel Under Distributed Scheduling - Order Optimality of Linear Receivers
Joseph Kampeas, Asaf Cohen, Omer Gurewitz
Consider the problem of a Multiple-Input Multiple-Output (MIMO) Multiple-Access Channel (MAC) at the limit of large number of users. Clearly, in practical scenarios, only a small s…