Les communications sans fils sont devenues un outil fondamental pour les sociétés modernes. Les réseaux cellulaires sont le moyen préféré pour l’accès à Internet. L’augmentation de la capacité du réseau est étroitement liée au problème des interférences. Les réseaux coopératifs ont été largement étudiés dans les années récentes. Cette thèse porte sur deux techniques de coopération dans la voie descendante :La première partie étudie les effets de quantification et délais sur les informations de retour nécessaires pour la mise en opération des différentes techniques d’émission coordonnée, connues sous le nom de CoMP (Coordinated Multipoint Transmission). Cette technique qui promet des augmentations importantes sur la capacité du réseau en conditions idéales, or ses vrais résultats sous le feedback limité doivent être encore décrits de manière analytique. En particulier, pour les modes d’émission connus comme JT (Joint Transmission) et CBF (Coordinated Beamforming), des expressions analytiques ont été déduites pour calculer la capacité du réseau et la probabilité de succès de transmission.Finalement une nouvelle technique de coopération de réseau pour les récepteurs avancés du type SIC (Successive Interference Cancellation) est présentée. La condition mathématique qui garantit des gains de capacité grâce à l’utilisation des récepteurs SIC est obtenue. Pour en profiter, une méthode de coopération est nécessaire pour assurer une adaptation de lien adéquate pour que l’interférence soit décodable et le débit somme soit supérieur à celui atteint avec des récepteurs traditionnels. Cette technique montre des gains importants de capacité pour des utilisateurs en bordure de cellule. / Wireless communications have become a fundamental feature of any modern society. In particular, cellular networks are essential for societal welfare but the increasing demand for data traffic set enormous scientific challenges. Increasing the network capacity is closely related to the problem of interference mitigation. In this regard, network cooperation has been studied in recent years and several different techniques have been proposed. In the first part, different transmission techniques commonly referred to as Coordinated Multi-Point Transmission (CoMP), are studied under the effect of feedback quantization and delay, unequal pathloss and other-cell interference (OCI). An analytical framework is provided, which yields closed-form expressions to calculate the ergodic throughput and outage probabilities of Coordinated Beamforming (CBF) and Joint Transmission (JT). The results indicate the optimal configuration for a system using CoMP and provide guidelines and answers to key questions, such as how many transmitters to coordinate, how many antennas to use, how many users to serve, which SNR regime is more convenient, whether to apply CBF or prefer a more complex JT, etc. Second, a new coordination technique at the receiver side is proposed to obtain sum-rate gains by means of Successive Interference Cancellation (SIC). The conditions that guarantee network capacity gains by means of SIC at the receiver are provided. To take advantage of these conditions, network coordination is needed to adapt the rates to be properly decoded at the different users involved. This technique is named Cooperative SIC and is shown to provide significant throughput gains for cell-edge users.

Antennas are one of the most sensitive elements in any wireless communication equipment. Designing small-profile, multiband and wideband internal antennas with a simple structure has become a necessary challenge. In this thesis, two planar antennas are designed, simulated and implemented on an effort to cover the LTE-M1 and NB-IoT radio frequencies. The cellular antenna is designed to receive and transmit data over the eight-band LTE700/GSM/UMTS, and the GNSS antenna is designed to receive signal from the global positioning system and global navigation systems, GPS (USA) and GLONASS. The antennas are suitable for direct print on the system circuit board of a device. Related theory and research work are discussed and referenced, providing a strong configuration for future use. Recommendations and suggestions on future work are also discussed. The proposed antenna system is more than promising and with further adjustments and refinement can lead to a fully working solution.

