期刊文献+

多源多目的模型中网络编码的时延性能分析 被引量:2

Delay Performance Analyses of Network Coding for Multisource-Multidestination Scenarios
下载PDF
导出
摘要 研究表明基于无线信道的广播特性,网络编码技术能够显著降低多播通信中的传输时延。多源多播模型中,在任一源节点已知其他源节点信息的条件下,现有传输方案能够确保系统时延最小化。本文在其他源节点信息未知时,对现有多源多目的单中继模型应用网络编码后的时延性能进行分析,并将该模型推广到多中继模型,提出了基于网络编码和机会中继选择策略的MR-OPP-NC方案,并在译码转发机制下,利用中断概率量化了应用网络编码前后的时延性能,仿真表明本文所提MR-OPP-NC方案与未使用网络编码的机会中继方案相比较,能获得显著的时延增益。 Research work has shown that taking advantage of the broadcasting nature of wireless channel network coding across multicast communication can significantly reduce system delay.In multi-Source multicast scenario,with the condition that each source has priori knowledge of other sources,existing transmission schemes can insure systematic delay minimum.In this paper,we analyze the delay performance of network coding for multisource-multidestination single-relay scenario without the above mentioned condition. Moreover,we extend the scenario to the multi-relay scenario,simultaneously proposing the MR-OPP-NC scheme based on network coding and opportunistic relaying selected strategy.We apply outage probability to the quantification of the delay performance of Network Coding with decode-and-forward(DF)strategy.Simulation results confirm that in contrast to opportunistic relaying scheme without network coding MR-OPP-NC scheme proposed can get significant delay performance gains.
出处 《信号处理》 CSCD 北大核心 2011年第5期672-677,共6页 Journal of Signal Processing
基金 国家重大专项(2010ZX03003-003-01) 国家863项目(2009AA012249) 国家自然科学基金(60972050)资助课题
关键词 网络编码 时延性能 机会中继 中断概率 network coding delay performance opportunistic relaying outage probability
  • 相关文献

参考文献14

  • 1R.Ahlswede,N.Cai,S-Y.R.Li,and R.W.Yeung.Network Information Flow[J].IEEE Trans.on Information Theory,2000,46(4):1204-1216.
  • 2Y.Chen,S.Kishore,and J.Li.Wireless diversity through network coding[C].Wireless Communications and Networking Conference (WCNC),Mar.2006,vol.3:1681-1686.
  • 3Lei Xiao,Thomas E.Fuja,J.Kliewer,and Daniel J.Costello.A Network Coding Approach to Cooperative Diversity[J].IEEE Trans.on Information Theory,October 2007,53(10):3714-3722.
  • 4A.Eryilmaz,A.Ozdaglar,and M.Medard.On Delay performance Gains From network coding[C].40th Annual Conference on Information Sciences and Systems,March 2006,864-870.
  • 5E.Ahmed,A.Eryilmaz,Muriel Medard,and Asuman E.Ozdaglar.On the Scaling Law of Network Coding Gains in Wireless Networks[C].IEEE Military Communications Conference,Oct.2007.
  • 6S.Katti,H.Rahul,W.Hu,D.Katabi,M.Medard and J.Crowcroft.XORs in the Air:Practical Wireless Network Coding[C].IEEE/ACM Transactions on Networking,June 2008,vol.16,no.3.
  • 7Shyamnath Gollakota,Dins Katabi.ZigZag Decoding:Combating Hidden Terminals in Wireless Networks[C].SIGCOMM'08,August 2008.
  • 8Xijin Yan,Jun Yang,and Zhen Zhang.An outer bound for multisource muttisink network coding with minimum cost consideration[J].IEEE Trans.on Information Theory,2006,52(6):2373-2385.
  • 9Yan X.Yeung R W,Zhang Z.The capacity region for multisource multisink network coding[C].IEEE International Symposium on Information Theory (ISIT),June 2007,pp:116-120.
  • 10R.Cogill,B.Shrader,and A.Ephremides.Stability analysis of random linear coding across multicast sessions[G].IEEE International Symposium on Information Theory (ISIT-08),Jul.2008,pp:31-35.

