传感器网络中基于抑制点过程的随机调度覆盖控制算法

An Effective IRSCCA(Inhibiton Point Process Based Random Scheduling Coverage Control Algorithm) Algorithm in Wireless Sensor Networks

现有随机调度覆盖控制算法由于节点加入不相交覆盖子集的完全随机性,会出现节点分布不均匀、额外唤醒节点过多的问题。文章通过理论分析给出了存在边界效应时满足覆盖质量要求的随机覆盖集节点数量的下界,然后根据抑制点过程理论对节点分布均匀性进行了量化建模,并给出了最优抑制距离搜索方法,在此基础上提出了一种基于抑制点过程的随机调度覆盖控制算法(IRSCCA),IRSCCA算法采用基于抑制机制的不相交覆盖子集划分规则来改善各覆盖子集节点分布的均匀性,通过自适应额外唤醒规则保证各覆盖子集到Sink的连通性。仿真结果表明,与现有算法相比IRSCCA算法可以显著改善覆盖子集中节点分布的均匀性,提供更好的覆盖质量,并能有效减少额外唤醒节点数量。

Aiming at non-uniformity of node distribution and excessive extra-on nodes due nodes＇ joining disjoint cover subsets in traditional algorithms, we propose our IRSCCA through 4 of the full paper explain our IRSCCA algorithm mentioned in the title, which we to full randomization in algorithm. Sections 1 believe is effective and whose core consists of： （ 1 ） we analyze theoretically the minimal number of nodes that belong to random cover sub- set satisfying required coverage quality; （2） we model quantitatively the spatial regulari cording to inhibition point process theory and present an optimal inhibition distance searc ty of node distribution ac- h approach; （3） IRSCCA algorithm utilizes disjoint cover subset partition rule based on inhibition mechanism to improve the uniformity of node distribution in each cover subset and to ensure each cover subset＇ s connectivity from source to sink by an a- daptive extra-on rule. Simulation results, presented in Figs. 2 and 3, and their analysis show preliminarily that IR- SCCA algorithm can indeed provide higher coverage quality as a result of more uniform node distribution in each cover subset while reducing the number of extra-on nodes as compared with the traditional algorithm.