The TopK Scheme for the Energy-Saving Data Organization in Broadcast-Based Wireless Environments

[[abstract]]Wireless broadcasting is an efficient way to deliver information to mobile clients. Due to power limit for the portable units, how to design an energy-saving organization is a key issue. Imielinski et al. have proposed two hashing-based schemes, Hashing A and Hashing B, to save energy in the progress of getting data of interest. However, these two hashing-based schemes have the directory miss phenomenon. To improve the directory miss phenomenon further, in this paper, we propose the TopK scheme which is a multiple-hashing-function-based scheme. From our simulation study, we show that the performance of TopK is better than that of Hashing B in terms of the average access time and the average tuning time

The TopK Scheme for the Energy-Saving Data Organization in Broadcast-Based Wireless Environments

[[abstract]]Wireless broadcasting is an efficient way to deliver information to mobile clients. Due to power limit for the portable units, how to design an energy-saving organization is a key issue. Imielinski et al. have proposed two hashing-based schemes, Hashing A and Hashing B, to save energy in the progress of getting data of interest. However, these two hashing-based schemes have the directory miss phenomenon. To improve the directory miss phenomenon further, in this paper, we propose the TopK scheme which is a multiple-hashing-function-based scheme. From our simulation study, we show that the performance of TopK is better than that of Hashing B in terms of the average access time and the average tuning time