Superiority of Network Coding in Space for Irregular Polygons

摘要：

　　Network coding in space elicits a new research direction lying at the intersection of information theory,networking and geometry.And its meaningful to unearth the potential superiority of network coding in space.In this paper,the constructions of network coding in space and routing in space are implemented for irregular polygons with a concave node,which havent been covered in literatures yet.And quantitative computation of a range for network coding outperforming routing under irregular polygons is given by mathematical calculation and Matlab.Several properties of network coding in space are found by induction and they lays a foundation for the problem of an arbitrary point set in space.Moreover,analysis of the comparison between network coding in space and routing in space are presented,and concluding remarks are given finally.

关键词： network coding in space routing Steiner minimal tree

作者: Xiaoxi Zhang Jiaqing Huang

作者单位: Department of Electronics and Information Engineering,Huazhong University of Science & Technology(HUST),Hubei Key Lab of Smart Internet Tech., Wuhan, 430074, P.R. China

会议类型: 国际会议

会议名称: 2012 IEEE 14th International Conference on Communication Technology(2012年第十四届通信技术国际会议(ICCT 2012))

会议地点: 成都

会议语种:英文

页码: 1450-1455

在线出版日期: 2012-11-09（万方平台首次上网日期，不代表论文的发表时间）