{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:08:09Z","timestamp":1746331689385,"version":"3.40.4"},"reference-count":43,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2014,8,4]],"date-time":"2014-08-04T00:00:00Z","timestamp":1407110400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Communications"],"published-print":{"date-parts":[[2016,2,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Network coding (NC) can greatly improve the performance of wireless mesh networks (WMNs) in terms of throughput and reliability, and so on. However, NC generally performs a batch\u2010based transmission scheme, the main drawback of this scheme is the inevitable increase in average packet delay, that is, a large batch size may achieve higher throughput but also induce larger average packet delay. In this work, we put our focus on the tradeoff between the average throughput and packet delay; in particular, our ultimate goal is to maximize the throughput for real\u2010time traffic under the premise of diversified and time\u2010varying delay requirements. To tackle this problem, we propose DCNC, a delay controlled network coding protocol, which can improve the throughput for real\u2010time traffic by dynamically controlling the delay in WMNs. To define an appropriate control foundation, we first build up a delay prediction model to capture the relationship between the average packet delay and the encoding batch size. Then, we design a novel freedom\u2010based feedback scheme to efficiently reflect the reception of receivers in a reliable way. Based on the predicted delay and current reception status, DCNC utilizes the continuous encoding batch size adjustment to control delay and further improve the throughput. Extensive simulations show that, when faced with the diversified and time\u2010varying delay requirements, DCNC can constantly fulfill the delay requirements, for example, achieving over 95% efficient packet delivery ratio (EPDR) in all instances under good channel quality, and also obtains higher throughput than the state\u2010of\u2010art protocol. Copyright \u00a9 2014 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/wcm.2505","type":"journal-article","created":{"date-parts":[[2014,8,4]],"date-time":"2014-08-04T10:10:31Z","timestamp":1407147031000},"page":"137-149","source":"Crossref","is-referenced-by-count":4,"title":["DCNC: throughput maximization via delay controlled network coding for wireless mesh networks"],"prefix":"10.1002","volume":"16","author":[{"given":"Yuben","family":"Qu","sequence":"first","affiliation":[{"name":"College of Communications Engineering PLA University of Science and Technology Nanjing 210007 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Dong","sequence":"additional","affiliation":[{"name":"College of Communications Engineering PLA University of Science and Technology Nanjing 210007 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Communications Engineering PLA University of Science and Technology Nanjing 210007 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Communications Engineering PLA University of Science and Technology Nanjing 210007 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang","family":"Tian","sequence":"additional","affiliation":[{"name":"College of Communications Engineering PLA University of Science and Technology Nanjing 210007 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaojie","family":"Tang","sequence":"additional","affiliation":[{"name":"Department of Information Systems University of Texas at Dallas Dallas TX U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2014,8,4]]},"reference":[{"key":"e_1_2_9_2_1","unstructured":"MIT Roofnet 2012. (Available from:https:\/\/2.zoppoz.workers.dev:443\/http\/www.pdos.lcs.mit.edu)."},{"key":"e_1_2_9_3_1","unstructured":"Bay area wireless users group 2012. (Available from:https:\/\/2.zoppoz.workers.dev:443\/http\/www.bawug.org)."},{"key":"e_1_2_9_4_1","unstructured":"Seattle wireless 2012. (Available from:https:\/\/2.zoppoz.workers.dev:443\/http\/www.seattlewireless.net)."},{"key":"e_1_2_9_5_1","doi-asserted-by":"crossref","unstructured":"AguayoD BicketJ JuddG MorrisR.Link\u2010level measurements from an 802.11b mesh network. InProceedings of the ACM SIGCOMM'04 New York USA August2004;121\u2013132.","DOI":"10.1145\/1030194.1015482"},{"key":"e_1_2_9_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"e_1_2_9_7_1","doi-asserted-by":"crossref","unstructured":"PerkinsC RoyerE.Ad hoc on\u2010demand distance vector routing.Proceedings of the IEEE WMCSA New Orleans USA February1999;90\u2013100.","DOI":"10.1109\/MCSA.1999.749281"},{"key":"e_1_2_9_8_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2009.0164"},{"key":"e_1_2_9_9_1","doi-asserted-by":"crossref","unstructured":"ChachulskiS JenningsM KattiS KatabiD.Trading structure for randomness in wireless opportunistic routing. InProceedings of the ACM SIGCOMM'07 New York USA October2007;169\u2013180.","DOI":"10.1145\/1282427.1282400"},{"key":"e_1_2_9_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2111382"},{"key":"e_1_2_9_11_1","doi-asserted-by":"crossref","unstructured":"LinY LiB LiangB.CodeOR: opportunistic routing in wireless mesh networks with segmented network coding. InProceedings of the IEEE ICNP'08 Orlando USA October 2008;13\u201322.","DOI":"10.1109\/ICNP.2008.4697020"},{"key":"e_1_2_9_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/WC-M.2006.250362"},{"key":"e_1_2_9_13_1","doi-asserted-by":"crossref","unstructured":"GhaderiM TowsleyD KuroseJ.Reliability gain of network coding in lossy wireless networks.InProceedings of the IEEE INFOCOM'08 Phoenix USA April2008;2171\u20132179.","DOI":"10.1109\/INFOCOM.2008.284"},{"key":"e_1_2_9_14_1","doi-asserted-by":"crossref","unstructured":"PengL SongG ShuiY VasilakosAV.CodePipe: an opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. InProceedings of the IEEE INFOCOM'12 Orlando USA March2012;100\u2013108.","DOI":"10.1109\/INFCOM.2012.6195456"},{"key":"e_1_2_9_15_1","unstructured":"Cisco.Cisco Visual Networking Index: Forecast and Methodology 2010\u20102015."},{"key":"e_1_2_9_16_1","doi-asserted-by":"crossref","unstructured":"ZhouY ZhangY LiuH XiongN VasilakosAV.A bare\u2010metal and asymmetric partitioning approach to client virtualization 2012;40\u201353.","DOI":"10.1109\/TSC.2012.32"},{"key":"e_1_2_9_17_1","doi-asserted-by":"crossref","unstructured":"FragouliC LunD M\u00e9dardM PakzadP.On feedback for network coding. InProceedings of the IEEE CISS'07 Baltimore USA March2007;248\u2013252.","DOI":"10.1109\/CISS.2007.4298308"},{"key":"e_1_2_9_18_1","unstructured":"HoT M\u00e9dardM ShiJ EffrosM KargerD.On randomized network coding. InProceedings of the 41st Annual Allerton Conference on Communication Control and Computing Monticello USA October2003."},{"key":"e_1_2_9_19_1","doi-asserted-by":"crossref","unstructured":"CostaR MunarettoD WidmerJ BarrosJ.Informed network coding for minimum decoding delay. InProceedings of the 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS'08) Atlanta USA October2008;80\u201391.","DOI":"10.1109\/MAHSS.2008.4660042"},{"key":"e_1_2_9_20_1","unstructured":"ZhangH ZhouJ ChenZ LiJ.Minimizing delay for video conference with network coding. InProceedings ACM SIGCOMM'09 Spain Barcelona August2009."},{"issue":"4","key":"e_1_2_9_21_1","article-title":"An optimal adaptive network coding shceme for minimizing decoding delay in broadcast erasure channels","volume":"2010","author":"Sadeghi P","year":"2010","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"key":"e_1_2_9_22_1","doi-asserted-by":"crossref","unstructured":"SorourS ValaeeS.Completion delay minimization for instantly decodable network coding with limited feedback. InProceedings IEEE ICC'11 Kyoto Japan June2011;5\u20139.","DOI":"10.1109\/icc.2011.5963123"},{"key":"e_1_2_9_23_1","doi-asserted-by":"crossref","unstructured":"KellerL DrineaE FragouliC.Online broadcasting with network coding. InProceedings IEEE Fourth Workshop on Network Coding Theory and Applications (NetCod'08) Hong Kong China January2008;1\u20136.","DOI":"10.1109\/NETCOD.2008.4476183"},{"key":"e_1_2_9_24_1","unstructured":"ZhangC FangY ZhuX.SProceedings of the IEEE INFOCOM'09. InRio de Janeiro Brazil April2009;199\u2013207."},{"key":"e_1_2_9_25_1","doi-asserted-by":"crossref","unstructured":"LiX WangC LinX.Throughput and delay analysis on uncoded and coded wireless broadcast with hard deadline constraints. InProceedigs of the IEEE INFOCOM'10 San Diego USA March2010;1\u20135.","DOI":"10.1109\/INFCOM.2010.5462258"},{"key":"e_1_2_9_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928247"},{"key":"e_1_2_9_27_1","doi-asserted-by":"crossref","unstructured":"PappasN SirisV TraganitisA.Delay and throughput of network coding with path redundancy for wireless mesh networks. InProceedings of the Third Joint IFIP Wireless and Mobile Networking Conference (WMNC'10) Budapest Hungary October2010;1\u20136.","DOI":"10.1109\/WMNC.2010.5678750"},{"key":"e_1_2_9_28_1","doi-asserted-by":"crossref","unstructured":"ZhenningK YehE SolijaninE.Coding improves the throughput\u2010delay trade\u2010off in mobile wireless networks. InProceedings of the IEEE International Symposium on Information Theory (ISIT'09) Seoul Korea June2009;1784\u20131788.","DOI":"10.1109\/ISIT.2009.5205277"},{"key":"e_1_2_9_29_1","doi-asserted-by":"crossref","unstructured":"SwapnaB EryilmazA ShroffN.Energy\u2010delay tradeoff in wireless network coding. InProceedings of the IEEE International Symposium on Network Coding (NetCod'10) Toronto Canada June2010;1\u20136.","DOI":"10.1109\/NETCOD.2010.5487666"},{"issue":"12","key":"e_1_2_9_30_1","first-page":"4100","article-title":"Cost\u2010delay tradeoffs for two\u2010way relay networks","volume":"10","author":"Ciftcioglu E","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_9_31_1","unstructured":"SundararajanJ ShahD M\u00e9dardM.Feedback\u2010based online network coding \u201d avaiable at arXiv preprint arXiv:0904.1730 (2009)."},{"key":"e_1_2_9_32_1","doi-asserted-by":"crossref","unstructured":"BarrosJ CostaR MunarettoD WidmerJ.Effective delay control in online network coding. InProceedings of the IEEE INFOCOM'09 Rio de Janeiro Brazil April2009;208\u2013216.","DOI":"10.1109\/INFCOM.2009.5061923"},{"key":"e_1_2_9_33_1","doi-asserted-by":"crossref","unstructured":"YangL SagduyuY LiJ.Adaptive network coding for scheduling real\u2010time traffic with hard deadlines. InProceedings of the ACM MOBIHOC'12 Hilton Head Island USA June2012;105\u2013114.","DOI":"10.1145\/2248371.2248389"},{"key":"e_1_2_9_34_1","doi-asserted-by":"crossref","unstructured":"SundararajanJ SadeghiP M\u00e9dardM.A feedbck\u2010based adaptive broadcast coding scheme for reducing in\u2010order delivery delay. InProceedings of IEEE Workshop on Network Coding Theory and Applications (NetCod'09) Lausanne Switzerland June2009;1\u20136.","DOI":"10.1109\/NETCOD.2009.5437470"},{"key":"e_1_2_9_35_1","doi-asserted-by":"crossref","unstructured":"HouI KumarP.Broadcasting delay\u2010constrained traffic over unreliable wireless links with network coding. InProceedings of the ACM MOBIHOC'11 New York USA May2011;33\u201342.","DOI":"10.1145\/2107502.2107508"},{"key":"e_1_2_9_36_1","doi-asserted-by":"crossref","unstructured":"SorourS ValaeeS.Adaptive network coded retransmission scheme for wireless multicast. InProceedings of the IEEE International Symposium on Information Theory (ISIT'09) Seoul Korea July2009;2577\u20132581.","DOI":"10.1109\/ISIT.2009.5205995"},{"key":"e_1_2_9_37_1","doi-asserted-by":"crossref","unstructured":"LeA TehraniA DimakisA MarkopoulouA.Instantly decodable network codes for real\u2010time applications. InProceedings of the IEEE International Symposium on Network Coding (NetCod'13) Calgary Canada June2013;1\u20136.","DOI":"10.1109\/NetCod.2013.6570827"},{"key":"e_1_2_9_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110519"},{"key":"e_1_2_9_39_1","doi-asserted-by":"crossref","unstructured":"ShraderB JonesN.Systematic wireless network coding. InProceedings of the IEEE MILCOM'09 San Jose USA October2009;1\u20137.","DOI":"10.1109\/MILCOM.2009.5380081"},{"volume-title":"Computer Networks: A System Approach, ISBN: 012370548","year":"2007","author":"Peterson L","key":"e_1_2_9_40_1"},{"key":"e_1_2_9_41_1","doi-asserted-by":"crossref","unstructured":"EryilmazA OzdaglarA M\u00e9dardM.On delay performance gains from network coding. InProceedings of the 40th Annual Conference on Information Sciences and Systems Princeton USA March2006;864\u2013870.","DOI":"10.1109\/CISS.2006.286588"},{"issue":"3","key":"e_1_2_9_42_1","first-page":"518","article-title":"Solving least squares problems","volume":"18","author":"Lawson C","year":"1976","journal-title":"Society for Industrial and Applied Mathematics"},{"key":"e_1_2_9_43_1","doi-asserted-by":"crossref","unstructured":"SundararajanJ ShahD M\u00e9dardM.ARQ for network coding. InProceedings of the IEEE Internaional Symposium on Information Theory (ISIT'08) Toronto Canada July2008;1651\u20131655.","DOI":"10.1109\/ISIT.2008.4595268"},{"key":"e_1_2_9_44_1","unstructured":"Qualnet 2014. (Available from:https:\/\/2.zoppoz.workers.dev:443\/http\/www.scalable\u2010networks.com)."}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fwcm.2505","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/wcm.2505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T01:57:06Z","timestamp":1746323826000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/wcm.2505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,4]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2,10]]}},"alternative-id":["10.1002\/wcm.2505"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/wcm.2505","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2014,8,4]]}}}