摘要
针对传统覆盖算法在求解覆盖度时计算量较大、算法复杂度过高,从而导致算法效率过低,提出一种基于概率模型的覆盖算法。首先该概率模型通过调度覆盖区域内的节点状态来实现对覆盖区域监测,保证了所关注目标节点被传感器节点均匀覆盖的同时又优化了网络资源;其次对不同的覆盖区域利用概率期望值及相应定理求出满足覆盖条件下最少传感器节点数。仿真实验结果表明,该算法在保证网络覆盖质量要求时能够有效地减少活跃节点的数量,延长了网络的生存时间。
A great deal of complicated calculation to figure out the coverage in traditional covering algorithm results in low efficiency of the algorithm. This paper put forward an coverage algorithm based on probability model. Firstly,this probability model monitored the coverage region by scheduling the nodes in the coverage region. In this way,target nodes could be covered equally by the sensor nodes and network resources could be optimized. Then,the number of the least sensor nodes could be figured out in different coverage regions by using expected values of probability. The simulation experiment shows that the number of active nodes can be decreased efficiently and the network＇s suvival time can be prolonged besides quanrantee of the required quality of network coverage.
出处
《计算机应用研究》
CSCD
北大核心
2010年第12期4673-4676,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(60876014)
河南省自然科学基金资助项目(2009B110012)
河南省科技厅攻关基金资助项目(102300410140)
关键词
无线传感器网络
概率模型
覆盖
算法
wireless sensor network（ WSN）
probability model
coverage
algorithm
