{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T15:55:43Z","timestamp":1760889343989,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2017,1,18]],"date-time":"2017-01-18T00:00:00Z","timestamp":1484697600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this paper, we propose a novel distributed unequal error protection (UEP) rateless coding scheme (DURC) for space information networks (SIN). We consider the multimedia data transmissions in a dual-hop SIN communication scenario, where multiple disjoint source nodes need to transmit their UEP rateless coded data to a destination via a dynamic relay. We formulate the optimization problems to provide optimal degree distributions on the direct links and the dynamic relay links to satisfy the required error protection levels. The optimization methods are based on the And\u2013Or tree analysis and can be solved by multi-objective programming. In addition, we evaluate the performance of the optimal DURC scheme, and simulation results show that the proposed DURC scheme can effectively provide UEP property under a variety of error requirements.<\/jats:p>","DOI":"10.3390\/e19010038","type":"journal-article","created":{"date-parts":[[2017,1,18]],"date-time":"2017-01-18T10:00:47Z","timestamp":1484733647000},"page":"38","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Distributed Rateless Codes with Unequal Error Protection Property for Space Information Networks"],"prefix":"10.3390","volume":"19","author":[{"given":"Jian","family":"Jiao","sequence":"first","affiliation":[{"name":"Communication Engineering Research Centre, Harbin Institute of Technology Shenzhen Graduate School, HIT Campus of University Town of Shenzhen, Shenzhen 518055, China"},{"name":"School of Electrical and Information on Engineering, The University of Sydney, Sydney, NSW 2006, Australia"}]},{"given":"Yi","family":"Yang","sequence":"additional","affiliation":[{"name":"Communication Engineering Research Centre, Harbin Institute of Technology Shenzhen Graduate School, HIT Campus of University Town of Shenzhen, Shenzhen 518055, China"}]},{"given":"Bowen","family":"Feng","sequence":"additional","affiliation":[{"name":"Communication Engineering Research Centre, Harbin Institute of Technology Shenzhen Graduate School, HIT Campus of University Town of Shenzhen, Shenzhen 518055, China"}]},{"given":"Shaohua","family":"Wu","sequence":"additional","affiliation":[{"name":"Communication Engineering Research Centre, Harbin Institute of Technology Shenzhen Graduate School, HIT Campus of University Town of Shenzhen, Shenzhen 518055, China"}]},{"given":"Yonghui","family":"Li","sequence":"additional","affiliation":[{"name":"School of Electrical and Information on Engineering, The University of Sydney, Sydney, NSW 2006, Australia"}]},{"given":"Qinyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Communication Engineering Research Centre, Harbin Institute of Technology Shenzhen Graduate School, HIT Campus of University Town of Shenzhen, Shenzhen 518055, China"}]}],"member":"1968","published-online":{"date-parts":[[2017,1,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2056","DOI":"10.1109\/JPROC.2011.2159571","article-title":"Reliability options for data communications in the future deep-space missions","volume":"99","author":"Paolini","year":"2011","journal-title":"Proc. IEEE"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/JSYST.2014.2330422","article-title":"Modeling RTT for DTN protocol over asymmetric cislunar space channels","volume":"10","author":"Yu","year":"2016","journal-title":"IEEE Syst. J."},{"key":"ref_3","unstructured":"Consultative Committee for Space Data Systems (CCSDS) (2014). Erasure Correcting Codes for Use in Nearearth and Deep-Space Communications, National Aeronautics and Space Administration."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/MWC.2010.5450661","article-title":"Reliable data delivery over deep space networks: Benefits of long erasure codes over ARQ strategies","volume":"17","author":"Marchese","year":"2010","journal-title":"IEEE Wirel. Commun."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3209","DOI":"10.1109\/TCOMM.2012.081012.110363","article-title":"Maximum likelihood erasure decoding of LDPC codes: Pivoting algorithms and code design","volume":"60","author":"Paolini","year":"2012","journal-title":"IEEE Trans. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1109\/TWC.2012.121412120053","article-title":"On-line construction of irregular repeat accumulate codes for packet erasure channels","volume":"12","author":"Liva","year":"2013","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/sat.1062","article-title":"Recent findings on erasure codes for space communications","volume":"32","author":"Garrammone","year":"2014","journal-title":"Int. J. Satell. Commun. Netw."},{"key":"ref_8","unstructured":"Luby, M. (2002, January 16\u201319). LT codes. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, BC, Canada."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","article-title":"Raptor codes","volume":"52","author":"Shokrollahi","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/MAES.2011.5739483","article-title":"Packets interleaving ccsds file delivery protocol in deep space communication","volume":"26","author":"Jiao","year":"2011","journal-title":"IEEE Aerosp. Electron. Syst. Mag."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1016\/j.actaastro.2010.09.015","article-title":"An erasure coding-based loss-tolerant file delivery protocol for deep space communications","volume":"68","author":"Li","year":"2011","journal-title":"Acta Astronaut."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Wang, Y., Jiao, J., Sui, X.-D., Wu, S.-H., Li, Y.-H., and Zhang, Q.-Y. (2016, January 13\u201315). Rateless coding scheme for time-varying dying channels. Proceedings of the 8th Wireless Communications & Signal Processing, Yangzhou, China.","DOI":"10.1109\/WCSP.2016.7752699"},{"key":"ref_13","first-page":"1","article-title":"QoS provisioning in converged satellite and terrestrial networks: A survey of the state-of-the-art","volume":"19","author":"Niephaus","year":"2016","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Gu, S.-S., Yang, Y., Jiao, J., Xiang, W., and Zhang, Q.-Y. (2015, January 15\u201317). Distributed rateless coded collaboration for satellite relay networks. Proceedings of the Wireless Communications & Signal Processing, Nanjing, China.","DOI":"10.1109\/WCSP.2015.7341168"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TWC.2016.2615618","article-title":"QoS Support in SGD-based High Throughput Satellite Networks","volume":"15","author":"Muhammad","year":"2016","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3740","DOI":"10.1109\/TIT.2007.904982","article-title":"The design and performance of distributed LT codes","volume":"53","author":"Puducheri","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Sejdinovic, D., Piechocki, R., and Doufexi, A. (2009, January 12\u201310). AND-OR tree analysis of distributed LT codes. Proceedings of the IEEE Infromation Theory Workshop, Taormina, Italy.","DOI":"10.1109\/ITWNIT.2009.5158583"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3217","DOI":"10.1109\/TCOMM.2011.091911.100189","article-title":"Binary soliton-like rateless coding for the Y-network","volume":"59","author":"Liau","year":"2011","journal-title":"IEEE Trans. Commun."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3327","DOI":"10.1109\/TCOMM.2013.061913.110585","article-title":"Improved low-complexity soliton-like network coding for a resource-limited relay","volume":"61","author":"Liau","year":"2013","journal-title":"IEEE Trans. Commun."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1049\/iet-com.2013.0488","article-title":"Network-coded rateless coding scheme in erasure multiple-access relay enabled communications","volume":"8","author":"Gu","year":"2014","journal-title":"IET Commun."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1109\/TIT.2007.892814","article-title":"Rateless codes with unequal error protection property","volume":"53","author":"Rahnavard","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"2510","DOI":"10.1109\/TCOMM.2009.09.070616","article-title":"Expanding window fountain codes for unequal error protection","volume":"57","author":"Sejdinovic","year":"2009","journal-title":"IEEE Trans. Commun."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2084","DOI":"10.1109\/TCOMM.2012.051512.110109","article-title":"Distributed unequal error protection rateless codes over erasure channels: A two-source scenario","volume":"60","author":"Talari","year":"2012","journal-title":"IEEE Trans. Commun."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"4630","DOI":"10.1109\/TCOMM.2015.2494011","article-title":"Generalized unequal error protection rateless codes for distributed wireless relay networks","volume":"63","author":"Baik","year":"2015","journal-title":"IEEE Trans. Commun."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1109\/TCOMM.2012.030712.110032","article-title":"On the intermediate symbol recovery rate of rateless codes","volume":"60","author":"Talari","year":"2012","journal-title":"IEEE Trans. Commun."},{"key":"ref_26","unstructured":"Luby, M., Mitzenmacher, M., and Shokrollahi, A. (1998, January 25\u201327). Analysis of random processes via and\/or tree evaluations. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Sanghavi, S. (2007, January 2\u20136). Intermediate performance of rateless codes. Proceedings of the IEEE Infromation Theory Workshop, Bergen, Norway.","DOI":"10.1109\/ITW.2007.4313121"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evolut. Comput."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/1\/38\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:26:31Z","timestamp":1760207191000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/1\/38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,18]]},"references-count":28,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1]]}},"alternative-id":["e19010038"],"URL":"https:\/\/doi.org\/10.3390\/e19010038","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2017,1,18]]}}}