The Experts below are selected from a list of 11838 Experts worldwide ranked by ideXlab platform
Hsin-lung Su - One of the best experts on this subject based on the ideXlab platform.
-
Network controlled Cell Selection for the high speed downlink packet access in UMTS
2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733), 2004Co-Authors: A. Das, Krishna Balachandran, Ashwin Sampath, Hsin-lung SuAbstract:An expanded effort is underway to support the evolution of the UMTS standard to meet the rapidly developing needs associated with wireless Internet applications. The support of high speed downlink packet access (HSDPA) is provided by means of a new, shared channel called high speed downlink shared channel (HS-DSCH) which is enabled by a number of performance enhancing technologies such as adaptive modulation and coding (AMC), hybrid ARQ (HARQ), fat-pipe scheduling, fast Cell Selection (FCS) and multiple input multiple output (MIMO) antenna techniques. In this paper, the advantage of FCS is investigated. To avoid the difficulty in HARQ transmission-state synchronization, FCS is allowed only among the Cells (sectors) belonging to the same base station. Two FCS approaches are compared in this paper. The user controlled Cell Selection (UCCS) selects the serving Cell based only on the channel quality seen by the user. While a new-network controlled Cell Selection (NCCS) approach jointly considers channel quality and network loading. It is shown that FCS significantly improves the HSDPA performance at low mobility. Among the FCS schemes, NCCS is superior to UCCS when the load among the Cells in the active set is unbalanced.
A. Das - One of the best experts on this subject based on the ideXlab platform.
-
Network controlled Cell Selection for the high speed downlink packet access in UMTS
2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733), 2004Co-Authors: A. Das, Krishna Balachandran, Ashwin Sampath, Hsin-lung SuAbstract:An expanded effort is underway to support the evolution of the UMTS standard to meet the rapidly developing needs associated with wireless Internet applications. The support of high speed downlink packet access (HSDPA) is provided by means of a new, shared channel called high speed downlink shared channel (HS-DSCH) which is enabled by a number of performance enhancing technologies such as adaptive modulation and coding (AMC), hybrid ARQ (HARQ), fat-pipe scheduling, fast Cell Selection (FCS) and multiple input multiple output (MIMO) antenna techniques. In this paper, the advantage of FCS is investigated. To avoid the difficulty in HARQ transmission-state synchronization, FCS is allowed only among the Cells (sectors) belonging to the same base station. Two FCS approaches are compared in this paper. The user controlled Cell Selection (UCCS) selects the serving Cell based only on the channel quality seen by the user. While a new-network controlled Cell Selection (NCCS) approach jointly considers channel quality and network loading. It is shown that FCS significantly improves the HSDPA performance at low mobility. Among the FCS schemes, NCCS is superior to UCCS when the load among the Cells in the active set is unbalanced.
Xinping Guan - One of the best experts on this subject based on the ideXlab platform.
-
Matching-Based Cell Selection for Proportional Fair Throughput Boosting via Dual-Connectivity
2017 IEEE Wireless Communications and Networking Conference (WCNC), 2017Co-Authors: Bo Yang, Cailian Chen, Xinping GuanAbstract:In an increasingly dense and heterogeneous wireless network with various access points, the users are likely to lie in the overlapping coverage areas of multiple radio access technologies, which motivates the boost of user throughput and quality of service via small Cell dual-connectivity. In this paper, with the objective of improving network throughput and considering fairness among users, we formulate a small Cell Selection problem to maximize the network utility reflecting proportional fairness, which is actually the sum of the logarithm of long-term rate of users. However, the formulated problem turns out to be non-convex and combinatorial, and is difficult to be transformed into a convex problem and traditional game-theoretic methods cannot be used. In this context, we introduce a many-to-one matching game with externalities, and develop a distributed algorithm that converges to a stable matching. To further enhance network throughput by mitigating co- channel interference among Cellular small Cells, a joint Cell Selection and power control algorithm is developed by adopting an iterative approach to determine them separately and sequentially. Lastly, compared with the nearest distance-based Cell Selection scheme and the Cell Selection scheme maximizing the total long-term rate of users, numerical results show the convergence of the matching-based Cell Selection algorithm and the joint Cell Selection and power control algorithm, as well as their significant improvement on both total long-term rate of users and user fairness.
-
WCNC - Matching-Based Cell Selection for Proportional Fair Throughput Boosting via Dual-Connectivity
2017 IEEE Wireless Communications and Networking Conference (WCNC), 2017Co-Authors: Bo Yang, Cailian Chen, Xinping GuanAbstract:In an increasingly dense and heterogeneous wireless network with various access points, the users are likely to lie in the overlapping coverage areas of multiple radio access technologies, which motivates the boost of user throughput and quality of service via small Cell dual-connectivity. In this paper, with the objective of improving network throughput and considering fairness among users, we formulate a small Cell Selection problem to maximize the network utility reflecting proportional fairness, which is actually the sum of the logarithm of long-term rate of users. However, the formulated problem turns out to be non-convex and combinatorial, and is difficult to be transformed into a convex problem and traditional game-theoretic methods cannot be used. In this context, we introduce a many-to-one matching game with externalities, and develop a distributed algorithm that converges to a stable matching. To further enhance network throughput by mitigating co- channel interference among Cellular small Cells, a joint Cell Selection and power control algorithm is developed by adopting an iterative approach to determine them separately and sequentially. Lastly, compared with the nearest distance-based Cell Selection scheme and the Cell Selection scheme maximizing the total long-term rate of users, numerical results show the convergence of the matching-based Cell Selection algorithm and the joint Cell Selection and power control algorithm, as well as their significant improvement on both total long-term rate of users and user fairness.
Gabriel Scalosub - One of the best experts on this subject based on the ideXlab platform.
-
Cell Selection in 4G Cellular Networks
IEEE Transactions on Mobile Computing, 2013Co-Authors: David Amzallag, Reuven Bar-yehuda, Gabriel ScalosubAbstract:Cell Selection is the process of determining the Cell(s) that provide service to each mobile station. Optimizing these processes is an important step toward maximizing the utilization of current and future Cellular networks. We study the potential benefit of global Cell Selection versus the current local mobile SNR-based decision protocol. In particular, we study the new possibility available in OFDMA-based systems, such as IEEE 802.16m and LTE-Advanced, of satisfying the minimal demand of a mobile station simultaneously by more than one base station. We formalize the problem as an optimization problem, and show that in the general case this problem is not only NP-hard but also cannot be approximated within any reasonable factor. In contrast, under the very practical assumption that the maximum required bandwidth of a single mobile station is at most an r-fraction of the capacity of a base station, we present two different algorithms for Cell Selection. The first algorithm produces a (1-r)-approximate solution, where a mobile station can be covered simultaneously by more than one base station. The second algorithm produces a 1-r/2-r-approximate solution, while every mobile station is covered by at most one base station. We complete our study by an extensive simulation study demonstrating the benefits of using our algorithms in high-loaded capacity-constrained future 4G networks, compared to currently used methods. Specifically, our algorithms obtain up to 20 percent better usage of the network's capacity, in comparison with the current Cell Selection algorithms.
-
Cell Selection in 4G Cellular Networks
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications, 2008Co-Authors: David Amzallag, Reuven Bar-yehuda, Gabriel ScalosubAbstract:Cell Selection is the process of determining the Cells that provide service to each mobile station. Optimizing these processes is an important step towards maximizing the utilization of current and future Cellular networks. In this paper we study the potential benefit of global Cell Selection versus the current local mobile SNR-based decision protocol. In particular, we study the new possibility that is feasible in OFDMA-based systems, of satisfying the minimal demand of a mobile station simultaneously by more than one base station. We formalize the problem as an optimization problem, called the all-or-nothing demand maximization problem, and show that when the demand of a single mobile station can exceed the capacity of a base station, this problem is not only NP-hard but also cannot be approximated within any reasonable factor. In contrast, under the very practical assumption that the maximum required bandwidth of a single mobile station is at most an r-fraction of the capacity of a base station, we present two different algorithms for Cell Selection. The first algorithm guarantees a satisfaction of at least a 1- r r fraction of an optimal assignment, where a mobile station can be covered simultaneously by more than one base station. The second algorithm guarantees a satisfaction of at least a 1-r/1-r fraction of an optimal assignment, while every mobile station is covered by at most one base station. Using an extensive simulation study we show that the Cell Selections determined by our algorithms achieve a better utilization of high-loaded capacity-constrained future 4G networks than the current SNR- based scheme. Specifically, our algorithms are shown to obtain up to 20% better usage of the network's capacity, in comparison with the current Cell Selection algorithms.
-
INFOCOM - Cell Selection in 4G Cellular Networks
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications, 2008Co-Authors: David Amzallag, Reuven Bar-yehuda, Gabriel ScalosubAbstract:Cell Selection is the process of determining the Cells that provide service to each mobile station. Optimizing these processes is an important step towards maximizing the utilization of current and future Cellular networks. In this paper we study the potential benefit of global Cell Selection versus the current local mobile SNR-based decision protocol. In particular, we study the new possibility that is feasible in OFDMA-based systems, of satisfying the minimal demand of a mobile station simultaneously by more than one base station. We formalize the problem as an optimization problem, called the all-or-nothing demand maximization problem, and show that when the demand of a single mobile station can exceed the capacity of a base station, this problem is not only NP-hard but also cannot be approximated within any reasonable factor. In contrast, under the very practical assumption that the maximum required bandwidth of a single mobile station is at most an r-fraction of the capacity of a base station, we present two different algorithms for Cell Selection. The first algorithm guarantees a satisfaction of at least a 1- r r fraction of an optimal assignment, where a mobile station can be covered simultaneously by more than one base station. The second algorithm guarantees a satisfaction of at least a 1-r/1-r fraction of an optimal assignment, while every mobile station is covered by at most one base station. Using an extensive simulation study we show that the Cell Selections determined by our algorithms achieve a better utilization of high-loaded capacity-constrained future 4G networks than the current SNR- based scheme. Specifically, our algorithms are shown to obtain up to 20% better usage of the network's capacity, in comparison with the current Cell Selection algorithms.
Shawki E. Shaaban - One of the best experts on this subject based on the ideXlab platform.
-
Novel Cell Selection algorithm for improving average user's effective data rate in LTE HetNets
2014 IEEE Symposium on Computers and Communications (ISCC), 2014Co-Authors: Mohamed A. Aboulhassan, Essam A. Sourour, Shawki E. ShaabanAbstract:Cell Selection algorithms are considered one of crucial features in LTE-Heterogeneous Networks (HetNets). Due to different downlink transmit power levels and randomness deployment of femtoCells, achieving better user throughput and reducing the necessity of dynamic load balancing techniques require appropriate algorithms for selecting optimum serving Cell. In this work, a new Cell Selection algorithm is proposed to enable new user to select best serving Cell that achieves maximum effective achievable data rate. A new prediction algorithm is designed within the new proposed Cell Selection algorithm to predict the performance of Proportional Fair (PF) scheduling algorithm without running it after every Resource Block (RB), to calculate the expected degradation in theoretical new user's achievable data. The numerical results show that the new Cell Selection proposed algorithm achieves higher average Cell throughput than conventional Cell Selection methods and maintains better balanced load between different adjacent Cells.
-
ISCC - Novel Cell Selection algorithm for improving average user's effective data rate in LTE HetNets
2014 IEEE Symposium on Computers and Communications (ISCC), 2014Co-Authors: Mohamed A. Aboulhassan, Essam A. Sourour, Shawki E. ShaabanAbstract:Cell Selection algorithms are considered one of crucial features in LTE-Heterogeneous Networks (HetNets). Due to different downlink transmit power levels and randomness deployment of femtoCells, achieving better user throughput and reducing the necessity of dynamic load balancing techniques require appropriate algorithms for selecting optimum serving Cell. In this work, a new Cell Selection algorithm is proposed to enable new user to select best serving Cell that achieves maximum effective achievable data rate. A new prediction algorithm is designed within the new proposed Cell Selection algorithm to predict the performance of Proportional Fair (PF) scheduling algorithm without running it after every Resource Block (RB), to calculate the expected degradation in theoretical new user's achievable data. The numerical results show that the new Cell Selection proposed algorithm achieves higher average Cell throughput than conventional Cell Selection methods and maintains better balanced load between different adjacent Cells.
