Abstract

Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile units over a single or multiple channels. Since the mobile units have limited battery power, the minimization of the access time for the broadcast data is an important problem. In this paper, we studied an efficient index allocation method for the broadcast data over multiple physical channels to minimize the access time. Previously proposed index allocation techniques either require the equal size of index and data or have a performance degradation problem when the number of given physical channels is not enough. To cope with these problems, we propose an efficient tree-structured index allocation method for the broadcast data with different access frequencies over multiple physical channels.KeywordsAccess TimeAccess PatternData ChannelMobile ClientData NodeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.