{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T08:51:23Z","timestamp":1775292683063,"version":"3.50.1"},"reference-count":33,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T00:00:00Z","timestamp":1543708800000},"content-version":"vor","delay-in-days":335,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61701019"],"award-info":[{"award-number":["61701019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>In the upcoming 5G era, many new types of networks will greatly expand the connectivity of the world such as vehicular ad hoc networks (VANETs), Internet of Things (IoT), and device\u2010to\u2010device communications (D2D). Network coding is a promising technology that can significantly improve the throughput and robustness of these emerging 5G multihop networks. However, network coding is generally very fragile to malicious attacks such as message content corruption and node compromise attacks. To take advantage of network coding in performance gain while refraining malicious network attacks is an interesting and challenging research issue. In this paper, we propose a new error\u2010detection and error\u2010correction (EDEC) scheme that can jointly detect and remove the malicious attacks based on the underlying error\u2010control scheme for general multihop networks that can model the 5G multihop networks. The proposed scheme can increase the throughput for network with pollution attacks compared to existing error\u2010detection based schemes. Then we propose a low\u2010density parity check (LDPC) decoding based EDEC (LEDEC) scheme. Our theoretical analysis demonstrates that the LEDEC scheme can further increase the throughput for heavily polluted network environments. We also provide extensive performance evaluation and simulation results to validate the proposed schemes. This research ensures the expected performance gain for the application of network coding in the 5G network under malicious pollution attacks.<\/jats:p>","DOI":"10.1155\/2018\/3473910","type":"journal-article","created":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T18:33:13Z","timestamp":1543775593000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Enjoy the Benefit of Network Coding: Combat Pollution Attacks in 5G Multihop Networks"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7195-1063","authenticated-orcid":false,"given":"Jian","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tongtong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han-Chieh","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,12,2]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1700208"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2447812"},{"key":"e_1_2_11_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2781372"},{"key":"e_1_2_11_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2017.1600284"},{"key":"e_1_2_11_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"e_1_2_11_8_2","unstructured":"HoT. LeongB. KoetterR. MedardM. EffrosM. andKargerD. Byzantine modification detection in multicast networks using randomized network coding Proceedings of the International Symposium on Information Theory ISIT\u2032 04 July 2004."},{"key":"e_1_2_11_9_2","doi-asserted-by":"crossref","unstructured":"GkantsidisC.andRodriguezP. Cooperative security for network coding file distribution Proceedings of the IEEE INFOCOM \u203206 April 2006 1\u201313.","DOI":"10.1109\/INFOCOM.2006.233"},{"key":"e_1_2_11_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2630062"},{"key":"e_1_2_11_11_2","unstructured":"CaiN.andYeungR. W. Network coding and error correction Proceedings of the IEEE Information Theory Workshop (ITW \u203202) 2002 119\u2013122."},{"key":"e_1_2_11_12_2","doi-asserted-by":"crossref","unstructured":"JaggiS. LangbergM. KattiS. HoT. KatabiD. andM\u00e9dardM. Resilient network coding in the presence of Byzantine adversaries Proceedings of the IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications May 2007 USA 616\u2013624 2-s2.0-34548349361.","DOI":"10.1109\/INFCOM.2007.78"},{"key":"e_1_2_11_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2795598"},{"key":"e_1_2_11_14_2","doi-asserted-by":"crossref","unstructured":"KrohnM. N. FreedmanM. J. andMazi\u00e8resD. On-the-fly verification of rateless erasure codes for efficient content distribution Proceedings of the 2004 IEEE Symposium on Security and Privacy May 2004 226\u2013239 2-s2.0-3543050732.","DOI":"10.1109\/SECPRI.2004.1301326"},{"key":"e_1_2_11_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_5"},{"key":"e_1_2_11_16_2","doi-asserted-by":"crossref","unstructured":"ShangT. PengT. LeiQ. andLiuJ. Homomorphic Signature for Generation-based Network Coding Proceedings of the 2016 IEEE International Conference on Smart Cloud SmartCloud 2016 November 2016 USA 269\u2013273 2-s2.0-85011048708.","DOI":"10.1109\/SmartCloud.2016.59"},{"key":"e_1_2_11_17_2","doi-asserted-by":"crossref","unstructured":"YuZ. WeiY. RamkumarB. andGuanY. An efficient scheme for securing XOR network coding against pollution attacks Proceedings of the 28th Conference on Computer Communications (INFOCOM \u203209) April 2009 406\u2013414 https:\/\/doi.org\/10.1109\/infcom.2009.5061945 2-s2.0-70349664122.","DOI":"10.1109\/INFCOM.2009.5061945"},{"key":"e_1_2_11_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01957-9_18"},{"key":"e_1_2_11_19_2","doi-asserted-by":"crossref","unstructured":"LiY. YaoH. ChenM. JaggiS. andRosenA. RIPPLE authentication for network coding Proceedings of the IEEE INFOCOM March 2010 1\u20139 https:\/\/doi.org\/10.1109\/infcom.2010.5462051 2-s2.0-77953301246.","DOI":"10.1109\/INFCOM.2010.5462051"},{"key":"e_1_2_11_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2012.120224"},{"key":"e_1_2_11_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2515517"},{"key":"e_1_2_11_22_2","doi-asserted-by":"crossref","unstructured":"ZhangP. JiangY. LinC. YaoH. WasefA. andShenzX. Padding for orthogonality: Efficient subspace authentication for network coding Proceedings of the IEEE INFOCOM 2011 April 2011 China 1026\u20131034 2-s2.0-79960873240.","DOI":"10.1109\/INFCOM.2011.5934876"},{"key":"e_1_2_11_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2013.24"},{"key":"e_1_2_11_24_2","doi-asserted-by":"crossref","unstructured":"KehdiE.andLiB. Null keys: limiting malicious attacks via null space properties of network coding Proceedings of the 28th Conference on Computer Communications IEEE INFOCOM \u203209 April 2009 1224\u20131232 2-s2.0-70349653419.","DOI":"10.1109\/INFCOM.2009.5062036"},{"key":"e_1_2_11_25_2","doi-asserted-by":"crossref","unstructured":"NewellA.andNita-RotaruC. Split Null Keys: A null space based defense for pollution attacks in wireless network coding Proceedings of the 2012 9th Annual IEEE Communications Society Conference on Sensor Mesh and Ad Hoc Communications and Networks SECON 2012 June 2012 Republic of Korea 479\u2013487 2-s2.0-84867938732.","DOI":"10.1109\/SECON.2012.6275815"},{"key":"e_1_2_11_26_2","doi-asserted-by":"crossref","unstructured":"QiaoW. LiJ. andRenJ. An efficient error-detection and error-correction (edec) scheme for network coding Proceedings of the IEEE Globecom \u203211 December 2011 1\u20135.","DOI":"10.1109\/GLOCOM.2011.6134039"},{"key":"e_1_2_11_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2754579"},{"key":"e_1_2_11_28_2","volume-title":"Error Control Coding","author":"Lin S.","year":"2004"},{"key":"e_1_2_11_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"e_1_2_11_30_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1981.1056404"},{"key":"e_1_2_11_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"e_1_2_11_33_2","unstructured":"LiJ. Capacity assurance in hostile networks [Ph.D. dissertation] 2015 Michigan State University."}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/3473910.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/3473910.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/3473910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T07:58:32Z","timestamp":1775289512000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/3473910"}},"subtitle":[],"editor":[{"given":"Karl","family":"Andersson","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/3473910"],"URL":"https:\/\/doi.org\/10.1155\/2018\/3473910","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"value":"1530-8669","type":"print"},{"value":"1530-8677","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-09-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-11-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"3473910"}}