35 research outputs found
Securing Large-Scale D2D Networks Using Covert Communication and Friendly Jamming
We exploit both covert communication and friendly jamming to propose a
friendly jamming-assisted covert communication and use it to doubly secure a
large-scale device-to-device (D2D) network against eavesdroppers (i.e.,
wardens). The D2D transmitters defend against the wardens by: 1) hiding their
transmissions with enhanced covert communication, and 2) leveraging friendly
jamming to ensure information secrecy even if the D2D transmissions are
detected. We model the combat between the wardens and the D2D network (the
transmitters and the friendly jammers) as a two-stage Stackelberg game.
Therein, the wardens are the followers at the lower stage aiming to minimize
their detection errors, and the D2D network is the leader at the upper stage
aiming to maximize its utility (in terms of link reliability and communication
security) subject to the constraint on communication covertness. We apply
stochastic geometry to model the network spatial configuration so as to conduct
a system-level study. We develop a bi-level optimization algorithm to search
for the equilibrium of the proposed Stackelberg game based on the successive
convex approximation (SCA) method and Rosenbrock method. Numerical results
reveal interesting insights. We observe that without the assistance from the
jammers, it is difficult to achieve covert communication on D2D transmission.
Moreover, we illustrate the advantages of the proposed friendly
jamming-assisted covert communication by comparing it with the
information-theoretical secrecy approach in terms of the secure communication
probability and network utility
Coexistence of RF-powered IoT and a Primary Wireless Network with Secrecy Guard Zones
This paper studies the secrecy performance of a wireless network (primary
network) overlaid with an ambient RF energy harvesting IoT network (secondary
network). The nodes in the secondary network are assumed to be solely powered
by ambient RF energy harvested from the transmissions of the primary network.
We assume that the secondary nodes can eavesdrop on the primary transmissions
due to which the primary network uses secrecy guard zones. The primary
transmitter goes silent if any secondary receiver is detected within its guard
zone. Using tools from stochastic geometry, we derive the probability of
successful connection of the primary network as well as the probability of
secure communication. Two conditions must be jointly satisfied in order to
ensure successful connection: (i) the SINR at the primary receiver is above a
predefined threshold, and (ii) the primary transmitter is not silent. In order
to ensure secure communication, the SINR value at each of the secondary nodes
should be less than a predefined threshold. Clearly, when more secondary nodes
are deployed, more primary transmitters will remain silent for a given guard
zone radius, thus impacting the amount of energy harvested by the secondary
network. Our results concretely show the existence of an optimal deployment
density for the secondary network that maximizes the density of nodes that are
able to harvest sufficient amount of energy. Furthermore, we show the
dependence of this optimal deployment density on the guard zone radius of the
primary network. In addition, we show that the optimal guard zone radius
selected by the primary network is a function of the deployment density of the
secondary network. This interesting coupling between the two networks is
studied using tools from game theory. Overall, this work is one of the few
concrete works that symbiotically merge tools from stochastic geometry and game
theory
The Role of Physical Layer Security in Satellite-Based Networks
In the coming years, 6G will revolutionize the world with a large amount of
bandwidth, high data rates, and extensive coverage in remote and rural areas.
These goals can only be achieved by integrating terrestrial networks with
non-terrestrial networks. On the other hand, these advancements are raising
more concerns than other wireless links about malicious attacks on
satellite-terrestrial links due to their openness. Over the years, physical
layer security (PLS) has emerged as a good candidate to deal with security
threats by exploring the randomness of wireless channels. In this direction,
this paper reviews how PLS methods are implemented in satellite communications.
Firstly, we discuss the ongoing research on satellite-based networks by
highlighting the key points in the literature. Then, we revisit the research
activities on PLS in satellite-based networks by categorizing the different
system architectures. Finally, we highlight research directions and
opportunities to leverage the PLS in future satellite-based networks
Secrecy-Optimized Resource Allocation for Device-to-Device Communication Undelaying Cellular Networks
L’objectif principal de l’introduction de la communication de périphérique-à -périphérique «device-to-device» (D2D) sous-jacente aux systèmes de communication sans fil de cinquième génération (5G), est d’augmenter l’efficacité spectrale (ES). Cependant, la communication
D2D sous-jacente aux réseaux cellulaires peut entraîner une dégradation des performances causée par des co-interférences de canal sévères entre les liaisons cellulaires et D2D. De plus, en raison de la complexité du contrôle et de la gestion, les connexions directes entre les appareils à proximité sont vulnérables. En conséquence, la communication D2D n’est pas robuste contre les menaces de sécurité et l’écoute clandestine. Pourtant, les co-interférences
de canal peuvent être adoptées pour aider les utilisateurs cellulaires (UC) et les paires D2D afin d’empêcher l’écoute clandestine. Dans cette thèse, nous étudions différents scénarios de problèmes d’allocation de ressources en utilisant le concept de sécurité de couche physique
«physical layer security» (PLS) pour la communication D2D sous-jacente aux réseaux cellulaires, tout en satisfaisant les exigences minimales de qualité de service (QoS) des liaisons cellulaires et D2D. Dans le cas où PLS est pris en compte, l’interférence peut aider à réduire l’écoute clandestine. Premièrement, nous formulons un scénario d’allocation de ressources dans lequel chaque bloc de ressources (RB) temps-fréquence de multiplexage par répartition orthogonale en fréquence (OFDM) peut être partagé par une seule CU et une paire D2D dans un réseau
unicellulaire. Le problème formulé est réduit au problème de correspondance tridimensionnelle, qui est généralement NP-difficile, et la solution optimale peut être obtenue par des
méthodes compliquées, telles que la recherche par force brute et/ou l’algorithme de branchement et de liaison qui ont une complexité de calcul exponentielle. Nous proposons donc une méta-heuristique basée sur l’algorithme de recherche tabou «Tabu Search» (TS) avec une complexité de calcul réduite pour trouver globalement la solution d’allocation de ressources radio quasi-optimale.----------ABSTRACT: The primary goal of introducing device-to-device (D2D) communication underlying fifthgeneration (5G) wireless communication systems is to increase spectral efficiency (ES). However, D2D communication underlying cellular networks can lead to performance degradation caused by severe co-channel interference between cellular and D2D links. In addition, due to the complexity of control and management, direct connections between nearby devices
are vulnerable. Thus, D2D communication is not robust against security threats and eavesdropping. On the other hand, the co-channel interference can be adopted to help cellular users (CUs) and D2D pairs to prevent eavesdropping. In this thesis, we investigate different resource allocation problem scenarios using the physical layer security (PLS) concept for the D2D communication underlying cellular networks, while satisfying the minimum quality of service (QoS) requirements of cellular and D2D link. If the PLS is taken into account, the interference can help reduce eavesdropping. First, we formulate a resource allocation scenario in which each orthogonal frequency-division
multiplexing (OFDM) time-frequency resource block (RB) can be shared by one single CU and one D2D pair in a single-cell network. The formulated problem is reduced to the threedimensional matching problem, which is generally NP-hard, and the optimal solution can be obtained through the complicated methods, such as brute-force search and/or branch-andbound algorithm that have exponential computational complexity. We, therefore, propose a meta-heuristic based on Tabu Search (TS) algorithm with a reduced computational complexity to globally find the near-optimal radio resource allocation solution
Recommended from our members
MIMO-based Friendly Jamming and Interference Management Techniques for Secure Wireless Communications
The ever-increasing growth of wireless systems has made them an essential part of our daily life. People rely heavily on wireless networks for communications and to conduct critical transactions from their mobile devices, including financial transactions, access to health records, etc. The proliferation of wireless communication devices opens the door for many security breaches, ranging from eavesdropping to jamming attacks. Such a disadvantage stems from the broadcast nature of wireless transmissions, which creates an exposed environment.
In this dissertation, we focus on eavesdropping attacks. While cryptographic techniques can be used to thwart eavesdropping attacks and enable secure wireless communications, they are not sufficient to protect the lower-layer headers of a packet (i.e., PHY and MAC headers). Hence, even though the secret message is encrypted, these unencrypted headers can be exploited by an adversary to extract invaluable information and initiate malicious attacks (e.g., traffic classification). Physical-layer (PHY-layer) security has been introduced as a promising candidate to prevent attacks that exploit unencrypted lower layer headers.
PHY-layer security techniques typically rely on injecting an intentional interference into the medium so as to confuse nearby eavesdroppers (Eve). Specifically, a legitimate transmit-receive (Alice-Bob) pair generates a bogus signal, namely friendly jamming (FJ), along with the information signal, to increase interference at Eve(s) but without affecting the legitimate receiver (Bob). Depending on which end of a legitimate link is responsible for generating the FJ signal, two types of FJ techniques exist: transmitter-based (TxFJ) and receiver-based (RxFJ).
In this dissertation, we propose to advance the state-of-art in PHY-layer security by considering multi-link scenarios, including multi-user multiple-input multiple-output (MU-MIMO) and peer-to-peer (P2P) networks. Specifically, we consider a scenario where one or more external Eve(s) attempt to snoop on communications of various links. In such networks, transmission of one link may be interfered with neighboring links' transmissions. Thus, special care must be dedicated to handling interference.
In our first contribution in this dissertation, we consider a P2P network tapped by external Eve(s) in which each Alice-Bob pair conceals its communications using TxFJ. TxFJ is realized at Alice side using MIMO precoding. The goal is to design the precoders for both information and TxFJ signals at all Alices so as to maximize a given utility (e.g., sum of communication rates) while preventing eavesdropping elsewhere. Because legitimate links do not cooperate with each other and there is no centralized authority to perform optimization, every link selfishly aims at maximizing its secrecy rate. Using non-cooperative game theory, we design a distributed method for maximizing the sum of secrecy rates. Under the exact knowledge of eavesdropping channels, we show that our distributed method has a comparable secrecy sum-rate to a centralized approach.
In our next contribution, we focus on employing practical precoders in our design for a P2P network. Specifically, we employed a zero-forcing-based (ZF-based) precoder for the TxFJ of each Alice-Bob pair in a P2P network. We also assume that each link has a certain rate demand to be satisfied. In such a scenario, even though the non-cooperative game designed for this P2P network is shown to be convergent to its unique Nash Equilibrium (NE), there is still no guarantee that the resulting NE is Pareto-optimal. Hence, we propose a modified price-based game, in which each link is penalized for generating interference on other legitimate links. We show that the price-based game converges to the Pareto-optimal point of secrecy rate region. We then leverage mixed-strategy games to provide solutions that are robust to uncertainties in knowledge of eavesdropping channels. The proposed ZF-based design of precoders is also implemented on software-defined radios to assess its performance on a single link in real-world scenarios.
In another contribution of this dissertation, we consider to further enhance the secrecy of each link in a P2P network by equipping each receiver with RxFJ. Hence, in addition to the power allocation between TxFJ and information signals, we optimize RxFJ power as well. We show that by using RxFJ at each Bob, we could leverage the well-established concept of concave games, which compared to non-convex games enjoy more simplified game-theoretic analysis. We derive sufficient conditions under which the game admits a unique NE. We also propose another version of our power control algorithm that can be implemented asynchronously, making it robust to transmission delays in the network.
In our last contribution, we consider the downlink of a MU-MIMO network in the presence of an external Eve. No knowledge of Eve's location is assumed at the access point. The network is studied in underloaded and overloaded conditions. In an underloaded (overloaded) network, the number of antennas at the access point is larger (smaller) than the total number of downlink users' antennas. In the overloaded setting, traditional methods of creating TxFJ, such as ZF-based methods, are infeasible. We propose a linear precoding scheme that relaxes such infeasibility in overloaded MU-MIMO networks. In the worst-case scenario where Eve has knowledge of the channels between access point and downlink users, we show that our method imposes the most stringent condition on the number of antennas required at Eve to cancel out TxFJ signals. We also show that choosing the number of independent streams to be sent to downlink users has an important role in achieving a tradeoff between security, reliability, and the achievable rate
D11.2 Consolidated results on the performance limits of wireless communications
Deliverable D11.2 del projecte europeu NEWCOM#The report presents the Intermediate Results of N# JRAs on Performance Limits of Wireless Communications and highlights the fundamental issues that have been investigated by the WP1.1. The report illustrates the Joint Research Activities (JRAs) already identified during the first year of the project which are currently ongoing. For each activity there is a description, an illustration of the adherence and relevance with the identified fundamental open issues, a short presentation of the preliminary results, and a roadmap for the joint research work in the next year. Appendices for each JRA give technical details on the scientific activity in each JRA.Peer ReviewedPreprin
Physical layer security solutions against passive and colluding eavesdroppers in large wireless networks and impulsive noise environments
Wireless networks have experienced rapid evolutions toward sustainability, scalability and interoperability. The digital economy is driven by future networked societies to a more holistic community of intelligent infrastructures and connected services for a more sustainable and smarter society. Furthermore, an enormous amount of sensitive and confidential information, e.g., medical records, electronic media, financial data, and customer files, is transmitted via wireless channels. The implementation of higher layer key distribution and management was challenged by the emergence of these new advanced systems. In order to resist various malicious abuses and security attacks, physical layer security (PLS) has become an appealing alternative. The basic concept behind PLS is to exploit the characteristics of wireless channels for the confidentiality. Its target is to blind the eavesdroppers such that they cannot extract any confidential information from the received signals. This thesis presents solutions and analyses to improve the PLS in wireless networks.
In the second chapter, we investigate the secrecy capacity performance of an amplify-andforward (AF) dual-hop network for both distributed beamforming (DBF) and opportunistic relaying (OR) techniques. We derive the capacity scaling for two large sets; trustworthy relays and untrustworthy aggressive relays cooperating together with a wire-tapper aiming to intercept the message. We show that the capacity scaling in the DBF is lower bounded by a value which depends on the ratio between the number of the trustworthy and the untrustworthy aggressive relays, whereas the capacity scaling of OR is upper bounded by a value depending on the number of relays as well as the signal to noise ratio (SNR).
In the third chapter, we propose a new location-based multicasting technique, for dual phase AF large networks, aiming to improve the security in the presence of non-colluding passive eavesdroppers. We analytically demonstrate that the proposed technique increases the security by decreasing the probability of re-choosing a sector that has eavesdroppers, for each transmission time. Moreover, we also show that the secrecy capacity scaling of our technique is the same as for broadcasting. Hereafter, the lower and upper bounds of the secrecy outage probability are calculated, and it is shown that the security performance is remarkably enhanced, compared to the conventional multicasting technique.
In the fourth chapter, we propose a new cooperative protocol, for dual phase amplify-andforward large wireless sensor networks, aiming to improve the transmission security while taking into account the limited capabilities of the sensor nodes. In such a network, a portion of the K relays can be potential passive eavesdroppers. To reduce the impact of these untrustworthy relays on the network security, we propose a new transmission protocol, where the source agrees to share with the destination a given channel state information (CSI) of source-trusted relay-destination link to encode the message. Then, the source will use this CSI again to map the right message to a certain sector while transmitting fake messages to the other sectors. Adopting such a security protocol is promising because of the availability of a high number of cheap electronic sensors with limited computational capabilities. For the proposed scheme, we derived the secrecy outage probability (SOP) and demonstrated that the probability of receiving the right encoded information by an untrustworthy relay is inversely proportional to the number of sectors. We also show that the aggressive behavior of cooperating untrusted relays is not effective compared to the case where each untrusted relay is trying to intercept the transmitted message individually.
Fifth and last, we investigate the physical layer security performance over Rayleigh fading channels in the presence of impulsive noise, as encountered, for instance, in smart grid environments. For this scheme, secrecy performance metrics were considered with and without destination assisted jamming at the eavesdropper’s side. From the obtained results, it is verified that the SOP, without destination assisted jamming, is flooring at high signal-to-noise-ratio values and that it can be significantly improved with the use of jamming