Le problème de coloration de graphe est un problème NP-complet particulièrement étudié, qui permet de modéliser de problèmes dans des domaines variés. Dans cette thèse, de nouveaux algorithmes exacts basés sur une étude de la structure du graphe sont proposés. Ce travail s'appuie sur l'algorithme « Total solutions Exact graph Coloring » (TexaCol) qui construit toutes les solutions en exploitant l'ensemble des cliques d'un graphe. Deux algorithmes exacts, « Partial best solutions Exact graph Coloring » (PexaCol) et « All best solutions Exact graph Coloring » (AexaCol), sont présentés ici pour construire certaines solutions optimales ou toutes les meilleures solutions. Ces deux algorithmes utilisent la méthode de backtracking, dans laquelle ils ne choisissent que les sous-ensembles de meilleurs solutions pour continuer la coloration. L’analyse de résultat montre que PexaCol et AexaCol sont capables de traiter des graphes plus grands que TexaCol. Mais surtout, AexaCol trouve toutes les meilleures solutions significativement plus vite que TexaCol ainsi que le solveur Gurobi, qui sont utilisés comme référence.La téléphonie mobile est un domaine en plein essor qui peut s'appuyer sur une modélisation à base de graphes. Actuellement, les techniques de type « Device-to-Device » (D2D) prennent une place importante dans les réseaux mobiles. L’allocation de ressource constitue l'un des principaux problèmes en matière de performance. Pour assigner efficacement une ressource radio à une paire D2D dans le système Long-Term Evolution (LTE), un schéma systématique d'allocation de ressources est proposé dans cette thèse. Il est basé sur une clusturisation des liens D2D, et permet de prendre en compte à la fois l'allocation inter-cluster et intra-cluster des ressources. En déterminant les zones d'interférence, le problème d'allocation des ressources inter-cluster est formulé comme un problème de coloration de graphe dynamique. Un algorithme de coloration de graphe dynamique est ainsi proposé, basé sur PexaCol. Cet algorithme peut assigner les ressources radio aux clusters qui sont générés ou supprimés dynamiquement. L’analyse numérique montre que cet algorithme assure une bonne performance en termes d'utilisation des ressources, de temps d’exécution et d'adaptabilité. Concernant le problème d’allocation de ressources inter-cluster, une méthode fondée sur la topologie est proposée, intégrant naturellement l'allocation de puissance et l’allocation de Resource Block (RB). Pour simplifier ce problème d'allocation de ressources, la meilleure topologie est choisie à chaque étape, celle qui permet d'obtenir le meilleur débit en utilisant le moins de RBs. A partir de ce procédé, quatre algorithmes d'optimisation sont proposés: l’algorithme glouton statique, PexaCol statique, PexaCol dynamique et PexaCol dynamique approximatif. L'analyse des résultats montre que pour les petits clusters, les versions statiques et dynamiques de PexaCol permettent d'obtenir un index d’optimisation maximal en choisissant la meilleure topologie locale pour chaque noeud. A l'opposé, les algorithmes "glouton statique" et "PexaCol dynamique approximatif" permettent d'obtenir une solution sous-optimale pour l'optimisation locale avec une complexité moindre. Pour les grands clusters, avec certaine séquence de la coloration, le PexaCol dynamique approximatif est mieux que l’algorithme glouton statique pour l’index d’optimisation pendant un temps d’exécution acceptable. / Graph coloring problem is a famous NP-complete problem, which has extensive applications. In the thesis, new exact graph coloring algorithms are researched from a graph structure point of view. Based on Total solutions Exact graph Coloring algorithm (TexaCol) which is capable of getting all coloring solution subsets for each subgraph, two other exact algorithms, Partial best solutions Exact graph Coloring algorithm (PexaCol) and All best solutions Exact graph Coloring algorithm (AexaCol), are presented to get multiple best solutions. These two algorithms utilize the backtracking method, in which they only choose the best solution subset each step to continue the coloring until partial or all best solutions are obtained. The result analysis shows that PexaCol and AexaCol can deal with larger graphs than TexaCol and especially, AexaCol runs much faster than TexaCol and the solver Gurobi to get all best solutions.Device-to-Device (D2D) is a promising technique for the future mobile networks, such as 5th generation wireless systems (5G), and the resource allocation is one of the most crucial problems for its performance. In order to efficiently allocate radio resource for D2D links in Long-Term Evolution (LTE) system, a systematic resource allocation scheme is proposed based on D2D clusters, including the inter-cluster resource allocation and the intra-cluster resource allocation. With the cluster interference range, the inter-cluster resource allocation problem is formulated as a dynamic graph coloring problem, and a dynamic graph coloring algorithm is designed based on PexaCol. This algorithm is able to allocate radio resource to clusters while they are dynamically generated and deleted. The numerical analysis results show that this algorithm has good performance in resource utilization, runtime and scalability.For the intra-cluster resource allocation problem, a topology-based resource allocation method is designed naturally combining power allocation with Resource Block (RB) allocation. To simplify this associated optimization problem, a local optimal method is proposed, in which the best topology is chosen each step achieving the maximal throughput with the minimum number of assigned RBs. With respect to this method, four algorithms are presented: static greedy, static PexaCol, dynamic PexaCol and dynamic PexaCol approximate. Result analysis shows that for small-scale clusters, static PexaCol and dynamic PexaCol are capable of getting a maximal optimization index by locally choosing the best topology for each node while static greedy and dynamic PexaCol approximate are able to get the suboptimal solution for the local optimization with much lower complexity. For large-scale clusters, giving certain treating sequences, the dynamic PexaCol approximate performs better than static greedy regarding the optimization index within an acceptable runtime.

