网络编码在无线通信中的应用研究
|
摘要
1956年,Feinstein和Shannon指出：“通信网络端对端的最大信息流是由网络的最小割决定的”,但是传统路由器的存储转发模式根本不可能达到香农最大流最小割定理的上界。直到本世纪初,香港中文大学的R. Ahlswede等人在IEEE Transactions on Information Theory上发表了一篇题为Network information flow的文章中,基于网络信息流的概念提出了网络编码的思想。他们指出网络节点对不同的信息流进行编码组合,可以获得网络组播速率的最大流限,而通过传统的存储和转发不能获得该最大流限。
为了研究网络编码在无线通信系统中的性能,.从网络编码的构造方法入手,分析了线性网络编码、随机网络编码和代数型网络编码的具体实现,尤其对随机线性网络编码做了深入研究,并通过实际例子进行详细论述。在以上理论工作的基础上,接下来研究了网络编码应用在几种无线通信环境下的性能增益,构造通信系统模型,提出不同的算法,设置不同的参数环境,论证网络编码的应用性能,得到理论结果,并仿真验证。主要结论及创新点如下：
研究网络编码在中继网络及协作通信网络中的性能,设计了三种Turbo式网络编码系统结构,并分别与不使用网络编码的相应系统性能作比较,突出了网络编码带来的误码性能增益。
在此基础上,提出信道编码与网络编码联合设计的模式应用在协作分集通信中的观点,网络编码可以与LDPC码、卷积码以及空时码等联合编码,带来误码性能及吞吐量等方面的进一步改善,并给出了仿真验证。
重点论述了网络编码在分布式存储中的性能,针对分布式存储中的一个重要参数-信源节点的度,从理论的角度推导出信源节点的度与恢复数据所需查询的存储节点数量之间的折衷关系,并给出了相应的定理和公式。这一理论公式也直接体现了网络编码代价及其带来的增益之间的折衷关系,具有现实指导意义。
最常用在分布式存储中的码型是纠删码(erasure code),如RS码、数字喷泉码(LT码,Raptor码)。针对这些码型的局限性以及网络编码的优势,研究了网络编码在分布式存储系统中的应用。以传感器网络模型为例,对分布式网络中实施网络编码所带来的系统能耗、吞吐量等方面的增益做了深入研究,设置不同的网络环境,分析了几种仿真参数下的性能,论证了网络编码在分布式存储中富有潜力的应用前景。
为了分析随机线性网络编码在无线Mesh网络中进行文件共享时的性能增益,分三种情况仿真：上传数据受限且MAC层理想无冲突情况下,阐明了随机线性网络编码对文件共享成功率的增益；MAC层存在冲突情况下论证了随机线性网络编码对文件共享下载时间的增益；节点移动且MAC层存在冲突情况下,分析了随机线性网络编码对文件共享下载时间的增益,都分别与传统路由的情况进行比较,突出网络编码所带来的性能改善。
In 1956, Elias, Feinstein and Shannon draw a conclusion that the communication network end-to-end maximum flow is decided by the network minimum cut.But storing-forwarding (SF) of traditional router cannot achieve the upper bound of information flow in maximum flow minimum cut theorem. Network coding is introduced by R.Ahlswede in the "Network information flow" published by IEEE Transactions on Information Theory in 2000, which is based on the conception of network in formation flow. The max-flow bound of network multicast can be achieved if the nodes encode ifferent information flow, which can not always be achieved by traditional SF mode.
To research the performance of network coding in wireless communications networks, starting from the basic principles and the structure of network coding, analyses linear network coding, random network coding and algebraic network coding.Especially studies the design of random linear network coding.Basic on above network coding theory, clarifies gain of network coding applying in wireless communication, provides system models, demonstrates several algorithm, sets up different simulation parameters, proves the application performance, concludes the theory results and simulation analysis.The main work and innovation of the dissertation includes the following:
In order to study the performance of network coding in relay and cooperative communication networks,three stuctures of Turbo-network coding are provided, and compares the BER gain of system with network coding and that of without network coding.
On the basis of Turbo-network coding,puts forward the application of joint channel and network coding in cooperative diversity communication. System performance of BER and throughput can be further improved via joint LDPC,convolutional code, or space-time code and network coding, and confirms the results via simulation diagrams.
The performance of network coding in distributed storage is studied. An important parameter-source node degree is emphased, develops the tradeoff relationshio between source node degree and the number of queried nodes brought out as theorem and formula. This theory formula reflects the tradeoff betweem network coding cost and gain, which has practical guiding value.
Erasure code, such as RS code, LT code and Raptor code, is the most commonly used in distributed storage. According to the limitations of erasure code and the advantages of network coding, research the application of network coding in distributed storage. Devoloping a sensor network model as an instance, analyzes network coding gain on energy consumption and system throughput. Furtherly, combines with node degree, sets up several network conditions, demonstrates the performance and confirms the potential future of network coding applying in distributed storage network.
To analyze the gain of down-load time and success rate brought by random linear network coding in wireless mesh nework, set up three simulation conditions:upload-limited but MAC layer be ideal conflict-free, MAC layer be conflict and mobile nodes and MAC be conflict. Simulation results compare the performance between the system with random network coding and the system with traditional route.
为了研究网络编码在无线通信系统中的性能,.从网络编码的构造方法入手,分析了线性网络编码、随机网络编码和代数型网络编码的具体实现,尤其对随机线性网络编码做了深入研究,并通过实际例子进行详细论述。在以上理论工作的基础上,接下来研究了网络编码应用在几种无线通信环境下的性能增益,构造通信系统模型,提出不同的算法,设置不同的参数环境,论证网络编码的应用性能,得到理论结果,并仿真验证。主要结论及创新点如下：
研究网络编码在中继网络及协作通信网络中的性能,设计了三种Turbo式网络编码系统结构,并分别与不使用网络编码的相应系统性能作比较,突出了网络编码带来的误码性能增益。
在此基础上,提出信道编码与网络编码联合设计的模式应用在协作分集通信中的观点,网络编码可以与LDPC码、卷积码以及空时码等联合编码,带来误码性能及吞吐量等方面的进一步改善,并给出了仿真验证。
重点论述了网络编码在分布式存储中的性能,针对分布式存储中的一个重要参数-信源节点的度,从理论的角度推导出信源节点的度与恢复数据所需查询的存储节点数量之间的折衷关系,并给出了相应的定理和公式。这一理论公式也直接体现了网络编码代价及其带来的增益之间的折衷关系,具有现实指导意义。
最常用在分布式存储中的码型是纠删码(erasure code),如RS码、数字喷泉码(LT码,Raptor码)。针对这些码型的局限性以及网络编码的优势,研究了网络编码在分布式存储系统中的应用。以传感器网络模型为例,对分布式网络中实施网络编码所带来的系统能耗、吞吐量等方面的增益做了深入研究,设置不同的网络环境,分析了几种仿真参数下的性能,论证了网络编码在分布式存储中富有潜力的应用前景。
为了分析随机线性网络编码在无线Mesh网络中进行文件共享时的性能增益,分三种情况仿真：上传数据受限且MAC层理想无冲突情况下,阐明了随机线性网络编码对文件共享成功率的增益；MAC层存在冲突情况下论证了随机线性网络编码对文件共享下载时间的增益；节点移动且MAC层存在冲突情况下,分析了随机线性网络编码对文件共享下载时间的增益,都分别与传统路由的情况进行比较,突出网络编码所带来的性能改善。
In 1956, Elias, Feinstein and Shannon draw a conclusion that the communication network end-to-end maximum flow is decided by the network minimum cut.But storing-forwarding (SF) of traditional router cannot achieve the upper bound of information flow in maximum flow minimum cut theorem. Network coding is introduced by R.Ahlswede in the "Network information flow" published by IEEE Transactions on Information Theory in 2000, which is based on the conception of network in formation flow. The max-flow bound of network multicast can be achieved if the nodes encode ifferent information flow, which can not always be achieved by traditional SF mode.
To research the performance of network coding in wireless communications networks, starting from the basic principles and the structure of network coding, analyses linear network coding, random network coding and algebraic network coding.Especially studies the design of random linear network coding.Basic on above network coding theory, clarifies gain of network coding applying in wireless communication, provides system models, demonstrates several algorithm, sets up different simulation parameters, proves the application performance, concludes the theory results and simulation analysis.The main work and innovation of the dissertation includes the following:
In order to study the performance of network coding in relay and cooperative communication networks,three stuctures of Turbo-network coding are provided, and compares the BER gain of system with network coding and that of without network coding.
On the basis of Turbo-network coding,puts forward the application of joint channel and network coding in cooperative diversity communication. System performance of BER and throughput can be further improved via joint LDPC,convolutional code, or space-time code and network coding, and confirms the results via simulation diagrams.
The performance of network coding in distributed storage is studied. An important parameter-source node degree is emphased, develops the tradeoff relationshio between source node degree and the number of queried nodes brought out as theorem and formula. This theory formula reflects the tradeoff betweem network coding cost and gain, which has practical guiding value.
Erasure code, such as RS code, LT code and Raptor code, is the most commonly used in distributed storage. According to the limitations of erasure code and the advantages of network coding, research the application of network coding in distributed storage. Devoloping a sensor network model as an instance, analyzes network coding gain on energy consumption and system throughput. Furtherly, combines with node degree, sets up several network conditions, demonstrates the performance and confirms the potential future of network coding applying in distributed storage network.
To analyze the gain of down-load time and success rate brought by random linear network coding in wireless mesh nework, set up three simulation conditions:upload-limited but MAC layer be ideal conflict-free, MAC layer be conflict and mobile nodes and MAC be conflict. Simulation results compare the performance between the system with random network coding and the system with traditional route.
引文
[1]P.Elias, A.Feinstein, C.Shannon, "A note on the maximum flow through a network", IEEE Trans. Inform. Theory, Vol.2, issue 4, pp.117-119, Dec 1956.
[2]P. Gupta and P. R. Kumar, "The Capacity of Wireless Networks," IEEE Trans. Inform. Theory, vol.46, pp.388-404, Mar.2000.
[3]R. Ahlswede, N.Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow", IEEE Trans. Inform. Theory, vol.46,no.4, pp.1204-1216, July 2000.
[4]Jingyao Zhang, Pingyi Fan, "Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks", IEEE Trans.on Communications, vol.56,no.4,pp: 598-607, April 2008.
[5]Wang, H.,Fan, P. and Letaief, K.B."Maximum flow and network capacity of network coding for ad-hoc networks", IEEE Transactions On Wireless Communication,6(12): 4193～4198,2007.
[6]Ramamoorthy,.A.Shi, J.;Wesel, R,D."On the capacity of network coding for random networks", IEEE Transactions on Information Theory, Vol.51,Issue 8, pp:2878-2885, Aug.2005.
[7]K R. Koetter, M. Medard, "Beyond Routing:An Algebraic Approach to Network Coding," INFOCOM,2002.
[8]Anwar Al Hamra Chadi Barakat Thierry Turletti, "Network Coding for Wireless Mesh Networks:A Case Study;" Proc of IEEE WoWMoM 2006. June 2006.
[9]Wang, J. Y,Yang, G., Lin, X. H.,He, Z. Q.,Lin, J. R. "Random Linear Coding for File Sharing in Upload-Limited Wireless Packet Networks," 2007 IEEE 66th Vehicular Technology Conference,2007.VTC-2007 Fall.2007(3):235-239.
[10]S.Yang and R.W.Yeung, "Characterizations of Network Error Correction/Detection and Erasure Correction", Netcod2007.
[11]R.W.Yeung and N. Cai, "Network error correction, part Ⅰ:Basic concepts and upper bounds,"[J].Communications in Information and Systems,2006,6(1):19-36.
[12]N. Cai and R. W. Yeung, "Network error correction, part Ⅱ:Lower bounds," [J]. Communications in Information and Systems,2006,6(1):37-54.
[13]Shokrollahi, "Raptor codes," IEEE T INFORM THEORY 52 (6):2551-2567 JUN 2006.
[14]MacKay, D.J.C. "Fountain codes," IEE Proceedings on Communications, Volume 152, Issue 6,9 Dec.2005 Page(s):1062-1068.
[15]S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding", IEEE Trans. Inform. Theory, vol.49,no.2,pp.371-381, Feb.2003.
[16]R. Koetter, M. Medard, "An algebraic approach to network coding", IEEE/ACM Trans. Networking, vol.11,no.5, pp.782-795, Oct.2003.
[17]P.Sanders, S.E gner, and L.Tolhuizen, "Polynomial time algorithms for network Information flow",ACM Symposium on Parallel Algorithms and Architectures (SPAR),pp.286-294,2003.
[18]S.Jaggi, P. Sanders, P. A. Chou, M. Effros, S.Egner, K. Jain, and L. M. G. M. Tolhuizen, "Polynomial time algorithms for multicast network code construction", IEEE Trans. Inform. Theory, vol.51,no.6, pp.1973-1982, June 2005.
[19]P.A.Chou,Y.Wu, and K.Jain. "Practical network coding", In P roceedings of 41st Annual Allerton Conference on Communication, Control, and Computing, October 2003.
[20]T.Ho, D.Karger, M.Medard, D.Karger and M.Efros, "The benefits of coding over routing in a Randomized seting", IEEE International Symposium on Information Theory, Yokohama, Japan, June 2003.
[21]T.H o, M.Medard, J.Shi, M.Efros and D.R.K arger,"On Randomized Network Coding",41st Annual Allerton Conference on Communication Control and Computing, Oct.2003,
[22]L. Shan-Shan, Z. Pei-Dong, and L. Xiang-Ke, "Energy efficient multipath routing using network coding in wireless sensor networks", in ADHOC-NOW,2006.
[23]Z.Xiong,W.Liu, J.Huang, et al,"Network coding approach:Intra-cluster information exchange in wireless sensor networks", In Proc. of MSN,2006.
[24]Petrovic D, Ramchandran K, Rabaey J, "Coding for sensor networks using untuned radios", In Proc.of IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, June 2005,pp.1093-1097.
[25]Zhang X, Wicker S B, "Robustness vs efficiency in sensor networks",In Proc.of Fourth International Symposium on Information Processing in Sensor Networks (IPSN),April 2005,pp.225-230.
[26]Z. Guo, P. Xie, J.Cui, and B.Wang, "On applying network coding to underwater sensor networks", In Proc. of ACMWUWNet'06, Los angeles, CA, Sept.2006.
[27]Ho T, Leong B, Medard M, et al, "On the utility of network coding in dynamic environments", In Proc.of Int'l Workshop on Wireless Ad-hoc Networks(IWWAN), June 2004,pp.196-200.
[28]Kodialam M S,Lakshman T V, Sengupta S,"Online multicast routing with bandwidth guarantees:a new approach using multicast network flow", In Proc.of Measurement and Modeling of Computer Systems,2000, pp.296-306.
[29]D. Wang, Q. Zhang, and J. Liu, "Partial network coding:Theory and application for continuous sensor data collection", In Proc. of 14th IEEE International Workshop on Quality of Service, June 2006.
[30]Dimakis A G,Prabhakaran V, Ramchandran K, "Ubiquitous access to distributed data in large-scale sensor networks through decent ralized erasure codes", In Proc. of Symposium on Information Processing in Sensor Networks (IPSN), Apri.2005.
[31]E. Ayday, F. Delgosha, and F. Fekri, "Location-aware security services for wireless sensor networks using network coding," In Proc. of 26th IEEE International Conference on Computer Communications,May 2007,pp.1226-1234.
[32]王俊义,“编码分组网络的效用最大化及网络编码在应用方面的研究”,[博士学位论文],北京,北京邮电大学,2008.
[33]S.Rhea, P.Eaton and J.Kubiatowicz. Pond:the OceanStore prototype[C]// Proceedings of the 2nd USENIX Conference on File and Storage Technologies, 2003:1-14
[34]黄佳庆、王帅、陈清文,“网络编码在P2P网络中的应用”[EB/OL][2009-03-16]http://www.cww.net.cn
[35]Nguyen, K.;Thinh Nguyen; Sen-ching Cheung, "Peer-to-Peer Streaming with Hierarchical Network Coding", IEEE International Conference on Multimedia and Expo, Vol.Issue,2-5 July 2007,pp.396-399.
[36]C.Gkantsidis and P.R.Rodriguez, Network Coding for Large Scale Content Distribution, IEEE INFOCOM 2005.
[37]Y.wu, K.Jain, and S.Y.Kung, A unification of Edmonds' routing theorem and Ahlswedeetal's network coding theorem, Joint special issue of the IEEE Trans.on Information Theory and the IEEE/ACM Trans. On Network and Information Theory in Mar,2005.
[38]D.S.Lun, N.Ratnakar and H.Lee. Achieving minimum-cost multicast:A decentralized approach based on network coding, Proc.IEEE INFOCOM 2005.
[39]Kapil Bhattad, Niranjan Ratnakar. Minimal Network Coding for Multicast.2005.
[40]S.Jaggi, P.Sanders, P.A.Chou, Polynomial Time Algorithms for Multicast Network Code Construction, IEEE Transaction on Information Theory, Vol.51, No.6, June, 2005.
[41]Al Hamra A, Barakat C,Turletti T, "Network Coding for Wireless Mesh Networks: A Case Study", In Proc. of IEEE International Symposium on a World of Wireless, Mobile and.Multimedia Networks (WoWMoM), Niagara-Falls,Buffalo N Y, USA, June 2006.
[42]Katti S,Katabi D, Hu W, et al, "The importance of being opportunistic:Practical network coding for wireless environments". In Proc. of 43rd Annual Allerton Conference on Communication, Control, and Computing, Allerton,Sept 2005.
[43]S.Katti, H. Rahul, W. Hu, et al, "Xors in the air:Practical wireless network coding", in Proc. of ACM SIGCOMM, Pisa, Italy,2006.
[44]W. Roh,A. Paulraj,"Outrage Performance of the Distributed Antenna Systems in a Composite Fading Channel",Proc. IEEE VTC'02-Fall, Vol.3, pp.1520-1524, Sept 2002.
[45]W. Roh,A. Paulraj,"Performance of the distributed antenna systems in a multi-cell environment",Proc. IEEE VTC'03-Spring,Vol.1,pp.587-591,April 2003。
[46]覃团发,会平,基于网络编码的分布式天线系统性能分析,《中兴通信技术》,2009年第1期.
[1]Li S Y, Yeung R W, Cai N, "Linear network coding", IEEE Trans on Information Theory, vol.49,2003,pp.371-381.
[2]Koetter R, Medard M, "An algebraic approach to network coding",IEEE/ACM Trans on Networking, vol.11,2003,pp.782-795.
[3]T. Ho, M. Medard, J. Shi, M. Effros, et al. On randomized network coding, in Proc. 41st Annual Allerton Conference on Communication, Control, and Computing, Oct. 2003. pp.11-20.
[4]T. Ho, D.R. Karger, M. Medard, et al."Network coding from a networkow perspective". In Proc. of Int'l Symp.Information Theory, Yokohama, Japan, June 2003.
[5]T. Ho, R. Koetter, M. Medard, et al.The benefits of coding over routing in a randomized setting. In Proc. Int'l Symp.Information Theory, Yokohama, Japan, June 2003.
[6]T. Ho, M. M_edard, R. Koetter, et.al. "Toward a random operation of networks". IEEE Trans. Information Theory,2004.
[7]R. Koetter, M. Medard, "An algebraic approach to network coding", IEEE/ACM Trans. Networking, vol.11,no.5, pp.782-795, Oct.2003.
[8]P.Sanders, S.E gner, and L.Tolhuizen, "Polynomial time algorithms for network Information flow",ACM Symposium on Parallel Algorithms and Architectures (SPAR), pp.286-294,2003.
[9]S.Jaggi, P. Sanders, P. A. Chou, M. Effros, S.Egner, K. Jain, and L. M. G. M. Tolhuizen, "Polynomial time algorithms for multicast network code construction", IEEE Trans. Inform. Theory, vol.51,no.6, pp.1973-1982, June 2005.
[10]T.Ho, D.Karger, M.Medard, D.Karger and M.Efros, "The benefits of coding over routing in a Randomized seting", IEEE International Symposium on Information Theory, Yokohama, Japan, June 2003.
[11]Tracey Ho, Ralf Koetter, A Random Linear Network Coding Approach to Multicast. IEEE Trans. On Information Theary, Vol.52.No.10,2006
[12]P. Elias, A. Feinstein, and C. E.Shannon, "A note on the maximum flow through a network" IEEE Trans.Information Theory, vol.2,1956,pp117-119.
[13]L. R. Ford and D.R. Fulkerson. "Flows in Networks".Princeton University Press, Princeton,1962.
[14]K. Menger. Zurallgemeinen Kurventheorie, "Fund. Math".1927.
[15]A. Schrijver. "Combinatorial Optimization:Polyhedra and Efficiency". Springer, 2003.
[16]Y.Wu, "Network coding for multicasting,"[Dissertation],Princeton, Dept. Elect. Eng.,Princeton Univ.,Princeton, NJ,2005.
[17]Bertsekas D, Gallager R. "Data networks", Revised. New Jersey:Prentice Hall,1996.
[18]Bollobas B, "random Graphs". Sec. ed. Combridge University Press,2001.
[19]Ahlswede R, Cai N,Li SY R, et al."Network information flow",IEEE Trans. On Information Theory,2003,49(2),pp:371～381.
[20]Raymond W Yeung, Shuo Yen Robert Li, Cai N,et al. "Network Coding Theory". Boston-Delft:Now the Essence of Knowledge,2006.
[21]P. Elias, A. Feinstein, and C. E. Shannon. "Note on maximum flow through a network".IRE Transactions on Information Theory IT-2,117--119,1956.
[22]陈惠开,网论-网络流,北京：人民邮电出版社,1992.
[23]樊平毅,网络信息论,北京：清华大学出版社,2009.
[24]Ahlswede R,Cai N,et al,"Network information flow",IEEE Trans on Information Theory, vol.46,2000,pp.1204-1216.
[25]L.Lovasz. "Connectivity in digraphs", Journal of Combinational Theory B, vol 15. 1973,pp.174-177.
[26]R. Koetter and M. Medard.Beyond Routing:An Algebraic Approach to Network Coding. Prol.Infocom,2002,1:122～130.
[27]王俊义,“编码分组网络的效用最大化及网络编码在应用方面的研究”,[博士学位论文],北京,北京邮电大学,2008.
[1]A. Sendonaris, E. Erkip, and B.Aazhang, "Increasing uplink capacity via user cooperation diversity", IEEE Intenational Symposium on Information Theory, Cambridge, US A,1998.
[2]A. Sendonaris, E. Erkip, and B.Aazhang. User co-operation diversity Part Ⅰ:System description. IEEE Trans.on Commun.,51(2003)39,1927-1937.
[3]A. Sendonaris, E. Erkip, and B.Aazhang. User co-operation diversity Part Ⅱ: Implementation aspects and performance analysis. IEEE Trans.on Communications 51(11):1939-1948,2003.
[4]Lei X, Fuja T, Kliawer J, Costello D, "A network coding approach to cooperative diversity", IEEE Trans. On Information Theory,53(10):3714-3722,2007.
[5]Todd E, Hunter, "Diversity through coded cooperation", IEEE Trans. On Wireless Communications,5(2):283-289,2006.
[6]Lin Z, Erkip E, Ghosh M, "Adaptive modulation for coded cooperative systems", IEEE 6th Workshop on Signal Processing Advances in Wireless Communications,2005
[7]Yingda Chen Kishore, S.Jing Li,"Wireless diversity through network coding" IEEE Wireless Communications and Networking Conference(WCNC),2006.
[8]Petar Popovski and Hiroyuki Yomo,"Physical Network Coding in Two-Way Wireless Relay Channels",IEEE International Conference on Communications(ICC),2007.
[9]Anwar Al Hamra,Chadi Barakat, "Network Coding forWireless Mesh Networks:A Case Study",Worldof Wireless, Mobile and Multimedia Networks(WoWMoM).2006.
[10]Yang, Sichao; Koetter, Ralf, "Network Coding over a Noisy Relay:a Belief Propagation Approach", IEEE International Symposium on Information Theory (ISIT), 2007.
[11]T. Wang and G B.Giannakis, "Complex Field Network Coding for Multiuser Cooperative Communications", IEEE Journal on Selected Areas in Communications, vol.26, no.3, pp:561-571, Apr.2008.
[12]覃团发,罗会平,基于网络编码的分布式天线系统性能分析,中兴通信技术,2009年第1期。
[13]李颖,王静,网络编码在无线通信网络中的应用,中兴通信技术,2009年第1期。
[14]D.Wang, Q. Zhang, and J.Liu. "Partial network coding:Theory and application for continuous sensor data collection". Fourteenth IEEE International Workshop on Quality of Service (IWQoS), pp.93-101. Jun.2006.
[15]Dan W, Qian Z, Jiangchun L, "Partial network coding:Concept, performance, and application for continuous data collection in sensor networks", ACM Trans.on Sensor Networks,4(3),2008.
[16]B.Zhao, M.Valenti, "Distributed turbo coded diversity for relay channel", IEE Electronics Letters, vol.39, pp:786-787, May 2003.
[17]Ao Zhan, Chen He, "Joint design of channel coding and physical network coding for wireless networks",International Conference on Neural Networks and Signal Processing, June 2008.
[18]Shengli Z, Yu Z, Soung C L, Khaled B L, "Joint Design of Network Coding and Channel Decoding for Wireless Networks", March 2007.
[19]Hausl, C, Dupraz, P, "Joint Network-Channel Coding for the Multiple-Access Relay Channel", Sensor and Ad Hoc Communications and Network(SECON'06).2006.
[20]Xingkai Bao, Jing Li, "Adaptive network coded cooperation (ANCC) for wireless relay networks:matching code-on-graph with network-on-graph", IEEE Trans.on Wireless Communications,2008.
[21]M. Effros, Tracey Ho, R.Koetter, "Linear Network Codes:A Unified Framework for Source, Channel, and Network Coding", Series in Discrete Mathematics and Theoretical Computer Science (DIMACS),2003.
[22]Nabar RU, Blocskei H, Kneubuhler F W, "Fading relay channels:performance limits and space-time signal design", IEEE JSCA,22(6):1099-1109,2004.
[23]Laneman J N, Wornell G W, "Distributed space-time coded protocols for exploiting cooperative diversity in wireless networks", IEEE Trans.on information theory, 49(10):2415-2425,2003.
[24]Janani M, Hedayat A, "Coded cooperation in wireless communications:space-time transmission and iterative decoding", IEEE Trans.on signal processing, 52(2):362-371,2004
[25]Hunter T E, Nosratinia A, "Coded cooperation under slow fading, fast fading, and power control", The thirty-sixth Asilomar Conference on signals, systems and computers, Pacific Grove, USA,2002.
[1]Akyildiz, I.F, weilian Su, Sankarasubramaniam, Y, Cayirci, E, "A survey on sensor networks", IEEE Communications Magezine,40(8):102-114,2002.
[2]Dimakis, A.G.;Prabhakaran, V.;Ramchandran, K, "Distributed data storage in sensor networks using decentralized erasure codes", the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers,2004.
[3]Morris R, Nakamuma M, Inoue T, "Distributed Data Storage for P2P and Ad-hoc Networks",NTT Tech Rev,1(6):29-36,2003.
[4]Alexandros G D, Vinod P, Kannan R, "Decentralized erasure codes for distributed storage" IEEE/ACM Transactions on Networking,14(1):2809-2816,2006.
[5]Cooley, J.A.;Mineweaser, J.L.;Servi, L.D.;Tsung, E.T, "Software-based erasure codes for scalable distributed storage",7(10):157-164,2003.
[6]Aguilera, M.K, Janakiraman, R, Xu, L, "Using erasure codes efficiently for storage in a distributed system", International Conference on Dependable Systems and Networks, June 2005.
[7]Rodrigo R, Barbara L, "High availability in DHTs:Erasure coding vs. replication", International Workshop on Peer-to-Peer Systems, Feb 2005.
[8]R. Ahlswede, N. Cai,S.-Y.R. Li. et al. "Network information flow",IEEE Trans. Inf. Theory,vol.46 (4),2000, pp.1204-1216.
[9]Dimakis.A.G,Prabhakaran.V, Ramchandran, "Decentralized erasure codes for distributed networked storage", IEEE Transaction on Information Theory, vol.52,pp: 2809-2816,2006.
[10]S.Rhea, P.Eaton and J.Kubiatowicz.Pond, "he OceanStore prototype", Proceedings of the 2nd USENIX Conference on File and Storage Technologies, pp:1-14,2003.
[11]S.Acedanski, S.Deb, M. M'edard, R. Koetter, "How Good is Random Linear Coding Based Distributed Networked Storage", Proceedings of First Workshop on Network coding, pp199-125,2005.
[12]M. Luby, "LT codes", In Proc.43rd Annu. IEEE Symp. Foundations of Computer Science (FOCS), pp:271-280,2002.
[13]A.Shokrollah,"Raptor Codes",IEEE Trans.on Information Theory, vol.52(6) pp:2551-2567,2006.
[14]Dimakis, A.G, Prabhakaran, V, Ramchandran, K, "Distributed Fountain Codes for Networked Storage", IEEE International Conference on Acoustics, Speech and Signal Processing, May 2006.
[15]Aly, S.A.,Zhenning Kong, Soljanin, E, "Raptor codes based distributed storage algorithms for wireless sensor networks", IEEE International Symposium on Information Theory, July 2008.
[16]Fragouli.C, Soljanin.E,"Information flow decomposition for network coding", IEEE Trans.on Information Theory, Vol.52(3), pp:829-848,2006
[17]Jingyao Zhang, Pingyi Fan, "Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks", IEEE Trans.on Communications, vol.56,no.4,pp: 598-607, April 2008.
[18]樊平毅,网络信息论,北京：清华大学出版社,2009.
[19]M. Raab, A. Steger, "Balls into Bins-A Simple andTight Analysis", Techniques in Computer Science,pp 159-170,1998.
[20]Mitzenmacher M, "Digital fountains:A Survey and Look Forward", IEEE Information Theory Workshop:271-276,2004.
[21]Christina Fragouli, Emina Soljanin, "Information Flow Decomposition for Network Coding", IEEE Trans.on Information Theory,53(2):829-848,2006.
[22]Ma Y, Li W, Fan P, et al.COSE:Combined Oportunistic Scheduling and Encoding Strategy for Network coding, Proc. IASTED CSNA2007, Oct 2007.
[1]I. F. Akyildiz, X. Wang, and W. Wang, "Wireless Mesh Networks:a survey," Computer Networks Journal (Elsevier), Jan.2005.
[2]I. F. Akyildiz, and X. Wang, "A survey on Wireless Mesh Networks," IEEE Comm. Mag.,vol.43, pp.23-30, Sept.2005.
[3]Mesh Networks Inc; http://www.meshnetworks.com
[4]R. Bruno, M. Conti, and E. Gregori, "Mesh Networks:Commodity Multihop Ad Hoc Networks," IEEE Comm. Mag.,vol.37,Mar 2005, pp.123-131.
[5]Networking Research Group, Microsoft Research. [Online].Available: http://research.microsoft.com/mesh/.
[6]V.Navda, A. Kashyap and S.R. Das, "Design and Evaluation of iMesh:an Infrastructure-mode Wireless Mesh Networks," in Proc.of 6th IEEE Int. Symposium on a World of Wireless Mobile and Multimedia Networks 2005,June 2005,pp. 164-170,
[7]夏征兵,宋玲,“基于Mesh结构的宽带无线接入网技术”,《电子技术应用》2006(10)：33-36,2006.
[8]Raniwalaa, Chiueh T, "Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network", Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05),3:2223-2234, 2005.
[9]IEEE802.11 Standard Group WebSite[EB/OL].http://www.ieee802.org/11/
[10]范涛,张燕,“无线Mesh网络的组网及其相关标准”,《数据通信》,2005(4)：40-42,2005.
[11]Marinam,Das s r, "A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks", Proceedings of the 2nd IEEE International Conference on Broadband Networks:Applications and Services Symposium (BroadNets'05),Oct 3-7:381-390,2005.
[12]Subramaniana,Gupta h, Das s r, "Minimum-interference channel assignment in multi-radio wireless mesh networks", Proceedings of 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks(SECON'07),Jun 18-21:481-490,2007.
[13]Radah m, Wong v w s, "WSN16-4:Logical topology design and interface assignment for multi-channel wireless mesh networks", Proceedings of IEEE Global Telecommunications Conference(Globecom'06), Dec 1:1-6,2006.
[14]Anwar Al Hamra Chadi Barakat Thierry Turletti. "Network Coding for Wireless Mesh Networks:A Case Study". IEEE WoWMoM 2006. Jun 2006.pp.9-22.
[15]Jian Zhang; Chen, Y.P.;Marsic, I, "Network Coding via Opportunistic Forwarding in Wireless Mesh Networks", Wireless Communications and Networking Conference, 2008 (WCNC 2008):1775-1780,2008.
[16]Sachin Katti, Dina Katabi, Hari Balakrishnan, Muriel Medard, "Symbol-Level Network Coding for Wireless Mesh Networks", ACM SIGCOMM, Aug 2008.
[17]Roberto B, Aurelio F, "Event Diffusion in Wireless Mesh Networks Using Random Linear Network Coding" [Online].Available:http://www.ifp.uiuc.edu/koetter/NWC.
[18]Katti, S.Rahul, H. Wenjun Hu, Katabi, D, Medard, M, Crowcroft, J,"XORs in the Air:Practical Wireless Network Coding", IEEE/ACM Transactions on Networking, 16(3):497-510,2008.
[19]K. Philips. S.S.Panwar, and A. N. Tantawi. Connectivity properties of a packet radio network model.in Proc. IEEE Transactions on Information Theory, September 1989. Vol.35,1044-1056.
[20]王俊义,“编码分组网络的效用最大化及网络编码在应用方面的研究”,[博士学位论文],北京,北京邮电大学,2008.
[21]Decoutod, Aguayo d, Bicket j,et al. "A high throughput path metric for multi-hop wireless routing", Proceedings of 9th Annual International Conference on Mobile Computing and Networking, Sep(14-19):136-146,2003.
[22]Koksalce, Jamieson k, Telatar e, et al. "Impacts of channel variability on link-level throughput in wireless networks", Proceedings of ACM SIGMETRICS/Performance, June,2006.
[23]Koksalce, Balakrishnan h. "Quality aware routing metrics for time-varying wireless mesh networks", IEEE Journal on Selected Areas in Communications,24(11): 1984-1994,2006.
[24]Bhayag,Manoj b s, Siva c, et al. "Ring-based routing schemes for load distribution and throughput improvement in multi hop cellular, Ad hoc, and mesh networks", Proceedings of 2003 International Conference on High Performance Computing (HiPC'03),Dec(17-20):152-161,2003.
[25]Raniwalaa, Gopalan k, Chiueh t. Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks [J].ACM Mobile Computing and Communications Review,8(2):50-65,2004.
[2]P. Gupta and P. R. Kumar, "The Capacity of Wireless Networks," IEEE Trans. Inform. Theory, vol.46, pp.388-404, Mar.2000.
[3]R. Ahlswede, N.Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow", IEEE Trans. Inform. Theory, vol.46,no.4, pp.1204-1216, July 2000.
[4]Jingyao Zhang, Pingyi Fan, "Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks", IEEE Trans.on Communications, vol.56,no.4,pp: 598-607, April 2008.
[5]Wang, H.,Fan, P. and Letaief, K.B."Maximum flow and network capacity of network coding for ad-hoc networks", IEEE Transactions On Wireless Communication,6(12): 4193～4198,2007.
[6]Ramamoorthy,.A.Shi, J.;Wesel, R,D."On the capacity of network coding for random networks", IEEE Transactions on Information Theory, Vol.51,Issue 8, pp:2878-2885, Aug.2005.
[7]K R. Koetter, M. Medard, "Beyond Routing:An Algebraic Approach to Network Coding," INFOCOM,2002.
[8]Anwar Al Hamra Chadi Barakat Thierry Turletti, "Network Coding for Wireless Mesh Networks:A Case Study;" Proc of IEEE WoWMoM 2006. June 2006.
[9]Wang, J. Y,Yang, G., Lin, X. H.,He, Z. Q.,Lin, J. R. "Random Linear Coding for File Sharing in Upload-Limited Wireless Packet Networks," 2007 IEEE 66th Vehicular Technology Conference,2007.VTC-2007 Fall.2007(3):235-239.
[10]S.Yang and R.W.Yeung, "Characterizations of Network Error Correction/Detection and Erasure Correction", Netcod2007.
[11]R.W.Yeung and N. Cai, "Network error correction, part Ⅰ:Basic concepts and upper bounds,"[J].Communications in Information and Systems,2006,6(1):19-36.
[12]N. Cai and R. W. Yeung, "Network error correction, part Ⅱ:Lower bounds," [J]. Communications in Information and Systems,2006,6(1):37-54.
[13]Shokrollahi, "Raptor codes," IEEE T INFORM THEORY 52 (6):2551-2567 JUN 2006.
[14]MacKay, D.J.C. "Fountain codes," IEE Proceedings on Communications, Volume 152, Issue 6,9 Dec.2005 Page(s):1062-1068.
[15]S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding", IEEE Trans. Inform. Theory, vol.49,no.2,pp.371-381, Feb.2003.
[16]R. Koetter, M. Medard, "An algebraic approach to network coding", IEEE/ACM Trans. Networking, vol.11,no.5, pp.782-795, Oct.2003.
[17]P.Sanders, S.E gner, and L.Tolhuizen, "Polynomial time algorithms for network Information flow",ACM Symposium on Parallel Algorithms and Architectures (SPAR),pp.286-294,2003.
[18]S.Jaggi, P. Sanders, P. A. Chou, M. Effros, S.Egner, K. Jain, and L. M. G. M. Tolhuizen, "Polynomial time algorithms for multicast network code construction", IEEE Trans. Inform. Theory, vol.51,no.6, pp.1973-1982, June 2005.
[19]P.A.Chou,Y.Wu, and K.Jain. "Practical network coding", In P roceedings of 41st Annual Allerton Conference on Communication, Control, and Computing, October 2003.
[20]T.Ho, D.Karger, M.Medard, D.Karger and M.Efros, "The benefits of coding over routing in a Randomized seting", IEEE International Symposium on Information Theory, Yokohama, Japan, June 2003.
[21]T.H o, M.Medard, J.Shi, M.Efros and D.R.K arger,"On Randomized Network Coding",41st Annual Allerton Conference on Communication Control and Computing, Oct.2003,
[22]L. Shan-Shan, Z. Pei-Dong, and L. Xiang-Ke, "Energy efficient multipath routing using network coding in wireless sensor networks", in ADHOC-NOW,2006.
[23]Z.Xiong,W.Liu, J.Huang, et al,"Network coding approach:Intra-cluster information exchange in wireless sensor networks", In Proc. of MSN,2006.
[24]Petrovic D, Ramchandran K, Rabaey J, "Coding for sensor networks using untuned radios", In Proc.of IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, June 2005,pp.1093-1097.
[25]Zhang X, Wicker S B, "Robustness vs efficiency in sensor networks",In Proc.of Fourth International Symposium on Information Processing in Sensor Networks (IPSN),April 2005,pp.225-230.
[26]Z. Guo, P. Xie, J.Cui, and B.Wang, "On applying network coding to underwater sensor networks", In Proc. of ACMWUWNet'06, Los angeles, CA, Sept.2006.
[27]Ho T, Leong B, Medard M, et al, "On the utility of network coding in dynamic environments", In Proc.of Int'l Workshop on Wireless Ad-hoc Networks(IWWAN), June 2004,pp.196-200.
[28]Kodialam M S,Lakshman T V, Sengupta S,"Online multicast routing with bandwidth guarantees:a new approach using multicast network flow", In Proc.of Measurement and Modeling of Computer Systems,2000, pp.296-306.
[29]D. Wang, Q. Zhang, and J. Liu, "Partial network coding:Theory and application for continuous sensor data collection", In Proc. of 14th IEEE International Workshop on Quality of Service, June 2006.
[30]Dimakis A G,Prabhakaran V, Ramchandran K, "Ubiquitous access to distributed data in large-scale sensor networks through decent ralized erasure codes", In Proc. of Symposium on Information Processing in Sensor Networks (IPSN), Apri.2005.
[31]E. Ayday, F. Delgosha, and F. Fekri, "Location-aware security services for wireless sensor networks using network coding," In Proc. of 26th IEEE International Conference on Computer Communications,May 2007,pp.1226-1234.
[32]王俊义,“编码分组网络的效用最大化及网络编码在应用方面的研究”,[博士学位论文],北京,北京邮电大学,2008.
[33]S.Rhea, P.Eaton and J.Kubiatowicz. Pond:the OceanStore prototype[C]// Proceedings of the 2nd USENIX Conference on File and Storage Technologies, 2003:1-14
[34]黄佳庆、王帅、陈清文,“网络编码在P2P网络中的应用”[EB/OL][2009-03-16]http://www.cww.net.cn
[35]Nguyen, K.;Thinh Nguyen; Sen-ching Cheung, "Peer-to-Peer Streaming with Hierarchical Network Coding", IEEE International Conference on Multimedia and Expo, Vol.Issue,2-5 July 2007,pp.396-399.
[36]C.Gkantsidis and P.R.Rodriguez, Network Coding for Large Scale Content Distribution, IEEE INFOCOM 2005.
[37]Y.wu, K.Jain, and S.Y.Kung, A unification of Edmonds' routing theorem and Ahlswedeetal's network coding theorem, Joint special issue of the IEEE Trans.on Information Theory and the IEEE/ACM Trans. On Network and Information Theory in Mar,2005.
[38]D.S.Lun, N.Ratnakar and H.Lee. Achieving minimum-cost multicast:A decentralized approach based on network coding, Proc.IEEE INFOCOM 2005.
[39]Kapil Bhattad, Niranjan Ratnakar. Minimal Network Coding for Multicast.2005.
[40]S.Jaggi, P.Sanders, P.A.Chou, Polynomial Time Algorithms for Multicast Network Code Construction, IEEE Transaction on Information Theory, Vol.51, No.6, June, 2005.
[41]Al Hamra A, Barakat C,Turletti T, "Network Coding for Wireless Mesh Networks: A Case Study", In Proc. of IEEE International Symposium on a World of Wireless, Mobile and.Multimedia Networks (WoWMoM), Niagara-Falls,Buffalo N Y, USA, June 2006.
[42]Katti S,Katabi D, Hu W, et al, "The importance of being opportunistic:Practical network coding for wireless environments". In Proc. of 43rd Annual Allerton Conference on Communication, Control, and Computing, Allerton,Sept 2005.
[43]S.Katti, H. Rahul, W. Hu, et al, "Xors in the air:Practical wireless network coding", in Proc. of ACM SIGCOMM, Pisa, Italy,2006.
[44]W. Roh,A. Paulraj,"Outrage Performance of the Distributed Antenna Systems in a Composite Fading Channel",Proc. IEEE VTC'02-Fall, Vol.3, pp.1520-1524, Sept 2002.
[45]W. Roh,A. Paulraj,"Performance of the distributed antenna systems in a multi-cell environment",Proc. IEEE VTC'03-Spring,Vol.1,pp.587-591,April 2003。
[46]覃团发,会平,基于网络编码的分布式天线系统性能分析,《中兴通信技术》,2009年第1期.
[1]Li S Y, Yeung R W, Cai N, "Linear network coding", IEEE Trans on Information Theory, vol.49,2003,pp.371-381.
[2]Koetter R, Medard M, "An algebraic approach to network coding",IEEE/ACM Trans on Networking, vol.11,2003,pp.782-795.
[3]T. Ho, M. Medard, J. Shi, M. Effros, et al. On randomized network coding, in Proc. 41st Annual Allerton Conference on Communication, Control, and Computing, Oct. 2003. pp.11-20.
[4]T. Ho, D.R. Karger, M. Medard, et al."Network coding from a networkow perspective". In Proc. of Int'l Symp.Information Theory, Yokohama, Japan, June 2003.
[5]T. Ho, R. Koetter, M. Medard, et al.The benefits of coding over routing in a randomized setting. In Proc. Int'l Symp.Information Theory, Yokohama, Japan, June 2003.
[6]T. Ho, M. M_edard, R. Koetter, et.al. "Toward a random operation of networks". IEEE Trans. Information Theory,2004.
[7]R. Koetter, M. Medard, "An algebraic approach to network coding", IEEE/ACM Trans. Networking, vol.11,no.5, pp.782-795, Oct.2003.
[8]P.Sanders, S.E gner, and L.Tolhuizen, "Polynomial time algorithms for network Information flow",ACM Symposium on Parallel Algorithms and Architectures (SPAR), pp.286-294,2003.
[9]S.Jaggi, P. Sanders, P. A. Chou, M. Effros, S.Egner, K. Jain, and L. M. G. M. Tolhuizen, "Polynomial time algorithms for multicast network code construction", IEEE Trans. Inform. Theory, vol.51,no.6, pp.1973-1982, June 2005.
[10]T.Ho, D.Karger, M.Medard, D.Karger and M.Efros, "The benefits of coding over routing in a Randomized seting", IEEE International Symposium on Information Theory, Yokohama, Japan, June 2003.
[11]Tracey Ho, Ralf Koetter, A Random Linear Network Coding Approach to Multicast. IEEE Trans. On Information Theary, Vol.52.No.10,2006
[12]P. Elias, A. Feinstein, and C. E.Shannon, "A note on the maximum flow through a network" IEEE Trans.Information Theory, vol.2,1956,pp117-119.
[13]L. R. Ford and D.R. Fulkerson. "Flows in Networks".Princeton University Press, Princeton,1962.
[14]K. Menger. Zurallgemeinen Kurventheorie, "Fund. Math".1927.
[15]A. Schrijver. "Combinatorial Optimization:Polyhedra and Efficiency". Springer, 2003.
[16]Y.Wu, "Network coding for multicasting,"[Dissertation],Princeton, Dept. Elect. Eng.,Princeton Univ.,Princeton, NJ,2005.
[17]Bertsekas D, Gallager R. "Data networks", Revised. New Jersey:Prentice Hall,1996.
[18]Bollobas B, "random Graphs". Sec. ed. Combridge University Press,2001.
[19]Ahlswede R, Cai N,Li SY R, et al."Network information flow",IEEE Trans. On Information Theory,2003,49(2),pp:371～381.
[20]Raymond W Yeung, Shuo Yen Robert Li, Cai N,et al. "Network Coding Theory". Boston-Delft:Now the Essence of Knowledge,2006.
[21]P. Elias, A. Feinstein, and C. E. Shannon. "Note on maximum flow through a network".IRE Transactions on Information Theory IT-2,117--119,1956.
[22]陈惠开,网论-网络流,北京：人民邮电出版社,1992.
[23]樊平毅,网络信息论,北京：清华大学出版社,2009.
[24]Ahlswede R,Cai N,et al,"Network information flow",IEEE Trans on Information Theory, vol.46,2000,pp.1204-1216.
[25]L.Lovasz. "Connectivity in digraphs", Journal of Combinational Theory B, vol 15. 1973,pp.174-177.
[26]R. Koetter and M. Medard.Beyond Routing:An Algebraic Approach to Network Coding. Prol.Infocom,2002,1:122～130.
[27]王俊义,“编码分组网络的效用最大化及网络编码在应用方面的研究”,[博士学位论文],北京,北京邮电大学,2008.
[1]A. Sendonaris, E. Erkip, and B.Aazhang, "Increasing uplink capacity via user cooperation diversity", IEEE Intenational Symposium on Information Theory, Cambridge, US A,1998.
[2]A. Sendonaris, E. Erkip, and B.Aazhang. User co-operation diversity Part Ⅰ:System description. IEEE Trans.on Commun.,51(2003)39,1927-1937.
[3]A. Sendonaris, E. Erkip, and B.Aazhang. User co-operation diversity Part Ⅱ: Implementation aspects and performance analysis. IEEE Trans.on Communications 51(11):1939-1948,2003.
[4]Lei X, Fuja T, Kliawer J, Costello D, "A network coding approach to cooperative diversity", IEEE Trans. On Information Theory,53(10):3714-3722,2007.
[5]Todd E, Hunter, "Diversity through coded cooperation", IEEE Trans. On Wireless Communications,5(2):283-289,2006.
[6]Lin Z, Erkip E, Ghosh M, "Adaptive modulation for coded cooperative systems", IEEE 6th Workshop on Signal Processing Advances in Wireless Communications,2005
[7]Yingda Chen Kishore, S.Jing Li,"Wireless diversity through network coding" IEEE Wireless Communications and Networking Conference(WCNC),2006.
[8]Petar Popovski and Hiroyuki Yomo,"Physical Network Coding in Two-Way Wireless Relay Channels",IEEE International Conference on Communications(ICC),2007.
[9]Anwar Al Hamra,Chadi Barakat, "Network Coding forWireless Mesh Networks:A Case Study",Worldof Wireless, Mobile and Multimedia Networks(WoWMoM).2006.
[10]Yang, Sichao; Koetter, Ralf, "Network Coding over a Noisy Relay:a Belief Propagation Approach", IEEE International Symposium on Information Theory (ISIT), 2007.
[11]T. Wang and G B.Giannakis, "Complex Field Network Coding for Multiuser Cooperative Communications", IEEE Journal on Selected Areas in Communications, vol.26, no.3, pp:561-571, Apr.2008.
[12]覃团发,罗会平,基于网络编码的分布式天线系统性能分析,中兴通信技术,2009年第1期。
[13]李颖,王静,网络编码在无线通信网络中的应用,中兴通信技术,2009年第1期。
[14]D.Wang, Q. Zhang, and J.Liu. "Partial network coding:Theory and application for continuous sensor data collection". Fourteenth IEEE International Workshop on Quality of Service (IWQoS), pp.93-101. Jun.2006.
[15]Dan W, Qian Z, Jiangchun L, "Partial network coding:Concept, performance, and application for continuous data collection in sensor networks", ACM Trans.on Sensor Networks,4(3),2008.
[16]B.Zhao, M.Valenti, "Distributed turbo coded diversity for relay channel", IEE Electronics Letters, vol.39, pp:786-787, May 2003.
[17]Ao Zhan, Chen He, "Joint design of channel coding and physical network coding for wireless networks",International Conference on Neural Networks and Signal Processing, June 2008.
[18]Shengli Z, Yu Z, Soung C L, Khaled B L, "Joint Design of Network Coding and Channel Decoding for Wireless Networks", March 2007.
[19]Hausl, C, Dupraz, P, "Joint Network-Channel Coding for the Multiple-Access Relay Channel", Sensor and Ad Hoc Communications and Network(SECON'06).2006.
[20]Xingkai Bao, Jing Li, "Adaptive network coded cooperation (ANCC) for wireless relay networks:matching code-on-graph with network-on-graph", IEEE Trans.on Wireless Communications,2008.
[21]M. Effros, Tracey Ho, R.Koetter, "Linear Network Codes:A Unified Framework for Source, Channel, and Network Coding", Series in Discrete Mathematics and Theoretical Computer Science (DIMACS),2003.
[22]Nabar RU, Blocskei H, Kneubuhler F W, "Fading relay channels:performance limits and space-time signal design", IEEE JSCA,22(6):1099-1109,2004.
[23]Laneman J N, Wornell G W, "Distributed space-time coded protocols for exploiting cooperative diversity in wireless networks", IEEE Trans.on information theory, 49(10):2415-2425,2003.
[24]Janani M, Hedayat A, "Coded cooperation in wireless communications:space-time transmission and iterative decoding", IEEE Trans.on signal processing, 52(2):362-371,2004
[25]Hunter T E, Nosratinia A, "Coded cooperation under slow fading, fast fading, and power control", The thirty-sixth Asilomar Conference on signals, systems and computers, Pacific Grove, USA,2002.
[1]Akyildiz, I.F, weilian Su, Sankarasubramaniam, Y, Cayirci, E, "A survey on sensor networks", IEEE Communications Magezine,40(8):102-114,2002.
[2]Dimakis, A.G.;Prabhakaran, V.;Ramchandran, K, "Distributed data storage in sensor networks using decentralized erasure codes", the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers,2004.
[3]Morris R, Nakamuma M, Inoue T, "Distributed Data Storage for P2P and Ad-hoc Networks",NTT Tech Rev,1(6):29-36,2003.
[4]Alexandros G D, Vinod P, Kannan R, "Decentralized erasure codes for distributed storage" IEEE/ACM Transactions on Networking,14(1):2809-2816,2006.
[5]Cooley, J.A.;Mineweaser, J.L.;Servi, L.D.;Tsung, E.T, "Software-based erasure codes for scalable distributed storage",7(10):157-164,2003.
[6]Aguilera, M.K, Janakiraman, R, Xu, L, "Using erasure codes efficiently for storage in a distributed system", International Conference on Dependable Systems and Networks, June 2005.
[7]Rodrigo R, Barbara L, "High availability in DHTs:Erasure coding vs. replication", International Workshop on Peer-to-Peer Systems, Feb 2005.
[8]R. Ahlswede, N. Cai,S.-Y.R. Li. et al. "Network information flow",IEEE Trans. Inf. Theory,vol.46 (4),2000, pp.1204-1216.
[9]Dimakis.A.G,Prabhakaran.V, Ramchandran, "Decentralized erasure codes for distributed networked storage", IEEE Transaction on Information Theory, vol.52,pp: 2809-2816,2006.
[10]S.Rhea, P.Eaton and J.Kubiatowicz.Pond, "he OceanStore prototype", Proceedings of the 2nd USENIX Conference on File and Storage Technologies, pp:1-14,2003.
[11]S.Acedanski, S.Deb, M. M'edard, R. Koetter, "How Good is Random Linear Coding Based Distributed Networked Storage", Proceedings of First Workshop on Network coding, pp199-125,2005.
[12]M. Luby, "LT codes", In Proc.43rd Annu. IEEE Symp. Foundations of Computer Science (FOCS), pp:271-280,2002.
[13]A.Shokrollah,"Raptor Codes",IEEE Trans.on Information Theory, vol.52(6) pp:2551-2567,2006.
[14]Dimakis, A.G, Prabhakaran, V, Ramchandran, K, "Distributed Fountain Codes for Networked Storage", IEEE International Conference on Acoustics, Speech and Signal Processing, May 2006.
[15]Aly, S.A.,Zhenning Kong, Soljanin, E, "Raptor codes based distributed storage algorithms for wireless sensor networks", IEEE International Symposium on Information Theory, July 2008.
[16]Fragouli.C, Soljanin.E,"Information flow decomposition for network coding", IEEE Trans.on Information Theory, Vol.52(3), pp:829-848,2006
[17]Jingyao Zhang, Pingyi Fan, "Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks", IEEE Trans.on Communications, vol.56,no.4,pp: 598-607, April 2008.
[18]樊平毅,网络信息论,北京：清华大学出版社,2009.
[19]M. Raab, A. Steger, "Balls into Bins-A Simple andTight Analysis", Techniques in Computer Science,pp 159-170,1998.
[20]Mitzenmacher M, "Digital fountains:A Survey and Look Forward", IEEE Information Theory Workshop:271-276,2004.
[21]Christina Fragouli, Emina Soljanin, "Information Flow Decomposition for Network Coding", IEEE Trans.on Information Theory,53(2):829-848,2006.
[22]Ma Y, Li W, Fan P, et al.COSE:Combined Oportunistic Scheduling and Encoding Strategy for Network coding, Proc. IASTED CSNA2007, Oct 2007.
[1]I. F. Akyildiz, X. Wang, and W. Wang, "Wireless Mesh Networks:a survey," Computer Networks Journal (Elsevier), Jan.2005.
[2]I. F. Akyildiz, and X. Wang, "A survey on Wireless Mesh Networks," IEEE Comm. Mag.,vol.43, pp.23-30, Sept.2005.
[3]Mesh Networks Inc; http://www.meshnetworks.com
[4]R. Bruno, M. Conti, and E. Gregori, "Mesh Networks:Commodity Multihop Ad Hoc Networks," IEEE Comm. Mag.,vol.37,Mar 2005, pp.123-131.
[5]Networking Research Group, Microsoft Research. [Online].Available: http://research.microsoft.com/mesh/.
[6]V.Navda, A. Kashyap and S.R. Das, "Design and Evaluation of iMesh:an Infrastructure-mode Wireless Mesh Networks," in Proc.of 6th IEEE Int. Symposium on a World of Wireless Mobile and Multimedia Networks 2005,June 2005,pp. 164-170,
[7]夏征兵,宋玲,“基于Mesh结构的宽带无线接入网技术”,《电子技术应用》2006(10)：33-36,2006.
[8]Raniwalaa, Chiueh T, "Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network", Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05),3:2223-2234, 2005.
[9]IEEE802.11 Standard Group WebSite[EB/OL].http://www.ieee802.org/11/
[10]范涛,张燕,“无线Mesh网络的组网及其相关标准”,《数据通信》,2005(4)：40-42,2005.
[11]Marinam,Das s r, "A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks", Proceedings of the 2nd IEEE International Conference on Broadband Networks:Applications and Services Symposium (BroadNets'05),Oct 3-7:381-390,2005.
[12]Subramaniana,Gupta h, Das s r, "Minimum-interference channel assignment in multi-radio wireless mesh networks", Proceedings of 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks(SECON'07),Jun 18-21:481-490,2007.
[13]Radah m, Wong v w s, "WSN16-4:Logical topology design and interface assignment for multi-channel wireless mesh networks", Proceedings of IEEE Global Telecommunications Conference(Globecom'06), Dec 1:1-6,2006.
[14]Anwar Al Hamra Chadi Barakat Thierry Turletti. "Network Coding for Wireless Mesh Networks:A Case Study". IEEE WoWMoM 2006. Jun 2006.pp.9-22.
[15]Jian Zhang; Chen, Y.P.;Marsic, I, "Network Coding via Opportunistic Forwarding in Wireless Mesh Networks", Wireless Communications and Networking Conference, 2008 (WCNC 2008):1775-1780,2008.
[16]Sachin Katti, Dina Katabi, Hari Balakrishnan, Muriel Medard, "Symbol-Level Network Coding for Wireless Mesh Networks", ACM SIGCOMM, Aug 2008.
[17]Roberto B, Aurelio F, "Event Diffusion in Wireless Mesh Networks Using Random Linear Network Coding" [Online].Available:http://www.ifp.uiuc.edu/koetter/NWC.
[18]Katti, S.Rahul, H. Wenjun Hu, Katabi, D, Medard, M, Crowcroft, J,"XORs in the Air:Practical Wireless Network Coding", IEEE/ACM Transactions on Networking, 16(3):497-510,2008.
[19]K. Philips. S.S.Panwar, and A. N. Tantawi. Connectivity properties of a packet radio network model.in Proc. IEEE Transactions on Information Theory, September 1989. Vol.35,1044-1056.
[20]王俊义,“编码分组网络的效用最大化及网络编码在应用方面的研究”,[博士学位论文],北京,北京邮电大学,2008.
[21]Decoutod, Aguayo d, Bicket j,et al. "A high throughput path metric for multi-hop wireless routing", Proceedings of 9th Annual International Conference on Mobile Computing and Networking, Sep(14-19):136-146,2003.
[22]Koksalce, Jamieson k, Telatar e, et al. "Impacts of channel variability on link-level throughput in wireless networks", Proceedings of ACM SIGMETRICS/Performance, June,2006.
[23]Koksalce, Balakrishnan h. "Quality aware routing metrics for time-varying wireless mesh networks", IEEE Journal on Selected Areas in Communications,24(11): 1984-1994,2006.
[24]Bhayag,Manoj b s, Siva c, et al. "Ring-based routing schemes for load distribution and throughput improvement in multi hop cellular, Ad hoc, and mesh networks", Proceedings of 2003 International Conference on High Performance Computing (HiPC'03),Dec(17-20):152-161,2003.
[25]Raniwalaa, Gopalan k, Chiueh t. Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks [J].ACM Mobile Computing and Communications Review,8(2):50-65,2004.