不规则(5 + 1)模型下空间网络编码的成本优势

Ting Wen, Xiaoxi Zhang, Xin Huang, Jiaqing Huang
{"title":"不规则(5 + 1)模型下空间网络编码的成本优势","authors":"Ting Wen, Xiaoxi Zhang, Xin Huang, Jiaqing Huang","doi":"10.1109/DASC.2013.140","DOIUrl":null,"url":null,"abstract":"Network coding in space, a new direction also named space information flow, is verified to have potential advantages over routing in space if the geometric conditions are satisfied. Cost advantage is adopted to measure the performance for network coding in space. Present literatures proved that only in regular (5 + 1) model, network coding in space is strictly superior to routing in terms of single-source multicast, comparing with other regular (n + 1) models. Focusing on irregular (5 + 1) model, this paper uses geometry to quantitatively study the constructions of network coding and optimal routing when a sink node moves without limits in space. Furthermore, the upperbound of cost advantage is figured out as well as the region where network coding is strictly superior to routing. Some properties of network coding in space are also presented.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Cost Advantage of Network Coding in Space for Irregular (5 + 1) Model\",\"authors\":\"Ting Wen, Xiaoxi Zhang, Xin Huang, Jiaqing Huang\",\"doi\":\"10.1109/DASC.2013.140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network coding in space, a new direction also named space information flow, is verified to have potential advantages over routing in space if the geometric conditions are satisfied. Cost advantage is adopted to measure the performance for network coding in space. Present literatures proved that only in regular (5 + 1) model, network coding in space is strictly superior to routing in terms of single-source multicast, comparing with other regular (n + 1) models. Focusing on irregular (5 + 1) model, this paper uses geometry to quantitatively study the constructions of network coding and optimal routing when a sink node moves without limits in space. Furthermore, the upperbound of cost advantage is figured out as well as the region where network coding is strictly superior to routing. Some properties of network coding in space are also presented.\",\"PeriodicalId\":179557,\"journal\":{\"name\":\"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DASC.2013.140\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC.2013.140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

空间网络编码是一种新的方向,也被称为空间信息流,在满足几何条件的情况下,它比空间路由具有潜在的优势。采用成本优势来衡量网络空间编码的性能。现有文献证明,与其他规则(n + 1)模型相比,只有在规则(5 + 1)模型中,网络空间编码在单源组播方面严格优于路由。本文以不规则(5 + 1)模型为研究对象,利用几何方法定量研究了汇聚节点无空间限制移动时网络编码和最优路由的构造。在此基础上,确定了网络编码严格优于路由的区域以及网络编码的成本优势上限。给出了空间网络编码的一些性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cost Advantage of Network Coding in Space for Irregular (5 + 1) Model
Network coding in space, a new direction also named space information flow, is verified to have potential advantages over routing in space if the geometric conditions are satisfied. Cost advantage is adopted to measure the performance for network coding in space. Present literatures proved that only in regular (5 + 1) model, network coding in space is strictly superior to routing in terms of single-source multicast, comparing with other regular (n + 1) models. Focusing on irregular (5 + 1) model, this paper uses geometry to quantitatively study the constructions of network coding and optimal routing when a sink node moves without limits in space. Furthermore, the upperbound of cost advantage is figured out as well as the region where network coding is strictly superior to routing. Some properties of network coding in space are also presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信