This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Tree-Structured Index Allocation Method with Replication over Multiple Broadcast Channels in Wireless Environments
March 2005 (vol. 17 no. 3)
pp. 311-325
ASCII Text
x 
 
Sungwon Jung, Byungkyu Lee, Sakti Pramanik, "A Tree-Structured Index Allocation Method with Replication over Multiple Broadcast Channels in Wireless Environments," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 3, pp. 311-325, March, 2005.
 
 
BibTex
x
 
@article{ 10.1109/TKDE.2005.36,
author = {Sungwon Jung and Byungkyu Lee and Sakti Pramanik},
title = {A Tree-Structured Index Allocation Method with Replication over Multiple Broadcast Channels in Wireless Environments},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {17},
number = {3},
issn = {1041-4347},
year = {2005},
pages = {311-325},
doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.36},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - A Tree-Structured Index Allocation Method with Replication over Multiple Broadcast Channels in Wireless Environments
IS - 3
SN - 1041-4347
SP311
EP325
EPD - 311-325
A1 - Sungwon Jung,
A1 - Byungkyu Lee,
A1 - Sakti Pramanik,
PY - 2005
KW - Mobile databases
KW - multiple broadcast channels
KW - alphabetic Huffman trees
KW - index allocation method
KW - data dissemination
KW - broadcast data.
VL - 17
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 
Broadcast has often been used to disseminate frequently requested data efficiently to a large volume of mobile units over single or multiple channels. Since mobile units have limited battery power, the minimization of the access and tuning times for the broadcast data is an important problem. There have been many research efforts that focus on minimizing access and tuning times by providing indexes on the broadcast data. In this paper, we have studied an efficient index allocation method for broadcast data with skewed access frequencies over multiple physical channels which cannot be coalesced into a single high bandwidth channel. Previously proposed index allocation techniques have one of two problems. The first problem is that they require equal size for both index and data. The second problem is that their performance degrades when the number of given physical channels is not enough. These two problems will result in an increased average access time for the broadcast data. To cope with these problems, we propose a tree-structured index allocation method. Our method minimizes the average access time by broadcasting the hot data and their indices more frequently than the less hot data and their indexes over the dedicated index and data channels. We present an in-depth experimental and theoretical analysis of our method by comparing it with other similar techniques. Our performance analysis shows that it significantly decreases the average access and tuning times for the broadcast data over existing methods.

