An Efficient Broadcast Scheme for Wireless Data Schedule Under a New Data Affinity Model

NHUIR > College of Science and Technology > Department of Information Management > Periodical Articles > Item 987654321/25081

Please use this identifier to cite or link to this item: http://nhuir.nhu.edu.tw/handle/987654321/25081

Title:	An Efficient Broadcast Scheme for Wireless Data Schedule Under a New Data Affinity Model
Authors:	吳光閔;Wu, Guang-Ming;Wang, Chin-Bin;Tsaih, Derchian;Ho, Yun-Ting
Contributors:	資訊管理學系
Date:	2005
Issue Date:	2017-07-18 15:47:50 (UTC+8)
Abstract:	Data schedule in broadcasting is playing a more importance role due to increasing demand for large client popularity and vast amount of information. For system with multipoint queries, data records which queried by same query are broadcasted contiguously to reduce the average access time. Several techniques have been used in clustering data by defining the affinity between them. The data affinity function defined was mainly aiming at minimizing the linear Query Distance. However, our work showing that in order to minimize the average access time, the objective function shall be in quadratic form. We propose a MinimumGap algorithm(MG) which merge relevant segments base on this new affinity function. Through extensive experiments, the results show not only the query’s access time can be reduced by using this new affinity function, by using a dummy segment to speed our algorithm, the scheme we proposed have significant saving on both time complexity and memory space complexity.
Relation:	Lecture Notes in Computer Science vol. 3391 pp.390-400
Appears in Collections:	[Department of Information Management] Periodical Articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	363	View/Open