On the Multihop Relays with Multiple Antennas for LTE-A

In this paper we analyze cooperative communications for broadcast/multicast wireless communication systems based on the LTE-A standard. Multihop relays utilizing the same frequency bands as the base station are considered. These relays are equipped with multiples antennas (MIMO), at least the double of those employed at the base station side. The simulation results show that multihop relays achieve an improvement of power efficiency, while keeping the average coverage and the overall network throughput unchanged. This can be viewed as an energy-efficient wireless transmission technique, which contributes to the implementation of the green cell networks concept, as it allows a reduction in the carbon emission footprint

Resource Tuned Optimal Random Network Coding for Single Hop Multicast future 5G Networks

Optimal random network coding is reduced complexity in computation of coding coefficients, computation of encoded packets and coefficients are such that minimal transmission bandwidth is enough to transmit coding coefficient to the destinations and decoding process can be carried out as soon as encoded packets are started being received at the destination and decoding process has lower computational complexity. But in traditional random network coding, decoding process is possible only after receiving all encoded packets at receiving nodes. Optimal random network coding also reduces the cost of computation. In this research work, coding coefficient matrix size is determined by the size of layers which defines the number of symbols or packets being involved in coding process. Coding coefficient matrix elements are defined such that it has minimal operations of addition and multiplication during coding and decoding process reducing computational complexity by introducing sparseness in coding coefficients and partial decoding is also possible with the given coding coefficient matrix with systematic sparseness in coding coefficients resulting lower triangular coding coefficients matrix. For the optimal utility of computational resources, depending upon the computational resources unoccupied such as memory available resources budget tuned windowing size is used to define the size of the coefficient matrix

Resource Tuned Optimal Random Network Coding for Single Hop Multicast future 5G Networks

Optimal random network coding is reduced complexity in computation of coding coefficients, computation of encoded packets and coefficients are such that minimal transmission bandwidth is enough to transmit coding coefficient to the destinations and decoding process can be carried out as soon as encoded packets are started being received at the destination and decoding process has lower computational complexity. But in traditional random network coding, decoding process is possible only after receiving all encoded packets at receiving nodes. Optimal random network coding also reduces the cost of computation. In this research work, coding coefficient matrix size is determined by the size of layers which defines the number of symbols or packets being involved in coding process. Coding coefficient matrix elements are defined such that it has minimal operations of addition and multiplication during coding and decoding process reducing computational complexity by introducing sparseness in coding coefficients and partial decoding is also possible with the given coding coefficient matrix with systematic sparseness in coding coefficients resulting lower triangular coding coefficients matrix. For the optimal utility of computational resources, depending upon the computational resources unoccupied such as memory available resources budget tuned windowing size is used to define the size of the coefficient matrix

Analysis and optimization of sparse random linear network coding for reliable multicast services

Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different Random Linear Network Coding (RLNC) techniques. We deal with a fundamental problem: the computational complexity of the RLNC decoder. The higher the number of decoding operations is, the more the user’s computational overhead grows and, consequently, the faster the battery of mobile devices drains. By referring to several sparse RLNC techniques, and without any assumption on the implementation of the RLNC decoder in use, we provide an efficient way to characterise the performance of users targeted by ultra-reliable layered multicast services. The proposed modelling allows to efficiently derive the average number of coded packet transmissions needed to recover one or more service layers. We design a convex resource allocation framework that allows to minimise the complexity of the RLNC decoder by jointly optimising the transmission parameters and the sparsity of the code. The designed optimisation framework also ensures service guarantees to predetermined fractions of users. The performance of the proposed optimisation framework is then investigated in a LTE-A eMBMS network multicasting H.264/SVC video services

Distribuição de vídeo para grupos de utilizadores em redes móveis heterogéneas19

