无线传感器网络k点连通可靠性的研究

Research on the k-Vertex-Connectivity Reliability in Wireless Sensor Networks

无线传感器网络的出现引起了人们的广泛关注,由于无线传感器网络的节点不是预先定位而是随机撒放,那么如何保证一定区域内的传感器节点在满足连通可靠性要求的情况下连结成一张网络?而若干次随机抛撒所形成网络的连通度的平均值与网络的节点个数、节点的通讯半径之间又有何关系?通过计算机仿真模拟试验,给出了网络的k(k>0)连通度概率分布曲线;引入了连通度的数学期望概念来描述若干次抛撒所形成网络的连通度k的平均值,给出了其随网络节点个数、节点通讯半径变化的回归方程;给出了无线传感器网络k点连通概率曲线和3点连通的经验公式;分析了边界节点对网络连通度的影响。这些对无线传感器网络节点个数和节点通讯半径的选择、系统冗余设计等都具有重要的指导意义或参考价值。

The emergence of Wireless Sensor Networks has arisen extensive attention of people. Because the nodes of Wireless Sensor Networks are not placed accurately in advance but cast randomly, how to ensure the nodes in a certain area connect a network under the requirement of connectivity reliability？ What＇s the relationship between the average of networks＇ connectivity and nodes number and radio range？ By computer simulations, the probability distribution graph of k-vertex-connectivity（k〉0）is given. The average of networks＇ connectivity is described by the notion of expectation and the regress equation of expectation, nodes number and radio range is also listed. The graph of k-vertex-connectivity curves and the experiment formula of 5-connected networks are presented. The effect on the connectivity by the boundary nodes is discussed at last. All of these have a significance of guidance and reference to choose nodes number, radio range and system redundancy in the designing of Wireless Sensor Networks.