Next Article in Journal
A Multi-Aperture Technique for Longitudinal Miniaturization of UWB 3 dB Dual-Layer SIW Coupler
Previous Article in Journal
A Comparative Review on Enhancing Visual Simultaneous Localization and Mapping with Deep Semantic Segmentation
Previous Article in Special Issue
Secure Computing for Fog-Enabled Industrial IoT
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Secrecy Performance Enhancement Using Self-Interference Cancellation in Wireless Mutual Broadcast Networks for Proximity-Based Services

by
Taesoo Kwon
1,* and
HyeonWoo LEE
2
1
Department of Computer Science and Engineering, Seoul National University of Science and Technology (SeoulTech), Seoul 01811, Republic of Korea
2
Department of Mobile Systems Engineering, Dankook University, Yongin 16890, Republic of Korea
*
Author to whom correspondence should be addressed.
Sensors 2024, 24(11), 3389; https://doi.org/10.3390/s24113389
Submission received: 29 April 2024 / Revised: 19 May 2024 / Accepted: 22 May 2024 / Published: 24 May 2024
(This article belongs to the Special Issue Advances in Wireless Ad-Hoc and Sensor Networks towards 6G)

Abstract

:
With the increasing demand for data exchange between nearby devices in proximity-based services, enhancing the security of wireless mutual broadcast (WMB) networks is crucial. However, WMB networks are inherently vulnerable to eavesdropping due to the open broadcast nature of their communication. This paper investigates the improvement of secrecy performance in random-access-based WMB (RA-WMB) networks by integrating physical layer security (PLS) techniques with hybrid duplex (HBD) operations under a stochastic geometry framework. The HBD method balances half-duplex (HD) receiving and full-duplex (FD) transceiving, utilizing self-interference cancellation (SIC) to enhance PLS performance. Key operational parameters, including transmission probability (TxPr), friendly jammer density, and conditions for FD operation, are designed to maximize secrecy performance. The analytical and numerical results demonstrate significant improvements in PLS performance, with SIC playing a critical role, particularly in scenarios with dense legitimate nodes, and with TxPr adjusted to balance HD receiving and FD transceiving based on SIC imperfections. The proposed design principles provide a comprehensive framework for enhancing the security of WMB networks, addressing the complex interplay of interference and SIC in various network configurations.

1. Introduction

With the anticipated arrival of sixth generation (6G) technology, a highly intelligent society and lifestyle are on the horizon, driven by extensive wireless information exchanges between massive devices including sensors, Internet of Things (IoT) devices, mobile phones, and vehicles [1]. This proliferation of devices is expected to accelerate exponentially [2]. In particular, data sharing between legitimate yet unspecified neighboring nodes not only facilitates the detection of nearby devices [3,4,5] but also serves as a foundation for advanced proximity-based services. These services encompass a wide range of emerging applications, including geographic content sharing between nearby users or IoT devices [6], user- or device-aware services using Bluetooth low energy (BLE) beacons [7], social community detection in mobile social networks [8], and dissemination of driving safety information in vehicle-to-vehicle (V2V) networks [9,10]. This process, termed “wireless mutual broadcast (WMB)” [11] in this study, typically begins by broadcasting information to unspecified devices and gathering data from those in close proximity. However, this WMB is inherently vulnerable to eavesdropping because a transmitter ingenuously disseminates its broadcast message (BM) to unknown nodes. On the other hand, physical layer security (PLS) ensures nonzero secrecy capacity by maintaining the link quality of eavesdroppers below that of legitimate nodes [12], gaining significant attention as an effective alternative or complement to traditional cryptographic methods [13,14]. This approach is particularly useful in large-scale distributed networks where managing and sharing security keys may be challenging [14,15]. Recently, its applications have been being extended to various networks, including satellite–terrestrial integrated networks [16], simultaneous wireless information and power transfer networks [17], and covert mmWave communication networks [18]. From this perspective, this paper conducts an analytical exploration of the spatial PLS performances of the WMB.
In PLS, for a nonzero secrecy capacity [12], the connection quality for unauthorized eavesdroppers (Eves) needs to be kept below the performance of legitimate receivers, and this strategy may require knowledge about nearby legitimate nodes [13,14]. However, a WMB operation often commences without such prior information, and this poses significant challenges in integrating WMB with PLS strategies [11]. The work of [11] investigated the PLS performances of a random-access-based WMB (RA-WMB) network with half-duplex (HD) nodes, where nodes probabilistically alternate between transmitting and receiving broadcast messages (BMs). Although the work of [11] attempted to quantify the contribution of PLS on RA-WMB, it is still questionable whether or not the PLS performance of WMB can be further improved, and if so, how it can be achieved. The works in [19,20,21,22,23] demonstrated that full-duplex (FD) jamming can contribute to enhancing network-wide PLS performance depending on the self-interference cancellation (SIC) capability. This benefit motivates us to investigate the potential of SIC and to examine mediating HD and FD, in terms of enhancing the PLS performance of WMB.

1.1. Related Works

The data broadcast between neighbor nodes, i.e., WMB, supports a wide range of applications, including ambient data sharing [1,6], mobile social networking [8], intelligent transportation [9,10,24], and emergency communications [25,26]. Like any wireless network with performance limited by mutual interference [27], interference in WMB networks similarly impairs system performance. Stochastic geometry facilitates the mathematical tractability of wireless network performances through stochastically modeling the spatial radio interaction among devices [27], and several literatures have quantified and improved network-wide performances of WMB [24,28,29,30,31,32,33,34,35,36], under stochastic geometry frameworks. The works in [28,29] mathematically quantified the average number of successfully discovered nodes, and they proposed the design principles for improving performance. The peer discovery is a representative example of WMB when a BM is used for proximity awareness. The work in [31] studied the resource allocation method to mitigate interference through geo-location-based access in V2V WMB networks, and it demonstrated the performance gain through modeling vehicular networks based on stochastic geometry. The study on WMB has been further extended in conjunction with various issues including low power design [32], full duplex [33,34], and energy harvesting [35], in terms of network-wide performances. The works in [33,34] demonstrated that SIC significantly affects RA-WMB performance depending on the level of residual self-interference (RSI). In particular, the work of [34] showed that adjusting the proportions of simultaneous transceiving nodes and receiving-only nodes may improve RA-WMB performance compared to a scenario where all nodes are simultaneously transceiving with SIC, especially at high RSI levels. Furthermore, the work of [36] analytically examined the use of device-to-device (D2D) multicast for emergency information dissemination of a flying central station. Furthermore, the work of [24] analytically designed the broadcast period of vehicles in cooperative vehicle systems where vehicles periodically broadcast such information as position and speed via random access, using stochastic geometry theory. However, all of those works did not deal with the PLS performances of WMB.
The PLS offers advantages in the context of wireless networks by leveraging the inherent characteristics of physical medium [13], thus providing security that is inherently robust against eavesdropping without the complexities and vulnerabilities associated with key management and algorithmic encryption in conventional cryptographic methods. This makes PLS particularly suitable for dynamic and resource-constrained environments, such as wireless sensor, IoT, V2V, and D2D networks [14,15]. In order to confound Eves more actively, a legitimate transmitter and friendly jammer send artificial noise (AN) for impairing Eves’ link [14,15,37]. However, AN may be rather harmful to other nearby legitimate nodes in wireless networks because jamming signals raise interference. In this regard, through applying stochastic geometry theory, network-wide secrecy performances have been analytically quantified in various scenarios, e.g., the millimeter wave ad hoc network [38], three dimensional IoT networks [39], covert communication in D2D networks [40], vehicular networks [41], and uncoordinated random jamming in wireless sensor networks [42]. Further, several studies investigated the effect of an FD jamming approach, where FD nodes receive informative data from their transmitter while simultaneously sending AN for confounding Eves [19,20], in terms of strengthening network-wide secrecy performances in wireless distributed networks [21,22], under stochastic geometry frameworks. In particular, the work of [22] demonstrated that FD jamming impacts PLS performance depending on RSI level and proposed a switchable FD/HD mode. Hence, they concentrated on enhancing security by impairing the connections to these Eves while preserving the quality of the link to an intended receiver. In contrast, the WMB studied in this paper experiences inevitable performance degradation due to jamming, because both receivers and eavesdroppers remain unknown. This lack of information significantly makes the PLS in WMB challenging. The work of [11] analytically investigated the spatial secrecy performance of RA-WMB networks and demonstrated that simply adjusting a fraction of transmitters, by controlling transmission probability (TxPr), improved PLS performance. However, it did not consider FD operations with SIC.

1.2. Contributions and Organization

This paper investigates the performance and design principles of the secure RA-WMB that uses SIC for enhancing PLS performance. In particular, this study analytically quantifies the impact of SIC, through adjusting the proportion of legitimate HD receiving (i.e., not using SIC) and FD transceiving (i.e., using SIC) nodes, and this mixture of HD receiving and FD transceiving is referred to as the hybrid duplex (HBD). Even though a more advanced access method, such as carrier sense multiple access (CSMA), can further improve the performance, for mathematical tractability of network-wide PLS performance, this paper focuses on exploring the PLS of the HBD RA-WMB, and more complex WMB issues will remain as future works. This secure RA-WMB can serve as a baseline for evaluating the performance of more advanced secure WMB systems. The key contributions of this paper are highlighted as follows:
  • Comprehensive analysis of secrecy performance for HBD RA-WMB: This study analytically expresses the PLS performance of the HBD RA-WMB and quantitatively elucidates its inherent properties regarding the spatial radio interaction among legitimate FD transceving and HD receiving nodes, Eves, and friendly jammers. In particular, the analysis and numerical results demonstrate that the significant differences in the secrecy performance between secure HBD RA-WMB and conventional approaches, such as nonsecure RA-WMB [28,29,34] and secure HD RA-WMB [11]. These conventional methods can be regarded as special cases within the scope of the comprehensive results investigated herein.
  • Proposition of design principles for secure HBD RA-WMB: This study proposes the design principles of the key operation parameters including TxPr and friendly jammer density, in terms of maximizing the secrecy performance. In particular, the TxPr determines the operation method of nodes, such as FD transceving and HD receiving, through comprehensively considering the imperfections of SIC and beneficial and harmful effects of interference, with the aim of enhancing the secrecy performance of WMB. The analytical expression of the TxPr in secure HBD operation design explicitly distinguishes itself from the conventional non-secure RA-WMB design. In contrast, it is demonstrated that friendly jammers are not quite beneficial.
  • Quantification of required SIC capability: This study endeavors to quantitatively examine the RSI condition in imperfect SIC that are required for FD transceiving to significantly enhance secrecy performance, through identifying the conditions for the FD optimality and superiority. FD optimality denotes that it is optimal for all nodes to work in FD, while FD superiority indicates that FD outperforms HD in terms of secrecy performance. The FD optimality and superiority are addressed in terms of Eves density as well as RSI amount and wireless channels. It is remarkably interesting that these conditions increasingly become loose as Eves becomes dense.
