A New Interference-Alignment Scheme for Wireless MapReduce
arXiv:2210.06621 · doi:10.1109/ISIT50566.2022.9834584
Abstract
We consider a full-duplex wireless Distributed Computing (DC) system under the MapReduce framework. New upper and lower bounds on the optimal tradeoff between Normalized Delivery Time (NDT) and computation load are presented. The upper bound strictly improves over the previous reported upper bounds and is based on a novel interference alignment (IA) scheme tailored to the interference cancellation capabilities of MapReduce nodes. The lower bound is proved through information-theoretic converse arguments.
References in corpus (6)
- Real Interference Alignment: Exploiting the Potential of Single Antenna Systems
- Degrees of Freedom Region for the MIMO X Channel
- Degrees of Freedom of Interference Channels with CoMP Transmission and Reception
- Data Shuffling in Wireless Distributed Computing via Low-Rank Optimization
- On Cognitive Interference Networks
- A New Interference-Alignment Scheme for Wireless MapReduce