Modeling and Optimal Design of Linear Network Coding for Secure Unicast with Multiple Streams
In this paper, we will address the modeling and optimal design of linear network coding (LNC) for secure unicast with multiple streams between the same source and destination pair. The objectives include 1) satisfying the weakly secure requirements, 2) maximizing the transmission data rate, and 3) m...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on parallel and distributed systems Jg. 24; H. 10; S. 2025 - 2035 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.10.2013
|
| Schlagworte: | |
| ISSN: | 1045-9219 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper, we will address the modeling and optimal design of linear network coding (LNC) for secure unicast with multiple streams between the same source and destination pair. The objectives include 1) satisfying the weakly secure requirements, 2) maximizing the transmission data rate, and 3) minimizing the size of the finite field. To fulfill the first two objectives, we formulate a secure unicast routing problem and prove that it is equivalent to a constrained link-disjoint path problem. Based on this fact, we develop an efficient algorithm that can find the optimal unicast topology in a polynomial amount of time. With the given topology, we investigate the design of both weakly secure deterministic LNC and weakly secure random LNC. In the designs of deterministic LNC and random LNC, we prove that the required size of the finite field decreases with the decrease of the number of intermediate nodes in the topology. Therefore, to meet the third objective, we formulate a problem to minimize the number of intermediate nodes. We prove that this problem is NP-Complete and develop an approximation algorithm to solve it. Finally, extensive simulation experiments have been conducted, and the results demonstrate the effectiveness of the proposed algorithms. |
|---|---|
| AbstractList | In this paper, we will address the modeling and optimal design of linear network coding (LNC) for secure unicast with multiple streams between the same source and destination pair. The objectives include 1) satisfying the weakly secure requirements, 2) maximizing the transmission data rate, and 3) minimizing the size of the finite field. To fulfill the first two objectives, we formulate a secure unicast routing problem and prove that it is equivalent to a constrained link-disjoint path problem. Based on this fact, we develop an efficient algorithm that can find the optimal unicast topology in a polynomial amount of time. With the given topology, we investigate the design of both weakly secure deterministic LNC and weakly secure random LNC. In the designs of deterministic LNC and random LNC, we prove that the required size of the finite field decreases with the decrease of the number of intermediate nodes in the topology. Therefore, to meet the third objective, we formulate a problem to minimize the number of intermediate nodes. We prove that this problem is NP-Complete and develop an approximation algorithm to solve it. Finally, extensive simulation experiments have been conducted, and the results demonstrate the effectiveness of the proposed algorithms. |
| Author | Kejie Lu Jin Wang Bin Xiao Jianping Wang Naijie Gu |
| Author_xml | – sequence: 1 givenname: Jin surname: Wang fullname: Wang, Jin – sequence: 2 givenname: Jianping surname: Wang fullname: Wang, Jianping – sequence: 3 givenname: Kejie surname: Lu fullname: Lu, Kejie – sequence: 4 givenname: Bin surname: Xiao fullname: Xiao, Bin – sequence: 5 givenname: Naijie surname: Gu fullname: Gu, Naijie |
| BookMark | eNp1kM1OAjEYRbvARFCXrtz0BQbb0k7p0oB_CYgJsDSTTucrVoeWtCXEt5cJxoWJq7s59yb3DFDPBw8IXVMypJSo29XrdDlkhLIhK0UP9SnholCMqnM0SOmDEMoF4X30Ng8NtM5vsPYNXuyy2-oWTyG5jcfB4pnzoCN-gXwI8RNPQtOxNkS8BLOPgNfeGZ0yPrj8juf7NrtdC3iZI-htukRnVrcJrn7yAq0f7leTp2K2eHye3M0Kw4TMRTmWvGGNNFIoWze1JVpxZhStS2tKLUxtpWDSSsKpJVZQDsTUtRmPObO0htEFGp12TQwpRbCVcVlnF3yO2rUVJVVnpeqsVJ2V6mjl2Cr-tHbxeD9-_cvfnHgHAL9syZRUko--AXoJcfg |
| CODEN | ITDSEO |
| CitedBy_id | crossref_primary_10_1109_TMM_2016_2545403 crossref_primary_10_1155_2018_3729046 crossref_primary_10_1002_dac_3526 crossref_primary_10_1016_j_comnet_2015_12_012 crossref_primary_10_1109_TNSE_2018_2888848 crossref_primary_10_1109_TMM_2018_2827783 crossref_primary_10_1016_j_jnca_2014_09_002 |
| Cites_doi | 10.1109/INFCOM.2007.78 10.1109/ISIT.2003.1228459 10.1109/TNET.2003.818197 10.1109/JSAC.2010.100607 10.1109/ISIT.2002.1023595 10.1109/18.850663 10.1109/TIT.2002.807285 10.1109/ISIT.2007.4557282 10.1145/285055.285059 10.1109/ITWNIT.2009.5158587 10.1109/ISIT.2004.1365180 10.1109/MWC.2004.1269720 10.1109/NETCOD.2010.5487671 |
| ContentType | Journal Article |
| DBID | 97E RIA RIE AAYXX CITATION |
| DOI | 10.1109/TPDS.2012.265 |
| DatabaseName | IEEE Xplore (IEEE) 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 Computer Science |
| EndPage | 2035 |
| ExternalDocumentID | 10_1109_TPDS_2012_265 6297974 |
| Genre | orig-research |
| GroupedDBID | --Z -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNI RNS RZB TN5 TWZ UHB VH1 AAYXX CITATION |
| ID | FETCH-LOGICAL-c257t-6874d2d7c759fbdbf0a942c91b6fc6a5cbf7527f7041f0f514e0cbbc8842f1be3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000323503500011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1045-9219 |
| IngestDate | Sat Nov 29 08:10:28 EST 2025 Tue Nov 18 20:53:11 EST 2025 Wed Aug 27 02:52:30 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 10 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c257t-6874d2d7c759fbdbf0a942c91b6fc6a5cbf7527f7041f0f514e0cbbc8842f1be3 |
| PageCount | 11 |
| ParticipantIDs | ieee_primary_6297974 crossref_citationtrail_10_1109_TPDS_2012_265 crossref_primary_10_1109_TPDS_2012_265 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-10-01 |
| PublicationDateYYYYMMDD | 2013-10-01 |
| PublicationDate_xml | – month: 10 year: 2013 text: 2013-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | IEEE transactions on parallel and distributed systems |
| PublicationTitleAbbrev | TPDS |
| PublicationYear | 2013 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref12 ref15 ref14 ref10 Ho (ref13); 41 Feldman (ref8) ref2 ref1 ref16 ref18 ref7 Ahuja (ref11) 1993 ref4 ref3 ref6 ref5 Garey (ref17) 1990 Bhattad (ref9) |
| References_xml | – ident: ref6 doi: 10.1109/INFCOM.2007.78 – ident: ref12 doi: 10.1109/ISIT.2003.1228459 – volume-title: Computers and Intractability: A Guide to the Theory of NP-Completeness year: 1990 ident: ref17 – ident: ref2 doi: 10.1109/TNET.2003.818197 – ident: ref5 doi: 10.1109/JSAC.2010.100607 – ident: ref7 doi: 10.1109/ISIT.2002.1023595 – ident: ref1 doi: 10.1109/18.850663 – ident: ref3 doi: 10.1109/TIT.2002.807285 – ident: ref10 doi: 10.1109/ISIT.2007.4557282 – ident: ref18 doi: 10.1145/285055.285059 – volume-title: Proc. First Workshop Network Coding, Theory, and Applications (NetCod) ident: ref9 article-title: Weakly Secure Network Coding – volume: 41 start-page: 11 volume-title: Proc. 41st Ann. Allerton Conf. Comm. Control and Computing ident: ref13 article-title: On Randomized Network Coding – ident: ref15 doi: 10.1109/ITWNIT.2009.5158587 – volume-title: Network Flows: Theory, Algorithms, and Applications year: 1993 ident: ref11 – ident: ref4 doi: 10.1109/ISIT.2004.1365180 – ident: ref16 doi: 10.1109/MWC.2004.1269720 – volume-title: Proc. 42nd Ann. Allerton Conf. Comm., Control, and Computing ident: ref8 article-title: On the Capacity of Secure Network Coding – ident: ref14 doi: 10.1109/NETCOD.2010.5487671 |
| SSID | ssj0014504 |
| Score | 2.1410675 |
| Snippet | In this paper, we will address the modeling and optimal design of linear network coding (LNC) for secure unicast with multiple streams between the same source... |
| SourceID | crossref ieee |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 2025 |
| SubjectTerms | deterministic linear network coding Encoding finite field Network coding Network topology passive attack random linear network coding Routing Secure linear network coding Topology Unicast Vectors |
| Title | Modeling and Optimal Design of Linear Network Coding for Secure Unicast with Multiple Streams |
| URI | https://ieeexplore.ieee.org/document/6297974 |
| Volume | 24 |
| WOSCitedRecordID | wos000323503500011&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) issn: 1045-9219 databaseCode: RIE dateStart: 19900101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0014504 providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH5sw4MenDrF-YscxJPd2jRtmqNsDi9OQQUvUprkBQTXipv-_SZZV3fQg9BDKa-l9Ev6XvK-9z6AcybiKJWJDgo7ngImNQY2Co-DVHJeYFiIMJZebIJPp9nzs7hvwWVTC4OInnyGA3fqc_m6Up9uq2yYUsFt_NuGNufpslaryRiwxEsF2tVFEgg7DX_6aQ4f78cPjsRFB9T5kDX_syao4v3JpPu_N9mB7TpuJFdLoHehheUedFeaDKSeonuwtdZgsAcvTurMFZyTotTkzv4eZvYhY8_aIJUhdiVqRzqZLrngZFQ5T0ZsHEv8PjySJ1c7Ml8Qt11LbmvyIXGp7GI234enyfXj6CaoBRUCZWfmIkgzzjTVXPFEGKmlsVgwqkTkKn7SIlHS8IRyw0MWmdDYWApDJaXKMkZNJDE-gE5ZlXgIhFO0t-kUWVLYIxOJjmSYCTQMYwx5Hy5XnzlXdbdxJ3rxlvtVRyhyh0ruUMktKn24aMzfl202_jLsOTQaoxqIo98vH8MmdfIVnnx3Ap3Fxyeewob6WrzOP878APoGKtPFEA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB58gXrwtYpvcxBPdk3TpGmO4gNFXQVX8CKlSSYg6K7sw99vkq3rHvQg9FDKtJR-SWeS-WY-gEOusjTXwiaVH08J1xYTH4VnSa6lrJBWimY6ik3IVqt4flYPU3A8roVBxEg-w2Y4jbl82zXDsFV2kjMlffw7DbOCc0ZH1VrjnAEXUSzQry9EovxE_OmoedJ-OH8MNC7WZMGLTHigCUmV6FEul__3LiuwVEeO5HQE9SpMYWcNlr9VGUg9SddgcaLFYANegthZKDknVceSe_-DePcPOY-8DdJ1xK9F_VgnrREbnJx1gy8jPpIlcSceyVOoHukPSNiwJXc1_ZCEZHb13l-Hp8uL9tlVUksqJMbPzUGSF5JbZqWRQjlttfNocGZUGmp-8koY7aRg0knKU0edj6aQGq1NUXDmUo3ZBsx0uh3cBCIZ-ttsjlxU_iiUsKmmhULHMUMqt-D4-zOXpu43HmQv3sq47qCqDKiUAZXSo7IFR2Pzj1Gjjb8MGwGNsVENxPbvlw9g_qp9d1veXrdudmCBBTGLSMXbhZlBb4h7MGc-B6_93n4cTF-T7shX |
| 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=Modeling+and+Optimal+Design+of+Linear+Network+Coding+for+Secure+Unicast+with+Multiple+Streams&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Wang%2C+Jin&rft.au=Wang%2C+Jianping&rft.au=Lu%2C+Kejie&rft.au=Xiao%2C+Bin&rft.date=2013-10-01&rft.issn=1045-9219&rft.volume=24&rft.issue=10&rft.spage=2025&rft.epage=2035&rft_id=info:doi/10.1109%2FTPDS.2012.265&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TPDS_2012_265 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon |