An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels

Abstract

In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper, the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, a minimal expected average access time of the broadcast data items is first derived. The broadcast program is then generated, which minimizes the minimal expected average access time. Simulation is performed to compare the performance of our approach with two existing approaches.The result of the experiments shows that our approach outperforms others and is in fact close to the optimal.

Control Plane for Spectrum Access and Mobility in Cognitive Radio Networks with Heterogeneous Frequency Devices

“…Most control signals should be sent via broadcast to the users in the CRN. Several broadcasting problems such as the minimum broadcasting energy problem (Cagalj et al, 2002) and the allocation for broadcasting heterogeneous data in multiple channels (Hsu et al, 2005;Tsai et al, 2009), among others have been studied in the literature. The channel allocation/frequency assignment problem has been studied in static and dynamic environments.…”

A hybrid scheduling scheme for data broadcast over a single channel in mobile environments

“…Existing broadcast scheduling schemes have been developed from two different viewpoints: one is based on data access probabilities (Acharya et al 1995;Imielinski et al 1997;Hsu et al 2005;Sharaf and Chrysanthis 2004;Sun et al 2003;Yee et al 2001) and the other is based on the semantic relations of the data (Lee et al 2002a,b;Chehadeh et al 1999;Chung and Kim 2001;Lee and Lo 2003;Shih and Liu 2008). The broadcast disks (Acharya et al 1995) approach analyzes the access preference of each data object and differentiates the delivery frequencies of the data objects so that more popular data items are broadcast more frequently.…”

On Channel Allocation for Heterogeneous Data Broadcasting

“…By exploiting the feature of variantfanout, algorithm VF K was proposed to achieve nearoptimal allocation with low complexity. On the other hand, Hsu et al also developed an effective algorithm in [4] to generate a near-optimal broadcast program. Different from algorithm VF K , what Hsu et al proposed is based on Wong's theorem [19].…”

“…There are many research topics in generating the broadcast programs to broadcast data items via multiple broadcast channels [4], [5], [6], [7], [8], [9], [10]. A flat broadcast program, in which the items are allocated to broadcast channels with equal appearance frequencies, is a straightforward way for broadcasting.…”

“…However, this approach is ineffective since the expected waiting time of data items with different access probabilities is the same. In order to overcome the effectiveness problem, approaches are proposed in [4], [8], and [9] to generate broadcast programs in which the expected waiting time of popular data items (i.e., with higher access probabilities) is shorter than that of unpopular data items (i.e., with lower access probabilities). In addition to providing basic services for mobile users, there are also many extensions of the broadcast technique.…”