This paper proposes an adaptive data broadcasting algorithm for data dissemination to improve data access efficiency. The proposed algorithm first constructs a broadcast tree to determine the broadcast frequency of each data, and splits the broadcast tree into some broadcast wood to generate the broadcast program. In addition, this paper develops an analytical model to derive the mean access latency of the generated broadcast program. In light of the derived result, the bandwidth for both index channel and data channel can be optimally allocated to maximize bandwidth utilization. Furthermore, to evaluate the effectiveness of the proposed strategy, experiments are demonstrated as well. From the experimental results, it can be seen that the proposed mechanism is feasible in practice.
|Publication status||Published - 2006 Dec 1|
|Event||IASTED International Conference on WIRELESS SENSOR NETWORKS, Part of the Sixth IASTED International Multi-Conference on WIRELESS AND OPTICAL COMMUNICATIONS - Banff, AB, Canada|
Duration: 2006 Jul 3 → 2006 Jul 4
|Other||IASTED International Conference on WIRELESS SENSOR NETWORKS, Part of the Sixth IASTED International Multi-Conference on WIRELESS AND OPTICAL COMMUNICATIONS|
|Period||06-07-03 → 06-07-04|
All Science Journal Classification (ASJC) codes