Multiple Trees with Network Coding for Efficient and Reliable Multicast in MANETs

Yu-Hsun Chen, Gen-Huey Chen, E. Wu
{"title":"Multiple Trees with Network Coding for Efficient and Reliable Multicast in MANETs","authors":"Yu-Hsun Chen, Gen-Huey Chen, E. Wu","doi":"10.1109/ICPPW.2010.85","DOIUrl":null,"url":null,"abstract":"The innovative exploitation of network coding technology could bring great design advantages to MANETs. First, wireless links are inherently lossy due to channel fading or interference. Second, the delivery condition of the route from the source to each receiver in a multicast transmission might be significantly distinct. Trying to satisfy the reliability requirement for the poorly-connected receivers may affect the performance of the rest of the receivers. In this paper, we present a tree-based multicast protocol, which exploits the characteristics of network coding to provide efficient and reliable multicast. A metric, named Receiving Probability (RP), is proposed to represent the probability for a node in a multicast tree to successfully receive a packet sent by the multicast source. To mitigate the distinctions among the receivers, the proposed multicast protocol aims to construct multiple trees such that the RP of each receiver satisfies a predefined threshold. Besides, since seldom redundant packets are generated with random network coding, by applying random network coding to these constructed multiple trees, differently coded packets can be transmitted on multiple trees, and the throughput of the reliable multicast can be improved. Simulation results show that the average throughput can be enhanced 30% and the throughput of the poorly-connected receivers can be enhanced 100% with our protocol, compared to a recent work.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 39th International Conference on Parallel Processing Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPPW.2010.85","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The innovative exploitation of network coding technology could bring great design advantages to MANETs. First, wireless links are inherently lossy due to channel fading or interference. Second, the delivery condition of the route from the source to each receiver in a multicast transmission might be significantly distinct. Trying to satisfy the reliability requirement for the poorly-connected receivers may affect the performance of the rest of the receivers. In this paper, we present a tree-based multicast protocol, which exploits the characteristics of network coding to provide efficient and reliable multicast. A metric, named Receiving Probability (RP), is proposed to represent the probability for a node in a multicast tree to successfully receive a packet sent by the multicast source. To mitigate the distinctions among the receivers, the proposed multicast protocol aims to construct multiple trees such that the RP of each receiver satisfies a predefined threshold. Besides, since seldom redundant packets are generated with random network coding, by applying random network coding to these constructed multiple trees, differently coded packets can be transmitted on multiple trees, and the throughput of the reliable multicast can be improved. Simulation results show that the average throughput can be enhanced 30% and the throughput of the poorly-connected receivers can be enhanced 100% with our protocol, compared to a recent work.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于多树网络编码的多播多播网络
网络编码技术的创新开发可以为manet带来巨大的设计优势。首先,由于信道衰落或干扰,无线链路本身就有损耗。其次,在组播传输中,从源到每个接收方的路由传递条件可能显著不同。试图满足连接不良的接收机的可靠性要求可能会影响其他接收机的性能。本文提出了一种基于树的组播协议,利用网络编码的特性提供高效可靠的组播。提出了一种度量,称为接收概率(RP),用来表示组播树节点成功接收组播源发送的数据包的概率。为了消除接收方之间的差异,提出的组播协议旨在构建多个树,使每个接收方的RP满足预定义的阈值。另外,由于随机网络编码很少产生冗余数据包,因此对这些构建的多树进行随机网络编码,可以在多棵树上传输不同编码的数据包,从而提高可靠组播的吞吐量。仿真结果表明,与现有协议相比,该协议的平均吞吐量可提高30%,连接不良的接收端吞吐量可提高100%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
GEM: Graphical Explorer of MPI Programs Predictive Space- and Time-Resource Allocation for Parallel Job Scheduling in Clusters, Grids, Clouds WS4D: Toolkits for Networked Embedded Systems Based on the Devices Profile for Web Services A Multi-hop Walkie-Talkie-Like Emergency Communication System for Catastrophic Natural Disasters Message Driven Programming with S-Net: Methodology and Performance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1