Based on the comprehensive findings presented in this paper, Table 1 provides a concise summary and comparison of the design principles of TxPr, which determines the operations of WMB nodes for various RSI levels ranging from 0 to , between secure and nonsecure RA-WMB approaches. Note that the HD performance in [11] is equivalent to the HBD performance with an infinite RSI level in the model analyzed in this paper. In this table, λ B and λ E denote the spatial densities of legitimate nodes and Eves, respectively, and ν B * and β denote the optimal proportion of legitimate nodes transceiving with SIC (i.e., TxPr) and the amount of RSI, respectively. (Hence, the proportion of legitimate nodes receiving without SIC becomes 1 ν B * . Furthermore, the properties of ν B * are inferred from its suboptimal values and numerical results.) Further, β F O and β F S denote the values of β required for the FD optimality and superiority, respectively. The notations are described in Table 2, which also lists the parameter values used for the numerical results in Section 6.
The remainder of this paper is organized as follows. Section 2 describes the system model for the HBD RA-WMB and defines the secrecy performance metric. Section 3 analytically quantifies the secrecy performance, which unveils the inherent properties of HBD RA-WMB and the impact of AN. Section 4 proposes the design method of the HBD RA-WMB in terms of improving the secrecy performance. Section 5 further elaborates on the condition for FD operation as a special yet typical duplex scenario. Then, Section 6 discusses the numerical results, and Section 7 concludes the paper.
Notations: E [ X ] denotes the expectation of random variable X and P [ E ] represents the probability of event E. I [ Y = y ] is an indicator function whose value is 1 if Y = y while becoming 0 otherwise.

2. Secrecy Performance Models for Hybrid Duplex RA-WMB Networks

This section describes the HBD RA-WMB models where each legitimate node independently chooses either HD receiving or FD transceiving with a designed probability and defines the network-wide secrecy performance.

2.1. System Model

This paper considers RA-WMB networks, where legitimate nodes broadcast and gather their BMs, while Eves attempt to overhear those legitimate BMs. This study assumes that Eves try to decode BMs without any interference cancellation and any collusion among Eves, and more advanced operations by Eves will remain as future works. In order to safeguard BMs against Eves, the RA-WMB network employs Wyner’s wiretap encoding [12]. This method sets the rates for a transmitted codeword and confidential BM at R T and R S , respectively, with the difference R E R T R S serving as the rate redundancy to ensure secrecy against Eves. Perfect secrecy is achieved if R E exceeds the capacity of the most capable Eve’s link. Given that BMs must be decodable by nearby unspecified legitimate nodes, the data rate for BMs is usually fixed, making it feasible to establish predetermined values for R T and R S . As a result, a node can securely receive a BM provided that it avoids the following two types of outages [11,22]: (i) a connection outage, where a legitimate receiver’s capacity drops below R T , and (ii) a secrecy outage, where the capacity of the most malicious Eve exceeds R E . Further, the network may consider deploying jamming nodes that transmit artificial noise (AN) to degrade the link quality for Eves. However, the AN transmission of these friendly jammers affects all nodes because they lack information about legitimate receivers. As a result, the AN broadcast may have a negative effect on legitimate nodes as well as Eves. In order to construct an analytically tractable network model, it is assumed that legitimate nodes and Eves are spatially distributed according to homogeneous Poisson point processes (HPPPs) with density λ B and λ E , respectively.
Figure 1 presents the operation model for the secure HBD RA-WMB. Each legitimate node either receives BMs from other nodes without SIC, or simultaneously transmits its own BM while receiving BMs from other nodes using SIC. The model assumes that all nodes are synchronized for this operation [28,29,33,35]. In this network, a legitimate node works in either of the following three modes:
(i)
RxOnly (denoted by H ): A node only gathers BMs broadcast by other legitimate nodes and it does not transmit any signal.
(ii)
TxRx (denoted by F ): A node transmits the BM that it generates as an information source, using transmit power p, and simultaneously attempts to decode BMs generated from other nodes through canceling the self-interference from its own transmission.
(iii)
JamRx (denoted by N ): A part of legitimate nodes transmit AN with transmit power δ N p in order to confound unknown Eves, and they also attempt to receive BMs from other legitimate nodes employing SIC, similar to the TxRx mode.
Each node determines its operation mode in a probabilistic manner, that is, a legitimate node works in one mode of the RxOnly, TxRx, and JamRx with probability of 1 ν B ν N , ν B , and ν N . In particular, ν B denotes the TxPr, which is a primary design parameter for the RA-WMB [11,28,29,34]. Note that ν B and ν N are constrained by 0 < ν B 1 , 0 < ν N < 1 , and ν B + ν N 1 . The TxRx and JamRx employ SIC, and FD operation can be readily modeled by setting ν B to 1 ν N . In particular, this paper also refers to the TxRx mode as FD transceiving. Further, the RxOnly mode, also known as HD receiving, does not utilize SIC. Original HD operation includes BM transmission without SIC in addition to RxOnly operation. Although these three operation modes for HBD do not exactly represent these HD operations due to the absence of a transmission-only mode, HBD can simulate HD performance when RSI is sufficiently large to fail to decode any BM in the TxRx and JamRx modes; thus, the HD results in [11] can be regarded as a specific instance of this study characterized by an excessively large RSI. As a result, the HBD with these three modes provides a comprehensive model of the duplexing methods, spanning from HD and FD to a pure HBD configuration where HD receiving and FD transceiving nodes coexist.
In the HBD RA-WMB networks, legitimate nodes in the JamRx mode are selected from all legitimate nodes and referred to as internal jammers. The network regulates the proportion of these internal jammers through adjusting ν N . Additionally, the system may employ external jammers, which do not possess any BM and solely transmit AN. External jammers are expected to be beneficial when interference only from legitimate nodes is insufficient to prevent Eves from overhearing BMs. It is assumed that these external jammers are also distributed according to an HPPP with density λ J and continuously send AN with transmit power δ J p all the time.
The model considers wireless channels where a transmitted signal undergoes standard power loss propagation with path loss exponent α and Rayleigh fading with unit mean. When the spatial distribution of nodes follows an HPPP, the effects of independent and identically distributed shadowing can be expressed as another equivalent HPPP [28,43]; thus, the results in this paper can be straightforwardly extended to incorporate the impact of shadowing, similar to those in [28,29,34], even though this paper does not explicitly consider shadowing. The spatial node distributions of legitimate nodes, external jammers, and Eves are denoted by Φ B , Φ J , and Φ E , respectively, where Φ s denotes an HPPP with density λ s , where s { B , J , E } . Furthermore, β denotes the RSI normalized by p.
In this paper, X l denotes the location of node l that belongs to the set of legitimate nodes or external jammers, i.e., X l Φ B or X l Φ J . In addition, h l i , K, and σ 2 denote the Rayleigh fading gain from nodes i to node l, the path loss gain at a unit distance, and σ ˜ 2 K p where σ ˜ 2 is noise power. When the typical node located at the origin works in mode d where d D { H , F , N } , the signal to interference plus noise ratio (SINR) of the link from a tagged node located at X i to the typical node is given by
Ξ B d ( X i ) h o i | X i | α I B + I J + β d / K + σ 2 ,
where I B X b Φ B { X i } h o b I [ d b = F ] + I [ d b = N ] δ N | X b | α , I J X j Φ J h o j δ J | X j | α , and d b D means the operation mode of node b. It is noteworthy that P [ I [ d b = F ] = 1 ] = ν B and P [ I [ d b = N ] = 1 ] = ν N . Further, β d I [ d = F ] + I [ d = N ] δ N β , which models the effect of imperfect SIC in operation mode d.
On the other hand, an Eve located at Y e experiences the following SINR for node i:
Ξ E ( X i , Y e ) h e i | X i Y e | α I B , E + I J , E + σ 2 .
where I B , E X b Φ B { X i } h e b I [ d b = F ] + I [ d b = N ] δ N | X b Y e | α and I J , E X j Φ J h e j δ J | X j Y e | α .

2.2. Network-Wide Secrecy Performance

