| With the coming of information era, people hope to access data anywhere and anytime. To meet this requirement, mobile computing is researched as the combination of computing and wireless communication technology. Compared with the traditional distributed computing technology, mobile computing has characteristic in itself, such as unsymmetrical wireless bandwidth, limited resource, mobility, and so on. Because of well expansibility, data broadcasting technology is widely applied to mobile computing. In virtue of the importance of data broadcasting in mobile computing, this paper has theoretical sense and practical value to a certain degree.In this paper, the scheduling policy of multiple data requesting based on multiple channels is investigated at first, and then proposes a MCHM algorithm. Access conflict is the key problem of multiple data requesting in multi-channel. MCHM uses heuristic approach to solve this problem effectively.Dynamic change of multiple data requesting is considered in this paper at the same time. According to characters of multiple data requesting, this paper proposes a broadcast model which is based on the combination of MCHM algorithm and on-demand broadcast.In order to save energy of mobile clients, index broadcasting is always adopted. According to the different data access probability, this paper proposes a FECL algorithm based on index structure, which schedules index nodes in multi-channel. At the same time, extensible Huffman code is adopted to search each index node. This index strategy makes mobile clients monitor data information quickly and exactly.Finally, a series of simulation experiments are designed, and comparisons between the algorithms presented in this paper and other previously proposed algorithms are conducted. The experiment results show that the algorithms proposed in this paper have improved the performance of data broadcasting, and thus provides a feasible solution to the data broadcasting technology nuder mobile computing environment. |
PDF Full Text Request