In a mobile computing system, broadcasting has become a very interesting and challenging research issue. The server continuously broadcasts data to mobile users; the data can be inserted into customized size relations and broadcasted as Regular Broadcast Plan (RBP) with multiple channels. Two algorithms, given the data size for each provided service, the Basic Regular (BRA) and the Partition Value Algorithm (PVA) can provide a static and dynamic RBP construction with multiple constraints solutions respectively. Servers have to define the data size of the services and can provide a feasible RBP working with many broadcasting plan operations. The operations become more complicated when there are many kinds of services and the sizes of data sets are unknown to the server. To that end a framework has been developed that also gives the ability to select low or high capacity channels for servicing. Theorems with new analytical results can provide direct conditions that can state the existence of solutions for the RBP problem with the compound criterion. Two kinds of solutions are provided: the equal and the non equal subrelation solutions. The Cucho Search Algorithm (CS) with the Levy flight behavior has been selected for the optimization. The CS for RBP (CSRP) is developed applying the theorems to the discovery of RBPs. An additional change to CS has been made in order to increase the local search. The CS can also discover RBPs with the minimum number of channels. From all the above modern servers can be upgraded with these possibilities in regards to RBPs discovery with fewer channels.

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
, “
Sceduling Data Broadcast In Asymmetric Communication Environment
”, in
ACM/Baltzer Wireless Networks
, vol.
5
,
1999
, pp.
171
182
.
This content is only available via PDF.