期刊文献+

一种基于两测度的无线链路重要性评价方法 被引量:2

A Method for Estimating the Importance of Based on both Sides of the Wireless Networks Link
下载PDF
导出
摘要 基于现实中的网络往往为非对称网络,各条串接链路之间也不是对称的关系,故将某些串联链路的重要性视为相等是不妥当的。该文提出了一种评价无线网络中每条链路重要性的新方法———两测度法,并给出了归一化表达式。通过比较第i条链路失效时整个网络的生成树数目和节点两两之间最短距离的总和,来评价第i条链路的重要性。该方法可以用来判断全网络链路的重要性,并比较任意两条链路的相对重要性,实验结果证明了该方法的正确性。 Based on the reality of the network are asymmetric network,link between each of the series is not a symmetrical relationship,therefore the importance of certain serial link is not appropriate as equal.A both sides of law degree method for estimating the importance of node in wireless networks is proposed.A generalized expression for computing the node score is given.By comparing the i-th link fails the number of spanning tree nodes and the shortest distance between any two sum evaluate the importance of all network links,and compare the relative importance of any two links,the experimental results prove the correctness of the method.
出处 《杭州电子科技大学学报(自然科学版)》 2011年第5期159-162,共4页 Journal of Hangzhou Dianzi University:Natural Sciences
关键词 链路重要性 生成树数目 最短距离总和 networks reliability spanning tree the shortest distance
  • 相关文献

参考文献5

二级参考文献40

  • 1沈波,张世永,钟亦平.无线传感器网络分簇路由协议[J].软件学报,2006,17(7):1588-1600. 被引量:267
  • 2李方敏,徐文君,高超.一种适用于无线传感器网络的功率控制MAC协议[J].软件学报,2007,18(5):1080-1091. 被引量:26
  • 3任智,郭伟,苏静,刘军.基于跨层协同设计的高效AODV改进路由算法[J].计算机学报,2007,30(5):838-844. 被引量:12
  • 4Tsen F P,Sung T Y,Lin M Y,et al.Finding the most vital edges with respect to the number of spanning trces[J].IEEE Trans Reliability,1994,43(4):600-602.
  • 5Rao V.Most-vital edge of a graph with respect to spanning trees[J].IEEE Trans Reliability,1998,47(1):6-7.
  • 6Page L B,Perry J E.Reliability polynomials and link importance in networks[J].IEEE Trans Reliability,1994,43(1):51-58.
  • 7Nardelli E,Proietti G,Widmayer P.A faster computation of the most vital edge of a shortest path[J].Information Processing Letters,2001,79(2):81-85.
  • 8Traldi L.Commentary on:Reliability polynomials and link importance in Networks[J].IEEE Trans Reliability,2000,49(3):322.
  • 9Perkins C, Bhagwat P. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers//Proceedings of the ACM SIGCOMM'94, London, 1994, 234-244.
  • 10Johnson D, Maltz D. Dynamic source routing in Ad Hoe wireless networks. Norwell, MA, USA: Mobile Computing, Kluwer Academic Publishers, 1996.

共引文献76

同被引文献19

  • 1戴伏生,董学励.基于可靠性指标的通信网链路重要性评估方法[J].南京邮电大学学报(自然科学版),2007,27(1):11-19. 被引量:11
  • 2罗景峰,刘艳秋.一种全终端网络可靠性多目标优化模型及求解[J].计算机技术与发展,2007,17(8):23-25. 被引量:2
  • 3Chen Y, Hu AQ, Yip KW, Hu J, et al. Finding the most vital node with respect to the number of spanning trees. IEEE Int. Conf. neural Networks & Signal Processing, 2003, 12: 1670- 1673.
  • 4Wu RZ, Hu XY, Tang LR. Node Importance Evaluation Based on Triangle Module for Optical Mesh Networks. IEEE Conferences. 2011,7:1-4.
  • 5Hu J, Wang B, Lee DY. Evaluating Node Importance with Multi-criteria. IEEE Conferences. 2010,12:792-797.
  • 6Kubat P. Estimation of reliability for communication/com- puter networks simulation/analytic approach. IEEE Trans. on Communication, 1989,37(9):927-9.
  • 7Chen Yong, Hu Aiqun, Yip Kun-Wah, et al.Finding the Most Vital Node with Respect to the Number of Spanning Trees[C]//Proc.of International Conference on Neural Networks and Signal Processing.[S.l.]: IEEE Press, 2003.
  • 8Page L B, Perry J E.Reliability Polynomials and Link Importance in Networks[J].IEEE Transactions on Reliability, 1994, 43(1): 51-58.
  • 9Wu Runze, Hu Xiuyuan, Tang Liangrui.Node Importance Evaluation Based on Triangle Module for Optical Mesh Networks[C]//Proc.of Wireless Communications, Networking and Mobile Computing.Beijing, China: [s.n.], 2011.
  • 10Tsen F P, Sung Ting-Yi, Lin Menyang, et al.Finding the Most Vital Edges with Respect to the Number of Spanning Trees[J].IEEE Transactions on Reliability, 1994, 43(4): 600-602.

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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