期刊文献+

带有编码冗余控制的机会网络数据转发机制 被引量:2

Coding redundancy controlled data forwarding mechanism in opportunistic networks
下载PDF
导出
摘要 网络编码方法能有效提高数据传输效率,但采用该方法的机会网络数据转发机制均未考虑传输中的编码数据迭代冗余副本控制问题。为了充分降低译码复杂度并减少迭代冗余副本,提出了相遇持续时间估计及编码机会感知方法,进而设计了带有传输容量估计的编码冗余控制数据转发机制。节点以分布式的方式感知数据编码机会,为不同扩散程度的数据确定相应的优先级,并根据传输容量估计结果完成转发控制,以充分利用节点间的相遇持续时间。结果表明,所提出机制有效地减少了网络中的冗余副本,使译码所需的数据量趋于理论上的最小值,改善了网络资源利用率。 The network coding can improve network transmission efficiency. But most of the data forwarding mechanism does not consider the iteration redundancy control during data transmission. In order to reduce the complexity of decod- ing and iteration redundancy copies sufficiently in coding nodes limited network, the encounter duration estimating method and coding opportunity-aware method are proposed. Further, a data forwarding mechanism for coding redun- dancy control with communication capacity estimating method is designed. It can make full use of the encounter duration between nodes to forward the data, which has more coding opportunity and less than the community capacity. Further- more, the coding number of nodes is updated and the iteration redundancy in every generation is controlled. Experimental results show that, the mechanism could reduce the iteration redundancy in the network and minimize data amount re- quired by decoding, which tends to the theoretical minimum and improves the utilization of network resources.
出处 《通信学报》 EI CSCD 北大核心 2015年第3期37-48,共12页 Journal on Communications
基金 国家自然科学基金资助项目(61371097) 重庆市自然科学重点基金资助项目(CSTC2013JJB40001 CSTC2013JJB40006) 重庆市青年科技人才培养计划基金资助项目(CSTC2014KJRC-QNRC40001) 重庆邮电大学青年自然科学基金资助项目(A2012-93)~~
关键词 机会网络 网络编码 冗余控制 传输容量 opportunistic networks network coding redtmdancy control transmission capacity
  • 相关文献

参考文献3

二级参考文献49

  • 1AHLSWEDE R, CAI N, YEUNG R. Network information flow[J]. IEEE Transactions on Information Theory, 2000, 46: 1204-1216.
  • 2LI S Y, YEUNG R, CAIN. Linear network coding[J]. IEEE Transactions on Information Theory, 2003, 49(2):371-381.
  • 3KOETTER R, MEDARD M. An algebraic approach to network coding[J]. IEEE/ACM Transactions on Networking, 2003, 11: 782-795.
  • 4HO T, MEDARD M, SHI J. On randomized network coding[A]. Proceedings of the Annual Allerton Conference on Communication Control and Computing[C]. Monticello, 2003.
  • 5GKANTSIDIS C, RODRIGUEZ E Network coding for large scale content distribution[A]. Proceedings of IEEE Conference on Computer Communications[C]. Miami, 2005. 2235-2245.
  • 6KA'ITI S, HU W J, MEDARD M. The importance of being opportunistic: practical network coding for wireless environments[A]. Proceedings of the Annual Allerton Conference on Communication, Control, and Computing[C]. Monticello, 2005.
  • 7KATTI S, HU W J, MEDARD M. XORs in the air: practical network coding[A]. Proceedings of ACM Conference on Communications Architectures, Protocols and Applications[C]. Pisa, Italy, 2006. 243-254.
  • 8HAMRA A, BARAKAT C, TURLETTI T. Network coding for wireless mesh networks: a case study[A]. Proceedings of the International Symposium on World of Wireless, Mobile and Multimedia Networks [C]. New York, 2006. 103-114.
  • 9LIU J N, GOECKEL D, TOWSLEY D. The throughput order of ad-hoc networks employing network coding and broadcasting[A]. Proceedings of IEEE Military Communications Conference[C]. Washington, 2006. 1-7.
  • 10SENGUPTA S, RAYANCHU S, BANERJEE S. An analysis of wireless network coding for unicast sessions: the case for coding-aware routing[A]. Proceedings of IEEE Conference on Computer Communications[C]. Alaska, 2007. 1028-1036.

共引文献18

同被引文献8

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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