Study of Air Ordering Procedure for Information Broadcasting

Abstract

Wireless data broadcasting is a new way to share public information with many mobile users. To measure how well these systems work, we look at two main things: how long it takes to access the information (access latency) and how long the device has to stay active (tuning time). Indexing technology helps reduce tuning time by letting devices find information quickly and then switch to a low-power mode while waiting. Different indexing methods work better or worse, so comparing them can be hard. In this paper, I look at and compare some popular indexing methods for wireless data broadcasting, such as distributed index, exponential index, hash table, and Huffman tree index. I use probability theory to analyze how each method performs.

DOI: https://doi.org/10.52783/tjjpt.v45.i02.6393