In RA-WMB networks, because all legitimate nodes become an information source, performance can be measured by counting the number of successfully decoded BMs from arbitrary legitimate nodes [28,34], which is denoted by B . Unlike this B , secure RA-WMB networks have to count the number of BMs securely received at a legitimate node [11], which represents the BM that suffers from neither connection nor secrecy outage. This means the average number of the BMs that a legitimate node successfully decodes but all Eves fail to decode, which is denoted by S o . A legitimate node receives BMs in either of H , F , or N , as described in Section 2.1, and as a result,
S o = d D θ d E X b Φ B I [ d b = F ] P [ Ξ B d ( X b ) > ξ B ] P [ max Y e Φ E Ξ E ( X b , Y e ) ξ E ] ,
where θ H 1 ν B ν N , θ F ν B , θ N ν N . In (3), ξ B and ξ E represent the minimum SINR thresholds for a legitimate node’s and an Eve’s successful receiving, respectively. Note that nonsecure performance B is S o for λ E = 0 [28,34], and the secure performance only for HD (denoted by S H o ) is equal to S o for β [11]. Further, when all legitimate nodes operate only in FD, this performance (denoted by S F o ) becomes S o for ν B = 1 ν N . Because legitimate receiving (Rx) nodes and Eves receive signals from the same transmitters, events { Ξ B d ( X b ) > ξ B } and { max Y e Φ E Ξ E ( X b , Y e ) ξ E } are inherently correlated. This correlation further complicates the analysis of S o . For ease of analysis, similar to the approach only for HD studied in [11], this paper approximates S o by disregarding the interference correlation, as follows:
S o S d D θ d E X b Φ B I [ d b = F ] P [ Ξ B d ( X i ) > ξ B ] E Y e Φ E P [ Ξ E ( X b , Y e ) ξ E ] .
Then, S in (6) also embraces the performances of nonsecure, only HD, and only FD operations as special cases, as follows:
B ( ν B ) = S ( ν B , 0 , 0 ) | λ E = 0 , S H o S H ( ν B , ν N , λ J ) lim β S ( ν B , ν N , λ J ) , S F o S F ( ν N , λ J ) S ( 1 ν N , ν N , λ J ) .
The numerical and simulation results in Section 6 will demonstrate that ( S , S H , S F ) provide quite close approximations of ( S o , S H o , S F o ) , even though these approximations exhibit small deviations from the original secrecy performances.

3. Spatial Secrecy Performance Analysis of Hybrid Duplex RA-WMB

This section investigates the secrecy performance and its inherent properties for secure HBD RA-WMB networks. The following result analytically expresses S in (4).
Lemma 1.
When λ ¯ λ B ν B + λ B ν N δ N 2 α + λ J δ J 2 α ,
S ( ν B , ν N , λ J ) = d D θ d s d ( ν B , ν N , λ J ) ,
where
s d ( ν B , ν N , λ J ) = λ B ν B A d ( λ ¯ , ξ B ) exp λ E A H ( λ ¯ , ξ E ) ,
A d ( λ , ξ ) R 2 P Ξ B d ( x ) > ξ B d x = π 0 exp π λ ξ 2 α Δ ( α ) x ξ ( β d / K + σ 2 ) x α 2 d x ,
Δ ( α ) = 2 π / α sin ( 2 π / α ) , and d D = { H , F , N } .
Proof. 
See Appendix A. □
In Lemma 1, A d ( λ , ξ ) can be interpreted as the area where a receiver can successfully decode BMs if transmitters are located therein when the SINR threshold is ξ . Therefore, θ d s d means the average number of the legitimate transmitting (Tx) nodes that are located in the receiving area of the typical node but not in the overhearing area of any Eve, like Figure 1.

3.1. Properties of Spatial Secrecy Performance

This subsection explores the inherent properties of S in (6).
Proposition 1.
S in (6) has the following properties:
(i)
When S ˇ d D θ d s ˇ d ( ν B , ν N , λ J ) and S ˜ d D θ d s ˜ d ( ν B , ν N , λ J ) , S > S ˇ > S ˜ where
s ˇ d ( ν B , λ J , ν J ) λ B ν B A d ( λ ¯ , ξ B ) exp λ E A ^ H ( λ ¯ , ξ E ) ,
s ˜ d ( ν B , λ J , ν J ) λ B ν B λ ¯ ξ B 2 / α Δ ( α ) exp π λ ¯ Δ ( α ) α 2 Γ 1 + α 2 ( β d / K + σ 2 ) λ E A ^ H ( λ ¯ , ξ E ) ,
and A ^ H ( λ ¯ , ξ ) 1 λ ¯ ξ 2 α Δ ( α ) .
(ii)
When β = 0 , in an interference-limited scenario,
lim σ 2 0 s d = lim σ 2 0 s ˇ d = lim σ 2 0 s ˜ d = λ B ν B λ ¯ ξ B 2 / α Δ ( α ) exp λ E A ^ H ( λ ¯ , ξ E ) .
As a result,
lim σ 2 0 S = lim σ 2 0 S ˇ = lim σ 2 0 S ˜ = λ B ν B λ ¯ ξ B 2 / α Δ ( α ) exp λ E A ^ H ( λ ¯ , ξ E ) .
In particular, when ν N and λ J are given, lim σ 2 0 S for β = 0 is maximized at ν B = 1 ν N .
(iii)
Assuming that Eve’s receiver capability is not less than that of a legitimate node, i.e., ξ E ξ B ,
S λ B ν B A H ( λ ¯ , ξ B ) exp λ E A H ( λ ¯ , ξ E ) λ B ν B A H ( λ ¯ , ξ B ) exp λ E A H ( λ ¯ , ξ B ) S ^ ,
where S ^ λ B λ E exp ( 1 ) .
(iv)
In a coverage-limited scenario without any interference,
S = d D θ d s d ( ν B , ν N , λ J ) = d D θ d λ B ν B A d ( 0 , ξ B ) exp λ E A H ( 0 , ξ E ) ,
where
A d ( 0 , ξ ) = π ξ 2 α β d K + σ 2 2 α Γ 1 + 2 α .
In particular, when ν N = 0 and λ J = 0 , S ( ν B , 0 , 0 ) is maximized at
ν B = min 1 , A H ( 0 , ξ B ) 2 A H ( 0 , ξ B ) A F ( 0 , ξ B ) .
(v)
When ν N = 0 and λ J = 0 , there exists such β A > 0 that S ( 1 , 0 , 0 ) max ν B S H ( ν B , 0 , 0 ) as long as β β A .
Proof. 
See Appendix B. □
It is not straightforward to deal with S in (6), which includes the sum of numerical integrals. In this regard, Proposition 1-(i) and (iii) provide the lower and upper bounds of S that have further simplified forms. From Proposition 1-(ii), it is expected that the lower bound in Proposition 1-(i) becomes tighter as the interference becomes increasingly dominant. In particular, for an ideal SIC (i.e., β = 0 ), these lower bounds become exactly the same as S . From these properties, for a small value of β and σ 2 , it is expected that S ˜ provides a tight lower bound of S . It is worth noting that the bounds in Proposition 1-(i) and (iii) serve as crucial tools for designing ν B (to be discussed in Section 4.1) and for analyzing the influence of external jammers (to be addressed in Section 3.2).
In a coverage-limited scenario where the impact of interference is ignored, e.g., a sparse node distribution scenario, S can be expressed in a quite simple form like (14) and (15). Interestingly, Proposition 1-(iv) also gives the optimal ν B for ν N = 0 and λ J = 0 , which does not depend on λ E . This signifies that there is no difference between secure and nonsecure designs when legitimate nodes are sparse. Section 6 will demonstrate that secure design plays a more crucial role in improving secrecy performance as interference increases. However, designing ν B in nonzero interference scenarios is not straightforward, which will be thoroughly addressed in Section 4.1. The optimal ν B in (16) increases with A F ( 0 , ξ B ) , and this implies that the HBD RA-WMB moves toward the FD RA-WMB as RSI decreases. On the other hand, as β , A F ( 0 , ξ B ) goes to zero, and this leads that the optimal ν B for HD RA-WMB becomes 1 2 . This result is consistent with the design in [29] that maximizes the nonsecure performance of HD RA-WMB.
Propositions 1-(v) indicate the FD superiority, which denotes that FD outperforms HD in terms of secrecy performance. This FD superiority significantly depends on RSI, and this issue will be addressed in more detail in Section 5.

3.2. Impact of Internal and External Jammers

To begin with, the following result demonstrates the ineffectiveness of internal jammers.
Corollary 1.
An internal jamming signal does not contribute to improving S .
Proof. 
From (7), note that s d s ´ d ( ν B , ν N , λ J ) λ B ( ν B + ν N ) A d ( λ ¯ , ξ B ) exp λ E A H ( λ ¯ , ξ E ) , where s ´ d means that internal jammers do not send an AN signal but transmit their BM with transmit power δ N p . □
From Corollary 1, the maximization of S can be achieved through adjusting ν B and λ J for ν N = 0 . This result is consistent with the result in Corollary 3.1 in [11] for HD. From now, if not stated otherwise, this paper assumes that ν N = 0 from Corollary 1.
The following result addresses the contribution of the external jammers.
Corollary 2.
An external jamming signal may contribute to increasing S . In particular, λ J > 0 is useful for a high Eve density. For example, in an interference-limited scenario with β = 0 and ξ B = ξ E , when λ E > λ B ξ 2 α Δ ( α ) , S is maximized at ν B = 1 and λ J = λ ¯ J , where λ ¯ J λ E ξ 2 α Δ ( α ) λ B δ J 2 α .
Proof. 
When β = 0 and ξ B = ξ E , from (13), S S ^ . Through setting ( ν B , λ J ) to ( 1 , λ ¯ J ) , S achieves max 0 < ν B 1 S ^ = λ B λ E exp ( 1 ) . □
From the above result, this study continues to explore scenarios where λ J 0 . Further, it is worth noting that Corollary 2 offers the results for HBD including FD, while Corollary 3.1 in [11] was only for HD.

4. Design Principles for Secrecy Performance Improvement in RA-WMB Networks

Although Section 3 highlights the intriguing properties of the secure HBD RA-WMB, the results do not clearly delineate the impact of key parameters such as TxPr and RSI on the secrecy performance, because S in (6) remains complex. Therefore, this section further explicitly quantifies the properties of S through approximating the secrecy performance and proposes the design methods of the key parameters, including ν B , β , and λ J .

4.1. Tx Probability Design for Secure RA-WMB

