此应用是基于马尔可夫随机场的新特性：势团势能，初始节点的概率密度。
It is based on the markov random field with new features, such as clique potential, initial nodes probability density.
研究了VP中计算节点集合最佳势的计算方法。
A method for getting the optimal number of computing nodes of a VP.
研究如何在理想状态下使分布达到覆盖度最大化，同时采用虚拟势场方法使节点作扩散运动，以消除网络感知重叠区。
How to maximize the coverage in ideal state is studied. By using virtual potential field, nodes repel each other, which eliminates the sensing overlapping regions.
应用推荐