The broadcast problem including the plan design is considered. The data are inserted and numbered at predefined order into customized size relations. The server ability to create a full, regular Broadcast Plan (RBP) with single and multiple channels after some data transformations is examined. The Regular Geometric Algorithm (RGA) prepares a RBP and enables the users to catch their items avoiding energy waste of their devices. Moreover, the Grouping Method Algorithm (GMA) based on integrated relations can guarantee the discrimination of services using all the available number of channels. This last property among the self-monitoring, self-organizing, can be offered by servers today providing also channel availability and less energy consumption by using smaller number of channels. Simulation results are provided.
[1]
Alan A. Bertossi,et al.
Optimal multi-channel data allocation with flat broadcast per channel
,
2004,
18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..
[2]
Alan A. Bertossi,et al.
Optimal skewed data allocation on multiple channels with flat broadcast per channel
,
2005,
IEEE Transactions on Computers.
[3]
Shamkant B. Navathe,et al.
Efficient Data Allocation over Multiple Channels at Broadcast Servers
,
2002,
IEEE Trans. Computers.
[4]
Rafael Alonso,et al.
Broadcast Disks: Data Management for Asymmetric Communication Environments
,
1994,
Mobidata.