Regular Data Broadcasting Plan with Grouping in Wireless Mobile Environment

Authors: John T. Tsiligaridis

Abstract:

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 Dimensioning Algorithm (GDA) based on integrated relations can guarantee the discrimination of services with a minimum number of channels. This last property among the selfmonitoring, 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.

Keywords: Broadcast, broadcast plan, mobile computing, wireless networks, scheduling.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1333674

References:

[1] S. Acharya, M.Franklin, S. Zdonik, R.Alonso, "Broadcast disks: Data management for asymmetric communications environments", Proc. of the ACM SIGMOD Int. Conf. on Management of Data, San Jose, May 1995, 199-210.
[2] W.Yee, S. Navathe, E. Omiecinski, C.Jermaine," Efficient Data Allocation over Multiple Channels of Broadcast Servers", IEEE Trans. on Computers, vol. 51, No.10,Oct 2002.
[3] E. Ardizzoni, A. Bertossi, M. Pinotti, S. Ramaprasad, R. Rizzi, M.Shashanka," Optimal Skewed Data Allocation on Multiple Channels with Flat per Channel", IEEE Trans. on Computers , Vol. 54,No. 5, May 2005.
[4] A. Bertossi, M.Pinotti, S. Ramaprasad, R. Rizzi, M. Shashanka, "Optimal multi-channel data allocation with flat broadcast per channel", Proceedings of IPDS-04, 2004, 18-27.