二级参考文献11

  • 1王兵山.离散数学[M].长沙:国防科技大学出版社,2004.263-281.
  • 2Ahlswede R, Cai N, I.i S Y R, et al. Network information flow[J]. IEEE Trans. on Information Theory , 2000,46(4) : 1204 - 1216.
  • 3Li S Y R,Yeung R W,Cai N. Linear network coding[J]. IEEE Trans. on Information Theory,2003,49(2):371-381.
  • 4Chou P A,Wu Y, Jain K. Practical network coding[C]//Alle rton Conference on Communication, Control and Computing 2003:73 - 482.
  • 5Koetter R, Medard M. An algebraic approach to network coding[J]. IEEE/ACM Trans. on Networking, 2003,11(5) : 782 - 795.
  • 6Jaggi S, Sanders P, Chou A, et al. Polynomial time algorithms for multicast network code construction[J]. IEEE Trans. on In formation Theroy, 2006,51(6) : 1973 - 1982.
  • 7Ho T, Medard M, Koetter R, et al. A random linear network coding approach to nmltieast[J]. IEEE Trans. on Information Theory, 2006,52(10) :4413 - 4430.
  • 8Yeung R W,Li S Y R,Cai N, et al. Network coding theory[J]. Foundation and Trends in Communications and Information Theory, 2005,2(4) : 241 - 381.
  • 9Yan X J, Yang J, Zhang Z. An outer bound for muhisource multisink network coding with minimum cost consideration[J]. IEEE Trans. on Information Theory ,2006,52(6) :2373 - 2385.
  • 10Yan X,Yeung R W, Zhang Z. The capacity region for multisource multi sink network coding[C]//Proc, of IEEE Inter national Symposium on Information Theory, 2007 : 116 - 120.

共引文献2

同被引文献33

  • 1Mackay D J C. Fountain codes [ J]. lEE Proceedings- Communications, 2005, 152 (6) : 1062-1068.
  • 2Luby M. LT codes[C]//Proc. 2002 IEEE Symp. Founda- tions of Computer Science (FOCS). Vancouver, Canada: IEEE, 2002: 271-280.
  • 3Zhang Y, Zhang Z. Joint Network-Channel Coding with Rateless Code over Multiple Access Relay System [ J ]. IEEE Transactions on Wireless Communications, 2013, 12( 1 ) : 320-332.
  • 4Puducheri S, Kliewer J, Fuja T E. The Design and Per- formance of Distributed LT Codes[ J ]. IEEE Transactions on Information Theory, 2007, 53(10): 3740-3754.
  • 5Sejdinovic D, Piechocki R J, Doufexi A. AND-OR tree analysis of distributed LT codes [ C ] //Proceedings 2009 IEEE Information Theory Workshop on Networking and In- formation Theory. Volos, Greece: IEEE, 2009: 261-265.
  • 6Liau A, Kim I, Yousefi S. Improved Low-Complexity Soliton-Like Network Coding for a Resource-Limited Re- lay [ J]. IEEE Transactions on Communications, 2013, 61 (8) : 3327-3335.
  • 7Lu F, Foh C, Cai J, et al. LT codes decoding: Design and analysis [ C ] //2009 IEEE International Symposium on Information Theory (IS1T 2009 ). Seoul, Korea: IEEE, 2009: 2492-2496.
  • 8Shao H, Xu D, Zhang X. Asymptotic Analysis and Opti- mization for Generalized Distributed Fountain Codes[J]. IEEE Communications Letters, 2013, 17 (5) : 988-991.
  • 9Luby M G, Mitzenmacher M, Shokrollahi M A. Analysis of random processes via And-Or tree evaluation [ C ] // Proceedings of the Ninth Annn,,d ACM-SIAM Symposium on Discrete Algorithms. San Francisco, USA: Society for Industrial and Applied Mathematics, 1998: 364-373.
  • 10GarciaI,SakaguchiK,ArakiK.Cell Planning for Cooperative Transmission[C].Las Vegas: Wireless Communications and Networking Conference(WCNC'08),2008:1769-1774.

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部