A drastic increase in traffic of mobile broadband is seen in the past few years, which is further accelerated by the increase in usage of smart phones and its applications. The availability of good smart phones and better data connectivity are encouraging mobile users to use video services. This huge increase in usage will pose a lot of challenges to the wireless networks. The wireless network has to become content aware in order to offer enhanced quality of video service through efficient utilization of the wireless spectrum. This thesis focuses on improving the Quality of Experience (QoE) for video transmission over Long Term Evolution (LTE) networks by imparting the content awareness to the system and providing unequal error protection for critical video packets. Two different schemes for the improvement of video quality delivery over LTE networks are presented in this thesis. Using content awareness, the retransmission count of Hybrid Automatic Repeat reQuest (HARQ) are changed dynamically such that the most important video frame gets more number of retransmission attempts, which increases its success for delivery in-turn increasing the received video quality. Since Radio Link Control (RLC) is the link layer for radio interface, the second approach focuses on optimizing this layer for efficient video transmission. As part of this scheme, a new operation mode called Hybrid Mode (HM) for RLC is defined. This mode performs retransmission only for the critical video frames, leaving other frames to unacknowledged transmission. The simulation results of both proposed schemes provide significant improvement in achieving good video quality without affecting the system performance.

Die vorliegende Diplomarbeit behandelt den Vergleich von QoS- und Mobilitätsmechanismen in der LTE/SAE-Architektur. Nach der Einführung in die LTE/SAE-Architektur wird dargestellt, wie die QoS und die Mobilität im Standard des 3GPP gewährleitet wird. Danach erfolgt eine Untersuchung der Technologien PMIP, Ethernet und MPLS, ob sie sich als Alternativen für die standardisierten Mechanismen eignen. In einem weiteren Kapitel wird ein eigenes Konzept zur QoS- und Mobilitätsverwaltung vorgestellt, und es erfolgen erste Betrachtungen. Abschließend wird ein Ausblick gegeben, wie das vorgestellte eigene Konzept weiter ausgebaut werden könnte.

Cette thèse traite des systèmes MIMO à multiplexage spatial, associés à la modulation OFDM. L'étude s'attarde particulièrement sur les systèmes 4x4, inclus ou à l'étude dans les normes 3GPP LTE et 3GPP LTE-A. Ces dimensions particulières nécessitent une étude de conception poussée du récepteur. Il s'agit notamment de proposer des détecteurs qui affichent à la fois de bonnes performances, une faible latence et une complexité de calcul réalisable dans un système embarqué. Le défi consiste plus particulièrement à proposer un détecteur offrant des performances quasi-optimales, tout en ne nécessitant qu'une complexité de calcul polynomiale. Une attention particulière est prêtée aux problèmes d'implantation. Ainsi, avantage est donné aux algorithmes à complexité fixe et permettant la réalisation d'opérations en parallèle. En réponse aux problématiques rencontrées, l'architecture du détecteur requiert une attention particulière. Le choix stratégique adopté est de chercher à transférer au prétraitement - qui ne dépend pas des données - le plus possible de complexité de calcul. Au cours de ce travail et suite à l'introduction du contexte général et des principaux pré-requis, l'inventaire des grandes tendances dans la littérature en ce qui concerne les détecteurs à décision dure est fait. Ils constituent le coeur du sujet et un détecteur original est proposé, incluant notamment les aspects de réduction de réseau et de décodage sphérique. Son avantage par rapport aux techniques existantes est ainsi démontré, et les résultats prometteurs sont maintenus lors de son extension à la décision souple. Comme attendu, le choix de transférer au prétraitement la complexité de calcul s'avère gagnant. Notamment, la réduction de complexité de calcul qu'il permet est présentée dans cette thèse. Parmi les principaux résultats, ce travail a débouché sur la proposition d'un détecteur original, qui a démontré un compromis entre performance et complexité de calcul efficace. Notamment, il requiert une complexité de calcul presque constante - selon les tailles de constellation -, tout en offrant des performances proches du maximum de vraisemblance. Par conséquent, le détecteur à décision souple proposé se positionne par rapport à l'état de l'art comme une solution d'une grande efficacité dans les systèmes 4x4.