As clarified in Section 3.2, internal jamming does not contribute to increasing S while external jamming may be helpful for high λ E . In other words, the design can be simplified through setting ν N to 0, and it is also expected that λ J = 0 is sensible if the Eve density is not quite large. Hence, this subsection focuses on the design of ν B for increasing S when ν N = 0 and λ J = 0 . When defining the optimal ν B for a given λ J as
ν B * ( λ J ) arg max 0 < ν B 1 S ,
the design objective in this subsection is to approximate ν B * ( 0 ) . The following results provide the fundamentals on the design of ν B through examining S ˜ in Proposition 1-(i).
Proposition 2.
Assume that ν N = 0 and λ J = 0 . Furthermore, let ν ˜ B arg max 0 < ν B 1 S ˜ ( ν B , 0 , 0 ) , Θ 1 ξ B 2 / α Δ ( α ) , Ω α 2 π λ B Δ ( α ) α / 2 Γ 1 + α 2 , and Λ E λ E λ B ξ E 2 / α Δ ( α ) . Then, S ˜ ( ν B , 0 , 0 ) have the following properties:
(i)
There exists a β c > 0 such that S ˜ ( ν B , 0 , 0 ) monotonically increases with ν B if β < β c . That is, if β < β c , ν ˜ B = 1 .
(ii)
If β , S ˜ ( ν B , 0 , 0 ) is log-concave for 0 < ν B 1 , and lim β ν ˜ B becomes ν ¯ or 1, where ν ¯ is the unique solution of f ν ¯ ( x ) = 0 if there exists a solution of f ν ¯ , ( x ) = 0 for 0 < x < 1 , and
f ν ¯ , ( x ) x α 2 + 1 + Λ E x α 2 Λ E x α 2 1 + Ω σ 2 x Ω σ 2 .
(iii)
For a finite β > 0 , ν ˜ B N ˜ ν B or 1, where N ˜ ν B { x | f ν ˜ B ( x ) = 0   f o r   0 < x 1 } , and f ν ˜ B ( x ) is defined in (A10).
Proof. 
See Appendix C. □
Proposition 2-(i) means that FD operation with ν B = 1 is recommended for RSI below a certain level. Furthermore, Proposition 2-(ii) derives ν B to maximize S ˜ for an infinite RSI, which serves as the lower bound of the secrecy performance of HD RA-WMB. This result aligns with the result in Proposition 3.1 of [11]. Proposition 2-(iii) provides a necessary condition for ν ˜ B , but it is not easy to derive ν ˜ B for general β when considering that f ν ˜ B ( x ) in (A10) has a complex form.
Therefore, this paper devises the design method of ν B through comprehensively considering the following important values of ν B in terms of maximizing S :
  • ν B = 1 : FD optimality from Propositions 1-(ii) and 2-(i) and the FD superiority from Proposition 1-(v).
  • ν B = ν ¯ : ease of deriving ν ˜ B for HD RA-WMB from Proposition 2-(ii) [11]
  • ν B = 1 2 : importance of attentive listening from Proposition 1-(iv) and [29].
As a result, when ν N = 0 and λ J = 0 , the design method for ν B is proposed in terms of increasing S , as follows:
ν ˘ B arg max ν B N ˘ ν ˜ B S ( ν B , 0 , 0 ) ,
where N ˘ ν ˜ B ν ¯ , 1 2 , 1 , and S ( ν ¯ , 0 , 0 ) = if ν ¯ does not exist.

4.2. FD Optimality for Secure RA-WMB without Any Jamming Signal

This subsection focuses on the condition for ν B * ( 0 ) = 1 . This FD optimality condition can be expressed in terms of RSI, but it is not straightforward to derive this condition directly from S in (6).
The following result gives the FD optimality condition in an extreme scenario where the effect of interference is ignored.
Corollary 3.
In a coverage-limited scenario without any interference, ν B * ( 0 ) becomes one if
A F ( 0 , ξ B ) 1 2 A H ( 0 , ξ B ) ,
which is equivalent to
β β F O , 0 K σ 2 2 α 2 1 .
Proof. 
From (16), note that if A H ( 0 , ξ B ) 2 A H ( 0 , ξ B ) A F ( 0 , ξ B ) 1 , ν * becomes one. From this FD optimality condition and (15), (20) and (21) are derived. □
It is worth noting that the performance becomes less sensitive to β as interference increases from (1); hence, it is sensible to consider β F O , 0 in (21) as the lowest RSI threshold for the FD optimality. In other words, for the FD optimality, RSI does not need to be below β F O , 0 .
For a general scenario with nonzero interference, it is not easy to express the FD optimality condition analytically. It is highly likely that ν ˘ B in (19) is a nonincreasing function of β because simultaneous transceiving using SIC is increasingly preferred as β decreases, which can be demonstrated through the numerical results. As a result, the FD optimality condition is approximated as
β β F O max β { β | ν ˘ B = 1 } β ,
where β F O can be found between β F O , 0 and a certain upper limit (e.g., 100 dB ) for a given HBD RA-WMB environment, via the bisection method, from Proposition 2-(i) and the nonincreasing property of ν ˘ B with respect to β .

4.3. Deployment of External Jamming Nodes for Secure RA-WMB

Corollary 2 demonstrated that λ J > 0 may contribute to increasing S for a high λ E . In other words, when the amount of interference from legitimate nodes is not large enough to prevent Eves from overhearing BMs, the external jamming further raises interference for disturbing Eves’ reception. In contrast, λ J > 0 also degrades the legitimate link quality because of the unspecified radiation of jamming signals. As a result, it seems to be sensible that the increase in ν B is first preferred to the increase in λ J . Therefore, this paper designs λ J > 0 for increasing S , through fixing ν B to one. The following result suggests the value of λ J for ν B = 1 through approximating S as S ˜ .
Proposition 3.
Assume that ν B = 1 and ν N = 0 . Then, S ˜ ( 1 , 0 , λ J ) can be maximized at
λ J = λ ^ J , F λ B δ J 2 α 1 x ^ 1 , i f   λ E λ ¯ E , F λ B ξ E 2 / α Δ ( α ) 1 Ω β K + σ 2 ,
where x ^ is the unique solution of f J ( x ) = 0,
f J ( x ) Ω β K + σ 2 x α 2 + Λ E x 1 ,
and Λ E and Ω are defined in Proposition 2.
Proof. 
See Appendix D. □
However, because S ˜ deviates from S for a non-small β and σ 2 , the design of λ J in Proposition 3 works well only for a small β . Then, one has a question about how to set λ J more accurately. The numerical results in Section 6 demonstrate that λ J primarily contributes to the increase in S only when Eves are dense, e.g., λ E > λ B . This excessive Eve density makes secure WMB operation difficult, and one should avoid this scenario. Further, the contribution of λ J is quite marginal, which will be presented via the numerical results in Section 6.

5. Design Principles of Secure RA-WMB for Full Duplex Case

The analytical exploration of S in Section 3 and Section 4 is for the HBD operations that are a mixture of HD and FD modes. Hence, this section discusses a specific but useful extreme case with ν B = 1 , where all legitimate nodes work in FD mode. For the other extreme scenario, where β and all legitimate nodes operates in HD mode, the relevant findings were detailed in [11], which can be regarded as a specific instance of the broader results discussed in this paper. From the assumption of ν N = 0 as a result of Corollary 1, the secrecy performance of the FD RA-WMB in (5) can be recast into
S F ( λ J ) S ( 1 , 0 , λ J ) = s F ( 1 , 0 , λ J ) .
The impact of external jamming signals has been already clarified in Corollary 2 because they include the case of ν B = 1 , that is, λ J > 0 marginally contributes to improving S F ( ν N , λ J ) for a large λ E . Therefore, this subsection further focuses on the FD superiority stated in Section 3.1 through setting λ J to 0, which is given by
S F ( 0 ) > max 0 < ν B < 1 S H ( ν B , 0 , 0 ) .
This FD superiority is a basic motivation of applying SIC in order to enhance the secrecy performance.
In a coverage-limited scenario, the FD superiority condition is expressed laconically as follows.
Corollary 4.
In a coverage-limited scenario, the FD superiority condition is
A F ( 0 , ξ B ) > 1 4 A H ( 0 , ξ B ) .
This condition is equivalent to
β β F S , 0 K σ 2 2 α 1 .
Proof. 
Because lim β A F ( 0 , ξ B ) = 0 from (16), max ν B S H ( ν B , 0 , 0 ) = S H ( 1 2 , 0 , 0 ) . Hence, from (26), S F ( 0 ) > S H ( 1 2 , 0 , 0 ) . Through substituting (14) into this condition, (27) is obtained. Finally, from (15) and (27), (28) is derived. □
Note that β F S , 0 in (28) is larger than β F O , 0 in (21). Even though a coverage-limited scenario is an extreme scenario, this result explicitly reveals the difference between the FD optimality and superiority.
In a general scenario with nonzero interference, it is not easy to analytically express the condition of RSI for the FD superiority. Therefore, through approximating max 0 < ν B < 1 S H ( ν B , 0 , 0 ) as S H ( ν ˘ , 0 , 0 ) , (26) is now replaced with the following equation:
S F ( 0 ) > S H ( ν ¯ , 0 , 0 ) .
For FD superiority, when defining β F S as
β F S β   such   that   S F ( 0 ) = S H ( ν ¯ , 0 , 0 ) ,
this β F S can be numerically found via the bisection method because S F ( 0 ) is a monotonic decreasing function of β . It is expected that β F S > β F O , where β F O was defined in (22), because the FD superiority is a more relaxed condition compared with the FD optimality. Further, when considering that the impact of β becomes less dominant as interference increases, it is expected that β F O , 0 < β F O and β F S , 0 < β F S .

6. Numerical Results and Discussion

