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.
|出版狀態||Published - 2006 12月 1|
|事件||IASTED International Conference on WIRELESS SENSOR NETWORKS, Part of the Sixth IASTED International Multi-Conference on WIRELESS AND OPTICAL COMMUNICATIONS - Banff, AB, Canada|
持續時間: 2006 7月 3 → 2006 7月 4
|Other||IASTED International Conference on WIRELESS SENSOR NETWORKS, Part of the Sixth IASTED International Multi-Conference on WIRELESS AND OPTICAL COMMUNICATIONS|
|期間||06-07-03 → 06-07-04|
All Science Journal Classification (ASJC) codes
- 工程 (全部)