Cette thèse est consacrée à l’étude de la modulation OFDM/OQAM en tant qu’alternative à la modulation OFDM. Nous traitons plus particulièrement le contexte multiusagers. De ce point de vue, les aspects de synchronisation sont déterminants. Les différentes options plus le choix de la forme d’onde sont donc examinés de ce point de vue. Un autre objectif est de montrer de manière précise comment la modulation OFDM/OQAM peut s’adapter à une transmission de type cellulaire, en prenant comme référence le système 3GPP/LTE. Les principales contributions que nous avons apportées sont : 1) Une analyse des phénomènes de désynchronisation : nous analysons l’effet de la désynchronisation, suivant les axes temporel et fréquentiel, sur les performances de l’OFDM/OQAM au récepteur. 2) Méthode de synchronisation : nous analysons une méthode de synchronisation temporelle définie dans un contexte de transmission OFDM/OQAM mono-usager et nous l’adaptons à un scénario de type multi-usagers. 3) Proposition d’un schéma d’accès multiple : nous proposons un schéma d’accès multiple basé sur la modulation OFDM/OQAM, alternatif aux techniques connues OFDMA et SC-FDMA, pour la transmission en liaison montante dans un contexte de type 3GPP/LTE. / This thesis is dedicated to the study of the OFDM/OQAM modulation as an alternative to the OFDM modulation. We treat more especially the multi-user environment. In this respect, synchronization aspects are crucial. The different options plus the choice of the waveform are examined in this point of view. Another objective is to precisely show how the OFDM/OQAM can be adapted to a cellular transmission type, taking as reference the 3GPP/LTE system. The main contributions we have made are : 1) Analysis of the desynchronization phenomena : we analyze the effect of desynchronization, according to the time and frequency axes, on the performance of OFDM/OQAM at the receiver side. 2) Synchronization method : we analyze a method of temporal synchronization defined in a single user OFDM/OQAM transmission and we adapt it to a multi-user scenario type. 3) Proposing for a multiple access scheme : we propose a multiple access scheme based on theOFDM/OQAM modulation, alternative to the known techniques OFDMA and SC-FDMA, for the UL transmission in a 3GPP/LTE context.

