1-3hit |
Haw-Yun SHIN Jean-Lien C. WU Wei-Yeh CHEN
This paper investigates the performance of an integrated voice/data wireless mobile network where a finite buffer is provided for voice calls since they can endure a tolerable time, or the reneging time, for service. Based on a given humanistic reneging time, we analyze the voice traffic blocking probability. The probability distribution of receiving service within the reneging time is obtained for each buffered voice call and based on this result, an appropriate amount of voice buffer is obtained. To alleviate the impact on data blocking probability caused by the voice buffer and to enhance the efficiency of data service, a dynamic multi-channel allocation scheme with channel de-allocation and guard channels is proposed for data traffic. Compared with the conventional method where the system adopts a single-channel allocation scheme without guard channel for data users, the proposed scheme shows significant improvement in data blocking probability, throughput and the mean service time. Furthermore, a system with an appropriate size of buffer for voice traffic can receive good improvement in voice blocking probability.
Power saving is an important issue in the mobile computing environment. In this paper, we propose a broadcast mechanism that constructs the broadcast channels according to the access frequency of each type of message in order to save power in mobile stations. The pinwheel scheduling algorithm presented in this paper is used to organize all types of messages in the broadcast channels in the most symmetrical distribution in order to reduce both the tuning and access time. The multichannel broadcast mechanism is also discussed for use when the number of message types increases. The performance of the proposed mechanism is analyzed, and the improvement over existing methods is demonstrated numerically. The results show that the proposed mechanism is capable improving both the tuning and access time due to the presence of skewness in the access distribution among the disseminated messages. When the number of message types increase, both the tuning and access time can be further improved as long as a small number of broadcast channels are added.
Haw-Yun SHIN Jean-Lien C. WU Hung-Huan LIU
This paper proposes an analytical model to demonstrate the benefit of data service in wireless networks using dynamic multi-channel scheme with channel de-allocation. The performance of a system providing buffers to voice calls to reduce the raised voice blocking probability caused by data contention is investigated. The effect of the cell dwell time and overlap area with adjacent cells on system performance are studied. All free channels are allocated to data users dynamically. For those data users using more than one channel, channels would be de-allocated for new requests, voice or data. Buffers are provided for voice calls to reduce the voice blocking probability caused by data packets contention. Handoff calls are given priority to be queued in the front of the buffer instead of providing guard channels to reduce their dropping probability. Meanwhile, the reneging time for new calls and the handoff dwell time for handoff calls are considered in our analysis to obtain an appropriate amount of buffer to voice. To compensate the blocking probability in data, guard channels are provided for data traffic. Numerical results show that the dynamic multi-channel scheme with possible de-allocation, compared with the single channel scheme, can enhance data traffic performance significantly in terms of the mean transmission time and blocking probability. A system providing an appropriate amount of buffer to voice traffic and giving priority to queued handoff calls can indeed reduce new call blocking probability and handoff call dropping probability. In addition, the proposed scheme can reduce the incomplete transmission probability of data packets.