AUTHORS: John Tsiligaridis

Download as PDF

ABSTRACT: The emerging wireless communication technology gives mobile financial services, location-based services by providing users with the capability of accessing data at any time and place. The broadcast problem including the plan design is considered. The data are inserted and numbered at a predefined order into customized size relations. The server fetches the requests and broadcasts the data to the air. A set of algorithms can guarantee, the creation of a full Regular Broadcast Plan (RBP), for the server with equal spacing repeated instances of items using single or multiple channels. First, the Basic regular (BRA) and the Partition Value algorithm (PVA), can provide a static and dynamic RBP construction with multiple constraints solutions respectively. PVA can also build the grouping of strong relations with minimum number of channels. Second, the Grouping Dimensioning Algorithm (GD provides dynamic solutions and, creates groups with predefined average access time, considering economy of channels. The Cuchoo Search Algorithm (CS) is selected for optimization. CS can discover the RBPs with minimum number of channels. Theorems for discovery RBPs with their criteria are used for preparing the conditions for developing the CS algorithms. Servers with these advantages, in addition to their self-monitoring and self-organizing, will have the ability for channel availability and lower energy consumption by using smaller number of channels. Simulation results are provided.

KEYWORDS: Broadcasting, Mobile Computing, Cuchoo Algorithm, Broadcast Plan, Relations, Grouping, Wireless Network.

REFERENCES:

[1] S. Acharia, M.Franklin, S. Zdonik, R.Alonso, “Broadcast disks: Data management for asymmetric communications environments”, in ACM SIGMOD- 1995, ACM SIGMOD Conference Proceedings, pp. 199-210.

[2] W. Wee, S. Navathe, E. Omiecinski, C. Jermaine, “Efficient Data Allocation over Multiple Channels of Broadcast Servers”, in IEEE Trans. On Computers, vol. 51, No.10,Oct 2002, pp. 1231- 1236.

[3] E. Ardizzoni, A. Bertossi, M. Pinotti, S. Ramaprasad, R. Rizzi, M. Shashanka, ” Optimal Skewed Data Allocation on Multiple Channels with Flat per Channel”, in IEEE Trans. on Computers, Vol. 54, No. 5, May 2005, pp. 558- 572.

[4] A. Bertossi, M.Pinotti, S.Ramaprasad, R.Rizzi, M. Shashanka, “Optimal multi-channel data allocation with flat broadcast per channel”, in International Parallel and Distributed Processing Symposium ( IPDS)-2014 , IPDS Proceedings, pp.18-27

[5] J. Tsiligaridis, “Static and Dynamic Algorithm for Regular Data Broadcasting Plans in Wireless Mobile Environment”, International Journal of Advanced Computer Science, IJACS, Vol.2 No.2, Feb. 2012, pp. 42-48.

[6] Yang, X. S., and Deb, S.” Engineering Optimization by Cuckoo Search”, in Int. Journal of Mathematical Modelling and Numerical Optimization, Vol.1, No 4, 2010, pp. 330-343

[7] E. Valian, S. Mohanna, S. Takavoli, ”Improved Cuckoo Search Algorithm for Global Optimization”, in Int. Journal of Communications and Information Tech., IJCIT, Vol.1, No.1, 2011,pp. 31-62.

[8] N. Vaidya, S. Hameed, “Scheduling Data Broadcast in Asymmetric Communication Environment”, in ACM/Baltzer Wireless Networks, vol.5, 1999, pp.171-182.

[9] Ljubomir Lazic, Nikos Mastorakis 'Cost effective software test metrics ' in WSEAS Transactions on Computers, Volume 7, Issue 6, pp 599-619

[10] Ljubomir Lazic, Nikos Mastorakis, 'Orthogonal Array application for optimal combination of software defect detection techniques choices' in WSEAS Transactions on Computers, Volume 7, Issue 8, pp 1319-1336