Abstract

We present a problem in the stability of switched positive systems that arises in network topology control. Preliminary results are given that guarantee stability of a network topology control problem under certain assumptions. Roughly speaking, these assumptions reduce the underlying stability problem to a nonlinear consensus problem with a driving term, that eventually becomes a Lur'e problem. Simulation results are given to illustrate our algorithm. While these results indicate that our assumptions can be removed, a proof of the general stability problem remains open.