{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:29Z","timestamp":1740122369216,"version":"3.37.3"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673359"],"award-info":[{"award-number":["61673359"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013315","name":"Science and Technology Service Network Plan","doi-asserted-by":"publisher","award":["17030901026"],"award-info":[{"award-number":["17030901026"]}],"id":[{"id":"10.13039\/501100013315","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10878-023-01065-y","type":"journal-article","created":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T12:01:33Z","timestamp":1690977693000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3303-0981","authenticated-orcid":false,"given":"Mohammad Ali","family":"Raayatpanah","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Weise","sequence":"additional","affiliation":[]},{"given":"Jinsong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,2]]},"reference":[{"issue":"4","key":"1065_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li SR, Yeung RW (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204\u20131216. https:\/\/doi.org\/10.1109\/18.850663","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"1065_CR2","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/MCOM.2014.6736760","volume":"52","author":"T Bauschert","year":"2014","unstructured":"Bauschert T, B\u00fcsing C, D\u2019Andreagiovanni F, Koster AMCA, Kutschka M, Steglich U (2014) Network planning under demand uncertainty with robust optimization. IEEE Commun Mag 52(2):178\u2013185. https:\/\/doi.org\/10.1109\/MCOM.2014.6736760","journal-title":"IEEE Commun Mag"},{"key":"1065_CR3","volume-title":"Linear programming and network flows","author":"MS Bazaraa","year":"2011","unstructured":"Bazaraa MS, Jarvis JJ, Sherali HD (2011) Linear programming and network flows. Wiley, Hoboken"},{"issue":"4","key":"1065_CR4","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23(4):769\u2013805. https:\/\/doi.org\/10.1287\/moor.23.4.769","journal-title":"Math Oper Res"},{"issue":"1","key":"1065_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal A, Nemirovski A (1999) Robust solutions of uncertain linear programs. Oper Res Lett 25(1):1\u201313. https:\/\/doi.org\/10.1016\/S0167-6377(99)00016-4","journal-title":"Oper Res Lett"},{"issue":"3","key":"1065_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math Program 88(3):411\u2013424. https:\/\/doi.org\/10.1007\/PL00011380","journal-title":"Math Program"},{"key":"1065_CR7","doi-asserted-by":"publisher","unstructured":"Ben-Tal A, Ghaoui LE, Nemirovski A (2009) Robust optimization, Vol.\u00a028 of Princeton series in applied mathematics, Princeton University Press, Princeton. https:\/\/doi.org\/10.1515\/9781400831050","DOI":"10.1515\/9781400831050"},{"issue":"3","key":"1065_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program 98(3):49\u201371. https:\/\/doi.org\/10.1007\/s10107-003-0396-4","journal-title":"Math Program"},{"issue":"1","key":"1065_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35\u201353. https:\/\/doi.org\/10.1287\/opre.1030.0065","journal-title":"Oper Res"},{"issue":"6","key":"1065_CR10","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.orl.2003.12.007","volume":"32","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Pachamanova D, Sim M (2004) Robust linear optimization under general norms. Oper Res Lett 32(6):510\u2013516. https:\/\/doi.org\/10.1016\/j.orl.2003.12.007","journal-title":"Oper Res Lett"},{"issue":"3","key":"1065_CR11","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464\u2013501. https:\/\/doi.org\/10.1137\/080734510","journal-title":"SIAM Rev"},{"issue":"3","key":"1065_CR12","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464\u2013501. https:\/\/doi.org\/10.1137\/080734510","journal-title":"SIAM Rev"},{"key":"1065_CR13","doi-asserted-by":"publisher","unstructured":"Birge JR, Louveaux F (2011) Introduction to stochastic programming. Springer, New York. https:\/\/doi.org\/10.1007\/978-1-4614-0237-4","DOI":"10.1007\/978-1-4614-0237-4"},{"issue":"1","key":"1065_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.4310\/cis.2006.v6.n1.a2","volume":"6","author":"N Cai","year":"2006","unstructured":"Cai N, Yeung RW (2006) Network error correction, I: basic concepts and upper bounds. Commun Inf Syst 6(1):19\u201335. https:\/\/doi.org\/10.4310\/cis.2006.v6.n1.a2","journal-title":"Commun Inf Syst"},{"key":"1065_CR15","volume-title":"Statistical Models in S","author":"JM Chambers","year":"1992","unstructured":"Chambers JM, Hastie TJ (1992) Statistical Models in S. Wadsworth & Brooks\/Cole Computer Science, Chapman and Hall\/CRC, London"},{"issue":"6","key":"1065_CR16","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1109\/TC.2015.2456027","volume":"65","author":"F Chen","year":"2015","unstructured":"Chen F, Xiang T, Yang Y, Chow SSM (2015) Secure cloud storage meets with secure network coding. IEEE Trans Comput 65(6):1936\u20131948. https:\/\/doi.org\/10.1109\/TC.2015.2456027","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"1065_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.cor.2012.05.020","volume":"40","author":"G Cla\u00dfen","year":"2013","unstructured":"Cla\u00dfen G, Koster AMCA, Schmeink A (2013) A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks. Comput Oper Res 40(1):80\u201390. https:\/\/doi.org\/10.1016\/j.cor.2012.05.020","journal-title":"Comput Oper Res"},{"issue":"1","key":"1065_CR18","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1109\/TIT.2017.2697421","volume":"64","author":"J Connelly","year":"2018","unstructured":"Connelly J, Zeger K (2018) Linear network coding over rings\u2013part I: scalar codes and commutative alphabets. IEEE Trans Inf Theory 64(1):274\u2013291. https:\/\/doi.org\/10.1109\/TIT.2017.2697421","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"1065_CR19","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/TIT.2017.2697422","volume":"64","author":"J Connelly","year":"2018","unstructured":"Connelly J, Zeger K (2018) Linear network coding over rings\u2014part II: vector codes and non-commutative alphabets. IEEE Trans Inf Theory 64(1):292\u2013308. https:\/\/doi.org\/10.1109\/TIT.2017.2697422","journal-title":"IEEE Trans Inf Theory"},{"key":"1065_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2019.106859","author":"MK Dermany","year":"2019","unstructured":"Dermany MK, Nadjafi-Arani MJ, Doostali S (2019) Combining topology control and network coding to optimize lifetime in wireless-sensor networks. Comput Netw. https:\/\/doi.org\/10.1016\/j.comnet.2019.106859","journal-title":"Comput Netw"},{"issue":"2","key":"1065_CR21","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/TSTE.2016.2605926","volume":"8","author":"T Ding","year":"2017","unstructured":"Ding T, Li C, Yang Y, Jiang J, Bie Z, Blaabjerg F (2017) A two-stage robust optimization for centralized-optimal dispatch of photovoltaic inverters in active distribution networks. IEEE Trans Sustain Energy 8(2):744\u2013754. https:\/\/doi.org\/10.1109\/TSTE.2016.2605926","journal-title":"IEEE Trans Sustain Energy"},{"key":"1065_CR22","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.comcom.2020.10.014","volume":"164","author":"S Doostali","year":"2020","unstructured":"Doostali S, Babamir SM (2020) An energy efficient cluster head selection approach for performance improvement in network-coding-based wireless sensor networks with multiple sinks. Comput Commun 164:188\u2013200. https:\/\/doi.org\/10.1016\/j.comcom.2020.10.014","journal-title":"Comput Commun"},{"key":"1065_CR23","doi-asserted-by":"publisher","unstructured":"dos Santos Ribeiro J\u00fanior N, Tavares RC, Vieira MAM, Vieira LFM, Gnawali O (2017) CodeDrip: improving data dissemination for wireless sensor networks with network coding. Ad Hoc Netw 54:42\u201352. https:\/\/doi.org\/10.1016\/j.adhoc.2016.09.023","DOI":"10.1016\/j.adhoc.2016.09.023"},{"key":"1065_CR24","doi-asserted-by":"publisher","unstructured":"Doshi S, Bhandare S, Brown TX (2002) An on-demand minimum energy routing protocol for a wireless ad hoc network. https:\/\/doi.org\/10.1145\/581291.581300","DOI":"10.1145\/581291.581300"},{"issue":"10","key":"1065_CR25","doi-asserted-by":"publisher","first-page":"7040","DOI":"10.1109\/TWC.2018.2865545","volume":"17","author":"A Douik","year":"2018","unstructured":"Douik A, Sorour S, Al-Naffouri TY, Yang H, Alouini M (2018) Delay reduction in multi-hop device-to-device communication using network coding. IEEE Trans Wireless Commun 17(10):7040\u20137053. https:\/\/doi.org\/10.1109\/TWC.2018.2865545","journal-title":"IEEE Trans Wireless Commun"},{"issue":"2","key":"1065_CR26","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1109\/TIT.2010.2094930","volume":"57","author":"BJ Ebrahimi","year":"2011","unstructured":"Ebrahimi BJ, Fragouli C (2011) Algebraic algorithms for vector network coding. IEEE Trans Inf Theory 57(2):996\u20131007. https:\/\/doi.org\/10.1109\/TIT.2010.2094930","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"1065_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1052623496305717","volume":"9","author":"L El Ghaoui","year":"1998","unstructured":"El Ghaoui L, Oustry F, Lebret H (1998) Robust solutions to uncertain semidefinite programs. SIAM J Optim 9(1):33\u201352. https:\/\/doi.org\/10.1137\/S1052623496305717","journal-title":"SIAM J Optim"},{"issue":"4","key":"1065_CR28","doi-asserted-by":"publisher","first-page":"2460","DOI":"10.1109\/TIT.2018.2797183","volume":"64","author":"T Etzion","year":"2018","unstructured":"Etzion T, Wachter-Zeh A (2018) Vector network coding based on subspace codes outperforms scalar linear network coding. IEEE Trans Inf Theory 64(4):2460\u20132473. https:\/\/doi.org\/10.1109\/TIT.2018.2797183","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"1065_CR29","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.ejor.2013.09.036","volume":"235","author":"V Gabrel","year":"2014","unstructured":"Gabrel V, Murat C, Thiele A (2014) Recent advances in robust optimization: an overview. Eur J Oper Res 235(3):471\u2013483. https:\/\/doi.org\/10.1016\/j.ejor.2013.09.036","journal-title":"Eur J Oper Res"},{"key":"1065_CR30","unstructured":"GAMS\u2014a user\u2019s guide. Accessed 13 Dec 2021. (2021). https:\/\/www.gams.com\/latest\/docs"},{"issue":"3","key":"1065_CR31","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s11277-007-9375-z","volume":"44","author":"S Gezici","year":"2008","unstructured":"Gezici S (2008) A survey on wireless position estimation. Wireless Pers Commun 44(3):263\u2013282. https:\/\/doi.org\/10.1007\/s11277-007-9375-z","journal-title":"Wireless Pers Commun"},{"issue":"8","key":"1065_CR32","doi-asserted-by":"publisher","first-page":"2840","DOI":"10.3837\/tiis.2015.08.005","volume":"9","author":"H Ghasvari","year":"2015","unstructured":"Ghasvari H, Raayatpanah MA (2015) Robust capacity planning in network coding under demand uncertainty. KSII Trans Internet Inf Syst 9(8):2840\u20132853. https:\/\/doi.org\/10.3837\/tiis.2015.08.005","journal-title":"KSII Trans Internet Inf Syst"},{"issue":"2","key":"1065_CR33","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s11590-016-1051-3","volume":"11","author":"H Ghasvari","year":"2017","unstructured":"Ghasvari H, Raayatpanah MA, Pardalos PM (2017) A robust optimization approach for multicast network coding under uncertain link costs. Optim Lett 11(2):429\u2013444. https:\/\/doi.org\/10.1007\/s11590-016-1051-3","journal-title":"Optim Lett"},{"issue":"10","key":"1065_CR34","doi-asserted-by":"publisher","first-page":"5965","DOI":"10.1109\/TIT.2020.3011555","volume":"66","author":"X Guang","year":"2020","unstructured":"Guang X, Yeung RW, Fu F (2020) Local-encoding-preserving secure network coding. IEEE Trans Inf Theory 66(10):5965\u20135994. https:\/\/doi.org\/10.1109\/TIT.2020.3011555","journal-title":"IEEE Trans Inf Theory"},{"key":"1065_CR35","doi-asserted-by":"publisher","unstructured":"Guang X, Yeung RW (2020) Linear network error correction coding revisited. In: Proceedings of the IEEE international symposium on information theory (ISIT\u201920), Jun.\u00a021\u201326, 2020, Los Angeles, CA, USA, IEEE, New York, pp 1635\u20131640. https:\/\/doi.org\/10.1109\/ISIT44484.2020.9174493","DOI":"10.1109\/ISIT44484.2020.9174493"},{"issue":"7","key":"1065_CR36","doi-asserted-by":"publisher","first-page":"6299","DOI":"10.1109\/TVT.2016.2640313","volume":"66","author":"L Hai","year":"2017","unstructured":"Hai L, Wang J, Wang P, Wang H, Yang T (2017) High-throughput network coding aware routing in time-varying multihop networks. IEEE Trans Veh Technol 66(7):6299\u20136309. https:\/\/doi.org\/10.1109\/TVT.2016.2640313","journal-title":"IEEE Trans Veh Technol"},{"issue":"1","key":"1065_CR37","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1109\/JSAIT.2021.3053697","volume":"2","author":"M Hayashi","year":"2021","unstructured":"Hayashi M, Cai N (2021) Secure non-linear network code over one-hop relay network. IEEE J Select Areas Inf Theory 2(1):296\u2013305. https:\/\/doi.org\/10.1109\/JSAIT.2021.3053697","journal-title":"IEEE J Select Areas Inf Theory"},{"key":"1065_CR38","doi-asserted-by":"publisher","unstructured":"Heinzelman WR, Chandrakasan A, Balakrishnan H (2000) Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd annual Hawaii international conference on system sciences (HICSS-33), Jan.\u00a07, 2000, Maui, Hawaii, USA, Vol.\u00a0II, IEEE Computer Society, New York https:\/\/doi.org\/10.1109\/HICSS.2000.926982","DOI":"10.1109\/HICSS.2000.926982"},{"issue":"4","key":"1065_CR39","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/TWC.2002.804190","volume":"1","author":"WB Heinzelman","year":"2002","unstructured":"Heinzelman WB, Chandrakasan AP, Balakrishnan H (2002) An application-specific protocol architecture for wireless microsensor networks. IEEE Trans Wireless Commun 1(4):660\u2013670. https:\/\/doi.org\/10.1109\/TWC.2002.804190","journal-title":"IEEE Trans Wireless Commun"},{"issue":"10","key":"1065_CR40","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T Ho","year":"2006","unstructured":"Ho T, M\u00e9dard M, Koetter R, Karger DR, Effros M, Shi J, Leong B (2006) A random linear network coding approach to multicast. IEEE Trans Inf Theory 52(10):4413\u20134430. https:\/\/doi.org\/10.1109\/TIT.2006.881746","journal-title":"IEEE Trans Inf Theory"},{"key":"1065_CR41","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"FK Hwang","year":"1992","unstructured":"Hwang FK, Richards DS (1992) The Steiner tree problem. Networks 22:55\u201389. https:\/\/doi.org\/10.1002\/net.3230220105","journal-title":"Networks"},{"issue":"6","key":"1065_CR42","doi-asserted-by":"publisher","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","volume":"51","author":"S Jaggi","year":"2005","unstructured":"Jaggi S, Sanders P, Chou PA, Effros M, Egner S, Jain K, Tolhuizen LMGM (2005) Polynomial time algorithms for multicast network code construction. IEEE Trans Inf Theory 51(6):1973\u20131982. https:\/\/doi.org\/10.1109\/TIT.2005.847712","journal-title":"IEEE Trans Inf Theory"},{"key":"1065_CR43","doi-asserted-by":"publisher","unstructured":"Jaggi S, Langberg M, Katti S, Ho T, Katabi D, M\u00e9dard M (2007) Resilient network coding in the presence of Byzantine adversaries. In: Proceedings of the 26th IEEE international conference on computer communications (INFOCOM\u201907), joint conference of the IEEE computer and communications societies, May\u00a06\u201312, 2007, Anchorage, Alaska, IEEE, New York, pp 616\u2013624. https:\/\/doi.org\/10.1109\/INFCOM.2007.78","DOI":"10.1109\/INFCOM.2007.78"},{"issue":"2","key":"1065_CR44","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1109\/COMST.2018.2796101","volume":"20","author":"S Kafaie","year":"2018","unstructured":"Kafaie S, Chen Y, Dobre OA, Ahmed MH (2018) Joint inter-flow network coding and opportunistic routing in multi-hop wireless mesh networks: a comprehensive survey. IEEE Commun Surv Tutorials 20(2):1014\u20131035. https:\/\/doi.org\/10.1109\/COMST.2018.2796101","journal-title":"IEEE Commun Surv Tutorials"},{"key":"1065_CR45","doi-asserted-by":"publisher","unstructured":"Karmarkar N (1984) A new polynomial-time algorithm for linear programming, In: DeMillo RA (ed) Proceedings of the 16th annual ACM symposium on theory of computing, April\u00a030\u2013May\u20132, 1984, Washington, ACM, New York, pp 302\u2013311. https:\/\/doi.org\/10.1145\/800057.808695","DOI":"10.1145\/800057.808695"},{"key":"1065_CR46","doi-asserted-by":"publisher","unstructured":"Keshavarz-Haddad A, Riedi RH (2008) Bounds on the benefit of network coding: Throughput and energy saving in wireless networks. In: Proceedings of the 27th IEEE international conference on computer communications (INFOCOM\u201908), the joint conference of the ieee computer and communications societies, Apr.\u00a013\u201318, 2008, Phoenix, AZ, USA, IEEE, New York, pp 376\u2013384. https:\/\/doi.org\/10.1109\/INFOCOM.2008.84","DOI":"10.1109\/INFOCOM.2008.84"},{"key":"1065_CR47","unstructured":"Khachiyan LG (1979) A polynomial algorithm in linear programming, Doklady Academii Nauk SSSR 1093\u20131096"},{"issue":"1","key":"1065_CR48","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TWC.2017.2764891","volume":"17","author":"AS Khan","year":"2018","unstructured":"Khan AS, Chatzigeorgiou I (2018) Opportunistic relaying and random linear network coding for secure and reliable communication. IEEE Trans Wireless Commun 17(1):223\u2013234. https:\/\/doi.org\/10.1109\/TWC.2017.2764891","journal-title":"IEEE Trans Wireless Commun"},{"issue":"5","key":"1065_CR49","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R Koetter","year":"2003","unstructured":"Koetter R, M\u00e9dard M (2003) An algebraic approach to network coding. IEEE\/ACM Trans Netw 11(5):782\u2013795. https:\/\/doi.org\/10.1109\/TNET.2003.818197","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"4","key":"1065_CR50","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.comcom.2008.11.025","volume":"32","author":"D Kumar","year":"2009","unstructured":"Kumar D, Aseri TC, Patel RB (2009) EEHC: energy efficient heterogeneous clustered scheme for wireless sensor networks. Comput Commun 32(4):662\u2013667. https:\/\/doi.org\/10.1016\/j.comcom.2008.11.025","journal-title":"Comput Commun"},{"issue":"6","key":"1065_CR51","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1109\/TII.2017.2781372","volume":"14","author":"K Lei","year":"2017","unstructured":"Lei K, Zhong S, Zhu F, Xu K, Zhang H (2017) An NDN IoT content distribution model with network coding enhanced forwarding strategy for 5G. IEEE Trans Ind Inf 14(6):2725\u20132735. https:\/\/doi.org\/10.1109\/TII.2017.2781372","journal-title":"IEEE Trans Ind Inf"},{"key":"1065_CR52","doi-asserted-by":"publisher","unstructured":"Li SR, Sun QT, Shao Z (2011) Linear network coding: theory and algorithms. In: Proceedings of the IEEE, IEEE, pp 372\u2013387. https:\/\/doi.org\/10.1109\/JPROC.2010.2093851","DOI":"10.1109\/JPROC.2010.2093851"},{"issue":"2","key":"1065_CR53","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"SR Li","year":"2003","unstructured":"Li SR, Yeung RW, Cai N (2003) Linear network coding. IEEE Trans Inf Theory 49(2):371\u2013381. https:\/\/doi.org\/10.1109\/TIT.2002.807285","journal-title":"IEEE Trans Inf Theory"},{"key":"1065_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2020.102259","volume":"107","author":"B Li","year":"2020","unstructured":"Li B, Ru X, Wang X, Zhao Q, Lu W, Yu C (2020) Relay selection in network coding assisted multi-pair D2D communications. Ad Hoc Netw 107:102259. https:\/\/doi.org\/10.1016\/j.adhoc.2020.102259","journal-title":"Ad Hoc Netw"},{"key":"1065_CR55","unstructured":"Lun DS, M\u00e9dard M, Koetter R (2005) Efficient operation of wireless packet networks using network coding. In: International workshop on convergent technologies (IWCT\u201905), Jun.\u00a06-10, 2005, Oulu, Finland, New York"},{"issue":"6","key":"1065_CR56","doi-asserted-by":"publisher","first-page":"2608","DOI":"10.1109\/TIT.2006.874523","volume":"52","author":"DS Lun","year":"2006","unstructured":"Lun DS, Ratnakar N, M\u00e9dard M, Koetter R, Karger DR, Ho T, Ahmed E, Zhao F (2006) Minimum-cost multicast over coded packet networks. IEEE Trans Inf Theory 52(6):2608\u20132623. https:\/\/doi.org\/10.1109\/TIT.2006.874523","journal-title":"IEEE Trans Inf Theory"},{"issue":"5","key":"1065_CR57","doi-asserted-by":"publisher","first-page":"3657","DOI":"10.1007\/s11276-020-02284-5","volume":"26","author":"S Malathy","year":"2020","unstructured":"Malathy S, Porkodi V, Sampathkumar A, Hindia MN, Dimyati K, Tilwari V, Qamar F, Amiri IS (2020) An optimal network coding based backpressure routing approach for massive IoT network. Wireless Netw 26(5):3657\u20133674. https:\/\/doi.org\/10.1007\/s11276-020-02284-5","journal-title":"Wireless Netw"},{"issue":"3","key":"1065_CR58","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1109\/COMST.2017.2661861","volume":"19","author":"A Naeem","year":"2017","unstructured":"Naeem A, Rehmani MH, Saleem Y, Rashid I, Crespi N (2017) Network coding in cognitive radio networks: a comprehensive survey. IEEE Commun Surv Tutorials 19(3):1945\u20131973. https:\/\/doi.org\/10.1109\/COMST.2017.2661861","journal-title":"IEEE Commun Surv Tutorials"},{"issue":"1","key":"1065_CR59","doi-asserted-by":"publisher","first-page":"22","DOI":"10.18178\/ijeetc.10.1.22-28","volume":"10","author":"N Nasaruddin","year":"2021","unstructured":"Nasaruddin N, Adriman R, Afdhal A (2021) Energy-efficient multiple-relay cooperative networks using Hamming coding. Int J Electric Electron Eng Telecommun IJEETC 10(1):22\u201328. https:\/\/doi.org\/10.18178\/ijeetc.10.1.22-28","journal-title":"Int J Electric Electron Eng Telecommun IJEETC"},{"issue":"2","key":"1065_CR60","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/TVT.2008.927729","volume":"58","author":"D Nguyen","year":"2009","unstructured":"Nguyen D, Tran T, Nguyen TP, Bose B (2009) Wireless broadcast using network coding. IEEE Trans Veh Technol 58(2):914\u2013925. https:\/\/doi.org\/10.1109\/TVT.2008.927729","journal-title":"IEEE Trans Veh Technol"},{"issue":"2","key":"1065_CR61","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1002\/net.20183","volume":"50","author":"F Ord\u00f3\u00f1ez","year":"2007","unstructured":"Ord\u00f3\u00f1ez F, Zhao J (2007) Robust capacity expansion of network flows. Networks 50(2):136\u2013145. https:\/\/doi.org\/10.1002\/net.20183","journal-title":"Networks"},{"issue":"3","key":"1065_CR62","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1109\/TNET.2015.2427161","volume":"24","author":"P Ostovari","year":"2015","unstructured":"Ostovari P, Wu J, Khreishah A, Shroff NB (2015) Scalable video streaming with helper nodes using random linear network coding. IEEE\/ACM Trans Netw 24(3):1574\u20131587. https:\/\/doi.org\/10.1109\/TNET.2015.2427161","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1065_CR63","unstructured":"R Core Team R (2018) A language and environment for statistical computing, R Foundation for Statistical Computing, Vienna, Austria, 2018. Accessed 13 Dec 2021. https:\/\/www.r-project.org\/"},{"key":"1065_CR64","doi-asserted-by":"crossref","unstructured":"Renegar J (2001) A mathematical view of interior-point methods in convex optimization, vol 3. MPS-SIAM series on optimization. SIAM, Philadelphia","DOI":"10.1137\/1.9780898718812"},{"issue":"4","key":"1065_CR65","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s11235-016-0247-2","volume":"65","author":"OB Rhaiem","year":"2017","unstructured":"Rhaiem OB, Chaari L (2017) Information transmission based on network coding over wireless networks: a survey. Telecommun Syst 65(4):551\u2013565. https:\/\/doi.org\/10.1007\/s11235-016-0247-2","journal-title":"Telecommun Syst"},{"issue":"4","key":"1065_CR66","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1109\/TNET.2010.2042727","volume":"18","author":"S Sengupta","year":"2010","unstructured":"Sengupta S, Rayanchu SK, Banerjee S (2010) Network coding-aware routing in wireless networks. IEEE\/ACM Trans Netw 18(4):1158\u20131170. https:\/\/doi.org\/10.1109\/TNET.2010.2042727","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"1065_CR67","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TIT.2010.2090212","volume":"57","author":"D Silva","year":"2011","unstructured":"Silva D, Kschischang FR (2011) Universal secure network coding via rank-metric codes. IEEE Trans Inf Theory 57(2):1124\u20131135. https:\/\/doi.org\/10.1109\/TIT.2010.2090212","journal-title":"IEEE Trans Inf Theory"},{"key":"1065_CR68","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2020.102182","volume":"107","author":"A Singh","year":"2020","unstructured":"Singh A, Nagaraju A (2020) Low latency and energy efficient routing-aware network coding-based data transmission in multi-hop and multi-sink WSN. Ad Hoc Netw 107:102182. https:\/\/doi.org\/10.1016\/j.adhoc.2020.102182","journal-title":"Ad Hoc Netw"},{"issue":"5","key":"1065_CR69","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21(5):1154\u20131157. https:\/\/doi.org\/10.1287\/opre.21.5.1154","journal-title":"Oper Res"},{"key":"1065_CR70","doi-asserted-by":"publisher","unstructured":"Toklu NE, Montemanni R, Gambardella LM (2013) An ant colony system for the capacitated vehicle routing problem with uncertain travel costs. In: Proceedings of the IEEE symposium on swarm intelligence (SIS\u201913), Apr.\u00a016\u201319, 2013, Singapore, IEEE, New York, pp 32\u201339. https:\/\/doi.org\/10.1109\/SIS.2013.6615156","DOI":"10.1109\/SIS.2013.6615156"},{"issue":"4","key":"1065_CR71","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1109\/TMC.2017.2739744","volume":"17","author":"M Usman","year":"2017","unstructured":"Usman M, Yang N, Jan MA, He X, Xu M, Lam K (2017) A joint framework for QoS and QoE for video transmission over wireless multimedia sensor networks. IEEE Trans Mob Comput 17(4):746\u2013759. https:\/\/doi.org\/10.1109\/TMC.2017.2739744","journal-title":"IEEE Trans Mob Comput"},{"issue":"6","key":"1065_CR72","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1023\/A:1020716919751","volume":"7","author":"JE Wieselthier","year":"2002","unstructured":"Wieselthier JE, Nguyen GD, Ephremides A (2002) Energy-efficient broadcast and multicast trees in wireless networks. Mobile Netw Appl 7(6):481\u2013492. https:\/\/doi.org\/10.1023\/A:1020716919751","journal-title":"Mobile Netw Appl"},{"issue":"2","key":"1065_CR73","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1145\/1816262.1816266","volume":"18","author":"Y Xi","year":"2010","unstructured":"Xi Y, Yeh EM (2010) Distributed algorithms for minimum cost multicast with network coding. IEEE\/ACM Trans Netw 18(2):379\u2013392. https:\/\/doi.org\/10.1145\/1816262.1816266","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"4","key":"1065_CR74","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s10489-011-0298-8","volume":"36","author":"H Xing","year":"2012","unstructured":"Xing H, Qu R (2012) A compact genetic algorithm for the network coding based resource minimization problem. Appl Intell 36(4):809\u2013823. https:\/\/doi.org\/10.1007\/s10489-011-0298-8","journal-title":"Appl Intell"},{"key":"1065_CR75","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.asoc.2017.06.003","volume":"59","author":"H Xing","year":"2017","unstructured":"Xing H, Li S, Cui Y, Yan L, Pan W, Qu R (2017) A hybrid EDA for load balancing in multicast with network coding. Appl Soft Comput 59:363\u2013377. https:\/\/doi.org\/10.1016\/j.asoc.2017.06.003","journal-title":"Appl Soft Comput"},{"key":"1065_CR76","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.asoc.2017.05.033","volume":"59","author":"H Xing","year":"2017","unstructured":"Xing H, Wang Z, Li T, Li H, Qu R (2017) An improved MOEA\/D algorithm for multi-objective multicast routing with network coding. Appl Soft Comput 59:88\u2013103. https:\/\/doi.org\/10.1016\/j.asoc.2017.05.033","journal-title":"Appl Soft Comput"},{"issue":"7","key":"1065_CR77","doi-asserted-by":"publisher","first-page":"6203","DOI":"10.1109\/TVT.2018.2816822","volume":"67","author":"Y Yan","year":"2018","unstructured":"Yan Y, Zhang B, Li C (2018) Network coding aided collaborative real-time scalable video transmission in d2d communications. IEEE Trans Veh Technol 67(7):6203\u20136217. https:\/\/doi.org\/10.1109\/TVT.2018.2816822","journal-title":"IEEE Trans Veh Technol"},{"issue":"6","key":"1065_CR78","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1109\/TWC.2008.060756","volume":"7","author":"W Ye","year":"2008","unstructured":"Ye W, Ord\u00f3\u00f1ez F (2008) Robust optimization models for energy-limited wireless sensor networks under distance uncertainty. IEEE Trans Wireless Commun 7(6):2161\u20132169. https:\/\/doi.org\/10.1109\/TWC.2008.060756","journal-title":"IEEE Trans Wireless Commun"},{"key":"1065_CR79","doi-asserted-by":"publisher","unstructured":"You L, Liu C, Tong S (2010) The lifetime optimization of wireless multimedia sensor networks under uncertain energy consumption. In: Proceedings of the 5th international conference on computer science and education (ICCSE), Aug.\u00a024\u201327, 2010, Hefei, China, IEEE, New York, pp 928\u2013932. https:\/\/doi.org\/10.1109\/ICCSE.2010.5593460","DOI":"10.1109\/ICCSE.2010.5593460"},{"key":"1065_CR80","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.106014","volume":"89","author":"A Zam","year":"2020","unstructured":"Zam A, Khayyambashi M, Bohlooli A (2020) Energy-efficient face detection and recognition scheme for wireless visual sensor networks. Appl Soft Comput 89:106014. https:\/\/doi.org\/10.1016\/j.asoc.2019.106014","journal-title":"Appl Soft Comput"},{"issue":"13","key":"1065_CR81","doi-asserted-by":"publisher","first-page":"10779","DOI":"10.1109\/JIOT.2021.3051098","volume":"8","author":"H Zhang","year":"2021","unstructured":"Zhang H, Hu Y, Wang R, Li Z, Zhang P, Xu R (2021) Energy efficient frame aggregation scheme in IoT over fiber-wireless networks. IEEE Internet Things J 8(13):10779\u201310791. https:\/\/doi.org\/10.1109\/JIOT.2021.3051098","journal-title":"IEEE Internet Things J"},{"issue":"1","key":"1065_CR82","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1109\/TIT.2013.2287725","volume":"60","author":"F Zhao","year":"2014","unstructured":"Zhao F, M\u00e9dard M, Ozdaglar AE, Lun DS (2014) Convergence study of decentralized min-cost subgraph algorithms for multicast in coded networks. IEEE Trans Inf Theory 60(1):410\u2013421. https:\/\/doi.org\/10.1109\/TIT.2013.2287725","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"1065_CR83","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1109\/TNSE.2018.2890430","volume":"7","author":"K Zheng","year":"2019","unstructured":"Zheng K, Liu X, Fu L, Wang X, Zhu Y (2019) Energy efficiency in multihop wireless networks with unreliable links. IEEE Trans Netw Sci Eng 7(1):576\u2013588. https:\/\/doi.org\/10.1109\/TNSE.2018.2890430","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"1\u20132","key":"1065_CR84","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10479-014-1756-6","volume":"257","author":"S Zokaee","year":"2017","unstructured":"Zokaee S, Jabbarzadeh A, Fahimnia B, Sadjadi SJ (2017) Robust supply chain network design: an optimization model with real world application. Ann Oper Res 257(1\u20132):15\u201344. https:\/\/doi.org\/10.1007\/s10479-014-1756-6","journal-title":"Ann Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01065-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01065-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01065-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T10:12:45Z","timestamp":1692785565000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01065-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":84,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1065"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01065-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"26 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that there are no conflicts of interests. All authors declare that they have no significant competing financial, professional or personal interests that might have influenced the performance or presentation of the work described in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"4"}}