Data broadcasting with data item locality and client mobility

Existing broadcasting techniques prepare a data broadcast by appending individual information items together, and send the data broadcast to a common channel from which all the mobile clients download. These techniques, however, fail to elaborate on how to construct the network perimeter within which to send their broadcasts. It is conceivable that these techniques use one of the following approaches: 1. a single broadcast for the entire network is prepared (one-for-all), 2. an individual broadcast for each wireless cell is prepared (one-for-each). In this paper, we explore the performance of both approaches via simulations. Particularly when the data items have locality, i.e., the increased likelihood of being requested at certain geographical areas, we suspect that these approaches have little use. For example, the traffic on a busy intersection might be requested very frequently within 10 miles of that intersection, and is of very little interest to those travelling 100 miles from that area. Hence, with a broadcast protocol that does not consider locality of data items, many clients will receive irrelevant data items.