摘要
在给定每个离散的网格点的覆盖度要达到K,精确度达到T的条件下,提出了一种基于概率模型的覆盖算法,并在Matlab中进行模拟.将该算法与平均算法、随机算法的模拟结果相比较,得出在相同前提下该算法所需的传感器数目最少.
Under the condition that the coverage of each discrete grid point is K and the precision is T,a new covering algorithm based on the probability model was proposed,which can be simulated with Matlab.Simulation results showed that the least sensors are needed in this new algorithm compared with the mean algorithm and the randomized algorithm.
出处
《海南大学学报(自然科学版)》
CAS
2010年第3期248-251,共4页
Natural Science Journal of Hainan University
基金
广东省科技计划项目(2009B01080030)
国家自然科学基金天元基金项目(10926141)
关键词
网格点覆盖
概率传感模型
贪婪启发式算法
grid coverage
probabilistic sensor model
greedy heuristic algorithm