相关对数阴影信道条件下基于贪婪的最优感知节点集合选择算法

Greedy based sensor set selecting algorithm under correlated log-normal shadowing

为了在资源使用效率与感知性能之间进行有效折中,通过分析感知节点集合的虚警概率上限,提出了一种基于贪婪的最优感知节点集合的自适应选择算法。理论分析结果与仿真结果均表明该算法可以快速地得到最优感知节点集合的近似最优解,并且该近似最优解与最优解之间的差别不大,但是其复杂度却大大降低,具有很好的实用性。

By analyzing the upper bound on the probability of false alarm for a sensor set,an adaptive sensor set selecting algorithm based on greedy with a lower complexity was proposed,which could get a good trade-off between sensing reliability and system resources usage efficiency.Analysis and simulation results both demonstrate that the proposed sensor set selecting algorithm can get the suboptimal sensor set rapidly with lower complexity,and the difference between the selected suboptimal sensor set and the optimal one is minor.