Submitted by Automação e Estatística (sst@bczm.ufrn.br) on 2018-04-11T20:06:38Z No. of bitstreams: 1 BrunoJacomeCavalcanti_TESE.pdf: 5397909 bytes, checksum: 5a245eec570a69adf8ca5d791aaddf70 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2018-04-16T20:46:19Z (GMT) No. of bitstreams: 1 BrunoJacomeCavalcanti_TESE.pdf: 5397909 bytes, checksum: 5a245eec570a69adf8ca5d791aaddf70 (MD5) / Made available in DSpace on 2018-04-16T20:46:19Z (GMT). No. of bitstreams: 1 BrunoJacomeCavalcanti_TESE.pdf: 5397909 bytes, checksum: 5a245eec570a69adf8ca5d791aaddf70 (MD5) Previous issue date: 2017-10-20 / A perfeita funcionalidade dos sistemas de comunicações de 3ª. e 4ª. gerações requerem, entre outras coisas, do conhecimento dos valores numéricos da predição das perdas de propagação dos sinais propagantes nos ambientes urbano, suburbano e rural. Portanto, o estudo das condições de propagação em um ambiente qualquer sempre será uma preocupação dos engenheiros projetistas. A análise e desenvolvimento de modelos robustos de predição de perdas de propagação em redes de comunicações Long Term Evolution (LTE) e Long Term Evolution Advanced (LTE-A) usando técnicas de Inteligência Artificial são realizadas neste trabalho. Os procedimentos metodológicos empregados foram aplicados no melhoramento da predição dos modelos de perda de propagação empíricos SUI, ECC-33, Ericsson 9999, TR 36.942 e o modelo do Espaço Livre, aplicados em redes LTE e LTE-A nas frequências de 800 MHz, 1800 MHz e 2600 MHz, para ambientes suburbanos em cidades de porte médio do nordeste do Brasil. Assim, nesta tese propõem-se dois modelos de Redes Neurais Artificiais (RNA): (i) o modelo de rede neural com entradas baseadas em erro (RNBE), utilizando como principal alimentador da rede o erro entre dados medidos e simulados, e, (ii) o modelo de rede neural com entradas baseadas no terreno (RNBT). O desempenho desses modelos foram comparados com os modelos de propagação considerados no trabalho e também as versões otimizadas utilizando Algoritmos Genéticos (AG) e o Método dos Mínimos Quadrados (LMS). Também foram realizadas comparações com valores medidos, obtidos a partir de uma campanha de medição realizada na cidade de Natal, Estado do Rio Grande do Norte. Os resultados finais obtidos através de simulações e medições apresentaram boas concordâncias métricas, com destaque para a performance do modelo RNBE. A principal contribuição dessa tese é que, ao utilizar essas técnicas que fazem uso de maneira mais eficiente dos modelos de propagação empíricos, pode-se estimar sinais propagantes realistas, evitando erros no planejamento e implementações de redes sem fio LTE e LTE-A em áreas suburbanas. / The perfect functionality of the 3rd and 4th generation of wireless systems requires, among other parameters, knowledge of the numerical values of the prediction of loss of propagation of propagation signals in urban, suburban and rural environments. Therefore, the study of propagation conditions in any environment will always be a concern of design engineers. The analysis and development of robust propagation loss prediction models in Long Term Evolution (LTE) and Long Term Evolution Advanced (LTE-A) communications networks using Artificial Intelligence techniques is performed in this work. The methodologies used were applied to improve the prediction of loss of empirical propagation SUI, ECC-33, Ericsson 9999, TR 36.942 models and the Free Space model applied in LTE and LTE-A networks in the frequencies of 800 MHz, 1800 MHz and 2600 MHz, for suburban environments in mid-sized cities in northeastern Brazil. Thus, in these thesis two models of Artificial Neural Networks (RNA) are proposed: (i) the neural network model with inputs based on error (RNBE) using as main feeder of the network the error between measured and simulated data, and (ii) the neural network model with land-based inputs (RNBT). The performance of these models was compared with the models of propagation considered in the work and also the versions optimized using Genetic Algorithms (AG) and the Least Square Method (LMS). Comparisons were also made with measured values, obtained from a measurement campaign carried out in the city of Natal, state of Rio Grande do Norte. The final results obtained through simulations and measurements presented good metric concordances, with emphasis on the performance of the RNBE model. Thus, the main contribution of this thesis is that, by using these techniques that make more efficient use of empirical propagation models, we can estimate realistic propagation signals, avoiding errors in the planning and implementations of LTE and LTE- A wireless networks in suburban areas.

Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2018-08-27T11:17:25Z No. of bitstreams: 2 Dissertação - Dalton Foltran de Souza - 2018.pdf: 3869661 bytes, checksum: 5fa93e5e35c983cbefa148826a07a3ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-08-27T11:20:32Z (GMT) No. of bitstreams: 2 Dissertação - Dalton Foltran de Souza - 2018.pdf: 3869661 bytes, checksum: 5fa93e5e35c983cbefa148826a07a3ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2018-08-27T11:20:32Z (GMT). No. of bitstreams: 2 Dissertação - Dalton Foltran de Souza - 2018.pdf: 3869661 bytes, checksum: 5fa93e5e35c983cbefa148826a07a3ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2018-07-04 / With the development of the next generation of mobile communications systems for 5G, several technologies are being studied aiming to reach the new requirements in new application scenarios. Among them, is the use of new modulations with higher spectral efficiency in substitution of OFDM, such as F-OFDM and UFMC, and also the scheduling algorithms which are in charge of sharing resources between users. In this work, we evaluated the application of F-OFDM and UFMC, 5G modulations candidates, on downlink LTE compared with OFDM and evaluated the schedulers Round Robin, QoS Guaranteed and PSO dealing with additional resources provided by the tested modulations. For that, we compared performance considering parameters like fairness, latency, throughput and spectral efficiency. The results showed that the downlink LTE improved performance in all evaluated parameters with UFMC modulation. In fact, there were a performance improvement in all schedulers evaluated. For example, PSO based scheduler improved latency and throughput while QoS Guaranteed reached the lowest loss, as the highest fairness were reached by QoS Guaranteed and Round Robin. Also, we propose a scheduling algorithm that takes into account the queue size in the user buffer and channel quality to maximize throughput and fairness in the LTE downlink network. The metrics evaluated were transmission efficiency, throughput, fairness, delay and losses. The proposed algorithm achieved better results for all evaluated metrics. / Com o desenvolvimento da próxima geração dos sistemas de comunicação móvel sem fio (5G) diversas tecnologias estão sendo estudadas com o objetivo de se atender aos novos requisitos de desempenho em diferentes cenários de aplicação. Dentre elas, está a utilização de modulações com maior eficiência espectral em substituição à OFDM, como F-OFDM e UFMC, como também os algoritmos de escalonamento que são responsáveis pelo compartilhamento dos recursos aos usuários. Neste trabalho, avaliamos a aplicação no downlink LTE das modulações F-OFDM e UFMC, candidatas ao 5G, comparadas a OFDM e avaliamos os escalonadores Round Robin, QoS Garantido e PSO ao lidar com recursos adicionais disponíveis proporcionados pelas modulações estudadas. Para tal, realizamos a análise de parâmetros de desempenho de tráfego, tais como vazão, índice de justiça, perda de dados e retardo médio. Os resultados mostraram que o enlace de descida do LTE apresentou melhor desempenho para todos os parâmetros analisados com a modulação UFMC. De fato, foram obtidas melhorias de desempenho para todos escalonadores avaliados. Como exemplo, o escalonador baseado em PSO apresentou melhorias no retardo e vazão, enquanto o escalonador QoS Garantido obteve menor taxa de perda de dados, sendo que índices de justiça mais elevados foram obtidos para os escalonadores QoS Garantido e Round Robin. Ainda, propusemos um escalonador que considera o tamanho da fila no buffer e a qualidade de canal visando maximizar a vazão e o índice de justiça no downlink da rede LTE. As métricas avaliadas foram eficiência de transmissão, vazão, índice de justiça, retardo e perda de dados. O algoritmo proposto alcançou melhores resultados em todas as métricas avaliadas em relação aos outros algoritmos considerados.

