期刊文献+

无线mesh网络的动态品质优化分析

Analysis on the optimum dynamic quality of wireless mesh network
下载PDF
导出
摘要 为获得全控型无线mesh网络的最优控制品质,首先分析影响全控型无线mesh网络控制品质的因素主要为网络时延,而为了获得较好的控制品质必须取得最小的网络时延,建立了最小网络时延的相关优化模型,并应用分支边界算法求解,最后通过相关数值计算和仿真分析,由仿真结果可知通过调节网络节点个数和数据流成功获得信道的概率以及任意节点获得信道后传输成功的概率降低网络时延,从而明显改善整个全控型无线mesh网络的控制品质。 In order to procure the optimum quality of control for full-controlled wireless mesh network, the primary influencing factor network time delay is analyzed. In order to get the optimum quality of control, the minimum network time delay should be acquired, and the algorithm of branch and bound is given to solve this problem. According to the numerical simulation, the quality of control for the whole network system with decreasing the delay time can be optimized by adjusting the number of nodes, the average transmission hop counts, and the probability of successful channel access and transmission for random nodes.
出处 《重庆大学学报(自然科学版)》 EI CAS CSCD 北大核心 2013年第2期51-55,共5页 Journal of Chongqing University
基金 国家863资助项目(No.2008AA01Z202) 国家自然科学基金资助项目(No.60872038) 重庆大学"211工程"三期创新人才培养技术建设项目(No.S-09102) 中央高校基本科研业务费资助项目(No.CDJRC10160005)
关键词 无线MESH网络 时延 优化 wireless mesh network time delay optimization
  • 相关文献

参考文献9

  • 1Sulyman A I, Hassanein H S. WiMAX metro area mesh networks: technologies and challenges [M] ff Misra S, Handbook of wireless mesh networks, London: Springer, 2008.
  • 2Marti P, Y6pez J, Velasco M, et al. Managing quality- of-control in network-based control systems by controller and message scheduling co-design[J]. IEEE Transactions on Industrial Electronics, 2004, 51 (6) : 1159-1167.
  • 3Bienstock D, Chopra S, Giinltik O, et al. Minimum cost capacity installation for multi-commodity network flows[J]. Mathematical Programming, 1998, 81 (2) :177-199.
  • 4Brunetta L, Conforti M, Fischetti M. A polyhedral approach to an integer multicommodity flow prohlem[J]. Discrete Applied Mathematics, 2000, 101 ( 1/2/3) : 13- 36.
  • 5Isazadeh A, Heydarian M. Optimal multicast multichannel routing in computer networks [ J ]. Computer Communications, 2008, 31(17): 4149-4161.
  • 6Mehdi J. Stochastic models in queueing theory[M]. 2rd ed. [S. 1. ] : Academic Press, 2002.
  • 7P6rez-Bellido A M, Salcedo-Sanz S, Ortiz-Garcl'a E G, et al. A dandelion-encoded evolutionary algorithm for the delay-constrained capacitated minimum spanning tree problem [J]. Computer Communications, 2009, 32(1) : 154-158.
  • 8Fontes D B, Hadjiconstantinou E, Christofides N. A branch-and-bound algorithm for concave network flow problems[J]. Journal of Global Optimization. 34 (1) : 127-155.
  • 9Haffner S, Monticelli A, Garcia A V, et al. Specialized branch-and-bound for transmission network expansion planning [J]. IEEE Proceedings of the Generation, Transmission and Distribution, 2001, 148 ( 5 ): 482-488.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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