A continual tree algorithm for integrated voice/data wireless networks
Noboru Iida, Takashi Watanabe, You Ueno, Tadanori Mizuno · 2002
This paper proposes a continual tree algorithm for integrated voice/data wireless networks. The continual tree algorithm (CTA) is a new kind of reservation scheme and uses an improved continual tree algorithm to reserve slots of a channel. And based on a CTA a multimedia wireless multiple access (MWMA) is discussed. In addition to pretty good channel efficiency of a reservation scheme due to CTA, MWMA has the following three futures. 1. A tree algorithm is stable, but the contention period to reserve slots of a channel is variable in length. So they are not suitable to transmit real-time data. Improving a tree algorithm and applying it to a fixed length frame of a channel, MWMA can transmit both real-time data and non-real-time data using a common channel. 2. A fixed length frame suffers from a large average delay under low traffic. MWMA divides a frame into small frames so that real-time data is communicated with short delays. 3. The center station controls reservations centrally using verbose slots. By this centralized scheme, MWMA mitigates energy limitations of user's mobile terminals, a problem of coming and going of many terminals not given to the network, and a hidden terminal problem.