Majorization theory in sensor scheduling

This paper presents that the majorization theory plays an essential role in a class of sensor scheduling problems, whose solutions all have periodic or uniformly distributed patterns. This paper revisits the problem of communication time scheduling for a single sensor with local computation capability, and strengthens its original result by the majorization theory. The scheduling for a single normal sensor in a general-order system is also studied, and the optimal schedules for minimizing the upper bound of the objective function is provided. Examples are provided at the end.