Secure inter-cluster communications with cooperative jamming against social outcasts

Wang, Li; Cao, Chunyan; Wu, Huaqing

doi:10.1016/j.comcom.2015.02.012

Cited by 9 publications

(5 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, we substitute (38) and (42) with into (11), and then substitute ( 11) into (9) to obtain (15).…”

Section: Appendix B Proof Of Theoremmentioning

confidence: 99%

“…Substituting (49) and ( 46) into (11) and then substituting (11) into (9) yields (16). P (r) can be written as P (r) = u + vr 4 , where u…”

Section: Appendix C Proof Of Theoremmentioning

confidence: 99%

“…Some recent efforts have been devoted to the study of PHY security-based secure communication in wireless networks with social relationships. Wang et al [11] considered a D2D communication scenario, where the head of two D2D user (DUE) clusters wish to communicate with the help of an intermediate Decode-and-Forward relay. The communication security is guaranteed by the cooperative jamming scheme, where multiple friendly jammers send jamming signals to suppress eavesdroppers, and the social relationship is modeled by a social trust parameter µ ∈ [0, 1].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Friendship-based cooperative jamming for secure communication in Poisson networks

2018

View full text Add to dashboard Cite

Wireless networks with the consideration of social relationships among network nodes are highly appealing for lots of important data communication services. Ensuring the security of such networks is of great importance to facilitate their applications in supporting future social-based services with strong security guarantee. This paper explores the physical layer security-based secure communication in a finite Poisson network with social friendships among nodes, for which a social friendship-based cooperative jamming scheme is proposed. The jamming scheme consists of a Local Friendship Circle (LFC) and a Long-range Friendship Annulus (LFA), where all legitimate nodes in the LFC serve as jammers, but the legitimate nodes in the LFA are selected as jammers through three location-based policies. To understand both the security and reliability performance of the proposed jamming scheme, we first model the sum interference at any location in the network by deriving its Laplace transform under two typical path loss scenarios. With the help of the interference Laplace transform results, we then derive the exact expression for the transmission outage probability (TOP) and determine both the upper and lower bounds on the secrecy outage probability (SOP), such that the overall outage performances of the proposed jamming scheme can be depicted. Finally, we present extensive numerical results to validate the theoretical analysis of TOP and SOP and also to illustrate the impacts of the friendship-based cooperative jamming on the network performances.

show abstract

“…Finally, we substitute (38) and (42) with into (11), and then substitute ( 11) into (9) to obtain (15).…”

Section: Appendix B Proof Of Theoremmentioning

confidence: 99%

“…Substituting (49) and ( 46) into (11) and then substituting (11) into (9) yields (16). P (r) can be written as P (r) = u + vr 4 , where u…”

Section: Appendix C Proof Of Theoremmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Friendship-based cooperative jamming for secure communication in Poisson networks

2018

View full text Add to dashboard Cite

show abstract

“…Thus, we can have

\begin{matrix} C_{j, k} (P_{s}, P_{j}) = \\ q_{j} {[\underset{2}{\log} (1 + P_{s} g_{sd}) - \underset{2}{\log} (1 + \frac{P_{s} g_{sk}}{P_{j} h_{jk} + 1})]}^{+} \\ + (1 - q_{j}) {[\underset{2}{\log} (1 + P_{s} g_{sd}) - \underset{2}{\log} (1 + P_{s} g_{sk})]}^{+} \end{matrix}

where q j ∈[0,1] is the social trust index of jammers and it jointly indicates both the socially established mutual trust between them and physical link stability of the channel from jammer node to eavesdropper . Note that physical link stability can be evaluated by contact (encountering) duration and frequency for the neighbouring devices to form potential D2D links or finding friendly jammers . q j =1 means a fully connected link or a trusted and dependable node, while q j =0 means a link or a node is totally untrustworthy and cannot be relied on at all.…”

Section: System Model and Problem Formulationmentioning

confidence: 99%

Jamming partner selection for maximising the worst D2D secrecy rate based on social trust

Wang

2015

Trans. Emerging Tel. Tech.

Self Cite

View full text Add to dashboard Cite

Device-to-device (D2D) communications have recently attracted broad attention, owing to its potential ability to improve spectrum and energy efficiency within the existing cellular infrastructure. Without sophisticated control, D2D users themselves are not powerful enough to resist eavesdropping or fight against security attacks. This work investigates how to select jamming partners for D2D users to thwart eavesdroppers by exploiting social relationship with the help of full channel state information (CSI) and partial CSI, respectively. We aim to maximise the worst-case eavesdropping by selecting jammer node and allocating transmit power for both source and jammer nodes. We first present a heuristic genetic algorithm-based solution to address the problem. We then propose low-complexity optimisation solutions by considering the upper and lower bounds of power allocation. Numerical results show that the proposed schemes can achieve better performance through finding an appropriate partner.

show abstract

“…Few works consider the physical layer security in D2D communications against eavesdropper or social outcasts, though some studies can be found on related problems such as in basic D2D links, as well as in traditional wireless relay networks. The mecha nism presented in [11] investigated the improvement of secrecy rate for cellular users by taking DUEs as friendly jammers, and [12] discussed D2D oriented secrecy performance generally in terms of clusters. In traditional cooperative relay networks, cooperative jamming (CJ) [13] [14] [15] [16] has been widely used to combat interception, and it was proven to have the potential to improve achievable secrecy rate.…”

Section: Introductionmentioning

confidence: 99%

Secrecy-oriented partner selection based on social trust in device-to-device communications

Wang

Liu

et al. 2015

2015 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

Device-to-device (D2D) communications recently have attracted broad attention owing to its potential ability to improve spectrum and energy efficiency within the existing cellular infrastructure. Lacking sophisticated control, D2D user equipments (DUEs) themselves are not powerful enough to resist eavesdropping or fight against security attacks. This work investigates selection of jamming partners for D2D users to thwart reception by social outcasts in D2D overlay, by exploiting social relationship to improve secrecy rate. We aim to maximize the secrecy rate of worst case, eavesdropping by any outcast, through selecting jammer node while allocating transmit power for both source and jammer. We present a heuristic genetic algorithm based solution to evaluate the problem directly. In addition, we also propose approximated optimization solutions by considering power allocation of upper and lower bounds to simplify the problem, by leveraging the fractional programming (GFP) oriented Dinkelbach-type algorithm. Numerical resultsshow that the proposed schemes can achieve better performance through finding an appropriate partner.Index Terms-D2D communications, cooperative jamming, social outcast, secrecy rate, power allocation.

show abstract

Secure inter-cluster communications with cooperative jamming against social outcasts

Cited by 9 publications

References 25 publications

Friendship-based cooperative jamming for secure communication in Poisson networks

Friendship-based cooperative jamming for secure communication in Poisson networks

Jamming partner selection for maximising the worst D2D secrecy rate based on social trust

Secrecy-oriented partner selection based on social trust in device-to-device communications

Contact Info

Product

Resources

About