Abstract
This paper considers a communication problem in a closed area, such as stock market, sport stadium, or showroom, where people may move around and dynamically request for a piece of data. PDAs or hand-held PCs downloading the data through wireless networks is a promising solution to such scenarios. One naive solution is to allocate dor each request a seperate channel, but this will require a lot of channels if the demand is high. One way to relieve this problem is to adjust the speeds that moblie hosts receive data point, onr of them can be handoff to listen to the channel of the other. In this way, the channel of the former mobile host can be released. However, this should be done only if the presprcified QoS requirement is not violated. In this paper, we develop three such channel-combine strategies, called Binary, Shortest-Distance-First, and Partition. Simulation and experimental results are also presented.