Submitted by Lucelia Lucena (lucelia.lucena@ufpe.br) on 2015-03-09T19:50:50Z No. of bitstreams: 2 DISSERTAÇÃO Marcos Graciano Santos.pdf: 3653832 bytes, checksum: 63b7958428e143779e52059edac458d4 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) / Made available in DSpace on 2015-03-09T19:50:50Z (GMT). No. of bitstreams: 2 DISSERTAÇÃO Marcos Graciano Santos.pdf: 3653832 bytes, checksum: 63b7958428e143779e52059edac458d4 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Previous issue date: 2014-08-11 / Atualmente, mais de 200 milhões de usuários utilizam as redes 3G/LTE (Long Term Evolution). Com este aumento crescente de usuários com acesso sem fio, muitas pesquisas se concentram no esforço de desenvolvimento de soluções que permitam atender às demandas de redes com alta disponibilidade e altas taxas de transmissão sem considerar, em geral, as limitações de bateria dos dispositivos. Como requisito do LTE Advanced (especificações para a Quarta Geração de comunicações móveis) incluem-se os Serviços de Proximidade, comunicação denominada de dispositivo a dispositivo (D2D, do inglês: device-to-device) para atender ao desenvolvimento de novas demandas de serviços, como jogos e vídeos on-line ou transferência de conteúdos, aplicações que, a cada dia, requerem maiores consumos de energia. Neste trabalho, realizamos medições que avaliam o consumo da comunicação dispositivo-estação base e propomos primeiramente um algoritmo de identificação de pares de dispositivos e definição de limiares de referência, diferentemente de outros trabalhos, com base nas características de consumo dos dispositivos, que viabilize comunicação direta D2D energeticamente mais eficiente que a comunicação convencional via estação rádio base. Em seguida, para cenários de grande aglomeração de pessoas, uma alternativa de serviço de disponibilização de conteúdos ou transferência de arquivos através de um novo padrão de alocação de recursos, utilizando o modo duplex por divisão no tempo (TDD – Time Duplex Division). Foram considerados cinco modelos de propagação distintos para comparação do desempenho, tomando como base uma situação real num parque do Recife considerando a transmissão de um vídeo em alta definição. Por fim, tratamos a questão da segurança com uma criptografia específica entre os dispositivos próximos. Os resultados são avaliados via simulação utilizando-se o Matlab, demonstrando a eficácia da solução com reduções de até 43% no consumo de energia da bateria do dispositivo.