Uplink scheduling and resource allocation schemes for LTE-advanced systems that incorporate relays or carry heterogeneous traffic
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Scheduling and resource allocation is one of the important tasks of the radio resource management layer in long term evolution (LTE) and LTE-Advanced wireless systems. Uplink scheduling and resource allocation is considered more challenging compared to the downlink case because of individual users' power constraints and the discrete nature of spectrum assignment. Downlink scheduling and resource allocation has extensively been studied for relay equipped or heterogeneous traffic networks, but less work has been considered for the LTE uplink case. In this thesis, we have proposed a few uplink scheduling and resource allocation schemes of LTE-Advanced systems that incorporate relay(s) or carry heterogeneous traffic. First, we have proposed a basic uplink scheduling and resource allocation scheme for decode-and-forward relay aided systems. Existing uplink scheduling works have looked at the problem from different angles instead of basic scheduling and resource allocation. In addition of having optimal resource allocation, the proposed scheme is adaptive. If the system has some bad or redundant relays, the proposed scheme can detect and recommends them to be deactivated. Having observed the difficulty in deciding which users to serve for a relay under the constraint of limited power, second, we have proposed a joint source and relay power allocation scheme for an amplify-and-forward relayed system. Existing works of this problem have ignored one term in their problem formulation, and hence failed to offer the optimal solution for all possible scenarios. We have taken care of that missing term in our work, and have shown the performance improvement comparing with the existing works. In this solution, all entities in the network work in an altruistic manner towards maximizing the network capacity. However, in the real world, the nodes may want some benefits while sacrificing their resource. To model the selfish behavior of the nodes, in the third work, we have proposed a game theoretical solution of this problem. Fourth, we have proposed an uplink scheduling and resource allocation scheme for a network which carries heterogeneous traffic. Although there are some existing uplink scheduling works dealing QoS in heterogeneous traffic networks, those were not careful about detailed standard specific all constraints. In addition to meet the conflicting requirements of QoS for different traffic, the proposed scheme takes the resource utilization constraint into account which is designed to benefit the network operators.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle