The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A novel coordinated scheduling algorithm for OFDM-based systems in multi-cell scenario is proposed in this paper. The studied algorithm based on the utility function is general for the downlink of networks. The algorithm coordinates the subcarrier assignment over the BS cluster. We first establish the framework for this inter-cell coordinated optimization problem through utility-based method. The...
In this paper, we focus on the subcarrier allocation in the uplink of long term evolution advanced (LTE-A) system assuming equal power allocation among subcarriers. Our goal is to maximize the priority-sum in the uplink considering the power limitation of User Equipment (UE). For the purpose, the method to determine the reallocated RBs set and the optimization procedures of reallocated RBs are proposed,...
Based on the fixed fairness algorithms, this paper considering the maximization of throughout in networks. Transforming the problem of allocation of bandwidth in centralized scheduling into a question of optimization of fairly allocate the rate, and then simplify it into linear programming problem. So an uplink fair alogrithms based on centralized scheduling is proposed. We use NS2 as the simulation...
With K-hop interference model, especially when K ≥ 2, the throughput-optimal centralized scheduler needs to solve a NP-Hard problem. It leads to the desire of a distributed, low-complexity but throughput-optimal scheduling algorithm. We generalize a randomized scheduling framework for a K-hop interference model and develop two randomized distributed scheduling algorithms which can be integrated into...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.