The Experts below are selected from a list of 1413 Experts worldwide ranked by ideXlab platform
D.p. Agrawal - One of the best experts on this subject based on the ideXlab platform.
-
Performance analysis of a preemptive and priority reservation handoff scheme for integrated service-based wireless mobile networks
IEEE Transactions on Mobile Computing, 2003Co-Authors: Jingao Wang, Qing-an Zeng, D.p. AgrawalAbstract:We propose an analytical model for integrated real-time and non-real-time services in a wireless mobile network with priority reservation and preemptive priority handoff schemes. We categorize the service calls into four different types, namely, real-time and non-real-time service originating calls, and real-time and non real-time handoff service request calls. Accordingly, the channels in each cell are divided into three parts: one is for real-time service calls only, the second is for non-real-time service calls only, and the last one is for overflow of handoff requests that cannot be served in the first two parts. In the third group, several channels are reserved exclusively for real-time service handoffs so that higher priority can be given to them. In addition, a realtime service handoff request has the right to preempt non-real-time service in the preemptive priority handoff scheme if no free channels are available, while the interrupted non-real-time service call returns to its handoff request queue. The system is modeled using a multidimensional Markov chain and a numerical analysis is presented to estimate blocking probabilities of originating calls, forced Termination Probability, and average transmission delay. This scheme is also simulated under different call holding time and cell dwell time distributions. It is observed that the simulation results closely match the analytical model. Our scheme significantly reduces the forced Termination Probability of real-time service calls. The Probability of packet loss of non-real-time transmission is shown to be negligibly small, as a non-real-time service handoff request in waiting can be transferred from the queue of the current base station to another one.
-
Modeling and efficient handling of handoffs in integrated wireless mobile networks
IEEE Transactions on Vehicular Technology, 2002Co-Authors: Qing-an Zeng, D.p. AgrawalAbstract:We propose and analyze two handoff schemes without and with preemptive priority procedures for integrated wireless mobile networks. We categorize the service calls into four different types, namely, originating voice calls, originating data calls, voice handoff request calls, and data handoff request calls and we assume two separate queues for two handoff services. A number of channels in each cell are reserved exclusively for handoff request calls. Out of these channels, few are reserved exclusively for voice handoff request calls. The remaining channels are shared by both originating and handoff request calls. In the preemptive priority scheme, higher priority is given to voice handoff request calls over data handoff request calls and can preempt data service to the queue if, upon arrival, a voice handoff request finds no free channels. We model the system by a three-dimensional Markov chain and compute the system performance in terms of blocking Probability of originating calls, forced Termination Probability of voice handoff request calls, and average transmission delay of data calls. It is observed that forced Termination Probability of voice handoff request calls can be decreased by increasing the number of reserved channels. On the other hand, as a data handoff request can be transferred from a queue of one base station to another, there is no packet loss of data handoff except for a negligibly small blocking Probability.
-
Performance analysis of preemptive handoff scheme for integrated wireless mobile networks
GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2001Co-Authors: Jingao Wang, Qing-an Zeng, D.p. AgrawalAbstract:We propose and analyze a preemptive handoff scheme for an integrated real-time and non real-time service wireless mobile network. The total channels of each cell are divided into three parts, one is for real-time service calls only, the second is for non real-time service calls only, and the last one is for overflowed handoff requests that can not be served in the first two parts. Out of third part, a few channels are reserved exclusively for the real-time handoffs service. To give the real-time service handoff requests higher priority over non-real-time service handoff requests, the real-time service handoff request is allowed to preempt the non-real-time service call when it finds no channel available on its arrival. The interrupted non-real-time service call returns back to the non-real-time service handoff request queue. The system is modeled by a multi-dimensional Markov chain and a numerical analysis is presented to estimate blocking probabilities of originating calls, forced Termination Probability of real-time service handoff requests calls, and average transmission delay of non-real-time service calls. This scheme is also simulated using extensive runs and both results are observed to agree fairly well. It is seen that the forced Termination Probability of real-time service calls is significantly reduced with our scheme while the Probability of packet loss of non-real-time transmission is made to be negligibly small, as a non- real-time service handoff request can be transferred from the queue of current base station to another one.
-
Performance analysis of a handoff scheme in integrated voice/data wireless networks
Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152), 2000Co-Authors: Qing-an Zeng, D.p. AgrawalAbstract:A handoff scheme in integrated voice and data mobile cellular radio systems with priority reservation voice handoff procedure is proposed. A method of numerical analysis of the system performance is presented. Blocking probabilities of originating voice and data calls, voice and data handoff requests, forced Termination Probability of voice handoff requests, and average length of voice and data handoff requests are evaluated. Forced Termination Probability of voice handoff request calls can be decreased by increasing the number of reserved channels. There is no packet loss for data users except for the negligibly small blocking Probability because a data handoff request can be transferred from a queue of one base station to another.
Pengbo Si - One of the best experts on this subject based on the ideXlab platform.
-
GLOBECOM - Dynamic Spectrum Access with QoS Provisioning in Cognitive Radio Networks
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010Co-Authors: Chunyan An, Hong Ji, Pengbo SiAbstract:Dynamic spectrum access is one of the most important premises of spectrum reuse based on cognitive radio technologies, which are considered to be the best way to alleviate the controversy on spectrum scarcity and low efficiency. However, most of previous work focuses on the increasing of system throughput, ignoring the QoS requirement of secondary users. In this paper, dynamic spectrum access with QoS provisioning is studied. We adopt discrete-time Markov chain to analyze and model the spectrum usage in time-slotted cognitive radio networks. Furthermore, three admission control schemes are proposed to minimize the forced Termination Probability of secondary users. Simulation results show that our proposed schemes can significantly improve the forced Termination Probability of secondary users, though slightly increase the blocking Probability.
-
Dynamic Spectrum Access with QoS Provisioning in Cognitive Radio Networks
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010Co-Authors: Chunyan An, Hong Ji, Pengbo SiAbstract:Dynamic spectrum access is one of the most important premises of spectrum reuse based on cognitive radio technologies, which are considered to be the best way to alleviate the controversy on spectrum scarcity and low efficiency. However, most of previous work focuses on the increasing of system throughput, ignoring the QoS requirement of secondary users. In this paper, dynamic spectrum access with QoS provisioning is studied. We adopt discrete-time Markov chain to analyze and model the spectrum usage in time-slotted cognitive radio networks. Furthermore, three admission control schemes are proposed to minimize the forced Termination Probability of secondary users. Simulation results show that our proposed schemes can significantly improve the forced Termination Probability of secondary users, though slightly increase the blocking Probability.
Chenn-jung Huang - One of the best experts on this subject based on the ideXlab platform.
-
An adaptive bandwidth reservation scheme for 4G cellular networks using flexible 2-tier cell structure
Expert Systems With Applications, 2010Co-Authors: Chenn-jung Huang, Hung-yen Shen, Yi-ta ChuangAbstract:Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping Probability for handoffs in cellular communications. The handoff events occur at a much higher rate in packet-switched fourth generation mobile communication networks than in traditional cellular systems. An efficient bandwidth reservation mechanism for the neighboring cells is therefore critical in the process of handoff during the connection of multimedia calls to avoid the unwillingly forced Termination and waste of limited bandwidth in fourth generation mobile communication networks, particularly when the handoff traffic is heavy. In this paper, an adaptive two-tier scheme, which employs grey prediction theory and swarm intelligence techniques, is proposed to reduce the forced Termination Probability of multimedia handoffs. The simulation results show that the proposed scheme can achieve superior performance than the representative bandwidth-reserving schemes in the literature when performance metrics are measured in terms of the forced Termination Probability for the handoffs, the call blocking Probability for the new connections and bandwidth utilization.
-
Implementation of call admission control scheme in next generation mobile communication networks using particle swarm optimization and fuzzy logic systems
Expert Systems With Applications, 2008Co-Authors: Chenn-jung Huang, Yi-ta Chuang, Dian-xiu YangAbstract:In the present and next generation wireless networks, cellular system remains the major method of telecommunication infrastructure. Since the characteristic of the resource constraint, call admission control is required to address the limited resource problem in wireless network. The call dropping Probability and call blocking Probability are the major performance metrics for quality of service (QoS) in wireless network. Many call admission control mechanisms have been proposed in the literature to decrease connection dropping Probability for handoffs and new call blocking Probability in cellular communications. In this paper, we proposed an adaptive call admission control and bandwidth reservation scheme using fuzzy logic control concept to reduce the forced Termination Probability of multimedia handoffs. Meanwhile, we adopt particle swarm optimization (PSO) technique to adjust the parameters of the membership functions in the proposed fuzzy logic systems. The simulation results show that the proposed scheme can achieve satisfactory performance when performance metrics are measured in terms of the forced Termination Probability for the handoffs, the call blocking Probability for the new connections and bandwidth utilization.
-
Adaptive resource reservation schemes for proportional DiffServ enabled fourth-generation mobile communications system
Computer Communications, 2007Co-Authors: Chenn-jung Huang, Yi-ta Chuang, Chih-tai GuanAbstract:Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping Probability for handoffs in cellular communications. The handoff events occur at a much higher rate in packet-switched fourth generation mobile communication networks than in traditional cellular systems. An efficient bandwidth reservation mechanism for the neighboring cells is therefore critical in the process of handoff during the connection of multimedia calls to avoid the unwillingly forced Termination and waste of limited bandwidth in fourth generation mobile communication networks, particularly when the handoff traffic is heavy. In this paper, two self-adaptive bandwidth reservation schemes, which adopt support vector regression and swarm intelligence techniques, respectively, are proposed to reduce the forced Termination Probability of multimedia handoffs. Meanwhile, a proportional differentiated service model is incorporated into our schemes to accommodate new metrics used in processing handoffs in next generation networks. The simulation results show that both the proposed schemes can achieve superior performance than the representative bandwidth-reserving schemes in the literature when performance metrics are measured in terms of the forced Termination Probability for the handoffs, the call blocking Probability for the new connections and bandwidth utilization.
-
A Self-Adaptive Bandwidth Reservation Scheme for 4G Mobile WiMAX
2007 International Workshop on Cross Layer Design, 2007Co-Authors: Chenn-jung Huang, Yi-ta Chuang, Chih-tai Guan, Dian-xiu Yang, You-jia ChenAbstract:Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping Probability for handoffs in cellular communications. The handoff events occur at a much higher rate in packet-switched 4G mobile WiMAX networks than in traditional cellular systems. In this paper, a self-adaptive bandwidth reservation schemes, which adopts a probabilistic mobility prediction model to estimate the bandwidth required in neighboring cells, is proposed to reduce the forced Termination Probability of multimedia handoffs in 4G mobile WiMAX networks. Via cross-layer design, it exploits 4G mobile WiMAX advantages by using the bandwidth reservation. The simulation results show that the proposed scheme can achieve superior performance than the representative bandwidth-reserving schemes in the literature when performance metrics are measured in terms of the forced Termination Probability for the handoffs, the call blocking Probability for the new connections and bandwidth utilization.
-
Application of support vector machines to bandwidth reservation in sectored cellular communications
Engineering Applications of Artificial Intelligence, 2005Co-Authors: Chenn-jung HuangAbstract:Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping Probability for handoffs in cellular communications. The handoff events occur at a much higher rate in sectored cellular networks than in traditional cellular systems. An efficient bandwidth reservation mechanism for the neighboring cells is therefore critical in the process of handoff during the connection of multimedia calls to avoid the unwillingly forced Termination and waste of limited bandwidth in the sectored cellular communications, particularly when the handoff traffic is heavy. In this paper, a self-adaptive bandwidth reservation scheme, which adopts support vector machines technique, is proposed to reduce the forced Termination Probability. Meanwhile, a channel-borrowing technique is used to decrease the new call-blocking Probability of real-time traffic. The simulation results show that the proposed scheme can achieve superior performance than the representative bandwidth-reserving schemes in sectored cellular networks in the literature when performance metrics are measured in terms of the forced Termination Probability and the new call- blocking Probability.
Qing-an Zeng - One of the best experts on this subject based on the ideXlab platform.
-
Performance analysis of a preemptive and priority reservation handoff scheme for integrated service-based wireless mobile networks
IEEE Transactions on Mobile Computing, 2003Co-Authors: Jingao Wang, Qing-an Zeng, D.p. AgrawalAbstract:We propose an analytical model for integrated real-time and non-real-time services in a wireless mobile network with priority reservation and preemptive priority handoff schemes. We categorize the service calls into four different types, namely, real-time and non-real-time service originating calls, and real-time and non real-time handoff service request calls. Accordingly, the channels in each cell are divided into three parts: one is for real-time service calls only, the second is for non-real-time service calls only, and the last one is for overflow of handoff requests that cannot be served in the first two parts. In the third group, several channels are reserved exclusively for real-time service handoffs so that higher priority can be given to them. In addition, a realtime service handoff request has the right to preempt non-real-time service in the preemptive priority handoff scheme if no free channels are available, while the interrupted non-real-time service call returns to its handoff request queue. The system is modeled using a multidimensional Markov chain and a numerical analysis is presented to estimate blocking probabilities of originating calls, forced Termination Probability, and average transmission delay. This scheme is also simulated under different call holding time and cell dwell time distributions. It is observed that the simulation results closely match the analytical model. Our scheme significantly reduces the forced Termination Probability of real-time service calls. The Probability of packet loss of non-real-time transmission is shown to be negligibly small, as a non-real-time service handoff request in waiting can be transferred from the queue of the current base station to another one.
-
Modeling and efficient handling of handoffs in integrated wireless mobile networks
IEEE Transactions on Vehicular Technology, 2002Co-Authors: Qing-an Zeng, D.p. AgrawalAbstract:We propose and analyze two handoff schemes without and with preemptive priority procedures for integrated wireless mobile networks. We categorize the service calls into four different types, namely, originating voice calls, originating data calls, voice handoff request calls, and data handoff request calls and we assume two separate queues for two handoff services. A number of channels in each cell are reserved exclusively for handoff request calls. Out of these channels, few are reserved exclusively for voice handoff request calls. The remaining channels are shared by both originating and handoff request calls. In the preemptive priority scheme, higher priority is given to voice handoff request calls over data handoff request calls and can preempt data service to the queue if, upon arrival, a voice handoff request finds no free channels. We model the system by a three-dimensional Markov chain and compute the system performance in terms of blocking Probability of originating calls, forced Termination Probability of voice handoff request calls, and average transmission delay of data calls. It is observed that forced Termination Probability of voice handoff request calls can be decreased by increasing the number of reserved channels. On the other hand, as a data handoff request can be transferred from a queue of one base station to another, there is no packet loss of data handoff except for a negligibly small blocking Probability.
-
Performance analysis of preemptive handoff scheme for integrated wireless mobile networks
GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2001Co-Authors: Jingao Wang, Qing-an Zeng, D.p. AgrawalAbstract:We propose and analyze a preemptive handoff scheme for an integrated real-time and non real-time service wireless mobile network. The total channels of each cell are divided into three parts, one is for real-time service calls only, the second is for non real-time service calls only, and the last one is for overflowed handoff requests that can not be served in the first two parts. Out of third part, a few channels are reserved exclusively for the real-time handoffs service. To give the real-time service handoff requests higher priority over non-real-time service handoff requests, the real-time service handoff request is allowed to preempt the non-real-time service call when it finds no channel available on its arrival. The interrupted non-real-time service call returns back to the non-real-time service handoff request queue. The system is modeled by a multi-dimensional Markov chain and a numerical analysis is presented to estimate blocking probabilities of originating calls, forced Termination Probability of real-time service handoff requests calls, and average transmission delay of non-real-time service calls. This scheme is also simulated using extensive runs and both results are observed to agree fairly well. It is seen that the forced Termination Probability of real-time service calls is significantly reduced with our scheme while the Probability of packet loss of non-real-time transmission is made to be negligibly small, as a non- real-time service handoff request can be transferred from the queue of current base station to another one.
-
Performance analysis of a handoff scheme in integrated voice/data wireless networks
Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152), 2000Co-Authors: Qing-an Zeng, D.p. AgrawalAbstract:A handoff scheme in integrated voice and data mobile cellular radio systems with priority reservation voice handoff procedure is proposed. A method of numerical analysis of the system performance is presented. Blocking probabilities of originating voice and data calls, voice and data handoff requests, forced Termination Probability of voice handoff requests, and average length of voice and data handoff requests are evaluated. Forced Termination Probability of voice handoff request calls can be decreased by increasing the number of reserved channels. There is no packet loss for data users except for the negligibly small blocking Probability because a data handoff request can be transferred from a queue of one base station to another.
Chunyan An - One of the best experts on this subject based on the ideXlab platform.
-
GLOBECOM - Dynamic Spectrum Access with QoS Provisioning in Cognitive Radio Networks
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010Co-Authors: Chunyan An, Hong Ji, Pengbo SiAbstract:Dynamic spectrum access is one of the most important premises of spectrum reuse based on cognitive radio technologies, which are considered to be the best way to alleviate the controversy on spectrum scarcity and low efficiency. However, most of previous work focuses on the increasing of system throughput, ignoring the QoS requirement of secondary users. In this paper, dynamic spectrum access with QoS provisioning is studied. We adopt discrete-time Markov chain to analyze and model the spectrum usage in time-slotted cognitive radio networks. Furthermore, three admission control schemes are proposed to minimize the forced Termination Probability of secondary users. Simulation results show that our proposed schemes can significantly improve the forced Termination Probability of secondary users, though slightly increase the blocking Probability.
-
Dynamic Spectrum Access with QoS Provisioning in Cognitive Radio Networks
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010Co-Authors: Chunyan An, Hong Ji, Pengbo SiAbstract:Dynamic spectrum access is one of the most important premises of spectrum reuse based on cognitive radio technologies, which are considered to be the best way to alleviate the controversy on spectrum scarcity and low efficiency. However, most of previous work focuses on the increasing of system throughput, ignoring the QoS requirement of secondary users. In this paper, dynamic spectrum access with QoS provisioning is studied. We adopt discrete-time Markov chain to analyze and model the spectrum usage in time-slotted cognitive radio networks. Furthermore, three admission control schemes are proposed to minimize the forced Termination Probability of secondary users. Simulation results show that our proposed schemes can significantly improve the forced Termination Probability of secondary users, though slightly increase the blocking Probability.
