Loading…

Network coding with remix qualification for multicasting in delay-tolerant networks

In delay-tolerant networks where connectivity between nodes is intermittent, replication-based delivery mechanisms are often employed to deliver messages in a store-carry-forward manner instead of end-to-end delivery techniques that are mainly used in traditional computer networks and mobile ad-hoc...

Full description

Saved in:
Bibliographic Details
Main Authors: Yu-Feng Hsu, Chih-Lin Hu
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 1539
container_issue
container_start_page 1534
container_title
container_volume
creator Yu-Feng Hsu
Chih-Lin Hu
description In delay-tolerant networks where connectivity between nodes is intermittent, replication-based delivery mechanisms are often employed to deliver messages in a store-carry-forward manner instead of end-to-end delivery techniques that are mainly used in traditional computer networks and mobile ad-hoc networks. However, multicasting with replication-based methodologies can induce considerable message traffic and longer delivery delay time, thereby being vulnerable upon system performance. This paper exploits the potential of network coding to design an efficient network-coding multicast mechanism in delay-tolerant networks. In this design, intermediate nodes in a network can perform a specific remix qualification approach which can not only alleviate the dependency problem among coded blocks but also generate more innovative coded blocks for restoring the original message by destination nodes. Simulation results show that the proposed mechanism is able to achieve cost-effective performance as compared with the naive network-coding and the replication-based delivery mechanisms for message multicasting in delay-tolerant networks.
doi_str_mv 10.1109/WCNC.2013.6554791
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_6554791</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6554791</ieee_id><sourcerecordid>6554791</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-481881cbcf7eb44e4f78cb87a262fc433a5fd7430a95a45c08cec0b9e8cde6c93</originalsourceid><addsrcrecordid>eNo1kMtOwzAURM1LopR8AGLjH0jx9SO2lyiigFSVBSCWleNcgyFNIHFV-ve0almNRmd0FkPIFbAJALM3b-W8nHAGYlIoJbWFI3IBstBCWaHNMRmBUibnBfATkllt_pnhpzvGVS4UwDnJhuGTMbZ1agZyRJ7nmNZd_0V9V8f2na5j-qA9LuMv_Vm5JoboXYpdS0PX0-WqSds-pN0ytrTGxm3y1DXYuzbRdq8aLslZcM2A2SHH5HV691I-5LOn-8fydpZH0Crl0oAx4CsfNFZSogza-MpoxwsevBTCqVBrKZizyknlmfHoWWXR-BoLb8WYXO-9EREX331cun6zOPwj_gDuTlcF</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Network coding with remix qualification for multicasting in delay-tolerant networks</title><source>IEEE Xplore All Conference Series</source><creator>Yu-Feng Hsu ; Chih-Lin Hu</creator><creatorcontrib>Yu-Feng Hsu ; Chih-Lin Hu</creatorcontrib><description>In delay-tolerant networks where connectivity between nodes is intermittent, replication-based delivery mechanisms are often employed to deliver messages in a store-carry-forward manner instead of end-to-end delivery techniques that are mainly used in traditional computer networks and mobile ad-hoc networks. However, multicasting with replication-based methodologies can induce considerable message traffic and longer delivery delay time, thereby being vulnerable upon system performance. This paper exploits the potential of network coding to design an efficient network-coding multicast mechanism in delay-tolerant networks. In this design, intermediate nodes in a network can perform a specific remix qualification approach which can not only alleviate the dependency problem among coded blocks but also generate more innovative coded blocks for restoring the original message by destination nodes. Simulation results show that the proposed mechanism is able to achieve cost-effective performance as compared with the naive network-coding and the replication-based delivery mechanisms for message multicasting in delay-tolerant networks.</description><identifier>ISSN: 1525-3511</identifier><identifier>ISBN: 9781467359382</identifier><identifier>ISBN: 1467359386</identifier><identifier>EISSN: 1558-2612</identifier><identifier>EISBN: 1467359378</identifier><identifier>EISBN: 1467359394</identifier><identifier>EISBN: 9781467359399</identifier><identifier>EISBN: 9781467359375</identifier><identifier>DOI: 10.1109/WCNC.2013.6554791</identifier><language>eng</language><publisher>IEEE</publisher><subject>Delays ; Encoding ; Mobile computing ; Multicast communication ; Network coding ; Relays ; Routing</subject><ispartof>2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013, p.1534-1539</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6554791$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6554791$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yu-Feng Hsu</creatorcontrib><creatorcontrib>Chih-Lin Hu</creatorcontrib><title>Network coding with remix qualification for multicasting in delay-tolerant networks</title><title>2013 IEEE Wireless Communications and Networking Conference (WCNC)</title><addtitle>WCNC</addtitle><description>In delay-tolerant networks where connectivity between nodes is intermittent, replication-based delivery mechanisms are often employed to deliver messages in a store-carry-forward manner instead of end-to-end delivery techniques that are mainly used in traditional computer networks and mobile ad-hoc networks. However, multicasting with replication-based methodologies can induce considerable message traffic and longer delivery delay time, thereby being vulnerable upon system performance. This paper exploits the potential of network coding to design an efficient network-coding multicast mechanism in delay-tolerant networks. In this design, intermediate nodes in a network can perform a specific remix qualification approach which can not only alleviate the dependency problem among coded blocks but also generate more innovative coded blocks for restoring the original message by destination nodes. Simulation results show that the proposed mechanism is able to achieve cost-effective performance as compared with the naive network-coding and the replication-based delivery mechanisms for message multicasting in delay-tolerant networks.</description><subject>Delays</subject><subject>Encoding</subject><subject>Mobile computing</subject><subject>Multicast communication</subject><subject>Network coding</subject><subject>Relays</subject><subject>Routing</subject><issn>1525-3511</issn><issn>1558-2612</issn><isbn>9781467359382</isbn><isbn>1467359386</isbn><isbn>1467359378</isbn><isbn>1467359394</isbn><isbn>9781467359399</isbn><isbn>9781467359375</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1kMtOwzAURM1LopR8AGLjH0jx9SO2lyiigFSVBSCWleNcgyFNIHFV-ve0almNRmd0FkPIFbAJALM3b-W8nHAGYlIoJbWFI3IBstBCWaHNMRmBUibnBfATkllt_pnhpzvGVS4UwDnJhuGTMbZ1agZyRJ7nmNZd_0V9V8f2na5j-qA9LuMv_Vm5JoboXYpdS0PX0-WqSds-pN0ytrTGxm3y1DXYuzbRdq8aLslZcM2A2SHH5HV691I-5LOn-8fydpZH0Crl0oAx4CsfNFZSogza-MpoxwsevBTCqVBrKZizyknlmfHoWWXR-BoLb8WYXO-9EREX331cun6zOPwj_gDuTlcF</recordid><startdate>201304</startdate><enddate>201304</enddate><creator>Yu-Feng Hsu</creator><creator>Chih-Lin Hu</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201304</creationdate><title>Network coding with remix qualification for multicasting in delay-tolerant networks</title><author>Yu-Feng Hsu ; Chih-Lin Hu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-481881cbcf7eb44e4f78cb87a262fc433a5fd7430a95a45c08cec0b9e8cde6c93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Delays</topic><topic>Encoding</topic><topic>Mobile computing</topic><topic>Multicast communication</topic><topic>Network coding</topic><topic>Relays</topic><topic>Routing</topic><toplevel>online_resources</toplevel><creatorcontrib>Yu-Feng Hsu</creatorcontrib><creatorcontrib>Chih-Lin Hu</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yu-Feng Hsu</au><au>Chih-Lin Hu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Network coding with remix qualification for multicasting in delay-tolerant networks</atitle><btitle>2013 IEEE Wireless Communications and Networking Conference (WCNC)</btitle><stitle>WCNC</stitle><date>2013-04</date><risdate>2013</risdate><spage>1534</spage><epage>1539</epage><pages>1534-1539</pages><issn>1525-3511</issn><eissn>1558-2612</eissn><isbn>9781467359382</isbn><isbn>1467359386</isbn><eisbn>1467359378</eisbn><eisbn>1467359394</eisbn><eisbn>9781467359399</eisbn><eisbn>9781467359375</eisbn><abstract>In delay-tolerant networks where connectivity between nodes is intermittent, replication-based delivery mechanisms are often employed to deliver messages in a store-carry-forward manner instead of end-to-end delivery techniques that are mainly used in traditional computer networks and mobile ad-hoc networks. However, multicasting with replication-based methodologies can induce considerable message traffic and longer delivery delay time, thereby being vulnerable upon system performance. This paper exploits the potential of network coding to design an efficient network-coding multicast mechanism in delay-tolerant networks. In this design, intermediate nodes in a network can perform a specific remix qualification approach which can not only alleviate the dependency problem among coded blocks but also generate more innovative coded blocks for restoring the original message by destination nodes. Simulation results show that the proposed mechanism is able to achieve cost-effective performance as compared with the naive network-coding and the replication-based delivery mechanisms for message multicasting in delay-tolerant networks.</abstract><pub>IEEE</pub><doi>10.1109/WCNC.2013.6554791</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1525-3511
ispartof 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013, p.1534-1539
issn 1525-3511
1558-2612
language eng
recordid cdi_ieee_primary_6554791
source IEEE Xplore All Conference Series
subjects Delays
Encoding
Mobile computing
Multicast communication
Network coding
Relays
Routing
title Network coding with remix qualification for multicasting in delay-tolerant networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T05%3A18%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Network%20coding%20with%20remix%20qualification%20for%20multicasting%20in%20delay-tolerant%20networks&rft.btitle=2013%20IEEE%20Wireless%20Communications%20and%20Networking%20Conference%20(WCNC)&rft.au=Yu-Feng%20Hsu&rft.date=2013-04&rft.spage=1534&rft.epage=1539&rft.pages=1534-1539&rft.issn=1525-3511&rft.eissn=1558-2612&rft.isbn=9781467359382&rft.isbn_list=1467359386&rft_id=info:doi/10.1109/WCNC.2013.6554791&rft.eisbn=1467359378&rft.eisbn_list=1467359394&rft.eisbn_list=9781467359399&rft.eisbn_list=9781467359375&rft_dat=%3Cieee_CHZPO%3E6554791%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-481881cbcf7eb44e4f78cb87a262fc433a5fd7430a95a45c08cec0b9e8cde6c93%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6554791&rfr_iscdi=true