Friendship-based cooperative jamming for secure communication in Poisson networks

This paper investigates 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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Wireless networks 2019-10, Vol.25 (7), p.4077-4095
Hauptverfasser: Zhang, Yuanyu, Shen, Yulong, Jiang, Xiaohong
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 4095
container_issue 7
container_start_page 4077
container_title Wireless networks
container_volume 25
creator Zhang, Yuanyu
Shen, Yulong
Jiang, Xiaohong
description This paper investigates 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 performances of the proposed scheme, we first derive analytical expressions for the transmission outage probability and determine both the upper and lower bounds on the secrecy outage probability, given the basic Laplace transform of the sum interference at any location in the network. With the help of the tools from stochastic geometry, we then provide general expressions for the above Laplace transform under all path loss scenarios as well as closed-form Laplace transform results under two typical path loss cases, such that the overall outage performances of the proposed scheme can be depicted. Finally, we present extensive numerical results to validate our theoretical analysis and also to illustrate the impacts of the friendship-based cooperative jamming on the network performances.
doi_str_mv 10.1007/s11276-018-1732-1
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2036912669</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2036912669</sourcerecordid><originalsourceid>FETCH-LOGICAL-c382t-1c6a05bf08639c2616b65ef118a2a8c656c0dac7d12b92aee941d39ce3e3dc223</originalsourceid><addsrcrecordid>eNp1kE1LxDAQhoMouH78AG8Fz9FMYtPmKIurwoIKeg5pOl2z2qQmreK_N0sFT57mhXneGXgIOQN2AYxVlwmAV5IyqClUglPYIwsoK05rUHI_Z8Y5ZUzUh-QopS1jrBZKLcjTKjr0bXp1A21MwrawIQwYzeg-sdiavnd-U3QhFgntFDGv-37yzmYg-ML54jG4lHL0OH6F-JZOyEFn3hOe_s5j8rK6eV7e0fXD7f3yek2tqPlIwUrDyqZjtRTKcgmykSV2ALXhpraylJa1xlYt8EZxg6iuoM0kChSt5Vwck_P57hDDx4Rp1NswRZ9fas6EVMClVJmCmbIxpBSx00N0vYnfGpjemdOzOZ3N6Z05DbnD507KrN9g_Lv8f-kHjDxx3w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2036912669</pqid></control><display><type>article</type><title>Friendship-based cooperative jamming for secure communication in Poisson networks</title><source>SpringerLink Journals - AutoHoldings</source><creator>Zhang, Yuanyu ; Shen, Yulong ; Jiang, Xiaohong</creator><creatorcontrib>Zhang, Yuanyu ; Shen, Yulong ; Jiang, Xiaohong</creatorcontrib><description>This paper investigates 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 performances of the proposed scheme, we first derive analytical expressions for the transmission outage probability and determine both the upper and lower bounds on the secrecy outage probability, given the basic Laplace transform of the sum interference at any location in the network. With the help of the tools from stochastic geometry, we then provide general expressions for the above Laplace transform under all path loss scenarios as well as closed-form Laplace transform results under two typical path loss cases, such that the overall outage performances of the proposed scheme can be depicted. Finally, we present extensive numerical results to validate our theoretical analysis and also to illustrate the impacts of the friendship-based cooperative jamming on the network performances.</description><identifier>ISSN: 1022-0038</identifier><identifier>EISSN: 1572-8196</identifier><identifier>DOI: 10.1007/s11276-018-1732-1</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Communications Engineering ; Computer Communication Networks ; Electrical Engineering ; Engineering ; Exact solutions ; IT in Business ; Jammers ; Jamming ; Laplace transforms ; Lower bounds ; Mathematical analysis ; Networks ; Reliability analysis ; Security ; Wireless networks</subject><ispartof>Wireless networks, 2019-10, Vol.25 (7), p.4077-4095</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2018</rights><rights>Wireless Networks is a copyright of Springer, (2018). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c382t-1c6a05bf08639c2616b65ef118a2a8c656c0dac7d12b92aee941d39ce3e3dc223</citedby><cites>FETCH-LOGICAL-c382t-1c6a05bf08639c2616b65ef118a2a8c656c0dac7d12b92aee941d39ce3e3dc223</cites><orcidid>0000-0002-3248-5909</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11276-018-1732-1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11276-018-1732-1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Zhang, Yuanyu</creatorcontrib><creatorcontrib>Shen, Yulong</creatorcontrib><creatorcontrib>Jiang, Xiaohong</creatorcontrib><title>Friendship-based cooperative jamming for secure communication in Poisson networks</title><title>Wireless networks</title><addtitle>Wireless Netw</addtitle><description>This paper investigates 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 performances of the proposed scheme, we first derive analytical expressions for the transmission outage probability and determine both the upper and lower bounds on the secrecy outage probability, given the basic Laplace transform of the sum interference at any location in the network. With the help of the tools from stochastic geometry, we then provide general expressions for the above Laplace transform under all path loss scenarios as well as closed-form Laplace transform results under two typical path loss cases, such that the overall outage performances of the proposed scheme can be depicted. Finally, we present extensive numerical results to validate our theoretical analysis and also to illustrate the impacts of the friendship-based cooperative jamming on the network performances.</description><subject>Communications Engineering</subject><subject>Computer Communication Networks</subject><subject>Electrical Engineering</subject><subject>Engineering</subject><subject>Exact solutions</subject><subject>IT in Business</subject><subject>Jammers</subject><subject>Jamming</subject><subject>Laplace transforms</subject><subject>Lower bounds</subject><subject>Mathematical analysis</subject><subject>Networks</subject><subject>Reliability analysis</subject><subject>Security</subject><subject>Wireless networks</subject><issn>1022-0038</issn><issn>1572-8196</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kE1LxDAQhoMouH78AG8Fz9FMYtPmKIurwoIKeg5pOl2z2qQmreK_N0sFT57mhXneGXgIOQN2AYxVlwmAV5IyqClUglPYIwsoK05rUHI_Z8Y5ZUzUh-QopS1jrBZKLcjTKjr0bXp1A21MwrawIQwYzeg-sdiavnd-U3QhFgntFDGv-37yzmYg-ML54jG4lHL0OH6F-JZOyEFn3hOe_s5j8rK6eV7e0fXD7f3yek2tqPlIwUrDyqZjtRTKcgmykSV2ALXhpraylJa1xlYt8EZxg6iuoM0kChSt5Vwck_P57hDDx4Rp1NswRZ9fas6EVMClVJmCmbIxpBSx00N0vYnfGpjemdOzOZ3N6Z05DbnD507KrN9g_Lv8f-kHjDxx3w</recordid><startdate>20191001</startdate><enddate>20191001</enddate><creator>Zhang, Yuanyu</creator><creator>Shen, Yulong</creator><creator>Jiang, Xiaohong</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7SP</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M2P</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-3248-5909</orcidid></search><sort><creationdate>20191001</creationdate><title>Friendship-based cooperative jamming for secure communication in Poisson networks</title><author>Zhang, Yuanyu ; Shen, Yulong ; Jiang, Xiaohong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c382t-1c6a05bf08639c2616b65ef118a2a8c656c0dac7d12b92aee941d39ce3e3dc223</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Communications Engineering</topic><topic>Computer Communication Networks</topic><topic>Electrical Engineering</topic><topic>Engineering</topic><topic>Exact solutions</topic><topic>IT in Business</topic><topic>Jammers</topic><topic>Jamming</topic><topic>Laplace transforms</topic><topic>Lower bounds</topic><topic>Mathematical analysis</topic><topic>Networks</topic><topic>Reliability analysis</topic><topic>Security</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Yuanyu</creatorcontrib><creatorcontrib>Shen, Yulong</creatorcontrib><creatorcontrib>Jiang, Xiaohong</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Science Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Wireless networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhang, Yuanyu</au><au>Shen, Yulong</au><au>Jiang, Xiaohong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Friendship-based cooperative jamming for secure communication in Poisson networks</atitle><jtitle>Wireless networks</jtitle><stitle>Wireless Netw</stitle><date>2019-10-01</date><risdate>2019</risdate><volume>25</volume><issue>7</issue><spage>4077</spage><epage>4095</epage><pages>4077-4095</pages><issn>1022-0038</issn><eissn>1572-8196</eissn><abstract>This paper investigates 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 performances of the proposed scheme, we first derive analytical expressions for the transmission outage probability and determine both the upper and lower bounds on the secrecy outage probability, given the basic Laplace transform of the sum interference at any location in the network. With the help of the tools from stochastic geometry, we then provide general expressions for the above Laplace transform under all path loss scenarios as well as closed-form Laplace transform results under two typical path loss cases, such that the overall outage performances of the proposed scheme can be depicted. Finally, we present extensive numerical results to validate our theoretical analysis and also to illustrate the impacts of the friendship-based cooperative jamming on the network performances.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11276-018-1732-1</doi><tpages>19</tpages><orcidid>https://orcid.org/0000-0002-3248-5909</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 1022-0038
ispartof Wireless networks, 2019-10, Vol.25 (7), p.4077-4095
issn 1022-0038
1572-8196
language eng
recordid cdi_proquest_journals_2036912669
source SpringerLink Journals - AutoHoldings
subjects Communications Engineering
Computer Communication Networks
Electrical Engineering
Engineering
Exact solutions
IT in Business
Jammers
Jamming
Laplace transforms
Lower bounds
Mathematical analysis
Networks
Reliability analysis
Security
Wireless networks
title Friendship-based cooperative jamming for secure communication in Poisson networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T02%3A56%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Friendship-based%20cooperative%20jamming%20for%20secure%20communication%20in%20Poisson%20networks&rft.jtitle=Wireless%20networks&rft.au=Zhang,%20Yuanyu&rft.date=2019-10-01&rft.volume=25&rft.issue=7&rft.spage=4077&rft.epage=4095&rft.pages=4077-4095&rft.issn=1022-0038&rft.eissn=1572-8196&rft_id=info:doi/10.1007/s11276-018-1732-1&rft_dat=%3Cproquest_cross%3E2036912669%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2036912669&rft_id=info:pmid/&rfr_iscdi=true