A conflict avoidance data allocation algorithm in a multi-channel broadcast environment

On-demand broadcast is an effective data dissemination approach in mobile computing. Recently, a large number of applications have been developed in broadcast systems equipped with multiple channels. In this study, we investigate the data scheduling issues arising in multi-channel on-demand broadcast. The bandwidth utilization problem, which renders a poor performance of existing algorithms, is explored and examined. To tackle the observed problem, a novel scheduling algorithm is proposed, which aims at avoiding the conflict in data allocation and therewith, improving the bandwidth utilization. Results from our simulation study demonstrate the superiority of the proposed algorithm. © 2010 ACADEMY PUBLISHER.