A dynamic regular data broadcasting plan in wireless mobile environment

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 the users to catch their items avoiding energy waste of their devices. The Binary Grouping Dimensioning Algorithm (BGDA), based on integrated relations, can guarantee the discrimination of services with a minimum number of channels. Both of these algorithms provide static solutions to the RBP problem. The Partition Value Algorithm (PVA) works with more parameters and builds the grouping under the multiplicity constraint providing dynamic solutions with minimum number of channels as well. This last property, in addition to the self-monitoring, and self-organizing, can be offered by servers today providing also channel availability and lower energy consumption by using smaller number of channels. The RBP offers advantages over the flat design and discrimination of services. Simulation results are provided.