一种高效的动态概率广播算法及其概率模型检测分析

Analysis of an Efficient Dynamic Probability Broadcasting Algorithm Based on Probabilistic Model Checking

在AdHoc网络中,广播有着相当广泛的应用,其算法的效率极大地影响着网络的性能.本文基于DP算法提出了BN-DP算法,考虑了节点分布、计数器值以及收发节点间距离对广播算法的影响,赋予处于接收边缘的节点更高的转发概率.然后使用概率模型检测工具PRISM,分析了计数器值和节点分布对BN-DP算法性能的影响.结果表明:在相同可达率的情况下,所提出的BN-DP算法与FP、DP算法相比,减少了转发分组的数量,提高了广播效率.

Broadcasting is a common operation in Ad Hoc networks. The efficiency of broadcasting algorithm can dramatically affect the performance of the entire network. Based on dynamic probability broadcasting （DP） algorithm,border-node-first dynamic probability broadcasting （BN-DP） algorithm is presented. The influence of nodes density, package counter and distance between sender and receiver on the performance of broadcasting algorithm is considered in BN-DP algorithm. Nodes located at the radio border of the sender are set with higher rebroadcast probability. Analyses with PRISM reveal that BN-DP algorithm operates more efficiently than the FP （fixed probability） algorithm and DP algorithm do. With the same reachability, it saves more rebroadcasts and reduces overheads.