Providing multimedia services with a quality-of-service guarantee in mobile wireless networks presents more challenges due to user's mobility and limited bandwidth resource. In order to provide seamless multimedia services in the next-generation wireless networks, efficient call admission control algorithm must be developed. A novel borrowing-based call admission control policy is proposed in this paper as a solution to support quality-of-service guarantees in the mobile multimedia wireless networks. Based on the existing network conditions, the proposed scheme makes an adaptive decision for bandwidth allocation and call admission by employing attribute-measurement mechanism, dynamic time interval reservation strategy, and service-based borrowing strategy in each base station. We use the dynamically adaptive approaches to reduce the connection-blocking probability and connection-dropping probability, and to increase the bandwidth utilization, while the quality-of-service guarantees can be maintained at a comfortable level for mobile multimedia wireless networks. Extensive simulation results show that our proposed scheme outperforms the previously proposed scheme in terms of connection-blocking probability, connection-dropping probability, and bandwidth utilization, while providing highly satisfying degree of quality-of-service in mobile communication systems.

Next generation wireless networks are expected to support multimedia applications (audio phone, video on demand, video conference, file transfer, etc.). Multimedia applications make a great demand for bandwidth and impose stringent quality of service (QoS) requirements on the wireless networks. In order to provide mobile hosts with high QoS, efficient and better bandwidth reservation is necessary in multimedia wireless networks. This paper presents a novel hybrid dynamic-grouping bandwidth reservation scheme to support QoS guarantees in the next generation wireless networks. The proposed scheme is based on probabilistic resource estimation to provide QoS guarantees for multimedia traffic in cellular networks. We establish several reservation time-sections, called groups, according to the mobility information of mobile hosts (MHs) of each base station (BS). The amount of reserved bandwidth for each BS is dynamically adjusted for each reservation group. We use the hybrid dynamic-grouping bandwidth reservation scheme to decrease the connection-dropping probability (CDP) and connection-blocking probability (CBP), while increasing the bandwidth utilization. The simulation results show that the hybrid dynamic-grouping bandwidth reservation scheme provides less CDP and less CBP, and achieves high bandwidth utilization.

Future mobile communication systems are expected to support multimedia applications (audio phone, video on demand, video conference, file transfer, etc.). Multimedia applications make a great demand for bandwidth and impose stringent quality of service requirements on the mobile wireless networks. In order to provide mobile hosts with high quality of service in the next generation mobile multimedia wireless networks, efficient and better bandwidth reservation schemes must be developed. A novel traffic-based bandwidth reservation scheme is proposed in this paper as a solution to support quality of service guarantees in the mobile multimedia wireless networks. Based on the existing network conditions, the proposed scheme makes an adaptive decision for bandwidth reservation and call admission by employing fuzzy inference mechanism, timing based reservation strategy, and round-borrowing strategy in each base station. The amount of reserved bandwidth for each base station is dynamically adjusted, according to the on-line traffic information of each base station. We use the dynamically adaptive approach to reduce the connection-blocking probability and connection-dropping probability, while increasing the bandwidth utilization for quality of service sensitive mobile multimedia wireless networks. Simulation results show that our traffic-based bandwidth reservation scheme outperforms the previously known schemes in terms of connection-blocking probability, connection-dropping probability, and bandwidth utilization.