Voice-Centric LTE Femtocells and Improper Graph Colorings
Publikation: Forskning - peer review › Konferenceartikel i proceeding
Standard
Voice-Centric LTE Femtocells and Improper Graph Colorings. / Garcia, Luis Guilherme Uzeda; Pedersen, Klaus; Mogensen, Preben.
2012 IEEE 75th Vehicular Technology Conference (VTC Spring) . IEEE Press, 2012. s. 1-5 (I E E E V T S Vehicular Technology Conference. Proceedings).Publikation: Forskning - peer review › Konferenceartikel i proceeding
Harvard
APA
CBE
MLA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - Voice-Centric LTE Femtocells and Improper Graph Colorings
A1 - Garcia,Luis Guilherme Uzeda
A1 - Pedersen,Klaus
A1 - Mogensen,Preben
AU - Garcia,Luis Guilherme Uzeda
AU - Pedersen,Klaus
AU - Mogensen,Preben
PB - IEEE Press
PY - 2012/4
Y1 - 2012/4
N2 - This paper addresses carrier-based inter-cell interference coordination (CB-ICIC) among LTE femtocells operating on a single carrier. CB-ICIC is in many ways linked to the widely investigated dynamic channel assignment problem, which is often studied in the context of graph coloring. The investigation revolves around the sensible definition of the underlying graph, i.e. the network model, rather than focusing on the coloring algorithms and their properties. Ultimately, we posit that improper online graph-coloring suffices and is actually preferable. In short, settling for less-than-optimal configurations avoids uncontrolled service interruptions. Such disruptions tend to raise understandable concerns when it comes to fully autonomous selection of operational CCs. Our results dispel such concerns by showing that conservative methods can achieve most of the benefits of unrestricted off-line coloring algorithms with a very modest number (2-3) of CCs to choose from.
AB - This paper addresses carrier-based inter-cell interference coordination (CB-ICIC) among LTE femtocells operating on a single carrier. CB-ICIC is in many ways linked to the widely investigated dynamic channel assignment problem, which is often studied in the context of graph coloring. The investigation revolves around the sensible definition of the underlying graph, i.e. the network model, rather than focusing on the coloring algorithms and their properties. Ultimately, we posit that improper online graph-coloring suffices and is actually preferable. In short, settling for less-than-optimal configurations avoids uncontrolled service interruptions. Such disruptions tend to raise understandable concerns when it comes to fully autonomous selection of operational CCs. Our results dispel such concerns by showing that conservative methods can achieve most of the benefits of unrestricted off-line coloring algorithms with a very modest number (2-3) of CCs to choose from.
U2 - 10.1109/VETECS.2012.6240302
DO - 10.1109/VETECS.2012.6240302
SN - 978-1-4673-0989-9
BT - 2012 IEEE 75th Vehicular Technology Conference (VTC Spring)
T2 - 2012 IEEE 75th Vehicular Technology Conference (VTC Spring)
T3 - I E E E V T S Vehicular Technology Conference. Proceedings
T3 - en_GB
SP - 1
EP - 5
ER -