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.
In this paper, we propose a distributed adaptive interference coordination algorithm for a practical orthogonal frequency division multiple access (OFDMA)-based mobile cellular systems. The designed algorithm can achieve an efficient frequency reuse for any user distribution and traffic load. Since no a priori frequency planning is required, the minimal coordination between base stations is also achieved...
In this paper, we present a new power allocation algorithm called distributed inter-cell power allocation (DIPA) that improves the throughput-fairness trade-off without inter-BS coordination for multi-cell OFDMA systems in fast time-varying environment. In order to preclude the affection of instantaneous channel variation, the DIPA is designed to operate in large time scale (or super-frame) based...
In this paper, we propose the Nash bargaining solution for the interference problem in cellular networks. The base-stations of neighboring cells negotiate with each other to determine the best number of channels that should be allocated to their edge users. While cells optimize the allocated resources on a local level, the bargaining process acts as a common framework that combines the optimization...
In this paper, we propose a complete radio resource management procedure for best-effort (BE) service in OFDMA systems, which improves the system fairness with graceful throughput degradation compared to the derived analytical upper bound of the system throughput. By the proposed bandwidth and power allocation algorithms, the user in the worst channel environment has almost the same probability of...
In this paper, we consider an uplink multiservice networks employing Orthogonal Frequency Division Multiple Access (OFDMA) for WiMAX networks. Since the OFDMA physical resource available for scheduling is frame by frame, the uplink scheduler located at base station (BS) must efficiently allocate available resources to the subscriber stations (SSs) in response to constant or bursty data traffic on...
This paper addresses practical implementation issues of resource allocation in OFDM A networks: inaccuracy of channel state information (CSI) available to the resource allocation unit (RAU) and diversity of subscribers' quality of service (QoS) requirements. The resource allocation problem in the considered point-to-multipoint (PMP) network is modeled as a network utility maximization (NUM) problem...
In this paper we study the problem of subframe, subchannel and power allocation in OFDMA-based multihop relay networks. The system consists of a base station (BS), a number of relay stations (RS) and mobile stations (MS). We consider frame by frame scheduling, where the frame is divided into two subframes such as BS-RS and RS-MS subframes. We study two different problems, satisfying link rate requirements...
In this paper, a low-complexity SDMA-based greedy resource allocation (SGRA) algorithm is proposed for the uplink of IEEE 802.16 MIMO-OFDMA systems taking into account co-channel interference. The objective of SGRA is to allocate resources in the space-time-frequency domain in order to maximize system throughput while guaranteeing QoS requirements of real time services. By performing efficient interference...
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.