Similar regular plans for mobile clients

The broadcast problem including the plan design is considered. The data are inserted and numbered into customized size relations at a predefined order. The server ability to create a full, regular Broadcast Plan (RBP) with single and multiple channels, after some data transformations, is examined. The Basic Regular Algorithm (BRA) prepares an RBP and enables users to catch their items avoiding wasting energy of their devices. In the case of multiple channels, a dynamic grouping solution is proposed, called Full Partition Value Algorithm (FPVA) under a multiplicity constraint. The Similar Regular Plan Algorithm (SRPA) provides faster service of the supreme sets with the use of fewer channels. The combination of FPVA and SRPA provides flexibility for finding desired solutions. This last property, can be offered by servers today providing channel availability and lower energy consumption. Simulation results are provided.