Opportunistic Relaying and Random Linear Network Coding for Secure and Reliable Communication
Opportunistic relaying has the potential to achieve full diversity gain, while random linear network coding (RLNC) can reduce latency and energy consumption. In recent years, there has been a growing interest in the integration of both schemes into wireless networks in order to reap their benefits,...
Uloženo v:
| Vydáno v: | IEEE transactions on wireless communications Ročník 17; číslo 1; s. 223 - 234 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.01.2018
|
| Témata: | |
| ISSN: | 1536-1276, 1558-2248 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Opportunistic relaying has the potential to achieve full diversity gain, while random linear network coding (RLNC) can reduce latency and energy consumption. In recent years, there has been a growing interest in the integration of both schemes into wireless networks in order to reap their benefits, while considering security concerns. This paper considers a multi-relay network, where relay nodes employ RLNC to encode confidential data and transmit coded packets to a destination in the presence of an eavesdropper. Four relay selection protocols are studied covering a range of network capabilities, such as the availability of the eavesdropper's channel state information or the possibility to pair the selected relay with a node that intentionally generates interference. For each case, expressions for the probability that a coded packet will not be recovered by a receiver, which can be either the destination or the eavesdropper, are derived. Based on those expressions, a framework is developed that characterizes the probability of the eavesdropper intercepting a sufficient number of coded packets and partially or fully recovering the confidential data. Simulation results confirm the validity and accuracy of the theoretical framework and unveil the security-reliability trade-offs attained by each RLNC-enabled relay selection protocol. |
|---|---|
| AbstractList | Opportunistic relaying has the potential to achieve full diversity gain, while random linear network coding (RLNC) can reduce latency and energy consumption. In recent years, there has been a growing interest in the integration of both schemes into wireless networks in order to reap their benefits, while considering security concerns. This paper considers a multi-relay network, where relay nodes employ RLNC to encode confidential data and transmit coded packets to a destination in the presence of an eavesdropper. Four relay selection protocols are studied covering a range of network capabilities, such as the availability of the eavesdropper's channel state information or the possibility to pair the selected relay with a node that intentionally generates interference. For each case, expressions for the probability that a coded packet will not be recovered by a receiver, which can be either the destination or the eavesdropper, are derived. Based on those expressions, a framework is developed that characterizes the probability of the eavesdropper intercepting a sufficient number of coded packets and partially or fully recovering the confidential data. Simulation results confirm the validity and accuracy of the theoretical framework and unveil the security-reliability trade-offs attained by each RLNC-enabled relay selection protocol. |
| Author | Khan, Amjad Saeed Chatzigeorgiou, Ioannis |
| Author_xml | – sequence: 1 givenname: Amjad Saeed surname: Khan fullname: Khan, Amjad Saeed email: a.khan9@lancaster.ac.uk organization: Sch. of Comput. & Commun., Lancaster Univ., Lancaster, UK – sequence: 2 givenname: Ioannis surname: Chatzigeorgiou fullname: Chatzigeorgiou, Ioannis email: i.chatzigeorgiou@lancaster.ac.uk organization: Sch. of Comput. & Commun., Lancaster Univ., Lancaster, UK |
| BookMark | eNp9kE9Lw0AQxRepYFu9C17yBVJ3sslucpTgPygWasWThM1mIqvJbtlskX57N7Z48OBlZuC938zwZmRirEFCLoEuAGhxvXktFwkFsUgET_MCTsgUsiyPkyTNJ-PMeAxBOyOzYfigwcmzbEreVtutdX5n9OC1itbYyb0275E0TbQOxfbRUhuULnpC_2XdZ1TaZjS01kXPqHYOD17stKw7DHLfh21Kem3NOTltZTfgxbHPycvd7aZ8iJer-8fyZhkrRjMf50glr1kjihwaQdskQUwzBMUz0WAta0ypqAuhGGt4qgBYU6RIU2BcFEVN2ZzQw17l7DA4bKut0710-wpoNcZThXiqMZ7qGE9A-B9Eaf_ztHdSd_-BVwdQI-LvnZzmCTBg3wJEdR0 |
| CODEN | ITWCAX |
| CitedBy_id | crossref_primary_10_1109_JIOT_2020_2969955 crossref_primary_10_1108_IJIUS_08_2021_0091 crossref_primary_10_1007_s10878_023_01065_y crossref_primary_10_1109_TCOMM_2020_2971680 crossref_primary_10_3390_electronics12183764 crossref_primary_10_1109_ACCESS_2018_2877219 crossref_primary_10_1109_TCOMM_2019_2911578 crossref_primary_10_1016_j_adhoc_2021_102580 crossref_primary_10_1049_iet_com_2019_0767 crossref_primary_10_1109_TVT_2020_2992619 crossref_primary_10_1002_cpe_4635 crossref_primary_10_1109_TWC_2019_2891769 crossref_primary_10_1109_LWC_2022_3147601 crossref_primary_10_1109_TWC_2018_2869089 crossref_primary_10_1109_JIOT_2019_2902376 crossref_primary_10_1109_TVT_2020_3001871 crossref_primary_10_1109_ACCESS_2021_3114343 crossref_primary_10_1109_TVT_2018_2885869 crossref_primary_10_3390_e20100730 crossref_primary_10_1109_TCOMM_2022_3194074 crossref_primary_10_3390_e21100982 crossref_primary_10_1016_j_jisa_2019_102409 crossref_primary_10_1109_ACCESS_2019_2899507 crossref_primary_10_1109_ACCESS_2019_2929136 crossref_primary_10_1109_LWC_2018_2828420 |
| Cites_doi | 10.1109/TII.2013.2261082 10.1016/j.cose.2015.02.002 10.1109/TII.2014.2327915 10.1109/TIE.2009.2015754 10.1109/TVT.2017.2703305 10.1109/ISIT.2007.4557282 10.1109/TII.2016.2613504 10.1109/TWC.2016.2593445 10.1109/JPROC.2015.2463678 10.1109/TWC.2010.01.081128 10.1049/iet-com.2011.0003 10.1049/iet-com.2009.0634 10.1109/TVT.2015.2453364 10.1109/LCOMM.2015.2470662 10.1109/icc.2011.5963013 10.1109/JSAC.2005.862417 10.1109/TWC.2015.2506574 10.1109/CISS.2008.4558591 10.1109/TII.2015.2509442 10.1109/TCOMM.2010.100510.090258 10.1109/TCOMM.2013.111213.130235 10.1109/TWC.2013.110813.121671 10.1109/LWC.2017.2650224 10.1109/TIT.2006.881746 10.1109/TVT.2015.2478029 10.1109/LCOMM.2010.110310.101480 10.1109/TCOMM.2014.2350985 10.1109/TWC.2008.06090 10.1109/TCOMM.2012.011312.110015 10.1109/ISITA.2008.4895420 10.1109/TII.2014.2374071 10.1017/CBO9780511841224 10.1109/LCOMM.2017.2704110 10.1109/JPROC.2009.2015716 10.1109/TWC.2011.012411.100787 10.1109/LCOMM.2014.030914.140030 10.1109/TWC.2009.090323 10.1109/ICASSP.2012.6288501 10.1109/JPROC.2010.2094592 |
| ContentType | Journal Article |
| DBID | 97E ESBDL RIA RIE AAYXX CITATION |
| DOI | 10.1109/TWC.2017.2764891 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-2248 |
| EndPage | 234 |
| ExternalDocumentID | 10_1109_TWC_2017_2764891 8082131 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Royal Society International Exchanges Scheme grantid: IE140855 funderid: 10.13039/501100000288 |
| GroupedDBID | -~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AIBXA AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD ESBDL HZ~ H~9 IES IFIPE IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS AAYXX CITATION |
| ID | FETCH-LOGICAL-c305t-8e0a6b3d7981d70f22ee45e1c657debabe407b97c33d64c113d94e04136799b03 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 33 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000422945400017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1536-1276 |
| IngestDate | Sat Nov 29 06:23:44 EST 2025 Tue Nov 18 22:08:50 EST 2025 Wed Aug 27 02:47:14 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | https://creativecommons.org/licenses/by/3.0/legalcode |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c305t-8e0a6b3d7981d70f22ee45e1c657debabe407b97c33d64c113d94e04136799b03 |
| ORCID | 0000-0002-8255-3834 0000-0001-6802-3434 |
| OpenAccessLink | https://ieeexplore.ieee.org/document/8082131 |
| PageCount | 12 |
| ParticipantIDs | crossref_primary_10_1109_TWC_2017_2764891 ieee_primary_8082131 crossref_citationtrail_10_1109_TWC_2017_2764891 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-Jan. 2018-1-00 |
| PublicationDateYYYYMMDD | 2018-01-01 |
| PublicationDate_xml | – month: 01 year: 2018 text: 2018-Jan. |
| PublicationDecade | 2010 |
| PublicationTitle | IEEE transactions on wireless communications |
| PublicationTitleAbbrev | TWC |
| PublicationYear | 2018 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref13 ref12 ref15 ref14 cameron (ref47) 1994 cai (ref20) 2002 bhattad (ref43) 2005 ref17 ref16 ref19 ref18 liu (ref23) 2009 jeffrey (ref37) 2007 ref46 ref45 deb (ref10) 2005 ref42 ref41 ref44 ref49 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 ref34 ref36 szabo (ref11) 2015 geller (ref38) 1969; 71 ref31 ref30 ref33 ref32 ref2 ref1 ref39 papoulis (ref35) 2002 ref24 ref26 ref25 ref22 ref21 gabidulin (ref48) 1985; 21 ref28 ref27 ref29 |
| References_xml | – ident: ref6 doi: 10.1109/TII.2013.2261082 – ident: ref27 doi: 10.1016/j.cose.2015.02.002 – start-page: 323 year: 2002 ident: ref20 article-title: Secure network coding publication-title: Proc IEEE Int Symp Inf Theory (ISIT) – volume: 71 start-page: 120 year: 1969 ident: ref38 article-title: A table of integrals of the exponential integral publication-title: J Res Nat Bureau Standards – ident: ref8 doi: 10.1109/TII.2014.2327915 – ident: ref1 doi: 10.1109/TIE.2009.2015754 – ident: ref25 doi: 10.1109/TVT.2017.2703305 – ident: ref44 doi: 10.1109/ISIT.2007.4557282 – ident: ref7 doi: 10.1109/TII.2016.2613504 – ident: ref40 doi: 10.1109/TWC.2016.2593445 – ident: ref39 doi: 10.1109/JPROC.2015.2463678 – start-page: 1 year: 2005 ident: ref10 article-title: Network coding for wireless applications: A brief tutorial publication-title: Proc Int Wireless Ad Hoc Networks Workshop – year: 1994 ident: ref47 publication-title: Combinatorics Topics Techniques Algorithms – ident: ref36 doi: 10.1109/TWC.2010.01.081128 – ident: ref13 doi: 10.1049/iet-com.2011.0003 – ident: ref15 doi: 10.1049/iet-com.2009.0634 – ident: ref17 doi: 10.1109/TVT.2015.2453364 – ident: ref21 doi: 10.1109/LCOMM.2015.2470662 – ident: ref49 doi: 10.1109/icc.2011.5963013 – year: 2007 ident: ref37 publication-title: Table of Integrals Series and Products – ident: ref3 doi: 10.1109/JSAC.2005.862417 – start-page: 104 year: 2005 ident: ref43 article-title: Weakly secure network coding publication-title: Proc 1st Workshop Netw Coding Theory Appl (NetCod) – ident: ref2 doi: 10.1109/TWC.2015.2506574 – ident: ref30 doi: 10.1109/CISS.2008.4558591 – ident: ref22 doi: 10.1109/TII.2015.2509442 – ident: ref12 doi: 10.1109/TCOMM.2010.100510.090258 – ident: ref28 doi: 10.1109/TCOMM.2013.111213.130235 – ident: ref16 doi: 10.1109/TWC.2013.110813.121671 – start-page: 1 year: 2015 ident: ref11 article-title: Towards the tactile Internet: Decreasing communication latency with network coding and software defined networking publication-title: Proc 21st Eur Wireless Conf – ident: ref26 doi: 10.1109/LWC.2017.2650224 – ident: ref9 doi: 10.1109/TIT.2006.881746 – ident: ref19 doi: 10.1109/TVT.2015.2478029 – ident: ref45 doi: 10.1109/LCOMM.2010.110310.101480 – ident: ref14 doi: 10.1109/TCOMM.2014.2350985 – ident: ref5 doi: 10.1109/TWC.2008.06090 – ident: ref32 doi: 10.1109/TCOMM.2012.011312.110015 – ident: ref42 doi: 10.1109/ISITA.2008.4895420 – ident: ref4 doi: 10.1109/TII.2014.2374071 – volume: 21 start-page: 1 year: 1985 ident: ref48 article-title: Theory of codes with maximum rank distance publication-title: Problems Inf Transmiss – ident: ref33 doi: 10.1017/CBO9780511841224 – ident: ref46 doi: 10.1109/LCOMM.2017.2704110 – ident: ref24 doi: 10.1109/JPROC.2009.2015716 – ident: ref31 doi: 10.1109/TWC.2011.012411.100787 – year: 2002 ident: ref35 publication-title: Probability random variables and stochastic processes – ident: ref34 doi: 10.1109/LCOMM.2014.030914.140030 – ident: ref18 doi: 10.1109/TWC.2009.090323 – year: 2009 ident: ref23 publication-title: Cooperative Communications and Networking – ident: ref29 doi: 10.1109/ICASSP.2012.6288501 – ident: ref41 doi: 10.1109/JPROC.2010.2094592 |
| SSID | ssj0017655 |
| Score | 2.4247534 |
| Snippet | Opportunistic relaying has the potential to achieve full diversity gain, while random linear network coding (RLNC) can reduce latency and energy consumption.... |
| SourceID | crossref ieee |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 223 |
| SubjectTerms | intercept probability Jamming outage probability physical-layer security Power system reliability Probability Protocols random linear network coding Relay selection Relays Reliability Security |
| Title | Opportunistic Relaying and Random Linear Network Coding for Secure and Reliable Communication |
| URI | https://ieeexplore.ieee.org/document/8082131 |
| Volume | 17 |
| WOSCitedRecordID | wos000422945400017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2248 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017655 issn: 1536-1276 databaseCode: RIE dateStart: 20020101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA9zeNCDX1OcX-TgRXBb0nZJc5Th8DRFJu4ipUnfYKDtmJt_v--ltWwggpdSwktb8pK-z997jF0LaW2YQdCBwENyXIz_wTjtxJAKJ9PISuF8swk9GsWTiXlqsNsaCwMAPvkMunTrY_lZ4VbkKuvhUwJJoOktrVWJ1aojBlr5Dqd4gKmvjK5DksL0xq8DyuHSXRyOYiM3RNBaTxUvUob7__uYA7ZXqY78ruT1IWtAfsR21woKttjb45z0aQpRIxGnTDeCMfE0z_gzXooPjsYnbm4-KtO_-aAg4cVRdeXe9Q4lLbzPCFPFN_Ajx-xleD8ePHSqBgodh8d4iQsuUoWs0Aa1Ui2mQQAQ9UE61dcZ2NQCmnPWaBeGmYqclGFmIhARlXEzxorwhDXzIodTxmVknbTCKYfyDFITT0OqrKNEGOMb1LTNej9rmriqujg1uXhPvJUhTIJcSIgLScWFNrupZ8zLyhp_0LaIATVdtfZnvw-fsx2cHJeOkgvWXC5WcMm23ddy9rm48tvmG_kRv6w |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA9DBfXBrynOzzz4ItgtabO2eZThmDiryMS9SGnSGwxmO-bm3-8lrWUDEXwpJVzTkkt6n787Qq4YV8pLwXXAtZAcHeJ_MEycEBKmeSIUZ9o2mwiiKBwO5XON3FRYGACwyWfQNLc2lp_memFcZS2cxeUGNL3eFsJlBVqrihkEvu1xikfYdJYJqqAkk63BW8dkcQVNHBah5CtCaKmrihUq3d3_fc4e2SmVR3pbcHuf1CA7INtLJQXr5P1pajRqE6RGImpy3QyQiSZZSl_wkn9QND9xe9OoSACnndyIL4rKK7XOdyhoYTI2qCq6giA5JK_du0Gn55QtFByNB3mOS84SH5kRSNRLAzZyXQDRBq79dpCCShSgQadkoD0v9YXm3EulACZMITcpFfOOyFqWZ3BMKBdKc8W0r1GiQSLDkWdq6_jMC_EN_qhBWj9rGuuyvrhpczGJrZ3BZIxciA0X4pILDXJdPTEtamv8QVs3DKjoyrU_-X34kmz2Bo_9uH8fPZySLZwoLNwmZ2RtPlvAOdnQX_Px5-zCbqFvHhHC8w |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Opportunistic+Relaying+and+Random+Linear+Network+Coding+for+Secure+and+Reliable+Communication&rft.jtitle=IEEE+transactions+on+wireless+communications&rft.au=Khan%2C+Amjad+Saeed&rft.au=Chatzigeorgiou%2C+Ioannis&rft.date=2018-01-01&rft.issn=1536-1276&rft.eissn=1558-2248&rft.volume=17&rft.issue=1&rft.spage=223&rft.epage=234&rft_id=info:doi/10.1109%2FTWC.2017.2764891&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TWC_2017_2764891 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1536-1276&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1536-1276&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1536-1276&client=summon |