|| Minimax Bounds for Blind Network Inference
||Nishant Mehrotra, Rice University, United States; Eric Graves, Ananthram Swami, U.S. Army Research Laboratory, United States; Ashutosh Sabharwal, Rice University, United States|
||D4-S5-T3: Network Inference
||Thursday, 15 July, 23:20 - 23:40
||Thursday, 15 July, 23:40 - 00:00
We take the first step towards understanding the fundamental limits of blind wireless network inference performed by a distributed network of single-antenna adversary nodes. The distributed adversary nodes are assumed to be blind to the protocol parameters as well as the modulation, coding and encryption schemes used by the network being monitored. Focusing on the special case of inferring the channel access probabilities of the monitored nodes, we derive minimax bounds for blind inference. We show that blind inference is possible with similar sample complexity (asymptotically) as non-blind inference given certain network connectivity conditions are satisfied.