This section numerically evaluates and discusses the spatial secrecy performances of the HBD RA-WMB and its design methods that were investigated in the previous sections. The evaluation models comply with the system model described in Section 2, and if not stated otherwise, the system parameters are set to the values presented in Table 2.
Figure 2 exhibits the properties of S analyzed in Section 3.1. To begin with, the results demonstrate that S ignoring interference correlation agrees well with the simulation results that exactly reflect correlated interference. In Figure 2a, it is evident that Eves degrade S from S < B and HBD outperforms HD. When examining the performances of HBD at ν B = 1 , which denotes FD operation, FD is preferable at a higher λ B , while a pure HBD strategy incorporating both HD receiving (i.e., in the RxOnly mode) and FD transceiving (i.e., in the TxRx mode) nodes is more advantageous at a lower λ B . Further, ν ˘ B in (19) traces quite well the peak point of S in various interference scenarios (including both small and large impacts of σ 2 ), even though S ˜ deviates from S . In particular, when λ B = 2 km 2 , Figure 2a presents that the optimal operation for B is a mixture of FD transceiving and HD receiving with ν ˘ B = 0.27 , while the maximization of S for λ E = 0.2 λ B is achieved at FD operation with ν B = 1 , and this implies that Eves significantly affect the optimal TxPr design. In contrast, as expected in Proposition 1-(iv), in scenarios with sparse legitimate nodes and Eves (e.g., λ B = 0.2 km 2 , λ E = 0.04 km 2 ), the impact of Eves on the TxPr design becomes relatively smaller. In Figure 2a, because the effect of β = 125 dB is small for λ B = 2 km 2 while it is large for λ B = 0.2 km 2 ; thus, the optimal TxPr for λ B = 0.2 km 2 is around 1 2 . On the other hand, Figure 2b further explicitly reveals the significant impact of λ E on the optimal TxPr. It signifies that as Eves becomes denser, the legitimate nodes needs to generate more interference for confounding Eves. Further, Figure 2b presents that λ J affects the TxPr design, where ν ˘ B in (19) was obtained using ν ¯ derived from f ν ¯ , , J ( ν B ) = 0 in (A11) for λ J > 0 . In this subfigure, λ J degrades S and the optimization and impact of this λ J will be presented and discussed in Figure 6 in more detail.
Figure 3 demonstrates the effect and motivation of the secure design in the RA-WMB network. When TxPrs are securely and nonsecurely designed to increase S and B according to (19), respectively, Figure 3a compares the secrecy performances of the two designs. In the nonsecure design, recall that the TxPr for increasing B can be derived through setting λ E to zero in (19), and the value of S for this TxPr is measured. In the interference-dominant scenario with λ B = 8 km 2 , the secure design is outstandingly superior to the nonsecure one. It is interesting that the proposed secure design still significantly improves the secrecy performance even when legitimate nodes are not quite dense, e.g., when λ B = 3 km 2 . The nonsecure design increasingly degrades the secrecy performance as legitimate nodes become dense because the nonsecure design tends to decrease TxPr for mitigating interference [28,29,34] even if interference needs to be increased to confound Eves. Figure 3b clearly exhibits the difference between these TxPr designs. As λ B increases, the secure design more aggressively transmits BMs through increasing ν B , while the nonsecure design becomes more silent through decreasing ν B . Further, the nonsecure design does not respond to the increase in Eve density. In contrast, the secure design more rapidly reaches the FD operation as Eves become dense. This signifies that SIC can play a key role in increasing S as well as improving B [34].
Figure 4 quantitatively presents the contribution of SIC to the improvement of S and the design of TxPr, through parameterizing the RSI level. In Figure 4a, the y-axis denotes the gain of the secure design with respect to the nonsecure design, i.e., S ( ν ˘ B , 0 , 0 ) S ( ν ˘ B | λ E = 0 , 0 , 0 ) , when ν B ’s are designed to increase S and B , respectively. In the scenarios with λ B = 3 km 2 , which represent scenarios where legitimate nodes are not quite dense, the secure design provides a significant gain even when Eves are not dense, e.g., about 3–18 % for β = 115 dB . This gain substantially increases as RSI decreases, e.g., S increases by 17 64 % when β = 125 dB . As interference becomes more dominant, the gain becomes dramatically large. Further, it is interesting that even when legitimate nodes are sparse (e.g., when λ B = 0.5 km 2 ), the secure design is beneficial if low RSI is implemented. On the other hand, Figure 4b exhibits the impact of RSI on the suboptimal TxPr for secure designs in the same scenarios, demonstrating that the coexistence of nodes in the RxOnly and TxRx modes becomes preferable over scenarios where all nodes operate exclusively in the TxRx mode, as RSI increases. This highlights that when the SIC capability is not excellent, balancing the beneficial and harmful effects of interference is more important than simply maximizing the simultaneous transceiving of individual nodes through SIC, due to non-negligible self-interference.
Figure 5 examines the impact of λ B and λ E on the RSI threshold for the FD optimality and superiority. To begin with, the results demonstrate that β F O , 0 and β F S , 0 in Corollaries 3 and 4 provide the exact lower bounds for the FD optimality and superiority condition, each of which guides a reference value for SIC design. In this figure, β F O and β F S for nonzero interference are numerically obtained through the bisection method, as described in Section 4.2 and Section 5. The results reveal that the condition for β F O and β F S become looser as the impact of interference increases, and this is consistent with the result in [34]. On the other hand, the results demonstrate that β F O and β F S in the secure design are significantly affected by the Eve density. As Eves are dense, the FD optimality and superiority conditions become increasingly loose because the RA-WMB tends to work at a higher interference level for confounding Eves. As a result, the contribution of SIC can become further important in the secure RA-WMB.
Figure 6 evaluates the effect of external jammers on increasing S . The value on y-axis denotes a suboptimal value of S , which is obtained through applying ν ˘ B for a given λ J where ν ¯ in (19) comes from f ν ¯ , , J ( ν B ) = 0 in (A11), and this ν B is denoted by ν ¯ ( λ J ) in this figure; thus, the peak of the curves in Figure 6 represents a suboptimal value for the joint optimization of S over ν B and λ J . The results demonstrate that λ ^ J , F designed in Proposition 3 works well in HBD with a low RSI (e.g., β = 130 dB ) scenario. As RSI increases, λ ^ J , F in (23) deviates from the exact peak, as already expected in Section 4.3. Further, Figure 6 argues that the effect of λ J is quite marginal in terms of increasing S , from the observation that S monotonically decreases with λ J or the gap between the maximum value and the value for λ J = 0 is not significant, even when the Eve density is large (in this figure, note that λ E = λ B and λ E = 2 λ B ). This effect is similar to those for HD scenarios, which were obtained from Proposition 3.2 of [11]. As a result, one does not need to consider seriously the deployment of the external jammers for secure RA-WMB because they are marginally helpful when Eves are extremely dense.

7. Conclusions

This paper investigated the performance and design principles of the secure random-access-based wireless mutual broadcast (RA-WMB), with the objective of enhancing physical layer security (PLS) performance through self-interference cancellation (SIC). The analysis focused on the impact of SIC on the hybrid duplex (HBD) operation that balances the proportion of legitimate half-duplex (HD) receiving and full-duplex (FD) transceiving nodes. The analytical and numerical results demonstrated that the design of secure HBD RA-WMB differs significantly from conventional designs for nonsecure RA-WMB or secure HD RA-WMB. The deliberate increase in interference in the design, aimed at confounding eavesdroppers, reduced the sensitivity of secrecy performance to residual self-interference. This facilitated a more confident use of SIC, and this paper also examined the condition favoring this FD operation. In contrast, friendly jammers were not helpful in improving PLS performance due to their negative or quite marginal gain, which was similar to the conventional HD-WMB design. Further, this paper proposed a simple method for designing transmission probability, factoring in eavesdropper density and SIC impairment, to enhance the PLS performance. In future work, it would be interesting to expand the study into more interactive scenarios, such as carrier sensing multiple access and Eve collusion, to further generalize scenarios.

Author Contributions

Conceptualization, T.K.; methodology, T.K. and H.L.; software, T.K.; validation, T.K.; formal analysis, T.K.; investigation, T.K.; resources, T.K. and H.L.; data curation, T.K.; writing—original draft preparation, T.K. and H.L.; writing—review and editing, T.K. and H.L.; visualization, T.K.; supervision, T.K.; project administration, T.K.; funding acquisition, T.K. All authors have read and agreed to the published version of the manuscript.

Funding

This study was supported by the Research Program funded by the SeoulTech (Seoul National University of Science and Technology).

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
6G6th generation
ANArtificial noise
BMBroadcast message
CSMA      Carrier sense multiple access
D2DDevice-to-device
EveEavesdropper
FDFull duplex
HBDHybrid duplex
HDHalf duplex
HPPPHomogeneous Poisson point process
IoTInternet of things
PLSPhysical layer security
pgflProbability generating functional
PPPPoisson point process
RA-WMBRandom access based wireless mutual broadcast
RSIResidual self-interference
SICSelf-interference cancellation
TxPrTransmission probability
V2VVehicle-to-vehicle
WMBWireless mutual broadcast

Appendix A. Proof of Lemma 1

In (4), from Campbell’s theorem [27], i.e., E x Φ f ( x ) = R d f ( x ) Λ ( d x ) ,
E X b Φ B I [ d b = F ] P [ Ξ B d ( X i ) > ξ B ] = λ B ν B A d ( λ ¯ , ξ B ) .
Furthermore, A d ( λ ¯ , ξ B ) can be derived as follows:
A d ( λ ¯ , ξ ) R 2 P Ξ B d ( x ) > ξ d x = 2 π 0 E exp ξ r α I B + I J + β d / K + σ 2 r d r = ( a ) 2 π 0 exp ξ ( β d / K + σ 2 ) r α E X b Φ B ν B exp ξ r α h o b | X b | α · X n Φ B ν N exp ξ r α h o n | X n | α δ N X j Φ J exp ξ r α h o j | X j | α δ J r d r = 2 π 0 exp ξ ( β d / K + σ 2 ) r α E X b Φ B ν B 1 1 + ξ r α | X b | α · X n Φ B ν N 1 1 + ξ r α | X n | α δ N X j Φ J 1 1 + ξ r α | X j | α δ J r d r = ( b ) 2 π 0 exp π λ ¯ ξ 2 α Δ ( α ) r 2 ξ ( β d / K + σ 2 ) r α r d r = ( c ) π 0 exp π λ ¯ ξ 2 α Δ ( α ) x ξ ( β d / K + σ 2 ) x α 2 d x ,
where Φ s ν denotes a resultant HPPP with density λ s ν after applying an independent thinning with probability ν to HPPP Φ s , (a) follows from the definition of I B and I J in (1) and the Slivnyak’s theorem [27], (b) follows from the probability generating functional (pgfl) of a PPP, i.e., E x Φ v ( x ) = exp R d 1 v ( x ) Λ ( d x ) , similar to [27,28], and (c) follows from the change of variable, i.e., x r 2 .
On the other hand, E Y e Φ E P [ Ξ E ( X b , Y e ) ξ E ] can be obtained as follows:
E Y e Φ E P [ Ξ E ( X b , Y e ) ξ E ] = ( a ) exp R 2 P Ξ E ( x ) > ξ E Λ ( d x ) = exp λ E 0 P Ξ E ( x ) > ξ E d x = exp λ E A H ( λ ¯ , ξ E ) .
where Ξ E ( x ) denotes Ξ E ( x , Y ) for Eve Y located at the origin, and (a) follows from the fact that the translation of a PPP still constitutes a PPP equivalent to the original one and from the pgfl of a PPP.
As a result, from (A1), (A2), and (A3), (6) and (7) can be obtained.

