Providing Reliable Services over Wireless Networks Using a Low Overhead Random Linear Coding Scheme

In this work, we propose a novel intra-flow network coding solution, which is based on the combination of a low overhead Random Linear Coding (RLC) scheme and UDP, to offer a reliable communication service. In the initial protocol specification, the required overhead could be rather large and this h...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mobile networks and applications Ročník 22; číslo 6; s. 1113 - 1123
Hlavní autori:	Garrido, Pablo, Gómez, David, Lanza, Jorge, Serrat, Joan, Aguero, Ramón
Médium:	Journal Article Publikácia
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.12.2017 Springer Nature B.V
Predmet:	Coding Communications Engineering Computer Communication Networks Comunicació sense fil, Sistemes de Electrical Engineering Engineering Enginyeria de la telecomunicació IEEE 802.11 IT in Business Load balance control Mathematical models Network topologies Networks Packets erasure channels Protocol overhead Random Linear Coding Serveis telemàtics i de comunicació multimèdia TCP (protocol) Telemàtica i xarxes d'ordinadors Wireless communication systems Wireless networks Àrees temàtiques de la UPC IEEE 802.11 Load balance control Random Linear Coding Protocol overhead Wireless networks Packets erasure channels
ISSN:	1383-469X, 1572-8153
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	In this work, we propose a novel intra-flow network coding solution, which is based on the combination of a low overhead Random Linear Coding (RLC) scheme and UDP, to offer a reliable communication service. In the initial protocol specification, the required overhead could be rather large and this had an impact over the observed performance. We therefore include an improvement to reduce such overhead, by decreasing the header length. We describe an analytical model that can be used to assess the performance of the proposed scheme. We also use an implementation within the ns-3 framework to assess the correctness of this model and to broaden the analysis, considering different performance indicators and more complex network topologies. In all cases, the proposed solution clearly outperforms a more traditional approach, in which the TCP protocol is used as a means to offer a reliable communication service.
AbstractList	In this work, we propose a novel intra-flow network coding solution, which is based on the combination of a low overhead Random Linear Coding (RLC) scheme and UDP, to offer a reliable communication service. In the initial protocol specification, the required overhead could be rather large and this had an impact over the observed performance. We therefore include an improvement to reduce such overhead, by decreasing the header length. We describe an analytical model that can be used to assess the performance of the proposed scheme. We also use an implementation within the ns-3 framework to assess the correctness of this model and to broaden the analysis, considering different performance indicators and more complex network topologies. In all cases, the proposed solution clearly outperforms a more traditional approach, in which the TCP protocol is used as a means to offer a reliable communication service. In this work, we propose a novel intra-flow network coding solution, which is based on the combination of a low overhead Random Linear Coding (RLC) scheme and UDP, to offer a reliable communication service. In the initial protocol specification, the required overhead could be rather large and this had an impact over the observed performance. We therefore include an improvement to reduce such overhead, by decreasing the header length. We describe an analytical model that can be used to assess the performance of the proposed scheme. We also use an implementation within the ns-3 framework to assess the correctness of this model and to broaden the analysis, considering different performance indicators and more complex network topologies. In all cases, the proposed solution clearly outperforms a more traditional approach, in which the TCP protocol is used as a means to offer a reliable communication service. In this work, we propose a novel intra-flow network coding solution, which is based on the combination of a low overhead Random Linear Coding (RLC) scheme and UDP, to offer a reliable communication service. In the initial protocol specification, the required overhead could be rather large and this had an impact over the observed performance. We therefore include an improvement to reduce such overhead, by decreasing the header length. We describe an analytical model that can be used to assess the performance of the proposed scheme. We also use an implementation within the ns-3 framework to assess the correctness of this model and to broaden the analysis, considering different performance indicators and more complex network topologies. In all cases, the proposed solution clearly outperforms a more traditional approach, in which the TCP protocol is used as a means to offer a reliable communication service. Peer Reviewed
Author	Lanza, Jorge Gómez, David Serrat, Joan Aguero, Ramón Garrido, Pablo
Author_xml	– sequence: 1 givenname: Pablo surname: Garrido fullname: Garrido, Pablo email: pgarrido@tlmat.unican.es organization: Universidad de Cantabria – sequence: 2 givenname: David surname: Gómez fullname: Gómez, David organization: Universidad de Cantabria – sequence: 3 givenname: Jorge surname: Lanza fullname: Lanza, Jorge organization: Universidad de Cantabria – sequence: 4 givenname: Joan surname: Serrat fullname: Serrat, Joan organization: Universitat Politècnica de Catalunya – sequence: 5 givenname: Ramón surname: Aguero fullname: Aguero, Ramón organization: Universidad de Cantabria
BookMark	eNp1kF1LwzAYhYNMcJv-AO8CXlfz0SzNpQy_oDjZHHoX0vTt1rk1M-k2_Pe2VnA3Eg55A-c5vDkD1KtcBQhdUnJNCZE3gVLCRxGhjSSnkTxBfSokixIqeK-ZecKjeKTez9AghBUhRIgk7iP74t2-zMtqgaewLk22BjwDvy8tBOz24PFb6WENIeBnqA_OfwQ8D63d4NQd8KSxLMHkeGqq3G1wWlZgPB67n8iZXcIGztFpYdYBLn7vIZrf372OH6N08vA0vk0jywWvI26V5FmeG8GEoswSqVRuMksMVSIppCpsLLM4zpihJrYjIFQUQhowvPljxvkQ0S7Xhp3VHix4a2rtTPn3aMWIZJolQvGWueqYrXefOwi1Xrmdr5o1NVWSsPawo2TvQvBQ6K0vN8Z_aUp027_u-tdN_7rtX8uGYR0TGm-1AH-U_C_0DaR4iZI
Cites_doi	10.1145/1282427. 1282400 10.1109/TNET.2003.818197 10.1109/TIT.2002.807285 10.1109/TIT.2006.874390 10.1109/VTCSpring.2014.7022790 10.1109/18.850663 10.1109/PIMRC.2012.6362888 10.1109/VTCFall.2014.6966091 10.1145/2630777.2630781 10.1109/NSysS.2015.7042948 10.1109/TNET.2008.923722 10.1109/49.840210 10.1109/INFCOM.2009.5061931 10.1109/LCOMM.2010.110310.101480 10.1109/VTCSpring.2013.6692495 10.1109/SFCS.2002.1181950 10.1109/ISIT.2003.1228459 10.1109/SCVT.2000.923350 10.1109/icc.2011.5963013 10.1145/381677.381704 10.1109/49.857929 10.1109/ISCC.2014.6912516
ContentType	Journal Article Publication
Contributor	Universitat Politècnica de Catalunya. Departament d'Enginyeria Telemàtica Universitat Politècnica de Catalunya. MAPS - Management, Pricing and Services in Next Generation Networks
Contributor_xml	– sequence: 1 fullname: Universitat Politècnica de Catalunya. Departament d'Enginyeria Telemàtica – sequence: 2 fullname: Universitat Politècnica de Catalunya. MAPS - Management, Pricing and Services in Next Generation Networks
Copyright	Springer Science+Business Media New York 2016 Mobile Networks and Applications is a copyright of Springer, (2016). All Rights Reserved. info:eu-repo/semantics/openAccess
Copyright_xml	– notice: Springer Science+Business Media New York 2016 – notice: Mobile Networks and Applications is a copyright of Springer, (2016). All Rights Reserved. – notice: info:eu-repo/semantics/openAccess
DBID	AAYXX CITATION 3V. 7SC 7SP 7WY 7WZ 7XB 87Z 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L7M L~C L~D M0C M0N P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI Q9U XX2
DOI	10.1007/s11036-016-0731-7
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Electronics & Communications Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) ProQuest Central (Alumni) ProQuest Central UK/Ireland Health Research Premium Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business (OCUL) ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic Recercat
DatabaseTitle	CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition Electronics & Communications Abstracts ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Business (Alumni) ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) Business Premium Collection (Alumni)
DatabaseTitleList	ABI/INFORM Global (Corporate)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1572-8153
EndPage	1123
ExternalDocumentID	oai_recercat_cat_2072_285933 10_1007_s11036_016_0731_7
GroupedDBID	-59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 1SB 2.D 203 28- 29M 29~ 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 7WY 85S 8AO 8FE 8FG 8FL 8FW 8TC 8UJ 8US 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFO ACGFS ACHSB ACHXU ACKNC ACM ACMDZ ACMLO ACOKC ACOMO ACPIV ACREN ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADL ADMLS ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFEXP AFFNX AFGCZ AFKRA AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARAPS ARCEE ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. BA0 BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EBLON EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GXS H13 HCIFZ HF~ HG5 HG6 HGAVV HMJXF HQYDN HRMNR HVGLF HZ~ I-F I07 I09 IHE IJ- IKXTQ ITG ITH ITM IWAJR IXC IXE IZIGR IZQ I~X I~Y I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW LAK LLZTM M0C M0N M4Y MA- N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9O PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 Q2X QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCO SCV SDH SDM SHX SISQX SJN SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 W7O WK8 YLTOR Z45 Z7R Z7X Z7Z Z81 Z83 Z88 Z8M Z8R Z8T Z8W Z92 ZMTXR _50 ~A9 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AETEA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7SP 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D PKEHL PQEST PQUKI Q9U XX2
ID	FETCH-LOGICAL-c353t-3c973bdda525912c0799dabc0a1958f79fc47b44b2a1a4c6e015f57aea3153b33
IEDL.DBID	RSV
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000416547700012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1383-469X
IngestDate	Fri Nov 07 13:48:30 EST 2025 Tue Nov 04 23:02:12 EST 2025 Sat Nov 29 02:30:53 EST 2025 Fri Feb 21 02:33:52 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	6
Keywords	IEEE 802.11 Load balance control Random Linear Coding Protocol overhead Wireless networks Packets erasure channels
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c353t-3c973bdda525912c0799dabc0a1958f79fc47b44b2a1a4c6e015f57aea3153b33
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
OpenAccessLink	https://recercat.cat/handle/2072/285933
PQID	1970202022
PQPubID	26070
PageCount	11
ParticipantIDs	csuc_recercat_oai_recercat_cat_2072_285933 proquest_journals_1970202022 crossref_primary_10_1007_s11036_016_0731_7 springer_journals_10_1007_s11036_016_0731_7
PublicationCentury	2000
PublicationDate	2017-12-01
PublicationDateYYYYMMDD	2017-12-01
PublicationDate_xml	– month: 12 year: 2017 text: 2017-12-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationSubtitle	The Journal of SPECIAL ISSUES on Mobility of Systems, Users, Data and Computing
PublicationTitle	Mobile networks and applications
PublicationTitleAbbrev	Mobile Netw Appl
PublicationYear	2017
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	Jain R, Chiu DM, Hawe W (1984) A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. Technical Report TR-301. DEC Research Repor ChachulskiSJenningsMKattiSKatabiDTrading structure for randomness in wireless opportunistic routingSIGCOMM Comput Commun Rev200737416918010.1145/1282427.1282400 Sundararajan J, Shah D, Medard M, Mitzenmacher M, Barros J (2009) Network coding meets TCP. In: INFOCOM 2009. IEEE, pp 280–288. doi:10.1109/INFCOM.2009.5061931 Gomez D, Rodriguez E, Aguero R, Munoz L (2014) Reliable communications over lossy wireless channels by means of the combination of UDP and random linear coding. In: 2014 IEEE symposium on computers and communication (ISCC), pp 1–6. doi:10.1109/ISCC.2014.6912516 Luby M (2002) LT codes. In: The 43rd annual IEEE symposium on foundations of computer science, 2002. Proceedings, pp 271–280. doi:10.1109/SFCS.2002.1181950 Mascolo S, Casetti C, Gerla M, Sanadidi MY, Wang R (2001) Tcp westwood: Bandwidth estimation for enhanced transport over wireless links. In: Proceedings of the 7th annual international conference on mobile computing and networking, MobiCom ‘01. ACM, New York, pp 287–297. doi:10.1145/381677.381704 Krigslund J, Hansen J, Hundeboll M, Lucani D, Fitzek F (2013) CORE: COPE with MORE in wireless meshed networks. In: 2013 IEEE 77th vehicular technology conference (VTC Spring), pp 1–6. doi:10.1109/VTCSpring.2013.6692495 Heide J, Pedersen M, Fitzek F, Medard M (2014) A perpetual code for network coding. In: 2014 IEEE 79th vehicular technology conference (VTC Spring), pp 1–6. doi:10.1109/VTCSpring.2014.7022790 KattiSRahulHHuWKatabiDMédardMCrowcroftJXORs in the air: practical wireless network codingIEEE/ACM Trans Netw200816349751010.1109/TNET.2008.923722 Khurshid A, Kabir M, Das R (2015) Modified TCP newreno for wireless networks. In: 2015 international conference on networking systems and security (NSysS), pp 1–6. doi:10.1109/NSysS.2015.7042948 AhlswedeRCaiNLiSYYeungRNetwork information flowIEEE Trans Inf Theory200046412041216176854210.1109/18.8506630991.90015 KoetterRMédardMAn algebraic approach to network codingIEEE/ACM Trans Netw200311578279510.1109/TNET.2003.818197 Gomez D, Rodríguez E, Agüero R, Muñoz L (2014) Reliable communications over wireless mesh networks with inter and intra-flow network coding. In: Proceedings of the 2014 workshop on Ns-3, WNS3 ’14. ACM, New York, pp 4:1–4:8. doi:10.1145/2630777.2630781 BianchiGPerformance analysis of the IEEE 802.11 distributed coordination functionIEEE J Sel Areas Commun200018353554710.1109/49.840210 The ns-3 network simulator. http://www.nsnam.org LiSYYeungRCaiNLinear network codingIEEE Trans Inf Theory2003492371381196678510.1109/TIT.2002.8072851063.94004 Henderson T., Floyd S, GA, Nishida Y (2004) The NewReno modification to TCP’s fast recovery algorithm. Internet RFCs. ISSN 2070-1721 RFC 6582. http://www.rfc-editor.org/info/rfc6582 Lefevre F, Vivier G (2000) Understanding TCP’s behavior over wireless links. In: Symposium on communications and vehicular technology, 2000. SCVT-200, pp 123–130. doi:10.1109/SCVT.2000.923350 Sorensen C, Lucani D, Fitzek F, Medard M (2014) On-the-fly overlapping of sparse generations: a tunable sparse network coding perspective. In: 2014 IEEE 80th vehicular technology conference (VTC Fall), pp 1–5. doi:10.1109/VTCFall.2014.6966091 Stewart R, Xie Q, Mornmeault K, Sharp H, Taylor T, Rytina I, Kalla M, Zhang L (2000) Stream control transport protocol. Tech. rep., RFC 2960 Ho T, Koetter R, Medard M, Karger D, Effros M (2003) The benefits of coding over routing in a randomized setting. IEEE international symposium on information theory. Proceedings, p 7803. doi:10.1109/ISIT.2003.1228459 Gomez D, Hassayoun S, Herren A, Aguero R, Ros D (2012) Impact of network coding on TCP performance in wireless mesh networks. In: 2012 IEEE 23rd international symposium on personal indoor and mobile radio communications (PIMRC), pp 777–782. doi:10.1109/PIMRC.2012.6362888 Feizi S, Lucani D E, Médard M (2012) Tunable sparse network coding. In: Proceedings of the international Zurich seminar on Comm, pp 107–110 Lucani DE, Pedersen MV, Heide J, Fitzek FHP (2014) Fulcrum network codes: a code for fluid allocation of complexity. CoRR abs/1404.6620. arXiv:1404.6620 ShokrollahiARaptor codesIEEE Trans Inf Theory200652625512567223846410.1109/TIT.2006.8743901298.94147 ZorziMChockalingamARaoRThroughput analysis of TCP on channels with memoryIEEE J Sel Areas Commun20001871289130010.1109/49.857929 Albrecht M (2015) The M4RIE Library—version 20121224. The M4RIE Team. https://bitbucket.org/malb/m4rie Trullols-CrucesOBarcelo-OrdinasJFioreMExact decoding probability under random linear network codingIEEE Commun Lett2011151676910.1109/LCOMM.2010.110310.101480 Heide J, Pedersen M, Fitzek F, Medard M (2011) On code parameters and coding vector representation for practical RLNC. In: 2011 IEEE international conference on communications (ICC), pp 1–5. doi:10.1109/icc.2011.5963013 SY Li (731_CR20) 2003; 49 R Ahlswede (731_CR2) 2000; 46 731_CR16 731_CR14 731_CR12 731_CR13 731_CR10 731_CR11 G Bianchi (731_CR4) 2000; 18 O Trullols-Cruces (731_CR28) 2011; 15 731_CR9 731_CR6 731_CR7 731_CR8 731_CR1 R Koetter (731_CR17) 2003; 11 731_CR3 M Zorzi (731_CR29) 2000; 18 731_CR27 731_CR25 731_CR26 731_CR23 731_CR21 731_CR22 A Shokrollahi (731_CR24) 2006; 52 731_CR18 731_CR19 S Chachulski (731_CR5) 2007; 37 S Katti (731_CR15) 2008; 16
References_xml	– reference: Sundararajan J, Shah D, Medard M, Mitzenmacher M, Barros J (2009) Network coding meets TCP. In: INFOCOM 2009. IEEE, pp 280–288. doi:10.1109/INFCOM.2009.5061931 – reference: Henderson T., Floyd S, GA, Nishida Y (2004) The NewReno modification to TCP’s fast recovery algorithm. Internet RFCs. ISSN 2070-1721 RFC 6582. http://www.rfc-editor.org/info/rfc6582 – reference: Albrecht M (2015) The M4RIE Library—version 20121224. The M4RIE Team. https://bitbucket.org/malb/m4rie – reference: Gomez D, Rodríguez E, Agüero R, Muñoz L (2014) Reliable communications over wireless mesh networks with inter and intra-flow network coding. In: Proceedings of the 2014 workshop on Ns-3, WNS3 ’14. ACM, New York, pp 4:1–4:8. doi:10.1145/2630777.2630781 – reference: Stewart R, Xie Q, Mornmeault K, Sharp H, Taylor T, Rytina I, Kalla M, Zhang L (2000) Stream control transport protocol. Tech. rep., RFC 2960 – reference: Khurshid A, Kabir M, Das R (2015) Modified TCP newreno for wireless networks. In: 2015 international conference on networking systems and security (NSysS), pp 1–6. doi:10.1109/NSysS.2015.7042948 – reference: Sorensen C, Lucani D, Fitzek F, Medard M (2014) On-the-fly overlapping of sparse generations: a tunable sparse network coding perspective. In: 2014 IEEE 80th vehicular technology conference (VTC Fall), pp 1–5. doi:10.1109/VTCFall.2014.6966091 – reference: AhlswedeRCaiNLiSYYeungRNetwork information flowIEEE Trans Inf Theory200046412041216176854210.1109/18.8506630991.90015 – reference: Lucani DE, Pedersen MV, Heide J, Fitzek FHP (2014) Fulcrum network codes: a code for fluid allocation of complexity. CoRR abs/1404.6620. arXiv:1404.6620 – reference: Heide J, Pedersen M, Fitzek F, Medard M (2014) A perpetual code for network coding. In: 2014 IEEE 79th vehicular technology conference (VTC Spring), pp 1–6. doi:10.1109/VTCSpring.2014.7022790 – reference: Luby M (2002) LT codes. In: The 43rd annual IEEE symposium on foundations of computer science, 2002. Proceedings, pp 271–280. doi:10.1109/SFCS.2002.1181950 – reference: Krigslund J, Hansen J, Hundeboll M, Lucani D, Fitzek F (2013) CORE: COPE with MORE in wireless meshed networks. In: 2013 IEEE 77th vehicular technology conference (VTC Spring), pp 1–6. doi:10.1109/VTCSpring.2013.6692495 – reference: ShokrollahiARaptor codesIEEE Trans Inf Theory200652625512567223846410.1109/TIT.2006.8743901298.94147 – reference: LiSYYeungRCaiNLinear network codingIEEE Trans Inf Theory2003492371381196678510.1109/TIT.2002.8072851063.94004 – reference: Heide J, Pedersen M, Fitzek F, Medard M (2011) On code parameters and coding vector representation for practical RLNC. In: 2011 IEEE international conference on communications (ICC), pp 1–5. doi:10.1109/icc.2011.5963013 – reference: Feizi S, Lucani D E, Médard M (2012) Tunable sparse network coding. In: Proceedings of the international Zurich seminar on Comm, pp 107–110 – reference: The ns-3 network simulator. http://www.nsnam.org/ – reference: Mascolo S, Casetti C, Gerla M, Sanadidi MY, Wang R (2001) Tcp westwood: Bandwidth estimation for enhanced transport over wireless links. In: Proceedings of the 7th annual international conference on mobile computing and networking, MobiCom ‘01. ACM, New York, pp 287–297. doi:10.1145/381677.381704 – reference: Trullols-CrucesOBarcelo-OrdinasJFioreMExact decoding probability under random linear network codingIEEE Commun Lett2011151676910.1109/LCOMM.2010.110310.101480 – reference: KoetterRMédardMAn algebraic approach to network codingIEEE/ACM Trans Netw200311578279510.1109/TNET.2003.818197 – reference: BianchiGPerformance analysis of the IEEE 802.11 distributed coordination functionIEEE J Sel Areas Commun200018353554710.1109/49.840210 – reference: ChachulskiSJenningsMKattiSKatabiDTrading structure for randomness in wireless opportunistic routingSIGCOMM Comput Commun Rev200737416918010.1145/1282427.1282400 – reference: KattiSRahulHHuWKatabiDMédardMCrowcroftJXORs in the air: practical wireless network codingIEEE/ACM Trans Netw200816349751010.1109/TNET.2008.923722 – reference: Gomez D, Rodriguez E, Aguero R, Munoz L (2014) Reliable communications over lossy wireless channels by means of the combination of UDP and random linear coding. In: 2014 IEEE symposium on computers and communication (ISCC), pp 1–6. doi:10.1109/ISCC.2014.6912516 – reference: Lefevre F, Vivier G (2000) Understanding TCP’s behavior over wireless links. In: Symposium on communications and vehicular technology, 2000. SCVT-200, pp 123–130. doi:10.1109/SCVT.2000.923350 – reference: ZorziMChockalingamARaoRThroughput analysis of TCP on channels with memoryIEEE J Sel Areas Commun20001871289130010.1109/49.857929 – reference: Gomez D, Hassayoun S, Herren A, Aguero R, Ros D (2012) Impact of network coding on TCP performance in wireless mesh networks. In: 2012 IEEE 23rd international symposium on personal indoor and mobile radio communications (PIMRC), pp 777–782. doi:10.1109/PIMRC.2012.6362888 – reference: Ho T, Koetter R, Medard M, Karger D, Effros M (2003) The benefits of coding over routing in a randomized setting. IEEE international symposium on information theory. Proceedings, p 7803. doi:10.1109/ISIT.2003.1228459 – reference: Jain R, Chiu DM, Hawe W (1984) A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. Technical Report TR-301. DEC Research Repor – ident: 731_CR14 – volume: 37 start-page: 169 issue: 4 year: 2007 ident: 731_CR5 publication-title: SIGCOMM Comput Commun Rev doi: 10.1145/1282427. 1282400 – volume: 11 start-page: 782 issue: 5 year: 2003 ident: 731_CR17 publication-title: IEEE/ACM Trans Netw doi: 10.1109/TNET.2003.818197 – volume: 49 start-page: 371 issue: 2 year: 2003 ident: 731_CR20 publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2002.807285 – volume: 52 start-page: 2551 issue: 6 year: 2006 ident: 731_CR24 publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2006.874390 – ident: 731_CR11 doi: 10.1109/VTCSpring.2014.7022790 – volume: 46 start-page: 1204 issue: 4 year: 2000 ident: 731_CR2 publication-title: IEEE Trans Inf Theory doi: 10.1109/18.850663 – ident: 731_CR22 – ident: 731_CR7 doi: 10.1109/PIMRC.2012.6362888 – ident: 731_CR26 – ident: 731_CR25 doi: 10.1109/VTCFall.2014.6966091 – ident: 731_CR6 – ident: 731_CR8 doi: 10.1145/2630777.2630781 – ident: 731_CR16 doi: 10.1109/NSysS.2015.7042948 – volume: 16 start-page: 497 issue: 3 year: 2008 ident: 731_CR15 publication-title: IEEE/ACM Trans Netw doi: 10.1109/TNET.2008.923722 – volume: 18 start-page: 535 issue: 3 year: 2000 ident: 731_CR4 publication-title: IEEE J Sel Areas Commun doi: 10.1109/49.840210 – ident: 731_CR12 – ident: 731_CR27 doi: 10.1109/INFCOM.2009.5061931 – volume: 15 start-page: 67 issue: 1 year: 2011 ident: 731_CR28 publication-title: IEEE Commun Lett doi: 10.1109/LCOMM.2010.110310.101480 – ident: 731_CR18 doi: 10.1109/VTCSpring.2013.6692495 – ident: 731_CR21 doi: 10.1109/SFCS.2002.1181950 – ident: 731_CR13 doi: 10.1109/ISIT.2003.1228459 – ident: 731_CR19 doi: 10.1109/SCVT.2000.923350 – ident: 731_CR10 doi: 10.1109/icc.2011.5963013 – ident: 731_CR23 doi: 10.1145/381677.381704 – ident: 731_CR3 – volume: 18 start-page: 1289 issue: 7 year: 2000 ident: 731_CR29 publication-title: IEEE J Sel Areas Commun doi: 10.1109/49.857929 – ident: 731_CR1 – ident: 731_CR9 doi: 10.1109/ISCC.2014.6912516
SSID	ssj0005584
Score	2.179453
Snippet	In this work, we propose a novel intra-flow network coding solution, which is based on the combination of a low overhead Random Linear Coding (RLC) scheme and... In this work, we propose a novel intra-flow network coding solution, which is based on the combination of a low overhead Random Linear Coding (RLC) scheme and...
SourceID	csuc proquest crossref springer
SourceType	Open Access Repository Aggregation Database Index Database Publisher
StartPage	1113
SubjectTerms	Coding Communications Engineering Computer Communication Networks Comunicació sense fil, Sistemes de Electrical Engineering Engineering Enginyeria de la telecomunicació IEEE 802.11 IT in Business Load balance control Mathematical models Network topologies Networks Packets erasure channels Protocol overhead Random Linear Coding Serveis telemàtics i de comunicació multimèdia TCP (protocol) Telemàtica i xarxes d'ordinadors Wireless communication systems Wireless networks Àrees temàtiques de la UPC
SummonAdditionalLinks	– databaseName: ABI/INFORM Global dbid: M0C link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFA46PejB3-J0Sg6elGDbtKY9iQyHB53DH7BbSNIUBLfOddN_3_fS1m2CXqQUWhrawnt5-V7y5XuEnHKlARRrwUTKBQtFpJkGZ2aejiwAZIO90BWbEN1u3O8nvWrCraholXVMdIE6zQ3OkV_4iQBkA0dwNXpnWDUKV1erEhrLZAWRDVL67r32jOIRxWVR25gzSAP79aqm2zrnoxQvAB4GTu4zsTAuNUwxNQuY88cyqRt9Opv__e8tslHhTnpdOso2WbLDHbI-p0a4S0zP7cqDa4pEZdxTRetQQpHpSZEq-wahkXZL8nhBHeOAKnqXf9IHaAKhPaWPapjmAwppLnQj2s7dK5_AOwZ2j7x0bp7bt6yqwcAMj_iEcZMIrtNURZAn-YHxRJKkShtPoUpNJpLMhEKHoQ6Ur0JzaQFeZJFQVnGIpZrzfdIY5kN7QCjkq9AmQ8F4E9pAxClgG621zQBjCBU1yVltATkqpTbkTFQZzSWRjobmkgIbg40kDAt2bNREokz29w2egScCifJ8nDdJq7aNrLpoIWeGaZLz2rpzj3_78uHfLzsiawGO_I7x0iKNyXhqj8mq-Zi8FuMT559f71_qBA priority: 102 providerName: ProQuest
Title	Providing Reliable Services over Wireless Networks Using a Low Overhead Random Linear Coding Scheme
URI	https://link.springer.com/article/10.1007/s11036-016-0731-7 https://www.proquest.com/docview/1970202022 https://recercat.cat/handle/2072/285933
Volume	22
WOSCitedRecordID	wos000416547700012&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: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1572-8153 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0005584 issn: 1383-469X databaseCode: 7WY dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1572-8153 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0005584 issn: 1383-469X databaseCode: M0C dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1572-8153 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0005584 issn: 1383-469X databaseCode: P5Z dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1572-8153 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0005584 issn: 1383-469X databaseCode: K7- dateStart: 19990101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1572-8153 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0005584 issn: 1383-469X databaseCode: BENPR dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1572-8153 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005584 issn: 1383-469X databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Rb9MwED5tHQ_sgW3ARGGr_LCnIUtJnHDJI1StkNi6qt2g8GLZjiNN2tqpSeHvc5c2a4vggSmKFSsnJ7LPd5_lz3cAZ8pYAsUWJeYKZYyJlZaUWQY28QSQHc_COtkEDgbpZJINV-e4y4bt3mxJ1pZ6fdgt5OC5BFEkqWUocRf2yNulnK9hNP665nUk6TKTbaokrf0mzVbm35rYckYtVy7cFtD8Y2-0djn9gyf97CG8WCFM8XGpEkew46cvYX8j7uArcMP6_B09C6Yk8-kp0RgNwZxOwaTYOzKCYrCkiZei5hYIIy5mv8QViZARz8XITPPZvaAFLU0Y0Z3VTY5JD-79a7jp9667n-Uq24J0KlGVVC5DZfPcJLQiCiMXYJblxrrAcDyaArPCxWjj2EYmNLH74AlIFAkabxRZTavUMbSms6l_A4JWpiRTcGh4F_sI05xQjLXWF4Qm0CRtOG-6XT8sg2rodfhk7jnNxDPuOY0sTAOjyQH4uTOV5oDYjxW-owAjzYH4lGrDSTN8ejUZSx1mSKCYrqgN75vh2nj9ry-__S_pd_A8YpdfU11OoFXNF_4Unrmf1W0578Aufvvegb1PvcFwRLUvKKm8DLpUDpMfnVqHfwOzEuUB
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3fa9RAEB7KWdA-aP2FZ2vdB31RFi-7iZM8iEi1tNz1LFrh3tbdzQYEe2kvV4v_VP9GZzaXXivUtz5ICCRkSUjyzcy3u9_OALzQ1hEpdiix1ChTzJx0BGY5cFkgguzZCmOxCRyP88mkOFiB824tDMsqO58YHXVZex4jf5MUSMyGNvX--ERy1SieXe1KaLSwGIbfZ9Rla97tfaT_-1KpnU-H27tyUVVAep3pudS-QO3K0mbE_BPlB1gUpXV-YDnvSoVF5VN0aeqUTWzq3wYKmFWGNlhN3sHxACi5_FupzpHtaohyKSnJ8raIbq4ldTsn3SxqXKqXcOpfIliSjCqReCUO9nxz6q9w3L-mZWO027n3v32ndbi74NXiQ2sI92ElTB_A2qVsiw_BH8RVh3QsWIjNa8ZE5yoFK1kFS4F_kusX41Yc34ioqBBWjOoz8ZmaUOgqxRc7LesjQd14ek-xXcdbfiX0H4VH8O1G3vIx9Kb1NDwBQf1xalNxQnyfBoV5SdzNORcq4lBosz686v64OW5TiZhl0miGh2G5HcPDIDcmTBgKe2Hm7dxwGvCLE97VAJXh9INa92Gzw4JZuKDGLIHQh9cdmi5dvu7JT_99s-dwe_dwf2RGe-PhBtxRzHKiumcTevPZaXgGq_7X_Ecz24q2IeD7TYPsD0MRRvo
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3faxNBEB5KlGIf_FXFaLX7oC8tS3O7d07uQURaQ0tLDK2F4Mu6u7cHgsm1udTiv-Zf58xezrSCfeuDhECOW-643Dcz3-x-OwPwWltHpNihxEKjTDFz0hGYZc9lgQiyZyuMzSZwOOyPx_loBX61e2FYVtn6xOioi8rzHPlOkiMxG_qonXIhixjtDd6fnUvuIMUrrW07jQYih-HnJaVv9buDPXrXb5QafPy8uy8XHQak15meS-1z1K4obEZZQKJ8D_O8sM73LNdgKTEvfYouTZ2yiU3920DBs8zQBqvJUzieDCX3fwcpx2Q54Sj7spSXZP2moW5fSzo9bldU47a9hMsAE9mSZGCJxGsxsePrC3-N7_61RBsj3-DB__yfPYT7C74tPjQG8ghWwvQxrF2pwrgOfhR3I9JvwQJt3ksmWhcqWOEqWCL8nUKCGDai-VpEpYWw4qi6FJ9oCIW0QhzbaVFNBKX39Jxit4qXPCGrmIQncHorT_kUOtNqGp6BoDydxpRcKN-nQWG_IE7nnAslcSu0WRe22rdvzpoSI2ZZTJqhYliGx1AxyIMJH4bCYZh5OzdcHvzPAX9VD5XhsoRad2GjxYVZuKbaLEHRhe0WWVdO_-vOz2--2CasErbM0cHw8AXcU0x-ouhnAzrz2UV4CXf9j_m3evYqmomAr7eNsd8tBlAe
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=Providing+Reliable+Services+over+Wireless+Networks+Using+a+Low+Overhead+Random+Linear+Coding+Scheme&rft.jtitle=Mobile+networks+and+applications&rft.au=Garrido%2C+Pablo&rft.au=G%C3%B3mez%2C+David&rft.au=Lanza%2C+Jorge&rft.au=Serrat%2C+Joan&rft.date=2017-12-01&rft.pub=Springer+US&rft.issn=1383-469X&rft.eissn=1572-8153&rft.volume=22&rft.issue=6&rft.spage=1113&rft.epage=1123&rft_id=info:doi/10.1007%2Fs11036-016-0731-7&rft.externalDocID=10_1007_s11036_016_0731_7
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1383-469X&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1383-469X&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1383-469X&client=summon