Binary interpolation search for solution mapping on broadcast and on-demand channels in a mobile computing environment

Jiun-Long Huang*, Wen-Chih Peng, Ming Syan Chen

*此作品的通信作者

研究成果: Paper同行評審

10 引文 斯高帕斯(Scopus)

摘要

We explore in this paper the problem of dynamic data and channel allocations with the number of communication channels and the number of data items given. It is noted that the combined use of broadcast and on-demand channels can utilize the bandwidth effectively for data dissemination in a mobile computing environment. We first derive the analytical models of the expected delays when the data are requested through the broadcast and on-demand channels. Then, we transform this problem into to a guided search problem. In light of the theoretical properties derived, we devise an algorithm based on binary interpolation search, referred to as algorithm BIS, to obtain solutions of high quality efficiently. In essence, algorithm BIS is guided to explore the solution space with higher likelihood to be the optimal first, thereby leading to an efficient and effective search. It is shown by our simulation results that the solution obtained by algorithm BIS is of very high quality and is in fact very close to the optimal one. Sensitivity analysis on several parameters, including the number of data items and the number of communication channels, is conducted.

原文English
頁面434-441
頁數8
DOIs
出版狀態Published - 2001
事件Proceedings of the 2001 ACM CIKM: 10th International Conference on Information and Knowledge Management - Atlanta, GA, United States
持續時間: 5 11月 200110 11月 2001

Conference

ConferenceProceedings of the 2001 ACM CIKM: 10th International Conference on Information and Knowledge Management
國家/地區United States
城市Atlanta, GA
期間5/11/0110/11/01

指紋

深入研究「Binary interpolation search for solution mapping on broadcast and on-demand channels in a mobile computing environment」主題。共同形成了獨特的指紋。

引用此