Appendix B. Proof of Proposition 1

(i)
s d ( ν B , λ N , ν J ) > s ˇ d ( ν B , λ N , ν J ) follows from
exp λ E A H ( λ ¯ , ξ E ) > ( a ) exp π λ E 0 exp π λ ¯ ξ E 2 α Δ ( α ) x d x = exp λ E λ ¯ ξ E 2 α Δ ( α ) = exp λ E A ^ H ( λ ¯ , ξ E ) ,
where (a) follows from σ 2 > 0 .
Furthermore, s ˇ d ( ν B , λ N , ν J ) > s ˜ d ( ν B , λ N , ν J ) follows from
A d ( λ , ξ ) = π 0 exp π λ ξ 2 α Δ ( α ) x ξ ( β d / K + σ 2 ) x α 2 d x = ( a ) 1 λ ξ 2 α Δ ( α ) E exp ξ ( β d / K + σ 2 ) U α 2 > ( b ) 1 λ ξ 2 α Δ ( α ) exp E ξ ( β d / K + σ 2 ) U α 2 = ( c ) 1 λ ξ 2 α Δ ( α ) exp 1 π λ Δ ( α ) α 2 Γ 1 + α 2 ( β d / K + σ 2 ) ,
where (a) follows from the definition of random variable U that is exponentially distributed with the mean of μ 1 π λ ξ 2 α Δ ( α ) , (b) follows from the Jensen’s inequality, and (c) follows from E c U α 2 = 0 c μ u α 2 exp u μ d u = c μ α 2 Γ 1 + α 2 .
(ii)
If β = 0 , as σ 2 0 , the lower bounds in (A4) and (A5) approach the original value.
Further, when ν N and λ J are fixed, from (12), lim σ 2 0 S for β = 0 increases with ν B ; thus, ν B = 1 ν N maximizes lim σ 2 0 S for a given ν N and λ J , when β = 0 .
(iii)
This proof is similar to the one for Lemma 3.1(ii) of [11] which is only for HD. However, the result and proof in this paper are for a more general case, i.e., HBD. The inequalities in (13) are indexed as follows:
S ( a ) λ B ν B A H ( λ ¯ , ξ B ) exp λ E A H ( λ ¯ , ξ E ) ( b ) λ B ν B A H ( λ ¯ , ξ B ) exp λ E A H ( λ ¯ , ξ B ) ( c ) S ^ .
Note that A H max { A F , A N } from (8) and β 0 ; thus, (a) holds. Further, from the assumption of ξ E ξ B , (b) holds. For the proof of (c), consider f ( A ) A exp ( λ E A ) . Because f A = ( 1 λ E A ) exp ( λ E A ) , f A > 0 if A < 1 λ E , while f A < 0 if A > 1 λ E ; thus, the maximum value of f ( A ) over A is 1 λ E exp ( 1 ) which is achieved when A = 1 λ E . Furthermore, this upperbound, i.e., λ B ν B λ E exp ( 1 ) , is maximized at ν B = 1 . As a result, (iii) holds.
(iv)
In (6), a scenario with no interference can be expressed through setting λ ¯ to 0; thus, from (8) for λ ¯ = 0 , (15) is obtained.
If ν N = 0 and λ J = 0 ,
S ( ν B , 0 , 0 ) = λ B ν B ( 1 ν B ) A H ( 0 , ξ B ) + ν B A F ( 0 , ξ B ) exp λ E A H ( 0 , ξ E ) .
When considering that both A H ( 0 , ξ ) and A F ( 0 , ξ ) are now independent of ν B , S ( ν B , 0 , 0 ) is log-concave for 0 < ν B 1 . As a result, S ( ν B , 0 , 0 ) can be maximized at ν B = 1 or such ν B that
ν B log S ( ν B , 0 , 0 ) = 1 ν B + A H ( 0 , ξ B ) A F ( 0 , ξ B ) A H ( 0 , ξ B ) A F ( 0 , ξ B ) ν B A H ( 0 , ξ B ) = 0 .
From (A8), (16) is derived.
(v)
Consider that S ( 1 , 0 , 0 ) = λ B A F ( λ B , ξ B ) exp λ E A H ( λ B , ξ E ) and S H ( ν B , 0 , 0 ) = λ B ν B ( 1 ν B ) A H ( λ B ν B , ξ B ) exp λ E A H ( λ B ν B , ξ E ) .
From Propositons 1(i) and 1(iii) of [34], when β = 0 , B for FD always outperforms the maximum B for HD, i.e., λ B A F ( λ B , ξ B ) > λ B ν B ( 1 ν B ) A H ( λ B ν B , ξ B ) for any ν B . Further, exp λ E A H ( λ B , ξ E ) > exp λ E A H ( λ B ν B , ξ E ) for 0 < ν B < 1 because A H decreases as transmitter density increases. Therefore, when β = 0 , S ( 1 , 0 , 0 ) max ν B S H ( ν B , 0 , 0 ) .
Furthermore, S ( 1 , 0 , 0 ) is continuous and monotonically decreases with respect to β , and lim β S ( 1 , 0 , 0 ) = 0 .
As a result, Proposition 1-(v) holds.

Appendix C. Proof of Proposition 2

Proposition 2 assumes that λ J = 0 , but this proof assumes that λ J 0 is given for a further general result. In particular, these results are also used for obtaining some numerical results in Section 6.
When ν ¯ ν B + λ J λ B δ J 2 α , λ ¯ = λ B ν ¯ and ν ¯ ν B = 1 . Then,
log S ˜ ( ν B , 0 , λ J ) = Θ + log ν B ν ¯ Ω ¯ σ 2 ν ¯ α 2 Λ E ν ¯ 1 + log ( 1 ν B ) + ν B exp Ω ¯ β K ν ¯ α 2 .
where Ω ¯ 2 α Ω . The partial derivative of log S ˜ with respect to ν B is given as
f ν ˜ B ( ν B ) log S ˜ ( ν B , 0 , λ J ) ν B = ν B 1 ν ¯ 1 + Ω σ 2 ν ¯ α 2 1 + Λ E ν ¯ 2 + 1 + 1 + Ω β K ν B ν ¯ α 2 1 exp ( Ω ¯ β K ν ¯ α 2 ) ( 1 ν B ) + ν B exp Ω ¯ β K ν ¯ α 2 = ν B 1 ν ¯ 1 + Ω σ 2 ν ¯ α 2 1 + Λ E ν ¯ 2 + 1 + Ω β K ν B ν ¯ α 2 1 exp Ω ¯ β K ν ¯ α 2 ν B + ( 1 ν B ) exp Ω ¯ β K ν ¯ α 2 .
(i)
From (A10), when β = 0 , log S ˜ ( ν B , 0 , λ J ) ν B = ν B 1 ν ¯ 1 + Ω σ 2 ν ¯ α 2 1 + Λ E ν ¯ 2 > 0 for all ν B because ν B 1 ν ¯ 1 . Further, note that log S ˜ ( ν B , 0 , λ J ) ν B is continuous with respect to β ; thus, there exists an β c , J > 0 such that it always holds that log S ˜ ( ν B , 0 , λ J ) ν B > 0 if 0 β β c , J .
(ii)
This is the same as the result in Proposition 3.1 of [11]. The proof is fully provided due to its completeness and differences in notation. Assume that β . Then, each term of log S ˜ ( ν B , 0 , λ J ) in (A9) is concave for 0 < ν B < 1 ; thus, S ˜ ( ν B , 0 , 0 ) is log-concave for 0 < ν B < 1 , and if the solution of log S ˜ ( ν B , 0 , λ J ) ν B = 0 exists between 0 and 1, it is unique. Note that log S ˜ ( ν B , 0 , λ J ) ν B = 0 can be recast into f ν ¯ , , J ( x ) = 0 , where
f ν ¯ , , J ( ν B ) ( 2 ν B 1 ) ν ¯ α 2 + 1 + ν B ( 1 ν B ) ν ¯ α 2 ν B ( 1 ν B ) Λ E ν ¯ α 2 1 ν B ( 1 ν B ) Ω σ 2 .
Similarly, if there exists a ν B such that f ν ¯ , , J ( ν B ) = 0 for 0 < ν B < 1 , it is unique. When λ J = 0 , f ν ¯ , , J ( ν B ) = 0 is equivalent to f ν ¯ , ( ν B ) = 0 . As a result, if λ J = 0 , S ˜ can be maximized through setting ν B to ν ¯ or one.
(iii)
ν ˜ B N ˜ ν B is a necessary condition for maximizing S .

Appendix D. Proof of Proposition 3

