The Experts below are selected from a list of 4977 Experts worldwide ranked by ideXlab platform
Radu Selea - One of the best experts on this subject based on the ideXlab platform.
-
Coordinated Scheduling for wireless backhaul networks with soft frequency reuse
European Signal Processing Conference, 2013Co-Authors: Hayssam Dahrouj, Taiwen Tang, Jerry Chow, Radu SeleaAbstract:Coordinated resource allocation is a topic of significant interest for emerging wireless networks. This paper proposes and examines the benefits of Coordinated Scheduling in soft frequency reuse (SFR) based systems. Consider the downlink of a 3-sector-per-cell SFR-based wireless backhaul network consisting of N access nodes (ANs), each serving K remote terminals (RTs) multiplexed across the K time/frequency zones, with frequency reuse one between the sectors. Assuming a fixed transmit power, the paper considers the resource allocation problem of optimally Scheduling each of the NK RTs to one of the NK power-zones, on a one-to-one basis, and in a Coordinated manner, as opposed to conventional systems which schedule the RTs one at a time in an unCoordinated way. The paper solves the problem using the auction method, which offers a close-to-global-optimal solution. The paper further proposes heuristic methods with lower computational complexity. Simulation results show that Coordinated Scheduling offers significant performance improvement as compared to non-Coordinated systems.
-
EUSIPCO - Coordinated Scheduling for wireless backhaul networks with soft frequency reuse
2013Co-Authors: Hayssam Dahrouj, Taiwen Tang, Jerry Chow, Radu SeleaAbstract:Coordinated resource allocation is a topic of significant interest for emerging wireless networks. This paper proposes and examines the benefits of Coordinated Scheduling in soft frequency reuse (SFR) based systems. Consider the downlink of a 3-sector-per-cell SFR-based wireless backhaul network consisting of N access nodes (ANs), each serving K remote terminals (RTs) multiplexed across the K time/frequency zones, with frequency reuse one between the sectors. Assuming a fixed transmit power, the paper considers the resource allocation problem of optimally Scheduling each of the NK RTs to one of the NK power-zones, on a one-to-one basis, and in a Coordinated manner, as opposed to conventional systems which schedule the RTs one at a time in an unCoordinated way. The paper solves the problem using the auction method, which offers a close-to-global-optimal solution. The paper further proposes heuristic methods with lower computational complexity. Simulation results show that Coordinated Scheduling offers significant performance improvement as compared to non-Coordinated systems.
Hayssam Dahrouj - One of the best experts on this subject based on the ideXlab platform.
-
Coordinated Scheduling and Power Control in Cloud-Radio Access Networks
IEEE Transactions on Wireless Communications, 2016Co-Authors: Ahmed Douik, Hayssam Dahrouj, Tareq Y. Al-naffouri, Mohamed-slim AlouiniAbstract:This paper addresses the joint Coordinated Scheduling and power control problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where the cloud is only responsible for the Scheduling policy, power control, and synchronization of the transmit frames across the single-antenna base-stations (BS). The transmit frame consists of several time/frequency blocks, called power-zones (PZs). The paper considers the problem of Scheduling users to PZs and determining their power levels (PLs), by maximizing the weighted sum-rate under the practical constraints that each user cannot be served by more than one base-station, but can be served by one or more power-zones within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the joint Scheduling and power control graph formed by several clusters, where each is formed by a set of vertices, representing the possible association of users, BSs, and PLs for one specific PZ. The problem is, then, formulated as a maximum-weight clique problem, in which the weight of each vertex is the sum of the benefits of the individual associations belonging to that vertex. Simulation results suggest that the proposed cross-layer scheme provides appreciable performance improvement as compared to schemes from recent literature.
-
ICC - Coordinated Scheduling for the downlink of cloud radio-access networks
2015 IEEE International Conference on Communications (ICC), 2015Co-Authors: Ahmed Douik, Hayssam Dahrouj, Tareq Y. Al-naffouri, Mohamed-slim AlouiniAbstract:This paper addresses the Coordinated Scheduling problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where the cloud is only responsible for the Scheduling policy and the synchronization of the transmit frames across the connected base-stations (BS). The transmitted frame of every BS consists of several time/frequency blocks, called power-zones (PZ), maintained at fixed transmit power. The paper considers the problem of Scheduling users to PZs and BSs in a Coordinated fashion across the network, by maximizing a network-wide utility under the practical constraint that each user cannot be served by more than one base-station, but can be served by one or more power-zones within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the Scheduling graph in which each vertex represents an association of users, PZs and BSs. The problem is formulated as a maximum weight clique, in which the weight of each vertex is the benefit of the association represented by that vertex. The paper further presents heuristic algorithms with low computational complexity. Simulation results show the performance of the proposed algorithms and suggest that the heuristics perform near optimal in low shadowing environments.
-
Coordinated Scheduling for the Downlink of Cloud Radio-Access Networks
arXiv: Information Theory, 2014Co-Authors: Ahmed Douik, Hayssam Dahrouj, Tareq Y. Al-naffouri, Mohamed-slim AlouiniAbstract:This paper addresses the Coordinated Scheduling problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (C-RAN), where the cloud is only responsible for the Scheduling policy and the synchronization of the transmit frames across the connected base-stations (BS). The transmitted frame of every BS consists of several time/frequency blocks, called power-zones (PZ), maintained at fixed transmit power. The paper considers the problem of Scheduling users to PZs and BSs in a Coordinated fashion across the network, by maximizing a network-wide utility under the practical constraint that each user cannot be served by more than one base-station, but can be served by one or more power-zone within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the Scheduling graph in which each vertex represents an association of users, PZs and BSs. The problem is formulated as a maximum weight clique, in which the weight of each vertex is the benefit of the association represented by that vertex. The paper further presents heuristic algorithms with low computational complexity. Simulation results show the performance of the proposed algorithms and suggest that the heuristics perform near optimal in low shadowing environments
-
Coordinated Scheduling for wireless backhaul networks with soft frequency reuse
European Signal Processing Conference, 2013Co-Authors: Hayssam Dahrouj, Taiwen Tang, Jerry Chow, Radu SeleaAbstract:Coordinated resource allocation is a topic of significant interest for emerging wireless networks. This paper proposes and examines the benefits of Coordinated Scheduling in soft frequency reuse (SFR) based systems. Consider the downlink of a 3-sector-per-cell SFR-based wireless backhaul network consisting of N access nodes (ANs), each serving K remote terminals (RTs) multiplexed across the K time/frequency zones, with frequency reuse one between the sectors. Assuming a fixed transmit power, the paper considers the resource allocation problem of optimally Scheduling each of the NK RTs to one of the NK power-zones, on a one-to-one basis, and in a Coordinated manner, as opposed to conventional systems which schedule the RTs one at a time in an unCoordinated way. The paper solves the problem using the auction method, which offers a close-to-global-optimal solution. The paper further proposes heuristic methods with lower computational complexity. Simulation results show that Coordinated Scheduling offers significant performance improvement as compared to non-Coordinated systems.
-
EUSIPCO - Coordinated Scheduling for wireless backhaul networks with soft frequency reuse
2013Co-Authors: Hayssam Dahrouj, Taiwen Tang, Jerry Chow, Radu SeleaAbstract:Coordinated resource allocation is a topic of significant interest for emerging wireless networks. This paper proposes and examines the benefits of Coordinated Scheduling in soft frequency reuse (SFR) based systems. Consider the downlink of a 3-sector-per-cell SFR-based wireless backhaul network consisting of N access nodes (ANs), each serving K remote terminals (RTs) multiplexed across the K time/frequency zones, with frequency reuse one between the sectors. Assuming a fixed transmit power, the paper considers the resource allocation problem of optimally Scheduling each of the NK RTs to one of the NK power-zones, on a one-to-one basis, and in a Coordinated manner, as opposed to conventional systems which schedule the RTs one at a time in an unCoordinated way. The paper solves the problem using the auction method, which offers a close-to-global-optimal solution. The paper further proposes heuristic methods with lower computational complexity. Simulation results show that Coordinated Scheduling offers significant performance improvement as compared to non-Coordinated systems.
Moein Parastegari - One of the best experts on this subject based on the ideXlab platform.
-
optimal stochastic Coordinated Scheduling of proton exchange membrane fuel cell combined heat and power wind and photovoltaic units in micro grids considering hydrogen storage
Applied Energy, 2017Co-Authors: Mosayeb Bornapour, Rahmatallah Hooshmand, Amin Khodabakhshian, Moein ParastegariAbstract:Abstract Nowadays, renewable energy sources and combined heat and power units are extremely used in micro grids, so it is necessary to schedule these units to improve the performance of the system. In this regard, a stochastic model is proposed in this paper to schedule proton exchange membrane fuel cell-combined heat and power, wind turbines, and photovoltaic units coordinately in a micro grid while considering hydrogen storage. Hydrogen storage strategy is considered for the operation of proton exchange membrane fuel cell-combined heat and power units. To consider stochastic generation of renewable energy source units in this paper, a scenario-based method is used. In this method, the uncertainties of electrical market price, the wind speed, and solar irradiance are considered. This stochastic Scheduling problem is a mixed integer- nonlinear programming which considers the proposed objective function and variables of Coordinated Scheduling of PEMFC-CHP, wind turbines and photovoltaic units. It also considers hydrogen storage strategy and converts it to a mixed integer nonlinear problem. In this study a modified firefly algorithm is used to solve the problem. This method is examined on modified 33-bus distributed network as a MG for its performance.
-
optimal Coordinated Scheduling of combined heat and power fuel cell wind and photovoltaic units in micro grids considering uncertainties
Energy, 2016Co-Authors: Mosayeb Bornapour, Rahmatallah Hooshmand, Amin Khodabakhshian, Moein ParastegariAbstract:Abstract In this paper, a stochastic model is proposed for Coordinated Scheduling of combined heat and power units in micro grid considering wind turbine and photovoltaic units. Uncertainties of electrical market price; the speed of wind and solar radiation are considered using a scenario-based method. In the method, scenarios are generated using roulette wheel mechanism based on probability distribution functions of input random variables. Using this method, the probabilistic specifics of the problem are distributed and the problem is converted to a deterministic one. The type of the objective function, Coordinated Scheduling of combined heat and power, wind turbine, and photovoltaic units change this problem to a mixed integer nonlinear one. Therefore to solve this problem modified particle swarm optimization algorithm is employed. The mentioned uncertainties lead to an increase in profit. Moreover, the optimal Coordinated Scheduling of renewable energy resources and thermal units in micro grids increase the total profit. In order to evaluate the performance of the proposed method, its performance is executed on modified 33 bus distributed system as a micro grid.
Stephen V. Hanly - One of the best experts on this subject based on the ideXlab platform.
-
Multicell Coordinated Scheduling With Multiuser Zero-Forcing Beamforming
IEEE Transactions on Wireless Communications, 2016Co-Authors: Min Li, Chunshan Liu, Iain B. Collings, Stephen V. Hanly, Philip WhitingAbstract:Coordinated Scheduling/beamforming (CS/CB) is a cost-effective Coordinated multipoint (CoMP) transmission paradigm that has been incorporated in the recent long-term evolution cellular standard. In this paper, we study CS/CB with the aim of developing low-complexity multicell Coordinated user Scheduling policies. We focus on a class of multicell interfering broadcast networks in which base stations have only local data and local channel state information, but each has sufficient antennas to serve multiple users using zero-forcing beamforming. The coordination problem is formulated as finding Scheduling decisions across the cells such that the network sum rate is maximized. Starting from the two-cell model, we uncover the structure for a good Scheduling decision, which in turn leads to the definition of two distributed Scheduling policies of differing complexity and intercell coordination. Asymptotic theoretical bounds on the average sum rate are derived to predict the performance of the policies proposed. We extend to some example networks containing more than two cells and develop network-wide coordination policies. Numerical results confirm the effectiveness of the proposed policies and shed light on practical Coordinated system design.
-
ICC - Multicell Coordinated Scheduling with Multiuser ZF Beamforming
2014 IEEE International Conference on Communications (ICC), 2014Co-Authors: Chunshan Liu, Iain B. Collings, Stephen V. HanlyAbstract:We investigate a Coordinated Scheduling problem in a two-cell network where in each cell, two users are scheduled for simultaneous communication. Zero-forcing (ZF) beamforming is employed at each base station to suppress both intra- and inter-cell interference. The Coordinated Scheduling/beamforming problem is formulated as finding proper Scheduling decisions and hence beamformers across the network such that a weighted sum-throughput is maximized. We propose three distributed Scheduling policies that only require local data and local channel state information at each cell, and consume much less computation and communication overhead than the global optimization approach via exhaustive search. The proposed policies illustrate the complexity-performance tradeoff for the Coordinated system. Nevertheless, numerical results show that at all levels of complexity, the proposed policies perform close to the global optimization approach with ZF beamforming and outperform the scheme with matched filtering beamforming even with global coordination.
-
ITW - Multicell Coordinated Scheduling with Multiuser ZF Beamforming: Policies and Performance Bounds
2014 IEEE Information Theory Workshop (ITW 2014), 2014Co-Authors: Iain B. Collings, Chunshan Liu, Stephen V. Hanly, Phil WhitingAbstract:We consider a Coordinated multiuser Scheduling problem for a multicell mutually interfering broadcast network. In particular, we focus on a two-cell cluster, where both base stations have only local data and local channel state information, but each has sufficient number of antennas to serve multiple homogeneous users under a full zero-forcing beamforming trans- mission. The Scheduling problem is formulated as finding proper scheduled users and hence beamformers across the cells such that the sum rate is maximized. We uncover the structure for a good Scheduling decision, which in turn motivates three distributed Coordinated Scheduling policies of different levels of complexity. For the simplest policy, we derive a lower bound on the expected achievable sum rate. It is shown in the large user population limit, the simplest policy suffices to preserve the best possible multiplexing gain and multiuser diversity gain for the model studied, but it does induce a pairing loss on the sum rate due to the limited coordination between cells. I. INTRODUCTION
Taiwen Tang - One of the best experts on this subject based on the ideXlab platform.
-
Coordinated Scheduling for wireless backhaul networks with soft frequency reuse
European Signal Processing Conference, 2013Co-Authors: Hayssam Dahrouj, Taiwen Tang, Jerry Chow, Radu SeleaAbstract:Coordinated resource allocation is a topic of significant interest for emerging wireless networks. This paper proposes and examines the benefits of Coordinated Scheduling in soft frequency reuse (SFR) based systems. Consider the downlink of a 3-sector-per-cell SFR-based wireless backhaul network consisting of N access nodes (ANs), each serving K remote terminals (RTs) multiplexed across the K time/frequency zones, with frequency reuse one between the sectors. Assuming a fixed transmit power, the paper considers the resource allocation problem of optimally Scheduling each of the NK RTs to one of the NK power-zones, on a one-to-one basis, and in a Coordinated manner, as opposed to conventional systems which schedule the RTs one at a time in an unCoordinated way. The paper solves the problem using the auction method, which offers a close-to-global-optimal solution. The paper further proposes heuristic methods with lower computational complexity. Simulation results show that Coordinated Scheduling offers significant performance improvement as compared to non-Coordinated systems.
-
EUSIPCO - Coordinated Scheduling for wireless backhaul networks with soft frequency reuse
2013Co-Authors: Hayssam Dahrouj, Taiwen Tang, Jerry Chow, Radu SeleaAbstract:Coordinated resource allocation is a topic of significant interest for emerging wireless networks. This paper proposes and examines the benefits of Coordinated Scheduling in soft frequency reuse (SFR) based systems. Consider the downlink of a 3-sector-per-cell SFR-based wireless backhaul network consisting of N access nodes (ANs), each serving K remote terminals (RTs) multiplexed across the K time/frequency zones, with frequency reuse one between the sectors. Assuming a fixed transmit power, the paper considers the resource allocation problem of optimally Scheduling each of the NK RTs to one of the NK power-zones, on a one-to-one basis, and in a Coordinated manner, as opposed to conventional systems which schedule the RTs one at a time in an unCoordinated way. The paper solves the problem using the auction method, which offers a close-to-global-optimal solution. The paper further proposes heuristic methods with lower computational complexity. Simulation results show that Coordinated Scheduling offers significant performance improvement as compared to non-Coordinated systems.