TY - GEN
T1 - Minimax Bounds for Blind Network Inference
AU - Mehrotra, Nishant
AU - Graves, Eric
AU - Swami, Ananthram
AU - Sabharwal, Ashutosh
N1 - Funding Information:
Research was sponsored by the Army Research Office and was accomplished under Cooperative Agreement Number W911NF-19-2-0269. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Office or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.
Publisher Copyright:
© 2021 IEEE.
PY - 2021/7/12
Y1 - 2021/7/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85115059929&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85115059929&partnerID=8YFLogxK
U2 - 10.1109/ISIT45174.2021.9518065
DO - 10.1109/ISIT45174.2021.9518065
M3 - Conference contribution
AN - SCOPUS:85115059929
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1823
EP - 1828
BT - 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE International Symposium on Information Theory, ISIT 2021
Y2 - 12 July 2021 through 20 July 2021
ER -