Efficient techniques for cooperative spectrum sensing in cognitive radio networks
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é
In this thesis, we focus on two important design aspects of cooperative spectrum sensing (CSS) in cognitive radio networks which are the selection criterion of cooperating secondary users and the fusion technique for combining their local sensing decisions. We propose a novel adaptive user-group assignment algorithm that addresses the problem of sensing accuracy-efficiency trade-off in group-based CSS with heterogeneous cooperating secondary users. The performance of the proposed algorithm is bounded by 4.2% of the optimal solution. Through extensive simulations, we demonstrate that the proposed algorithm can effectively improve the performance of CSS in terms of the opportunistic throughput, sensing overhead and the number of sensing rounds needed to discover an available channel. Considering the different detection performance of cooperating secondary users, we propose a novel reliability-based decision fusion scheme in which a weight is assigned to each secondary user's local decision based on its reliability. Since the knowledge of the local probabilities of detection and false alarm for each secondary detector may not be known in practice, we employ a counting process to estimate those probabilities based on past global and local decisions. We then formulate the problem of minimizing the network probability of sensing error and develop a dual search algorithm, based on a non-linear Lagrangian approach, to solve the formulated problem. Our simulation results show that the dual algorithm converges to the optimal value with zero duality gap using few numbers of iterations. We also show that the probability of error is reduced by 18% and 88% compared to the OR and AND fusion rules, respectively, when the number of secondary users is eight. We then address the practical concern of secondary users reporting correlated local decisions to the fusion center. For this scenario, we formulate the problem of minimizing the network probability of sensing error optimization problem and employ the genetic algorithm to jointly find the optimal K*-out-of-M fusion rule and the optimal local threshold for a certain correlation index. Simulation results show that the network probability of sensing error degrades as the degree of correlation between cooperating secondary users increases. We also study the problem of multiband cooperative joint detection in the presence of sensing errors due to time offset. We derive the aggregate opportunistic throughput and aggregate interference to primary users for multiband cooperative joint detection in the presence of time offset. Our numerical results demonstrate the negative impact of the time offset on the aggregate opportunistic throughput of multiband cooperative joint detection.
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,001 | 0,000 |
| Bibliométrie | 0,000 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,001 | 0,000 |
| Science ouverte | 0,000 | 0,001 |
| Intégrité de la recherche | 0,000 | 0,001 |
| 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