Skip to main content Accessibility help
×
Home
Hostname: page-component-6c8bd87754-5d2lc Total loading time: 0.314 Render date: 2022-01-20T08:15:59.766Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

Percolation on the Information-Theoretically Secure Signal to Interference Ratio Graph

Published online by Cambridge University Press:  30 January 2018

Rahul Vaze*
Affiliation:
Tata Institute of Fundamental Research
Srikanth Iyer*
Affiliation:
Indian Institute of Science
*
Postal address: School of Technology and Computer Science, Tata Institute of Fundamental Research, Homi Bhabha Road, Mumbai, 400005, India.
∗∗ Postal address: Department of Mathematics, Indian Institute of Science, Bangalore, 560012, India. Email address: skiyer@math.iisc.ernet.in
Rights & Permissions[Opens in a new window]

Abstract

HTML view is not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes in R 2 of intensities λ and λ E , respectively. A directed edge from one legitimate node A to another legitimate node B exists provided that the strength of the signal transmitted from node A that is received at node B is higher than that received at any eavesdropper node. The strength of the signal received at a node from a legitimate node depends not only on the distance between these nodes, but also on the location of the other legitimate nodes and an interference suppression parameter γ. The graph is said to percolate when there exists an infinitely connected component. We show that for any finite intensity λ E of eavesdropper nodes, there exists a critical intensity λ c < ∞ such that for all λ > λ c the graph percolates for sufficiently small values of the interference parameter. Furthermore, for the subcritical regime, we show that there exists a λ0 such that for all λ < λ0 ≤ λ c a suitable graph defined over eavesdropper node connections percolates that precludes percolation in the graphs formed by the legitimate nodes.

Type
Research Article
Copyright
© Applied Probability Trust 

References

Dousse, O., Baccelli, F. and Thiran, P. (2005). Impact of interferences on connectivity in ad hoc networks. IEEE/ACM Trans. Networking 13, 425436.CrossRefGoogle Scholar
Dousse, O. et al. (2006). Percolation in the signal to interference ratio graph. J. Appl. Prob. 43, 552562.CrossRefGoogle Scholar
Grimmett, G. (1980). Percolation. Springer.Google Scholar
Gupta, P. and Kumar, P. R. (2000). The capacity of wireless networks. IEEE Trans. Inf. Theory 46, 388404.CrossRefGoogle Scholar
Haenggi, M. (2008). The secrecy graph and some of its properties. In Proc. IEEE Internat. Symp. Inf. Theory ISIT 2008, IEEE, pp. 539543.Google Scholar
Meester, R. and Roy, R. (1996). Continuum Percolation. Cambridge University Press.CrossRefGoogle Scholar
Penrose, M. (2003). Random Geometric Graphs. Oxford University Press.CrossRefGoogle Scholar
Pinto, P. and Win, M. Z. (2012). Percolation and connectivity in the intrinsically secure communications graph. IEEE Trans. Inf. Theory 58, 17161730.CrossRefGoogle Scholar
Sarkar, A. and Haenggi, M. (2013). Percolation in the secrecy graph. Discrete Appl. Math. 161, 21202132.CrossRefGoogle Scholar
Vaze, R. (2012). Percolation and connectivity on the signal to interference ratio graph. In Proc. IEEE INFOCOM 2012, IEEE, pp. 513521.CrossRefGoogle Scholar
Wyner, A. D. (1975). The wire-tap channel. Bell Syst. Tech. J. 54, 13551387.CrossRefGoogle Scholar
You have Access
1
Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Percolation on the Information-Theoretically Secure Signal to Interference Ratio Graph
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Percolation on the Information-Theoretically Secure Signal to Interference Ratio Graph
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Percolation on the Information-Theoretically Secure Signal to Interference Ratio Graph
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *