A Problem in Positive Systems Stability Arising in Topology Control
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.
KeywordsAverage Matrix Topology Control Positive System Geometric Graph Consensus Problem
Unable to display preview. Download preview PDF.
- 2.Estrin, D., Girod, L.D., Pottie, G.J., Srivastava, M.: Instrumenting the world with wireless sensor networks. In: Proc. of the Int. Conf. on Acoustics, Speech, and Signal Processing, Salt Lake City, UT, USA, vol. 4, pp. 2033–2036 (2001)Google Scholar
- 6.Knorn, F., Stanojevic, R., Corless, M., Shorten, R.: A framework for decentralised feedback connectivity control with application to sensor networks. Int. J. Control (to appear, 2009)Google Scholar
- 9.Reynolds, C.W.: Flocks, herds, and schools: A distributed behavioral model. In: Proc. of the 14th Annual Conf. on Computer Graphics and Interactive Techniques, Anaheim, CA, USA, pp. 25–34 (1987)Google Scholar
- 11.Zavlanos, M.M., Pappas, G.J.: Controlling connectivity of dynamic graphs. In: Proc. of the Joint 44th IEEE Conf. on Decision and Control, and the European Control Conf., Seville, Spain, pp. 6388–6393 (2005)Google Scholar