Jointly Optimal Routing and Minimum-Length Scheduling in Successive Interference Cancellation-Enabled Wireless Ad Hoc Networks

Abstract

This work studies the problem of jointly optimal routing and minimum length scheduling in a Successive Interference Cancellation (SIC) - enabled distributed wireless ad hoc network. The optimal solution finds the minimum number of time slots needed for the scheduling frame at a given flow rate in the presence of the SIC technique. Performance of the optimal solution that uses SIC is compared to the case wherein the interference is assumed as noise during reception. Numerical results show that the optimal solution with SIC shows significantly improved performance compared to the optimal solution without SIC. © 2021 IEEE.