[1] S. Acharya, M. Franklin, S. Zdonik, and R. Alonso, “Broadcast Disks: Data Management for Asymmetric Communication Environment,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 199-210, 1995.
[2] Mesquite Software Inc., “CSIM18 Simulation Engine USER'S GUIDE,” 2000.
[3] G. Forman and J. Zahorjan, “The Challenges of Mobile Computing,” Computer, vol. 27, no. 4, pp. 38-47, Apr. 1994.
[4] H. Leong and A. Si, “Data Broadcasting Strategies Over Multiple Unreliable Wireless Channels,” Proc. Fourth Int'l Conf. Information and Knowledge Management, Dec. 1995.
[5] C. Hsu, G. Lee, and A. Chen, “Index and Data Allocation on Multiple Broadcast Channels Considering Data Access Frequencies,” Proc. Third Int'l Conf. Mobile Data Management (MDM '02), 2002.
[6] A. Hurson, Y. Chehadeh, and L. Miller, “Object Organization on a Single Broadcast Channel in a Global Information Sharing Environment,” Proc. 24th Euromicro Conf., vol. 2, pp. 1021-1028, 1998.
[7] A. Hurson, Y. Chehadeh, and J. Hannan, “Object Organization on Parallel Broadcast Channels in a Global Information Sharing Environment,” Proc. IEEE Int'l Performance, Computing, and Comm. Conf. (IPCCC), Feb. 2000.
[8] T. Imielinski and B. Badrinath, “Wireless Mobile Computing: Challenges in Data Management,” Comm. ACM, vol 37, no. 10, pp. 18-28, 1994.
[9] T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Data on Air: Organization and Access,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp. 353-372, May/June 1997.
[10] J. Gray, P. Sundaresan, and S. Englert, K. Baclawski, and P. Weinberger, “Quickly Generating Billion-record Synthetic Databases,” Proc. 1994 ACM SIGMOD Int'l Conf. Management of Data, 1994.
[11] J. Juran, A.R. Hurson, N. Vijaykrishman, and S. Boonsiriwattanakul, “Data Organization and Retrieval on Parallel Air Channels, Performance and Energy Issues,” Proc. Int'l Conf. High Performance Computing (HiPC 2000), pp. 501-510, 2000.
[12] K. Lee, H. Leong, and A. Si, “Semantic Data Access in an Asymmetric Mobile Environment,” Proc. Third Int'l Conf. Mobile Data Management (MDM'02), 2002.
[13] D. Knuth, The Art of Computer Programming, second ed. Addison Wesley, 1998.
[14] W. Lee and D. Lee, “Using Signature Techniques for Information Filtering in Wireless and Mobile Environments,” J. Distributed and Parallel Databases, special issue on databases and mobile computing, vol. 4, no. 3, pp. 205-227, July 1996.
[15] K. Lee, H. Leong, and A. Si, “A Semantic Broadcast Scheme for a Mobile Environment Based on Dynamic Chunking,” Proc. 20th Int'l Conf. Distributed Computing Systems, pp. 522-529, 2000.
[16] S. Lo and A. Chen, “Optimal Index and Data Allocation in Multiple Broadcast Channels,” Proc. 16th Int'l Conf. Data Eng., pp. 293-302, 2000.
[17] N. Shivakumar and S. Venkatasubramanian, “Efficient Indexing for Broadcast Based Wireless Systems,” Mobile Networks and Applications, pp. 433-446, 1996.
[18] W. Ni, S. Vrbsky, Q. Fang, and J. Zhang, “Concurrency Control for Mobile Real-Time Databases Using Adaptive Broadcasting,” Proc. 20th IASTED Int'l Conf. Applied Informatics, pp. 425-430, Feb. 2000.
[19] W. Peng and M. Chen, “Dynamic Generation of Data Broadcasting Programs for a Broadcast Disk Array in a Mobile Computing Environment,” Proc. ACM Conf. Information and Knowledge Management (CIKM), pp. 38-45, 2000.
[20] K. Prabhakara, K. Hua, and J. Oh, “Multi-Level Multi-Channel Air Cache Design for Broadcasting in a Mobile Environment,” Proc. 16th Int'l Conf. Data Eng., 2000.
[21] H.D. Schwetman, “CSIM: A C-Based Process Oriented Simulation language,” Proc. 1986 Winter Simulation Conf., 1986.
[22] K. Tan and J. Yu, “An Analysis of Selective Tuning Schemes for Nonuniform Broadcast,” Data and Knowledge Eng., vol. 22, no. 3, pp. 319-344, 1997.
[23] W. Yee, S. Navathe, E. Omiecinski, and C. Jermaine, “Efficient Data Allocation over Multiple Channels at Broadcast Servers,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1231-1236, Oct. 2002.
[24] W. Yee and S. Navathe, “Efficient Data Access to Multi-Channel Broadcast Programs,” ACM Conf. Information and Knowledge Management (CIKM '03), pp. 153-160, 2003.
[25] Introduction to Human Ecology. Cambridge, Mass.: Addison Wesley Press, 1949.

Index Terms:
Mobile databases, multiple broadcast channels, alphabetic Huffman trees, index allocation method, data dissemination, broadcast data.
Citation:
Sungwon Jung, Byungkyu Lee, Sakti Pramanik, "A Tree-Structured Index Allocation Method with Replication over Multiple Broadcast Channels in Wireless Environments," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 3, pp. 311-325, March 2005, doi:10.1109/TKDE.2005.36
Usage of this product signifies your acceptance of the Terms of Use.