Minimal Wireless Broadcast Schedules for Multiobjective Pursuits

Mobile wireless devices can now act as push-based data broadcasters, disseminating information in crowded places. While assuming this role, a device must take into account various factors such as the mean service time, energy expenditure, or copyright costs. Apart from adhering to multiobjective optimality, a broadcast schedule must also be as small as possible in size to be producible and cacheable on a mobile device. This paper analytically proves the existence of optimal schedules that are finite and minimal in size. Furthermore, the optimality of the schedule is allowed to refer to an unlimited number of criteria. The analysis shows that multiobjective optimality can be met precisely by extremely small schedules, enabling their use in mobile devices. Simulations indicate perfect efficiency of the minimal schedules in realistic application scenarios.