Assume that ν B is fixed. Let ν ¯ ν B + λ J λ B δ J 2 α , x 1 ν ¯ , and Ω ¯ 2 α Ω . Then, 0 < x 1 ν B , and from (A9),
log S ˜ ( ν B , 0 , λ J ) = Θ + log ( ν B x ) Ω ¯ σ 2 x α 2 Λ E x + log ( 1 ν B ) + ν B exp Ω ¯ β K x α 2
which is log-concave for 0 < x 1 if ν B = 1 . Furthermore,
log S ˜ ( ν B , 0 , λ J ) x = Ω σ 2 x α 2 1 Λ E + 1 x Ω β K ν B x α 2 1 exp Ω ¯ β K x α 2 ( 1 ν B ) + ν B exp Ω ¯ β K x α 2 .
Furthermore, log S ˜ ( ν B , 0 , λ J ) x = 0 is equivalent to f J , ν B ( x ) = 0 , where
f J , ν B ( x ) Ω σ 2 x α 2 + Λ E x 1 + Ω β K ν B x α 2 exp Ω β K x α 2 ( 1 ν B ) + ν B exp Ω β K x α 2 .
Therefore, f J , ν B ( x ) becomes f J ( x ) in (24) when ν B = 1 . Note that when ν B = 1 , from the log-concavity of S ˜ ( ν B , 0 , λ J ) for 0 < x 1 , if the solution of f J , ν B ( x ) = 0 for 0 < x 1 exists, it is unique. Further, it should be met that f J ( 1 ) 0 for the existence of 0 < x ^ 1 because f J ( 0 ) = 1 .
As a result, from the relationship between λ J and x ^ and the condition of f J ( 1 ) 0 , (23) is obtained.

References

  1. Shen, L.H.; Feng, K.T.; Hanzo, L. Five Facets of 6G: Research Challenges and Opportunities. ACM Compt. Surv. 2023, 55, 1–39. [Google Scholar] [CrossRef]
  2. Lin, Z.; de Cola, T.; Wang, J.B.; Zhu, W.P.; Cheng, J. Supporting IoT With Rate-Splitting Multiple Access in Satellite and Aerial-Integrated Networks. IEEE Internet Things J. 2021, 8, 11123–11134. [Google Scholar] [CrossRef]
  3. Hayat, O.; Ngah, R.; Hashim, S.Z.M.; Dahri, M.H.; Malik, R.F.; Rahayu, Y. Device Discovery in D2D Communication: A Survey. IEEE Access 2019, 7, 131114–131134. [Google Scholar] [CrossRef]
  4. Hayat, O.; Ngah, R.; Kaleem, Z.; Hashim, S.Z.M.; Rodrigues, J.J.P.C. A Survey on Security and Privacy Challenges in Device Discovery for Next-Generation Systems. IEEE Access 2020, 8, 84584–84603. [Google Scholar] [CrossRef]
  5. Sun, Y.; Cao, J.; Ma, M.; Zhang, Y.; Li, H.; Niu, B. EAP-DDBA: Efficient Anonymity Proximity Device Discovery and Batch Authentication Mechanism for Massive D2D Communication Devices in 3GPP 5G HetNet. IEEE Trans. Dependable Secure Comput. 2022, 19, 370–387. [Google Scholar] [CrossRef]
  6. Liu, W.; Nakauchi, K.; Shoji, Y. A Neighbor-Based Probabilistic Broadcast Protocol for Data Dissemination in Mobile IoT Networks. IEEE Access 2018, 8, 12260–12268. [Google Scholar] [CrossRef]
  7. Jeon, K.E.; She, J.; Soonsawad, P.; Ng, P.C. BLE Beacons for Internet of Things Applications: Survey, Challenges, and Opportunities. IEEE Internet Things J. 2018, 5, 811–828. [Google Scholar] [CrossRef]
  8. Qiu, T.; Chen, B.; Sangaiah, A.K.; Ma, J.; Huang, R. A Survey of Mobile Social Networks: Applications, Social Characteristics, and Challenges. IEEE Syst. J. 2018, 12, 3932–3947. [Google Scholar] [CrossRef]
  9. Ghazi, M.U.; Khattak, M.A.K.; Shabir, B.; Malik, A.W.; Ramzan, M.S. Emergency Message Dissemination in Vehicular Networks: A Review. IEEE Access 2020, 8, 38606–38621. [Google Scholar] [CrossRef]
  10. Alghamdi, S.A. Cellular V2X With D2D Communications for Emergency Message Dissemination and QoS Assured Routing in 5G Environment. IEEE Access 2021, 9, 56049–56065. [Google Scholar] [CrossRef]
  11. Kwon, T.; Ju, H. Design Principles for Improving Spatial Secrecy Performance in Random Access based Wireless Mutual Broadcast Networks. IEEE Commun. Lett. 2020, 24, 917–921. [Google Scholar] [CrossRef]
  12. Wyner, A.D. The Wire-Tap Channel. Bell Syst. Tech. J. 1975, 54, 1355–1387. [Google Scholar] [CrossRef]
  13. Poor, H.V. Information and Inference in the Wireless Physical Layer. IEEE Wirel. Commun. Mag. 2012, 19, 40–47. [Google Scholar] [CrossRef]
  14. Illi, E.; Qaraqe, M.; Althunibat, S.; Alhasanat, A.; Alsafasfeh, M.; de Ree, M.; Mantas, G.; Rodriguez, J.; Aman, W.; Al-Kuwari, S. Physical Layer Security for Authentication, Confidentiality, and Malicious Node Detection: A Paradigm Shift in Securing IoT Networks. IEEE Commun. Surv. Tutor. 2024, 26, 347–388. [Google Scholar] [CrossRef]
  15. Solaija, M.S.J.; Salman, H.; Arslan, H. Towards a Unified Framework for Physical Layer Security in 5G and Beyond Networks. IEEE Open J. Veh. Technol. 2022, 3, 321–3435. [Google Scholar] [CrossRef]
  16. Lin, Z.; Lin, M.; Champagne, B.; Zhu, W.P.; Al-Dhahir, N. Secrecy-Energy Efficient Hybrid Beamforming for Satellite-Terrestrial Integrated Networks. IEEE Trans. Commun. 2021, 69, 6345–6360. [Google Scholar] [CrossRef]
  17. Niu, H.; Chu, Z.; Zhou, F.; Zhu, Z.; Zhen, L.; Wong, K.K. Robust Design for Intelligent Reflecting Surface-Assisted Secrecy SWIPT network. IEEE Trans. Wirel. Commun. 2022, 21, 4133–4149. [Google Scholar] [CrossRef]
  18. Ma, R.; Yang, W.; Guan, X.; Lu, X.; Song, Y.; Chen, D. Covert mmWave Communications with Finite Blocklength Against Spatially Random Wardens. IEEE Internet Things J. 2024, 11, 3402–3416. [Google Scholar] [CrossRef]
  19. Mohammadi, M.; Mobini, Z.; Galappaththige, D.; Tellambura, C. A Comprehensive Survey on Full-Duplex Communication: Current Solutions, Future Trends, and Open Issues. IEEE Commun. Surv. Tutor. 2023, 25, 2190–2244. [Google Scholar] [CrossRef]
  20. Ju, Y.; Liu, W.; Yang, M.; Liu, L.; Pei, Q.; Zhang, N.; Ota, K.; Dong, M.; Leung, V.C.M. Physical Layer Security in Full-Duplex Millimeter Wave Communication Systems. IEEE Trans. Veh. Technol. 2024, 73, 2816–2829. [Google Scholar] [CrossRef]
  21. Zheng, T.X.; Wang, H.M.; Yang, Q.; Lee, M.H. Safeguarding Decentralized Wireless Networks Using Full-Duplex Jamming Receivers. IEEE Trans. Wirel. Commun. 2017, 16, 278–292. [Google Scholar] [CrossRef]
  22. Zheng, T.X.; Wang, H.M.; Yuan, J.; Han, Z.; Lee, M.H. Physical Layer Security in Wireless Ad Hoc Networks Under A Hybrid Full-/Half-Duplex Receiver Deployment Strategy. IEEE Trans. Wirel. Commun. 2017, 16, 3827–3829. [Google Scholar] [CrossRef]
  23. Zheng, T.X.; Wang, H.M.; Yuan, J.; Han, Z.; Lee, M.H. Physical Layer Security in Heterogeneous Networks with Jammer Selection and Full-Duplex Users. IEEE Trans. Wirel. Commun. 2017, 16, 7982–7995. [Google Scholar]
  24. Kimura, T.; Saito, H. Theoretical Broadcast Rate Optimization for V2V Communications at Intersection. IEEE Trans. Dependable Secure Comput. 2022, 21, 3360–3372. [Google Scholar] [CrossRef]
  25. Wu, Z.; Park, V.D.; Li, J. Enabling Device to Device Broadcast for LTE Cellular Networks. IEEE J. Sel. Areas Commun. 2016, 34, 58–70. [Google Scholar] [CrossRef]
  26. Gismalla, M.S.M.; Azmi, A.I.; Salim, M.R.B.; Abdullah, M.F.L.; Iqbal, F.; Mabrouk, W.A.; Othman, M.B.; Ashyap, A.Y.I.; Supaat, A.S.M. Survey on Device to Device (D2D) Communication for 5GB/6G Networks: Concept, Applications, Challenges, and Future Directions. IEEE Access 2022, 10, 2169–3536. [Google Scholar] [CrossRef]
  27. Haenggi, M. Stochastic Geometry for Wireless Networks; Cambridge University Press: New York, NY, USA, 2012. [Google Scholar]
  28. Kwon, T.; Choi, J.W. Spatial Performance Analysis and Design Principles for Wireless Peer Discovery. IEEE Trans. Wirel. Commun. 2014, 13, 4507–4519. [Google Scholar] [CrossRef]
  29. Kwon, T. Transmission Probability Design for Random Access Based Wireless Peer Discovery. IEEE Commun. Lett. 2014, 18, 1603–1606. [Google Scholar] [CrossRef]
  30. Xenakis, D.; Kountouris, M.; Merakos, L.; Passas, N.; Verikoukis, C. Performance Analysis of Network-Assisted D2D Discovery in Random Spatial Networks. IEEE Trans. Wirel. Commun. 2016, 15, 5695–5707. [Google Scholar] [CrossRef]
  31. Martin-Vega, F.J.; Soret, B.; Aguayo-Torres, M.C.; Kovacs, I.Z.; Gomez, G. Geo-Location Based Access for Vehicular Communications: Analysis and Optimization via Stochastic Geometry. IEEE Trans. Veh. Technol. 2018, 67, 3069–3084. [Google Scholar] [CrossRef]
  32. Ashraf, M.; Lee, K.G. Overall Energy Minimization in the Wireless Peer Discovery System With Multi-Antenna Peers. IEEE Commun. Lett. 2019, 23, 1821–1825. [Google Scholar] [CrossRef]
  33. Kong, H.B.; Kang, S.; Lee, I. Wireless Peer Discovery in Heterogeneous Half-/Full-Duplex Networks. IEEE Commun. Lett. 2017, 21, 881–884. [Google Scholar] [CrossRef]
  34. Kwon, T.; Lee, H. Hybrid Duplex Wireless Peer Discovery with Imperfect Self-Interference Cancellation. IEEE Commun. Lett. 2018, 22, 598–601. [Google Scholar] [CrossRef]
  35. Kang, S.; Kong, H.B.; Song, C.; Lee, H.; Lee, I. Transmit Probability Designs for Wireless Peer Discovery with Energy Harvesting. IEEE Commun. Lett. 2017, 21, 644–647. [Google Scholar] [CrossRef]
  36. Zhou, X.; Durrani, S.; Guo, J. Drone-Initiated D2D-Aided Multihop Multicast Networks for Emergency Information Dissemination. IEEE Access 2020, 8, 3566–3578. [Google Scholar] [CrossRef]
  37. Goel, S.; Negi, R. Guaranteeing Secrecy Using Artificial Noise. IEEE Trans. Wirel. Commun. 2008, 7, 2180–2189. [Google Scholar] [CrossRef]
  38. Zhang, Y.; Shen, Y.; Jiang, X.; Kasahara, S. Secure Millimeter-Wave Ad Hoc Communications Using Physical Layer Security. IEEE Trans. Inf. Forensics Secur. 2021, 17, 99–114. [Google Scholar] [CrossRef]
  39. Chamkhia, H.; Erbad, A.; Al-Ali, A.K.; Mohamed, A.; Refaey, A.; Guizani, M. 3-D Stochastic Geometry-Based Modeling and Performance Analysis of Efficient Security Enhancement Scheme for IoT Systems. IEEE Internet Things J. 2022, 9, 6663–6677. [Google Scholar] [CrossRef]
  40. Feng, S.; Lu, X.; Sun, S.; Niyato, D.; Hossain, E. Securing Large-Scale D2D Networks Using Covert Communication and Friendly Jamming. IEEE Trans. Wirel. Commun. 2024, 23, 592–606. [Google Scholar] [CrossRef]
  41. Wang, C.; Li, Z.; Shi, J.; Si, J.; Ng, D.W.K. Physical Layer Security of Vehicular Networks: A Stochastic Geometry Approach. In Proceedings of the 2020 IEEE International Conference on Communications Workshops (ICC Workshops), Dublin, Ireland, 7–11 June 2020. [Google Scholar]
  42. Zheng, T.X.; Chen, X.; Wang, C.; Wong, K.K.; Yuan, J. Physical Layer Security in Large-Scale Random Multiple Access Wireless Sensor Networks: A Stochastic Geometry Approach. IEEE Trans. Commun. 2022, 70, 4038–4051. [Google Scholar] [CrossRef]
  43. Błaszczyszyn, B.; Karray, M.K.; Keeler, H.P. Using Poisson Processes to Model Lattice Cellular Networks. In Proceedings of the 2013 IEEE International Conference on Computer Communications (INFOCOM), Turin, Italy, 14–19 April 2013. [Google Scholar]
