Bounds on the Wireless MapReduce NDT-Computation Tradeoff

We consider a full-duplex wireless Distributed Computing (DC) system under the MapReduce framework. New upper bound and lower bounds on the tradeoff between Normalized Delivery Time (NDT) and computation load are obtained. The lower bound is proved through an information-theoretic converse. The upper bound is based on a novel IA scheme tailored to the interference cancellation capabilities of the nodes and improves over existing bounds.