二维欧氏空间中网络编码的研究  

Network coding in two-dimension Euclidean space

作　　者：黄佳庆[1] 杨春风[1] 金振坤[1,2] LI Zong.peng 

机构地区：[1]华中科技大学电子与信息工程系智能互联网技术湖北省重点实验室,湖北武汉430074 [2]武汉邮电科学研究院烽火科技学院,湖北武汉430074 [3]Department of Computer Science, University of Calgary, Canada

出　　处：《重庆邮电大学学报（自然科学版）》2012年第5期521-529,共9页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家自然科学基金(61271227,60872005);中央高校基本科研业务费专项资金(HUST:2011TS112)~~

摘　　要：针对网络编码的新方向—空间中的网络编码研究,首先提出二维欧氏空间中的五角星网络说明在空间中网络编码与路由存在本质差别和研究的必要性,然后通过理论推导得到二维欧氏空间中正(n+1)点单源多播情况下网络编码与路由性能比较及其代价优势极值,揭示空间中网络编码与路由不同的性质,并通过采用精确算法的软件验证理论推导的正确性,最后讨论空间中网络编码亟需解决的开放问题。With regard to a new research direction of network coding—network coding in space,a pentagram network in two-dimension Euclidean space was presented to illustrate the essential difference between network coding in space and routing in space as well as the corresponding research necessity.Then the performance between network coding and routing in two-dimension Euclidean space was compared for regular（n＋1）nodes in terms of single source multicast and its upper bound of maximal cost advantage was computed.From that,distinct properties of network coding in space different from routing in space were revealed.Furthermore,the software with the exact algorithm applied was adopted to validate the correctness of theoretical derivation.Finally,open issues of space network coding were addressed.

关 键 词：空间网络编码 欧氏空间 多播 Steiner最小树 代价优势 

分 类 号：TN911[电子电信—通信与信息系统]