| 1. |
- A. Mouris, Boules, et al.
(author)
-
A Dual-Polarized Multi-Antenna Structure for Simultaneous Transmission of Wireless Information and Power
- 2019
-
In: 2019 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting, APSURSI 2019 - Proceedings. - : IEEE. ; , s. 1805-1806
-
Conference paper (peer-reviewed)abstract
- In this paper, a dual-polarized multi-antenna structure is designed at 2.45 GHz with the goal of allowing simultaneous transmission of wireless information and power. Differential feeding was used to minimize the mutual coupling due to radiation leakage in addition to a mushroom-type EBG structure for suppressing the surface waves. Simulation results for the proposed structure show a mutual coupling level lower than -40 dB between the information transmitting antenna and the power transmitting antennas for both polarizations. The isolation level between the antennas is improved by at least 22 dB and 14 dB for the E-plane and H-plane coupling, respectively.
|
|
| 2. |
- A. Mouris, Boules, et al.
(author)
-
Multi-tone Signal Optimization for Wireless Power Transfer in the Presence of Wireless Communication Links
- 2020
-
In: IEEE Transactions on Wireless Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 1536-1276 .- 1558-2248. ; 19:5, s. 3575-3590
-
Journal article (peer-reviewed)abstract
- In this paper, we study optimization of multi-tone signals for wireless power transfer (WPT) systems. We investigate different non-linear energy harvesting models. Two of them are adopted to optimize the multi-tone signal according to the channel state information available at the transmitter. We show that a second-order polynomial curve-fitting model can be utilized to optimize the multi-tone signal for any RF energy harvester design. We consider both single-antenna and multi-antenna WPT systems. In-band co-existing communication links are also considered in this work by imposing a constraint on the received power at the nearby information receiver to prevent its RF front end from saturation. We emphasize the importance of imposing such constraint by explaining how inter-modulation products, due to saturation, can cause high interference at the information receiver in the case of multi-tone signals. The multi-tone optimization problem is formulated as a non-convex linearly constrained quadratic program. Two globally optimal solution approaches using mixed-integer linear programming and finite branch-and-bound techniques are proposed to solve the problem. The achieved improvement resulting from applying both solution methods to the multi-tone optimization problem is highlighted through simulations and comparisons with other solutions existing in the literature.
|
|
| 3. |
- Andersson, Mattias, 1980-, et al.
(author)
-
Equivocation of Eve using two edge type LDPC codes for the binary erasure wiretap channel
- 2010
-
In: 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers (ASILOMAR). - 9781424497225 ; , s. 2045-2049
-
Conference paper (peer-reviewed)abstract
- We consider transmission over a binary erasure wiretap channel using the code construction method introduced by Rathi et al. based on two edge type Low-Density Parity-Check (LDPC) codes and the coset encoding scheme. By generalizing the method of computing conditional entropy for standard LDPC ensembles introduced by Méasson, Montanari, and Urbanke to two edge type LDPC ensembles, we show how the equivocation for the wiretapper can be computed. We find that relatively simple constructions give very good secrecy performance and are close to the secrecy capacity.
|
|
| 4. |
- Andersson, Mattias, et al.
(author)
-
Nested Polar Codes for Wiretap and Relay Channels
- 2010
-
In: IEEE Communications Letters. - : IEEE. - 1089-7798 .- 1558-2558. ; 14:8, s. 752-754
-
Journal article (peer-reviewed)abstract
- We show that polar codes asymptotically achieve the whole capacity-equivocation region for the wiretap channel when the wiretapper's channel is degraded with respect to the main channel, and the weak secrecy notion is used. Our coding scheme also achieves the capacity of the physically degraded receiver-orthogonal relay channel. We show simulation results for moderate block length for the binary erasure wiretap channel, comparing polar codes and two edge type LDPC codes.
|
|
| 5. |
- Blasco-Serrano, Ricardo, et al.
(author)
-
A Measurement Rate-MSE Tradeoff for Compressive Sensing Through Partial Support Recovery
- 2014
-
In: IEEE Transactions on Signal Processing. - : IEEE Signal Processing Society. - 1053-587X .- 1941-0476. ; 62:18, s. 4643-4658
-
Journal article (peer-reviewed)abstract
- We study the fundamental relationship between two relevant quantities in compressive sensing: the measurement rate, which characterizes the asymptotic behavior of the dimensions of the measurement matrix in terms of the ratio m/ log n (m being the number of measurements and n the dimension of the sparse signal), and the mean square estimation error. First, we use an information-theoretic approach to derive sufficient conditions on the measurement rate to reliably recover a part of the support set that represents a certain fraction of the total signal power when the sparsity level is fixed. Second, we characterize the mean square error of an estimator that uses partial support set information. Using these two parts, we derive a tradeoff between the measurement rate and the mean square error. This tradeoff is achievable using a two-step approach: first support set recovery, then estimation of the active components. Finally, for both deterministic and random signals, we perform a numerical evaluation to verify the advantages of the methods based on partial support set recovery.
|
|
| 6. |
- Blasco-Serrano, Ricardo, et al.
(author)
-
An Achievable Measurement Rate-MSE Tradeoff in Compressive Sensing Through Partial Support Recovery
- 2013
-
In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). - New York : IEEE. - 9781479903566 ; , s. 6426-6430
-
Conference paper (peer-reviewed)abstract
- For compressive sensing, we derive achievable performance guarantees for recovering partial support sets of sparse vectors. The guarantees are determined in terms of the fraction of signal power to be detected and the measurement rate, defined as a relation between the dimensions of the measurement matrix. Based on this result we derive a tradeoff between the measurement rate and the mean square error, and illustrate it by a numerical example.
|
|
| 7. |
- Blasco-Serrano, Ricardo, et al.
(author)
-
Bandwidth efficient compress-and-forward relaying based on joint source-channel coding
- 2011
-
In: 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011. - : IEEE conference proceedings. - 9781612842554 ; , s. 1800-1804
-
Conference paper (peer-reviewed)abstract
- We propose a new code design for compress-and-forward relaying over bandlimited relay-to-destination channels. The main contribution of this paper is a code design based on joint (source-channel) coding and modulation that uses the correlation between the observations at the relay and the destination as protection against channel errors. This allows for relay nodes with reduced complexity, shifting most of the processing requirements to the destination node. Moreover, by using scalar quantizers with an entropy constraint our system provides remarkable performance in channel conditions where neither amplify-and-forward nor compress-and-forward efficiently exploit the presence of a relay node. Simulation results confirm the benefits of our proposed system.
|
|
| 8. |
- Blasco-Serrano, Ricardo, 1983-
(author)
-
Coding Strategies for Compress-and-Forward Relaying
- 2010
-
Licentiate thesis (other academic/artistic)abstract
- The deployment of large communication networks with many autonomous devices has opened new possibilities for transmission. In particular cooperation among the different nodes has been identified as an enabling technology to satisfy the increasing demand of resources. This thesis studies different coding strategies for cooperation in relay channels in the form of compress-and-forward.In the first part of this thesis we consider the application of the newly introduced polar codes for compress-and-forward relaying in relay channels with orthogonal receivers. First we construct polar codes for compress-and-forward relaying based on Slepian-Wolf coding for the scenario where the capacity of the relay-destination channel is large enough. We then consider the more general picture where the capacity of the relay-destination channel is arbitrary. As for Wyner-Ziv coding, we employ nested polar codes for source and channel coding that allow for compression at any desired distortion and exploit the correlation between the observations of the source transmission to minimize the transmission rate over the relay-destination channel. This construction allows for transmission at the prominent compress-and-forward rate under some additional constraints.In the second part of this thesis we propose a new coding strategy for compress-and-forward relaying for half-duplex Gaussian channels. Our code construction is based on simple code concatenation for joint source-channel coding at the relay and iterative decoding at the destination. Finally, we propose several realizations of the structure at the relay and different iterative decoding algorithms in order to adapt the construction to different scenarios. Our simulation results show remarkable performance gains over other cooperation strategies such as decode-and-forward and amplify-and-forward in the scenarios where both source-relay and relay-destination links have low signal-to-noise ratios.
|
|
| 9. |
- Blasco-Serrano, Ricardo, et al.
(author)
-
Communication and interference coordination
- 2014
-
In: 2014 Information Theory and Applications Workshop, ITA 2014 - Conference Proceedings. - : IEEE conference proceedings. ; , s. 6804218-
-
Conference paper (peer-reviewed)abstract
- We study the problem of controlling the interference created to an external observer by a communication processes. We model the interference in terms of its type (empirical distribution), and we analyze the consequences of placing constraints on the admissible type. Considering a single interfering link, we characterize the communication-interference capacity region. Then, we look at a scenario where the interference is jointly created by two users allowed to coordinate their actions prior to transmission. In this case, the tradeoff involves communication and interference as well as coordination. We establish an achievable communication-interference region and show that efficiency is significantly improved by coordination.
|
|
| 10. |
- Blasco-Serrano, Ricardo, et al.
(author)
-
Comparison of Underlay and Overlay Spectrum Sharing Strategies in MISO Cognitive Channels
- 2012
-
In: 2012 7th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM). - : IEEE Computer Society. - 9781936968558 ; , s. 224-229
-
Conference paper (peer-reviewed)abstract
- We consider an extension of the cognitive radio channel model in which the secondary transmitter has to obtain (“learn”) the primary message in a first phase rather than having non-causal knowledge of it. We propose an achievable rate region that combines elements of decode-and-forward relaying with coding for the pure cognitive radio channel model. Moreover, we find the choice of parameters that maximize the secondary rate under a primary rate constraint. Finally, we compare numerically the performance of our system to that of an underlay scheme that combines beamforming, rate splitting, and successive decoding. We observe that although the overlay design provides higher rates, the losses due to the first phase are quite severe. In fact, for the considered scenarios, cleverly designed underlay schemes can provide comparable performance.
|
|
| 11. |
- Blasco-Serrano, Ricardo, et al.
(author)
-
Compress-and-forward relaying based on symbol-wise joint source-channel coding
- 2010
-
In: IEEE International Conference on Communications. - : IEEE conference proceedings. - 9781424464043 ; , s. 1-5
-
Conference paper (peer-reviewed)abstract
- We propose a new compress-and-forward implementation for the relay channel based on joint source-channel coding techniques. The relay performs scalar quantization of its observation in combination with a redundant index mapping. Our system utilizes the correlation between the quantized signal and the direct-link observation of the transmitted symbols as redundancy for error protection on the relay-to-destination link. In order to fully exploit this correlation the destination requires iterative decoding to recover the quantized observation sent by the relay. Once regenerated, this quantized signal is optimally combined with the direct-link observation to decode the message conveyed by the source. By quantizing the observed signal itself rather than a measure on the reliability of the information bits (e.g. a posteriori probabilities from a decoder), and by using digital communication methods on the relay-to-destination link our system yields superior performance to that of amplify-and-forward, decode-and-forward and previous implementations of compress-and-forward based on soft decoding.
|
|
| 12. |
|
|
| 13. |
- Blasco-Serrano, Ricardo, 1983-
(author)
-
On Compression and Coordination in Networks
- 2013
-
Doctoral thesis (other academic/artistic)abstract
- The current trends in communications suggest that the transfer of information between machines will soon predominate over the traditional human-oriented exchange. The new applications in machine-to-machine communications demand for a new type of networks that are much larger and, especially, much denser. However, there are currently many challenges that hinder an efficient deployment of such networks. In this thesis, we study some fundamental and practical aspects of two of these challenges: coordination and compression.The problem of coordination in a network is that of organizing the nodes to make them work together. The information-theoretic abstraction of this corresponds to generating actions with a desired empirical distribution. In this thesis, we construct polar codes for coordination for a variety of topologies. These codes combine elements of source coding, used to produce the actions, with elements of channel coding, used to obtain efficient descriptions. We show that our constructions achieve several fundamental coordination limits in a structured manner and with affordable complexity.Then, we consider the problem of coordinating communications to control the interference created to an external observer, measured in terms of its empirical distribution.To study the relationship between communication and interference, we introduce the notion of communication-interference capacity region. We obtain a complete characterization of this region for the single user scenario and a partial solution for a multiple user case. Our results reveal a fundamental tradeoff between communication, coordination, and interference in this type of networks.The second problem considered in this thesis, compression, involves capturing the essence of data and discarding the irrelevant aspects to obtain compact representations. This takes on a new dimension in networks, where the importance of data is no longer a local matter. In this thesis, we show that polar codes are also suitable for achieving information-theoretic bounds that involve compression in networks. More precisely, we extend our coordination constructions to realize compress-and-forward relaying with affordable complexity.In the last part of the thesis, we take a network approach to the problem of compressive sensing and develop methods for partial support set recovery. We use these methods to characterize the tradeoff between the measurement rate and the mean square error. Finally, we show that partial support recovery is instrumental in minimizing measurement outages when estimating random sparse signals.
|
|
| 14. |
- Blasco-Serrano, Ricardo, et al.
(author)
-
Polar codes for compress-and-forward in binary relay channels
- 2010
-
In: 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010. - : IEEE conference proceedings. - 9781424497225 ; , s. 1743-1747
-
Conference paper (peer-reviewed)abstract
- We construct polar codes for binary relay channels with orthogonal receiver components. We show that polar codes achieve the cut-set bound when the channels are symmetric and the relay-destination link supports compress-and-forward relaying based on Slepian-Wolf coding. More generally, we show that a particular version of the compress-and-forward rate is achievable using polar codes for Wyner-Ziv coding. In both cases the block error probability can be bounded as O(2-Nβ) for 0 < β < 1/2 and sufficiently large block length N.
|
|
| 15. |
- Blasco-Serrano, Ricardo, et al.
(author)
-
Polar Codes for Cooperative Relaying
- 2012
-
In: IEEE Transactions on Communications. - : IEEE Press. - 0090-6778 .- 1558-0857. ; 60:11, s. 3263-3273
-
Journal article (peer-reviewed)abstract
- We consider the symmetric discrete memoryless relay channel with orthogonal receiver components and show that polar codes are suitable for decode-and-forward and compress-and-forward relaying. In the first case we prove that polar codes are capacity achieving for the physically degraded relay channel; for stochastically degraded relay channels our construction provides an achievable rate. In the second case we construct sequences of polar codes that achieve the compress-and-forward rate by nesting polar codes for source compression into polar codes for channel coding. In both cases our constructions inherit most of the properties of polar codes. In particular, the encoding and decoding algorithms and the bound on the block error probability O(2 (N beta)) which holds for any 0 < beta < 1/2.
|
|
| 16. |
- Blasco-Serrano, Ricardo, et al.
(author)
-
Polar Codes for Coordination in Cascade Networks
- 2012
-
In: International Zurich Seminar on Communications. - Zürich : Eidgenössische Technische Hochschule Zürich. ; , s. 55-58
-
Conference paper (peer-reviewed)abstract
- We consider coordination in cascade networks and construct sequences of polar codes that achieve any point in a special region of the empirical coordination capacity region. Our design combines elements of source coding to generate actions with the desired type with elements of channel coding to minimize the communication rate. Moreover, we bound the probability of malfunction of a polar code for empirical coordination. Possible generalizations and open problems are discussed.
|
|
| 17. |
- Caso, G., et al.
(author)
-
Cooperative Sensing of Spectrum Opportunities
- 2015
-
In: Opportunistic Spectrum Sharing and White Space Access. - Hoboken, NJ : Wiley-Blackwell. ; , s. 143-165
-
Book chapter (other academic/artistic)abstract
- Reliability and availability of sensing information gathered from local spectrum sensing (LSS) by a single Cognitive Radio is strongly affected by the propagation conditions, period of sensing, and geographical position of the device. For this reason, cooperative spectrum sensing (CSS) was largely proposed in order to improve LSS performance by using cooperation between Secondary Users (SUs). The goal of this chapter is to provide a general analysis on CSS for cognitive radio networks (CRNs). Firstly, the theoretical system model for centralized CSS is introduced, together with a preliminary discussion on several fusion rules and operative modes. Moreover, three main aspects of CSS that substantially differentiate the theoretical model from realistic application scenarios are analyzed: (i) the presence of spatiotemporal correlation between decisions by different SUs; (ii) the possible mobility of SUs; and (iii) the nonideality of the control channel between the SUs and the Fusion Center (FC). For each aspect, a possible practical solution for network organization is presented, showing that, in particular for the first two aspects, cluster-based CSS, in which sensing SUs are properly chosen, could mitigate the impact of such realistic assumptions.
|
|
| 18. |
- Cavarec, Baptiste, et al.
(author)
-
Achieving SWIPT through differential permutation-based coding intelligent reflecting surface
- 2021
-
In: 2021 17th International Symposium on Wireless Communication Systems (ISWCS). - : Institute of Electrical and Electronics Engineers (IEEE).
-
Conference paper (peer-reviewed)abstract
- In this paper, intelligent reflecting surfaces (IRSs) are exploited for simultaneous wireless information and power transfer. In the considered setup, the IRS, illuminated by a power transmitter, provides power to integrated sensors through energy harvesting while simultaneously transmitting information through differential permutation-based coding. The problem of allocating the IRS elements to either information or power transmission is studied, highlighting the tradeoff between the system throughput and the harvested power. The conducted performance analysis emphasizes the suitability of using IRSs in a SWIPT scenario without the need for cabled links or channel state information.
|
|
| 19. |
- De Nardis, L., et al.
(author)
-
Impact of mobility in cooperative spectrum sensing : Theory vs. simulation
- 2012
-
In: Wireless Communication Systems (ISWCS), 2012 International Symposium on. - : IEEE. - 9781467307604 ; , s. 416-420
-
Conference paper (peer-reviewed)abstract
- This work addresses the problem of cooperative spectrum sensing in cognitive radio networks, focusing on the impact of mobility on performance of cooperative sensing. First, a review of the most recent results on cooperative spectrum sensing is provided, resulting in the identification of measurement correlation and frame error rate in the reporting channel as the main parameters influencing the performance of cooperative sensing schemes. Next, the paper discusses the extension of the analysis to the case of mobile sensors, and determines the set of assumptions made in existing literature when taking into account mobility in sensing. The paper moves then to remove some of such assumptions, by presenting simulation results obtained in presence of realistic models for propagation in the considered area, as well as of a realistic mobility model. A comparison between theoretical derivation and simulation results shows that correlation among measurements taken by different sensors and the selected mobility model may significantly affect the sensing performance.
|
|
| 20. |
- Dössel, Leefke, et al.
(author)
-
Anytime reliability of systematic LDPC convolutional codes
- 2012
-
In: Communications (ICC), 2012 IEEE International Conference on. - : IEEE. - 9781457720529 ; , s. 2171-2175
-
Conference paper (peer-reviewed)abstract
- We propose a LDPC Convolutional Code ensemble together with an expanding-window message-passing decoder that asymptotically have anytime properties when used for streaming transmission on the binary erasure channel. We show analytically that the decoding erasure probability of these codes decays exponentially over decoding delay and determine the corresponding anytime exponents.
|
|
| 21. |
- Forssell, Henrik, et al.
(author)
-
Feature-Based Multi-User Authentication for Parallel Uplink Transmissions
- 2016
-
In: 2016 9TH INTERNATIONAL SYMPOSIUM ON TURBO CODES AND ITERATIVE INFORMATION PROCESSING (ISTC). - : IEEE. - 9781509034017 ; , s. 355-359
-
Conference paper (peer-reviewed)abstract
- We study a multi-user up-link scenario where an attacker tries to impersonate the legitimate transmitters. We present a new framework for deriving a posteriori attack probabilities from the channel observations at the access point, which enables fast intrusion detection and authentication at the physical layer and can be exploited to reduce the security overhead by offtoading higher-layer authentication schemes. This is highly relevant for delay-sensitive applications that are targeted in 5G where the security overhead may limit the real-time performance. We take a factor-graph approach that can easily be extended to take into account other features, channel models, and radio access schemes. While related works only consider single-link scenarios, the multi-user approach in this paper allows us to exploit the cross-channel correlation of the large-scale fading parameters that is due to the propagation environment for improving the detection performance. As numerical results show, especially for slowly changing channels with high correlation our approach provides significant performance gains.
|
|
| 22. |
- Forssell, Henrik, et al.
(author)
-
On the Impact of Feature-Based Physical Layer Authentication on Network Delay Performance
- 2017
-
In: Globecom 2017 - 2017 IEEE Global Communications Conference. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781509050192
-
Conference paper (peer-reviewed)abstract
- Feature-based authentication schemes that verify wireless transmitter identities based on physical-layer features allow for fast and efficient authentication with minimal overhead. Hence, they are interesting to consider for safety-critical applications where low latency and high reliability is required. However, as erroneous authentication decisions will introduce delays, we propose to study the impact of feature-based schemes on the system-level performance. In this paper, we therefore study the queuing performance of a line-of-sight wireless link that employs a feature-based authentication scheme based on the complex channel gain. Using stochastic networks calculus, we provide bounds on the delay performance which are validated by numerical simulations. The results show that the delay and authentication performance is highly dependent on the SNR and Rice factor. However, under good channel conditions, a missed-detection rate of 10(-8) can be achieved without introducing excessive delays in the system.
|
|
| 23. |
- Forssell, Henrik, 1991-
(author)
-
Performance Guarantees for Physical Layer Authentication in Mission-Critical Communications
- 2021
-
Doctoral thesis (other academic/artistic)abstract
- As the application areas for wireless communications are expanding, we also see new security vulnerabilities arise due to the open nature of the wire- less medium. One particularly challenging problem is how to guarantee the security of emerging mission-critical communications, e.g., realized by fifth generation (5G) mobile networks, that will enable use-cases like industrial automation, vehicular communications, and smart grids. As the room for security overhead is limited in mission-critical communications, mainly due to the associated strict requirements on latency and reliability, new lightweight security techniques are researched within the area of physical layer security. In particular, feature-based physical layer authentication (PLA), exploiting transmitter-specific features extracted from received signals for device au- thentication, is considered a promising solution for lightweight authentication and intrusion detection in mission-critical communications. In this thesis, we provide mathematical tools for analyzing channel-based PLA schemes, and in particular, for deriving worst-case performance guarantees appropriate for mission-critical contexts. We consider worst-case performance guarantees for feature-based PLA from two perspectives: Firstly, we provide mathematical bounds on the delay-performance im- pacts that arise due to the unlikely but inevitable erroneous authentication decisions (i.e., false alarms and missed detections). We model the PLA scheme using queueing analysis, develop models for active impersonation attacks, and derive bounds on the queueing delay violation probability using tools from stochastic network calculus. We consider the performance for both single- and multiple-antenna receiver architectures, and furthermore, a distributed multiple-antenna system in which we analyze varying degrees of distributed processing. These results establish under which practical deployments and channel conditions feature-based PLA would constitute a viable option for mission-critical applications. For instance, we find that for low-mobility scenarios with line-of-sight conditions, as exemplified by an industrial automation scenario with fixed sensor deployment, PLA can be used for strongly enhanced security while simultaneously maintaining mission-critical latency deadlines with high reliability. Moreover, we discuss extensions that would allow analysis of scenarios without line-of-sight and with higher mobility. From the second perspective, we provide tools for deriving the worst-case detection performance under optimal attackers that are aware of the PLA scheme. First, we consider a distributed PLA setting where authentication is based on the channel-states observed at multiple distributed radio-heads. We derive the optimal single-antenna attack strategy and corresponding missed detection probability, and provide a heuristic method for finding the optimal spatial attack position with respect to a given deployment. We then extend the results by considering a multiple-antenna attacker, the correspond- ing optimal pre-coding strategies, and the detection performance under the worst-case attacker. Furthermore, we analyze the impacts of limited channel state information (CSI) and power budgets at the attacker and provide a counter-strategy that can be used by the PLA receiver. With the single- antenna attacker, our results show significant detection performance benefits from a distributed antenna setting, which argues for practical relevance of PLA within modern 5G technologies like coordinated multi-point (CoMP) and distributed multiple-input multiple-output (MIMO) systems. For the multiple-antenna attacker, we observe significant impacts given perfect CSI knowledge and favorable channel conditions at the attacker. However, under realistic assumptions on power budget, CSI imperfections, and through the proposed counter-strategy, we find that strict detection performance guarantees can be maintained.
|
|
| 24. |
- Forssell, Henrik, 1991-, et al.
(author)
-
Physical Layer Authentication in Mission-Critical MTC Networks : A Security and Delay Performance Analysis
- 2019
-
In: IEEE Journal on Selected Areas in Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 0733-8716 .- 1558-0008. ; 37:4, s. 795-808
-
Journal article (peer-reviewed)abstract
- We study the detection and delay performance impacts of a feature-based physical layer authentication (PLA) protocol in mission-critical machine-type communication (MTC) networks. The PLA protocol uses generalized likelihood-ratio testing based on the line-of-sight (LOS), single-input multiple- output channel-state information in order to mitigate imper- sonation attempts from an adversary node. We study the de- tection performance, develop a queueing model that captures the delay impacts of erroneous decisions in the PLA (i.e., the false alarms and missed detections), and model three different adversary strategies: data injection, disassociation, and Sybil attacks. Our main contribution is the derivation of analytical delay performance bounds that allow us to quantify the delay introduced by PLA that potentially can degrade the performance in mission-critical MTC networks. For the delay analysis, we utilize tools from stochastic network calculus. Our results show that with a sufficient number of receive antennas (approx. 4-8) and sufficiently strong LOS components from legitimate devices, PLA is a viable option for securing mission-critical MTC systems, despite the low latency requirements associated to corresponding use cases. Furthermore, we find that PLA can be very effective in detecting the considered attacks, and in particular, it can significantly reduce the delay impacts of disassociation and Sybil attacks.
|
|
| 25. |
- Forssell, Karl Henrik, et al.
(author)
-
Delay Performance of Distributed Physical Layer Authentication Under Sybil Attacks
-
Other publication (other academic/artistic)abstract
- Physical layer authentication (PLA) has recently been discussed in the context of URLLC due to its low complexity and low overhead. Nevertheless, these schemes also introduce additional sources of error through missed de- tections and false alarms. The trade-offs of these characteristics are strongly dependent on the deployment scenario as well as the processing architec- ture. Thus, considering a feature-based PLA scheme utilizing channel-state information at multiple distributed radio-heads, we study these trade-offs analytically. We model and analyze different scenarios of centralized and de- centralized decision-making and decoding, as well as the impacts of a single- antenna attacker launching a Sybil attack. Based on stochastic network cal- culus, we provide worst-case performance bounds on the system-level delay for the considered distributed scenarios under a Sybil attack. Results show that the arrival-rate capacity for a given latency deadline is increased for the distributed scenarios. For a clustered sensor deployment, we find that the distributed approach provides 23% higher capacity when compared to the centralized scenario.
|
|
