40 citations · 220 across the 39 of their papers we have counts for
6 papers · 1 filter
Routing for Security in Networks with Adversarial Nodes
Pak Hou Che, Minghua Chen, Tracey Ho +2
We consider the problem of secure unicast transmission between two nodes in a directed graph, where an adversary eavesdrops/jams a subset of nodes. This adversarial setting is in c…
SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits
Mayank Bakshi, Sidharth Jaggi, Sheng Cai +1
Suppose x is any exactly k-sparse vector in R^n. We present a class of sparse matrices A, and a corresponding algorithm that we call SHO-FA (for Short and Fast) that, with high pro…
Analog Network Coding in General SNR Regime: Performance of Network Simplification
Samar Agnihotri, Sidharth Jaggi, Minghua Chen
We consider a communication scenario where a source communicates with a destination over a directed layered relay network. Each relay performs analog network coding where it scales…
Analog network coding in general SNR regime: Performance of a greedy scheme
Samar Agnihotri, Sidharth Jaggi, Minghua Chen
The problem of maximum rate achievable with analog network coding for a unicast communication over a layered relay network with directed links is considered. A relay node performin…
Analog Network Coding in General SNR Regime
Samar Agnihotri, Sidharth Jaggi, Minghua Chen
The problem of maximum rate achievable with analog network coding for a unicast communication over a layered wireless relay network with directed links is considered. A relay node…
Amplify-and-Forward in Wireless Relay Networks
Samar Agnihotri, Sidharth Jaggi, Minghua Chen
A general class of wireless relay networks with a single source-destination pair is considered. Intermediate nodes in the network employ an amplify-and-forward scheme to relay thei…