The evolutions veri ed in mobile devices capabilities (storage capacity, screen resolution, processor, etc.) over the last years led to a signi cant change in mobile user behavior, with the consumption and creation of multimedia content becoming more common, in particular video tra c. Consequently, mobile operator networks, despite being the target of architectural evolutions and improvements over several parameters (such as capacity, transmission and reception performance, amongst others), also increasingly become more frequently challenged by performance aspects associated to the nature of video tra c, whether by the demanding requirements associated to that service, or by its volume increase in such networks. This Thesis proposes modi cations to the mobile architecture towards a more e cient video broadcasting, de ning and developing mechanisms applicable to the network, or to the mobile terminal. Particularly, heterogeneous networks multicast IP mobility supported scenarios are focused, emphasizing their application over di erent access technologies. The suggested changes are applicable to mobile or static user scenarios, whether it performs the role of receiver or source of the video tra c. Similarly, the de ned mechanisms propose solutions targeting operators with di erent video broadcasting goals, or whose networks have di erent characteristics. The pursued methodology combined an experimental evaluation executed over physical testbeds, with the mathematical evaluation using network simulation, allowing the veri cation of its impact on the optimization of video reception in mobile terminalsA evolução veri cada nas características dos dispositivos moveis (capacidade de armazenamento, resolução do ecrã, processador, etc.) durante os últimos anos levou a uma alteração signi cativa nos comportamentos dos utilizadores, sendo agora comum o consumo e produção de conteúdos multimédia envolvendo terminais móveis, em particular o tráfego vídeo. Consequentemente, as redes de operador móvel, embora tendo também sido alvo constante de evoluções arquitecturais e melhorias em vários parâmetros (tais como capacidade, ritmo de transmissão/recepção, entre outros), vêemse cada vez mais frequentemente desa adas por aspectos de desempenho associados à natureza do tráfego de vídeo, seja pela exigência de requisitos associados a esse serviço, quer pelo aumento do volume do mesmo nesse tipo de redes. Esta Tese propôe alterações à arquitetura móvel para a disseminação de vídeo mais e ciente, de nindo e desenvolvendo mecanismos aplicáveis à rede, ou ao utilizador móvel. Em particular, são focados cenários suportados por IP multicast em redes móveis heterogéneas, isto é, com ênfase na aplicação destes mecanismos sobre diferentes tecnologias de acesso. As alterações sugeridas aplicam-se a cenários de utilizador estático ou móvel, sendo este a fonte ou receptor do tráfego vídeo. Da mesma forma, são propostas soluções tendo em vista operadores com diferentes objectivos de disseminação de vídeo, ou cujas redes têm diferentes características. A metodologia utilizada combinou a avaliação experimental em testbeds físicas com a avaliação matemática em simulações de redes, e permitiu veri car o impacto sobre a optimização da recepção de vídeo em terminais móveisPrograma Doutoral em Telecomunicaçõe

Recent Trends in Communication Networks

In recent years there has been many developments in communication technology. This has greatly enhanced the computing power of small handheld resource-constrained mobile devices. Different generations of communication technology have evolved. This had led to new research for communication of large volumes of data in different transmission media and the design of different communication protocols. Another direction of research concerns the secure and error-free communication between the sender and receiver despite the risk of the presence of an eavesdropper. For the communication requirement of a huge amount of multimedia streaming data, a lot of research has been carried out in the design of proper overlay networks. The book addresses new research techniques that have evolved to handle these challenges

Digital signal processing waveform aggregation and its experimental demonstration for next generation mobile fronthaul

L'abstract è presente nell'allegato / the abstract is in the attachmen

Efficient Traffic Management Algorithms for the Core Network using Device-to-Device Communication and Edge Caching

Exponentially growing number of communicating devices and the need for faster, more reliable and secure communication are becoming major challenges for current mobile communication architecture. More number of connected devices means more bandwidth and a need for higher Quality of Service (QoS) requirements, which bring new challenges in terms of resource and traffic management. Traffic offload to the edge has been introduced to tackle this demand-explosion that let the core network offload some of the contents to the edge to reduce the traffic congestion. Device-to-Device (D2D) communication and edge caching, has been proposed as promising solutions for offloading data. D2D communication refers to the communication infrastructure where the users in proximity communicate with each other directly. D2D communication improves overall spectral efficiency, however, it introduces additional interference in the system. To enable D2D communication, efficient resource allocation must be introduced in order to minimize the interference in the system and this benefits the system in terms of bandwidth efficiency. In the first part of this thesis, low complexity resource allocation algorithm using stable matching is proposed to optimally assign appropriate uplink resources to the devices in order to minimize interference among D2D and cellular users. Edge caching has recently been introduced as a modification of the caching scheme in the core network, which enables a cellular Base Station (BS) to keep copies of the contents in order to better serve users and enhance Quality of Experience (QoE). However, enabling BSs to cache data on the edge of the network brings new challenges especially on deciding on which and how the contents should be cached. Since users in the same cell may share similar content-needs, we can exploit this temporal-spatial correlation in the favor of caching system which is referred to local content popularity. Content popularity is the most important factor in the caching scheme which helps the BSs to cache appropriate data in order to serve the users more efficiently. In the edge caching scheme, the BS does not know the users request-pattern in advance. To overcome this bottleneck, a content popularity prediction using Markov Decision Process (MDP) is proposed in the second part of this thesis to let the BS know which data should be cached in each time-slot. By using the proposed scheme, core network access request can be significantly reduced and it works better than caching based on historical data in both stable and unstable content popularity