Novel Information Distribution Methods to Massive Mobile User Populations

Broadcast data delivery is encountered in many applications where there is a need to disseminate information to a large user community in a wireless asymmetric military communication environment. In this paper, we consider two types of broadcast data delivery systems, namely, push-based and pull-based, and provide a low-complexity near-optimal scheduling algorithms for both systems. By using a numerical study we also discuss the performance limit of a pull-based system. In addition, we identify the optimal memory management policy for the users in a push-based broadcast delivery system and propose implementable alternatives to the optimal policy.