Figure 1. Operation models for secure HBD RA-WMB.
Figure 1. Operation models for secure HBD RA-WMB.
Sensors 24 03389 g001
Figure 2. Properties of S [lines: analysis; open symbols: simulation ( S o ); solid symbols: suboptimal ν B given by ν ˘ B in (19)]: (a) S and its approximations ( λ E = 0.2 λ B , λ J = 0 ). (b) Impact of Eves and external jammers.
Figure 2. Properties of S [lines: analysis; open symbols: simulation ( S o ); solid symbols: suboptimal ν B given by ν ˘ B in (19)]: (a) S and its approximations ( λ E = 0.2 λ B , λ J = 0 ). (b) Impact of Eves and external jammers.
Sensors 24 03389 g002
Figure 3. Comparison of secure and nonsecure designs for HBD RA-WMB: (a) Effect of Eve density on suboptimal S . (b) Effect of Eve density on suboptimal ν B .
Figure 3. Comparison of secure and nonsecure designs for HBD RA-WMB: (a) Effect of Eve density on suboptimal S . (b) Effect of Eve density on suboptimal ν B .
Sensors 24 03389 g003
Figure 4. Contribution of SIC capability to secure RA-WMB (a) Effect of RSI on gain of secure RA-WMB design. (b) Effect of RSI on suboptimal ν B .
Figure 4. Contribution of SIC capability to secure RA-WMB (a) Effect of RSI on gain of secure RA-WMB design. (b) Effect of RSI on suboptimal ν B .
Sensors 24 03389 g004
Figure 5. RSI threshold for FD optimality [solid lines] and FD superiority [dashed lines].
Figure 5. RSI threshold for FD optimality [solid lines] and FD superiority [dashed lines].
Sensors 24 03389 g005
Figure 6. Contribution of external jammers to secure RA-WMB [y-axis: S applying ν ˘ B ( λ J ) ; solid symbols: λ ^ J , F in (23) for HBD and λ ^ J , H derived in [11] for HD].
Figure 6. Contribution of external jammers to secure RA-WMB [y-axis: S applying ν ˘ B ( λ J ) ; solid symbols: λ ^ J , F in (23) for HBD and λ ^ J , H derived in [11] for HD].
Sensors 24 03389 g006
Table 1. Design principles for secure HBD RA-WMB based on SIC capability.
Table 1. Design principles for secure HBD RA-WMB based on SIC capability.
SIC CapabilityRecommended DuplexingNonsecure vs. Secure DesignKey Designs
None or badHalf duplex (HD) ν B , B * < ν B *   ( ν B , B * 1 2 ) , ν B = ν ˘ B from (19),
(high RSI; e.g., β β F S )(RxOnly + TxRx with β ) ν B * as   λ E β F S from (28) or (30)
GoodPure hybrid duplex (HBD) ν B , B * < ν B * , ν B = ν ˘ B from (19)
(Medium RSI; e.g., β > β F O )(RxOnly + TxRx) ν B * as λ E and β
ExcellentFull duplex (FD) β F O , B < β F O , β F O from (21) or (22)
(Low RSI; β β F O )(TxRx, i.e., ν B * = 1 ) β F O as λ B and λ E
The results for HD are equivalent to the results in [11]. Subscript B denotes the one for nonsecure designs.
Table 2. Notations and their description for secure HBD RA-WMB.
Table 2. Notations and their description for secure HBD RA-WMB.
NotationsDescriptionsExpressions or Values
S o Average number of securely received BMs per nodeIn (3)
S Approximation of S o (almost the same as S o )In (6)
S ˜ , S ^ Lower and upper bounds of S In Proposition 1-(i) and (iii)
B Average number of nonsecurely received BMs per node S ( = S o ) for λ E = 0
S H , S F S ’s for HD and FDIn (5)
H , F , N RxOnly, TxRx, JamRx modes-
Φ B , Φ J , Φ E Sets of legitimate nodes, external jammers, and eavesdroppers-
θ d Probability of operation mode d { H , F , N } In (3)
A H , A F Area where a receiver can successfully decode BMs if transmitters are located therein, in H and F modesIn (8)
λ B , λ J , λ E Spatial densities of legitimate nodes, external jammers, Eves λ B = 0.2 to 8 km 2
p, δ N p , δ J p Tx power of BM, internal jamming, external jamming p = 23 dBm , δ N = δ J = 1
α Path loss exponent3.5
KPath loss gain at a unit distance 1 km 141.33 dBm
σ ˜ 2 / K Normalized noise power ( σ 2 σ ˜ 2 K p ) 22.89 dBm
h l i Rayleigh fading gain from node i to node lUnit mean
Ξ B H , Ξ B F SINR at legitimate receiver in modes H and F In (1)
Ξ E SINR at EveIn (2)
ξ B , ξ E SINR thresholds of legitimate receiver and Eve ξ B = ξ E = 0 dB
β Residual self-interference (RSI) normalized by p 130 to 100 dB
β F O , β F S RSI thresholds for FD optimality and FD superiorityIn (22) and (30)
β F O , 0 , β F S , 0 β F O and β F S in a coverage-limited scenarioIn (21) and (28)
ν B , ν N Transmission probability (TxPr), internal jamming probability 0 < ν B 1 , ν N = 0
ν B * , ν ˘ B Optimal and suboptimal TxPrs for HBD,In (17) and (19)
ν ¯ Suboptimal TxPr candidate for HD when λ J = 0 and ν N = 0 In Proposition (2)-(ii)
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Kwon, T.; LEE, H. Secrecy Performance Enhancement Using Self-Interference Cancellation in Wireless Mutual Broadcast Networks for Proximity-Based Services. Sensors 2024, 24, 3389. https://doi.org/10.3390/s24113389

AMA Style

Kwon T, LEE H. Secrecy Performance Enhancement Using Self-Interference Cancellation in Wireless Mutual Broadcast Networks for Proximity-Based Services. Sensors. 2024; 24(11):3389. https://doi.org/10.3390/s24113389

Chicago/Turabian Style

Kwon, Taesoo, and HyeonWoo LEE. 2024. "Secrecy Performance Enhancement Using Self-Interference Cancellation in Wireless Mutual Broadcast Networks for Proximity-Based Services" Sensors 24, no. 11: 3389. https://doi.org/10.3390/s24113389

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop