Security enhancements for sparse MIMO systems: A compressive sensing - artificial noise technique
Notice bibliographique
Résumé
In wireless communication, it is possible to achieve high level of security by exploiting the random characteristics of wireless channels and the transmitted signal structure.Thus, applying security at physical layer gained much attention since this randomness can be utilized to provide infinite set of secret keys; unlike cryptographic techniques that are applied at the network layer and are limited by the finite set of available keys.Not only this, but also the emerging types of networks pose restrictions on applying security at higher level due to the light computational abilities of the devices used such as sensors, radio-frequency identification (RFID) tags and so forth.Thus, physical layer security (PLS) provides a way to utilize the physics of radio propagation to secure such networks.Furthermore, sparsity, that exists in many types of signals, can be used to achieve sampling and compression efficiently.In this thesis, we consider physical layer security through combining both compressive sensing (CS) and artificial noise (AN) to elevate secrecy of MIMO communication systems.Contrary to the classical methods of CS-PLS, this technique does not impose any restriction on the adversary except one.It is assumed that both the adversary and the legitimate receiver have access to the same information with only one imposed postulation that the adversary should possess fewer antennas than the transmitter.This is a valid assumption in many applications that include a powerful base station.First, we lay down the theoretical foundation for physical layer security with emphasis on both compressive sensing and artificial noise.Then, we modify the CS system model to work in MIMO environment to be able to include AN, where the latter requires a MIMO layout to guarantee the presence of a valid null space to inject the artificial noise to the system.Two methods are considered to perform such modification; the first one is CS by repetition and the other one is CS on Air.Furthermore, different techniques are used to inject AN to the CS-based system and the security performance of each method is evaluated.The difference between these techniques lies in the method of creating the artificial noise and where it is injected.Moreover, the secrecy performance is enhanced by using beamforming to direct the information-bearing signal towards the intended receiver and degrades it in other directions.Finally, we investigate the effect of choosing the perturbation parameter (), due to the presence of AWGN and AN, in 1 -minimization algorithms on the recovery performance at the eavesdropper and consequently the achieved secrecy. is related to the noise level and decides the accuracy of recovering the transmitted signal.Simulation results show that using Abstract iii beamforming, when combining CS and AN, enhances secrecy considerably while imposing no assumptions on the confidentiality of information from the eavesdropper including CSI, seeds (used for generating random keys) or keys.Furthermore, they show that the choice of significantly affects secrecy since it cannot be correctly estimated at the adversary and hence increases the errors in 1 -minimization techniques that are used for signal reconstruction.
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.
Comment cette classification a été obtenuedéplier
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,001 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,001 | 0,000 |
| Bibliométrie | 0,001 | 0,001 |
| Études des sciences et des technologies | 0,001 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,001 | 0,000 |
| Intégrité de la recherche | 0,002 | 0,002 |
| 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écouleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».