Robust scheduling of wireless sensor networks for target tracking under uncertainty

•This paper addresses a target tracking robustness problem in Wireless Sensor Networks.•A maximum stability radius schedule is computed with a pseudo-polynomial algorithm.•Two classes of upper bounds are exploited to speed up convergence.•Large problem instances with up to 1000 sensors can be solved...

Ausführliche Beschreibung