期刊文献+

无线多跳CSMA网络中的编码感知路由

Network coding-aware routing in multi-hop CSMA wireless networks
下载PDF
导出
摘要 为了提高无线多跳CSMA网络的性能,提出了一种编码感知的路由方案JOCR.首先,采用ICN模型,通过引入编码感知路由,构造了基于路由层与MAC层联合优化的最小花费时间模型,且在该模型中权衡了无线CSMA网络环境下的编码机会、流量分配与MAC层性能之间的相互影响.然后,运用序列二次规划法,求解路由层最佳流量分配方案、网络编码方案以及MAC层CSM A协议参数设置方案,以确保系统在最短时间内完成既定数据传输任务.仿真实验结果表明,与现有方案相比,JOCR方案可以减少至少10%的花费时间.编码感知路由、路由层与MAC层的联合优化均可减少最小花费时间,有助于提升无线多跳CSMA网络的性能. To improve the performance of multi-hop CSMA( carrier sensing multiple access) wireless networks,a network coding-aware routing scheme,JOCR( joint optimization coding-aware routing),was proposed. First,based on the ICN( ideal CSNA network) model,a minimum time cost model( MTCM) based on the joint optimization of the routing layer and the MAC( medium access control) layer was constructed by introducing the network coding-aware routing. In the MTCM,the interactions among the coding opportunities,the flowassignment and the performance of the MAC layer in CSMA wireless networks are balanced. Then,the SQP( sequence quadratic program) method was used to obtain the optimal flowassignment scheme on the routing layer,the network-coding scheme and the parameter setting scheme of the CSMA protocol on the MAC layer,making sure that the network system can accomplish all given data delivery tasks with the minimum time cost. The simulation results showthat compared with the existing schemes,the JOCR scheme can reduce at least 10% time cost. Network coding-aware routing and the joint optimization of the routing layer and the MAC layer can reduce the minimum time cost and improve the performance of multi-hop CSMA wireless networks.
出处 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2016年第2期243-248,共6页 Journal of Southeast University:Natural Science Edition
基金 国家自然科学基金资助项目(61202459 61571178)
关键词 CSMA网络 编码感知路由 联合优化 最小花费时间 CSMA(carrier sensing multiple access) networks network coding-aware routing joint optimization minimum time cost
  • 相关文献

参考文献10

  • 1Liew S C, Kai C H, Leung H C, et al. Back-of-the-en- velope computation of throughput distributions in CSMA wireless networks [ J ]. IEEE Transactions on Mobile Computing, 2010, 9(9): 1319-133l.
  • 2Chert M, Liew S C, Shao Z, et al. Markov approxima- tion for combinatorial network optimization [ J ]. IEEE Transactions on Information Theory, 2013, 59 (10) :630l -6327.
  • 3Bellalta B, Zocca A, Cano C, et al. Throughput analy- sis in CSMA/CA networks using continuous time mark- ov networks: A tutorial[ M]//Wireless Networking for Moving Objects. Springer International Publishing, 2014: 115-133.
  • 4Katti S, Rahul H, Hu W, et al. XORs in the air: Prac- tical wireless network coding [ C ] l/Proceedings of ACM Conference on Communications Architectures, Protocols and Applications. Pisa, Italy, 2006: 243- 254.
  • 5Sengupta S, Rayanchu S, Banerjee S. An analysis of wireless network coding for unicast sessions: The case for coding-aware routing [ C ]//Proceeding of IEEE Conference on Computer Communications. Anchorage, Alaska, USA, 2007 : 1028 - 1036.
  • 6Umehara D, Denno S, Morikura M, et al. Throughput analysis of two-hop wireless CSMA network coding [ C ]/Proceeding of IEEE International Conference on Communications (ICC). Cape Town, New Jersey, USA, 2010: 1-6.
  • 7Paramanathan A, Thorsteinsson S, Lucani D E, et al. On bridging theory and practice of inter-session network coding for CSMA based wireless multi-hop networks [ J]. Ad Hoc Networks, 2015, 24 : 148 - 160.
  • 8Diestel R. Graph theory [ M ]. Heidelberg, Germany : Springer-Veflag, 2010:10 - 15.
  • 9de Couto D S J, Aguayo D, Bicket J, et al. A high- throughput path metric for multi-hop wireless routing [J]. Wireless Networks, 2005, 11(4) : 419 -434.
  • 10王宜举,修乃华.非线性最优化理论与方法[M].北京:科学出版社,2011:219-238.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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