Unconditional stability of the Foschini–Miljanic algorithm

In this note we prove the unconditional stability of the Foschini–Miljanic algorithm. Our results show that the Foschini–Miljanic algorithm is unconditionally stable (convergent) even in the presence of bounded time-varying communication delays, and in the presence of topology changes. The implication of our results may be important for the design of Code Division Multiple Access (CDMA) based wireless networks.