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.
The success of mobile and ubiquitous computing, coupled with the increasing demand for applications with high Quality of Service (QoS) and Quality of Experience (QoE) requirements, has brought great challenges to the future access networks. Thus, wireless mesh networks distinguish due to its flexibility, redundancy, low-cost and broadband capacity. However, aspects as scalability, availability and...
In this paper, we consider optimal dynamic spectrum management (DSM) for a downstream (DS) DSL scenario in which users are divided into a few separate groups, where vector encoding based signal coordination can be applied in each group and spectrum coordination is possible for all users. This can be seen as a mixed interference/broadcast channel (IF/BC) scenario. We investigate several candidates...
In OFDMA systems, chunk-based resource allocation is an effective approach to reduce the complexity of resource allocation by grouping a number of adjacent subcarriers into a chunk and allocating resources chunk by chunk. In this paper, chunk-based resource allocation is investigated in a multi-cell environment. To improve the spectral efficiency in the multi-cell system, fractional frequency reuse...
In conventional multicast scheme (CMS), the total throughput of multicast group is constrained by the user with the worst channel quality. In order to overcome this problem of limited throughput, we consider an opportunistic multicast scheduling (OMS) based on layered coding. A novel subcarrier and bit allocation algorithm is exploited for targeting the maximum throughput (MT) of a whole multicast...
This paper propose an optimal resource allocation algorithm by exploiting opportunistic multicast scheduling (OMS) scheme using layered coding combined with erasure correction coding for multicast services in the downlink of OFDMA-based single frequency networks (SFN). In this algorithm, we exploit unequal error protection (UEP) Reed-Solomon (RS) coding to compensate for possible data packet loss...
In this paper, a new resource allocation scheme to minimize Symbol Error rate (SER) for relay assisted cognitive radio networks is studied. A cognitive relay network with amplify-and-forward (AF) fixed gain relays and opportunistic access to the licensed spectrum is considered. The SER objective function and the optimization constraints are derived first. The resource allocation algorithm is then...
In this paper, we present some interesting issues of resource allocation in network virtualization. We also propose RAiNV, a resource allocation framework to handle those issues. Sharing of resources is in the heart of network virtualization. The key idea of network virtualization is to replace conventional Internet service provider (ISP) with two separate business entities: infrastructure providers...
In this paper, we investigate the interaction between two major technical challenges for LTE small cells deployment, in order to face the explosive increase of the traffic growth. These challenges are 1-Inter-Cell Interference Management which becomes critical in dense deployment of small cells and 2-Mobility Management since the handover frequency between close-by cells increases considerably. These...
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.