SIMILAR REGULAR PLANS FOR MOBILE CLIENTS

John Tsiligaridis

Abstract

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.

References

  1. Acharya, S., Zdonik, F., Alonso, R., 1995. “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. Yee, W., Navathe, S., Omiecinski, E., Jemaine, C., 2002.” Efficient Data llocation over Multiple Channels of Broadcast Servers”, IEEE Trans. on Computers, vol. 51, No.10, Oct 2002.
  3. Ardizzoni, E., Bertossi. A., Pinotti, M., Ramaprasad, S., Rizzi, R., Shashanka, M., 2005.” Optimal Skewed Data Allocation on Multiple Channels with Flat per Channel”, IEEE Trans. on Computers , Vol. 54,No. 5, May 2005
  4. Bertossi. A., Pinotti, M., Ramaprasad, S., Rizzi, R., Shashanka, M., 2004. “Optimal multi-channel data allocation with flat broadcast per channel”, Proceedings of IPDS'04, 2004, 18-27
  5. Peng, W., Chen. M., 2000. ” Dynamic Generation of data Broadcasting Programs for a Broadcast disk Array in a Mobile Computing Environment”, Proc. of the 9th ACM International Conference on Information and Knowledge Management (CIKM 2000), pp. 38-45
  6. Yao, G., Zhu, D., Li, H.,Ma. S., 2008. “ A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem”, Discrete Mathematics, 308(17), 3951-3959.
  7. Hashemi, S., Rezapour, M., Moradi, A.,2007. ”Two new algorithms for the Min-Power Broadcast problem in static ad hoc networks” , Applied Mathematics and Computation, 190(2) 1657-1668, 2007
  8. Tsiligaridis, J., 2009. “Regular Data Broadcasting Plan with Grouping in Wireless Mobile Environment”, International Conference on Computer Networks and Mobile Computing, (ICCNMC 2009), WASET, August 26-28, Singapore.
  9. Tsiligaridis, J., Acharya, R., 2007. “An adaptive Broadcasting Model in Mobile Information Systems”, 6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM 2007), June 28-30, Elk, Poland, pp.203-209.
Download


Paper Citation


in Harvard Style

Tsiligaridis J. (2011). SIMILAR REGULAR PLANS FOR MOBILE CLIENTS . In Proceedings of the International Conference on Data Communication Networking and Optical Communication System - Volume 1: DCNET, (ICETE 2011) ISBN 978-989-8425-69-0, pages 69-74. DOI: 10.5220/0003602000690074


in Bibtex Style

@conference{dcnet11,
author={John Tsiligaridis},
title={SIMILAR REGULAR PLANS FOR MOBILE CLIENTS},
booktitle={Proceedings of the International Conference on Data Communication Networking and Optical Communication System - Volume 1: DCNET, (ICETE 2011)},
year={2011},
pages={69-74},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003602000690074},
isbn={978-989-8425-69-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Data Communication Networking and Optical Communication System - Volume 1: DCNET, (ICETE 2011)
TI - SIMILAR REGULAR PLANS FOR MOBILE CLIENTS
SN - 978-989-8425-69-0
AU - Tsiligaridis J.
PY - 2011
SP - 69
EP - 74
DO - 10.5220/0003602000690074