ETD

Archivio digitale delle tesi discusse presso l'Università di Pisa

Tesi etd-04142014-141934


Tipo di tesi
Tesi di laurea magistrale
Autore
DONATI, ALESSANDRO
URN
etd-04142014-141934
Titolo
Energy Efficient Link Scheduler For Multi-hop Backhauling in LTE Advanced Networks
Dipartimento
INGEGNERIA DELL'INFORMAZIONE
Corso di studi
INGEGNERIA INFORMATICA
Relatori
relatore Dott. Stea, Giovanni
relatore Prof. Mingozzi, Enzo
relatore Ing. Virdis, Antonio
Parole chiave
  • LTE-Advanced
  • wireless backhauling
  • multi-hop
  • out-band
Data inizio appello
08/05/2014
Consultabilità
Completa
Riassunto
3GPP LTE-Advanced, the evolution of LTE release 8, represents the next generation technology for wireless mobile networks. Wireless backhauling, whereby usually smaller cells use the wireless links as a coordinated backhaul technology in lieu of wired connection, is one of the key technology enhancements in LTE-Advanced to fulfill the performance requirements and to improve the user experience.
Two modes have been envisaged for this technology: the in-band mode, considered in most studies, is the focus of the current 3GPP LTE-Advanced specification. In the latter, transmission to cellular users take place using the same resources as backhauling. However, with evolution of cellular systems, a multi-carrier option is expected to be available. This enables implementation of the out-band operation mode, in an operator controlled spectrum, according to which the time/frequency resources used for cellular transmission and backhauling are separate.
In any case, backhaling transmissions must be scheduled in order to avoid interference. In this work, we present an energy-efficient link scheduler for out-of-band multi-hop wireless backhauling, with three objectives: first, to be able to carry a required load at each node. Second, to reduce the power consumed by the nodes during transmission and enable coverage extension. Third, to increase network reliability by allowing for fast rerouting of traffic demands in case of a node/link failure.
We study the problem from three complementary points of view: the planning one, for which we provide tools that allow a planner to compute worst-case link quality given the phyisical layout of the network. second, the (long-term) link-scheduling one, for which we provide an optimal algorithm to route demands that keeps into account power consumption and avoids unreliable nodes as much as possible. Third,
we propose a recovery algorithm that is able to reroute demands in the presence of a failure, at a lower computation cost than recomputing the whole link schedule.
File