602 research outputs found
Dynamic Time-domain Duplexing for Self-backhauled Millimeter Wave Cellular Networks
Millimeter wave (mmW) bands between 30 and 300 GHz have attracted
considerable attention for next-generation cellular networks due to vast
quantities of available spectrum and the possibility of very high-dimensional
antenna ar-rays. However, a key issue in these systems is range: mmW signals
are extremely vulnerable to shadowing and poor high-frequency propagation.
Multi-hop relaying is therefore a natural technology for such systems to
improve cell range and cell edge rates without the addition of wired access
points. This paper studies the problem of scheduling for a simple
infrastructure cellular relay system where communication between wired base
stations and User Equipment follow a hierarchical tree structure through fixed
relay nodes. Such a systems builds naturally on existing cellular mmW backhaul
by adding mmW in the access links. A key feature of the proposed system is that
TDD duplexing selections can be made on a link-by-link basis due to directional
isolation from other links. We devise an efficient, greedy algorithm for
centralized scheduling that maximizes network utility by jointly optimizing the
duplexing schedule and resources allocation for dense, relay-enhanced OFDMA/TDD
mmW networks. The proposed algorithm can dynamically adapt to loading, channel
conditions and traffic demands. Significant throughput gains and improved
resource utilization offered by our algorithm over the static,
globally-synchronized TDD patterns are demonstrated through simulations based
on empirically-derived channel models at 28 GHz.Comment: IEEE Workshop on Next Generation Backhaul/Fronthaul Networks -
BackNets 201
Analysis Framework for Opportunistic Spectrum OFDMA and its Application to the IEEE 802.22 Standard
We present an analytical model that enables throughput evaluation of
Opportunistic Spectrum Orthogonal Frequency Division Multiple Access (OS-OFDMA)
networks. The core feature of the model, based on a discrete time Markov chain,
is the consideration of different channel and subchannel allocation strategies
under different Primary and Secondary user types, traffic and priority levels.
The analytical model also assesses the impact of different spectrum sensing
strategies on the throughput of OS-OFDMA network. The analysis applies to the
IEEE 802.22 standard, to evaluate the impact of two-stage spectrum sensing
strategy and varying temporal activity of wireless microphones on the IEEE
802.22 throughput. Our study suggests that OS-OFDMA with subchannel notching
and channel bonding could provide almost ten times higher throughput compared
with the design without those options, when the activity and density of
wireless microphones is very high. Furthermore, we confirm that OS-OFDMA
implementation without subchannel notching, used in the IEEE 802.22, is able to
support real-time and non-real-time quality of service classes, provided that
wireless microphones temporal activity is moderate (with approximately one
wireless microphone per 3,000 inhabitants with light urban population density
and short duty cycles). Finally, two-stage spectrum sensing option improves
OS-OFDMA throughput, provided that the length of spectrum sensing at every
stage is optimized using our model
Adaptive radio resource management schemes for the downlink of the OFDMA-based wireless communication systems
Includes bibliographical references.Due to its superior characteristics that make it suitable for high speed mobile wireless systems OFDMA has been adopted by next generation broadband wireless standards including Worldwide Interoperability for Microwave Access (WiMAX) and Long Term Evolution – Advanced (LTE-A). Intelligent and adaptive Radio Resource Management (RRM) schemes are a fundamental tool in the design of wireless systems to be able to fully and efficiently utilize the available scarce resources and be able to meet the user data rates and QoS requirements. Previous works were only concerned with maximizing system efficiency and thus used opportunistic algorithms that allocate resources to users with the best opportunities to optimize system capacity. Thus, only those users with good channel conditions were considered for resource allocation and users in bad channel conditions were left out to starve of resources. The main objective of our study is to design adaptive radio resource allocation (RRA) algorithms that distribute the scarce resources more fairly among network users while efficiently using the resources to maximize system throughput. Four scheduling algorithms have been formulated and analysed based on fairness, throughputs and delay. This was done for users demanding different services and QoS requirements. Two of the scheduling algorithms, Maximum Sum Rate (MSR) and Round Robin (RR) are used respectively, as references to analyze throughput and fairness among network users. The other two algorithms are Proportional Fair Scheduling (PFS) and Margin Adaptive Scheduling Scheme (MASS)
Multicast Scheduling and Resource Allocation Algorithms for OFDMA-Based Systems: A Survey
Multicasting is emerging as an enabling technology
for multimedia transmissions over wireless networks to support several groups of users with flexible quality of service (QoS)requirements. Although multicast has huge potential to push the limits of next generation communication systems; it is however one of the most challenging issues currently being addressed. In this survey, we explain multicast group formation and various
forms of group rate determination approaches. We also provide a systematic review of recent channel-aware multicast scheduling and resource allocation (MSRA) techniques proposed for downlink multicast services in OFDMA based systems. We study these enabling algorithms, evaluate their core characteristics, limitations and classify them using multidimensional matrix. We cohesively review the algorithms in terms of their throughput maximization, fairness considerations, performance complexities,
multi-antenna support, optimality and simplifying assumptions. We discuss existing standards employing multicasting and further highlight some potential research opportunities in multicast systems
Improving broadcast channel rate using hierarchical modulation
We investigate the design of a broadcast system where the aim is to maximise
the throughput. This task is usually challenging due to the channel
variability. Modern satellite communications systems such as DVB-SH and DVB-S2
mainly rely on time sharing strategy to optimize throughput. They consider
hierarchical modulation but only for unequal error protection or backward
compatibility purposes. We propose in this article to combine time sharing and
hierarchical modulation together and show how this scheme can improve the
performance in terms of available rate. We present the gain on a simple channel
modeling the broadcasting area of a satellite. Our work is applied to the
DVB-SH standard, which considers hierarchical modulation as an optional
feature.Comment: 5 pages, submitte
Contribution to resource management in cellular access networks with limited backhaul capacity
La interfaz radio de los sistemas de comunicaciones móviles es normalmente considerada como
la única limitación de capacidad en la red de acceso radio. Sin embargo, a medida que se van
desplegando nuevas y más eficientes interfaces radio, y de que el tráfico de datos y multimedia va
en aumento, existe la creciente preocupación de que la infraestructura de transporte (backhaul) de
la red celular pueda convertirse en el cuello de botella en algunos escenarios. En este contexto, la
tesis se centra en el desarrollo de técnicas de gestión de recursos que consideran de manera
conjunta la gestión de recursos en la interfaz radio y el backhaul. Esto conduce a un nuevo
paradigma donde los recursos del backhaul se consideran no sólo en la etapa de dimensionamiento,
sino que además son incluidos en la problemática de gestión de recursos.
Sobre esta base, el primer objetivo de la tesis consiste en evaluar los requerimientos de
capacidad en las redes de acceso radio que usan IP como tecnología de transporte, de acuerdo a las
recientes tendencias de la arquitectura de red. En particular, se analiza el impacto que tiene una
solución de transporte basada en IP sobre la capacidad de transporte necesaria para satisfacer los
requisitos de calidad de servicio en la red de acceso. La evaluación se realiza en el contexto de la
red de acceso radio de UMTS, donde se proporciona una caracterización detallada de la interfaz
Iub. El análisis de requerimientos de capacidad se lleva a cabo para dos diferentes escenarios:
canales dedicados y canales de alta velocidad. Posteriormente, con el objetivo de aprovechar
totalmente los recursos disponibles en el acceso radio y el backhaul, esta tesis propone un marco de
gestión conjunta de recursos donde la idea principal consiste en incorporar las métricas de la red de
transporte dentro del problema de gestión de recursos. A fin de evaluar los beneficios del marco de
gestión de recursos propuesto, esta tesis se centra en la evaluación del problema de asignación de
base, como estrategia para distribuir el tráfico entre las estaciones base en función de los niveles de
carga tanto en la interfaz radio como en el backhaul. Este problema se analiza inicialmente
considerando una red de acceso radio genérica, mediante la definición de un modelo analítico
basado en cadenas de Markov. Dicho modelo permite calcular la ganancia de capacidad que puede
alcanzar la estrategia de asignación de base propuesta. Posteriormente, el análisis de la estrategia
propuesta se extiende considerando tecnologías específicas de acceso radio. En particular, en el
contexto de redes WCDMA se desarrolla un algoritmo de asignación de base basado en simulatedannealing
cuyo objetivo es maximizar una función de utilidad que refleja el grado de satisfacción
de las asignaciones respecto los recursos radio y transporte. Finalmente, esta tesis aborda el diseño
y evaluación de un algoritmo de asignación de base para los futuros sistemas de banda ancha
basados en OFDMA. En este caso, el problema de asignación de base se modela como un problema
de optimización mediante el uso de un marco de funciones de utilidad y funciones de coste de
recursos. El problema planteado, que considera que existen restricciones de recursos tanto en la
interfaz radio como en el backhaul, es mapeado a un problema de optimización conocido como
Multiple-Choice Multidimensional Knapsack Problem (MMKP). Posteriormente, se desarrolla un
algoritmo de asignación de base heurístico, el cual es evaluado y comparado con esquemas de
asignación basados exclusivamente en criterios radio. El algoritmo concebido se basa en el uso de
los multiplicadores de Lagrange y está diseñado para aprovechar de manera simultánea el balanceo
de carga en la intefaz radio y el backhaul.Postprint (published version
- …