摘要
将无线传感器网络的节点部署问题抽象为圆覆盖问题;证明了当3个相同覆盖范围的节点构成边长为3的等边三角形时,节点的覆盖程度达到最大值82.7%.假设节点为势力场中的粒子,根据节点间力的作用部署节点,设计了CE-VFA算法,并在M atlab平台上对算法进行了仿真.结果显示,CE-VFA算法获得较好的网络部署效果,在消耗较少能量的前提下可以很好地改进原有部署的覆盖程度和覆盖效率,覆盖程度可以达到90%以上.*
Deployment in wireless sensor networks （WSNs） is discussed and analyzed as a disk coverage problem. The theorem is proved that the maximum coverage is 82.7% when three sensors with the same sensing range are deployed as an equilateral triangle whose side is √3. The sensors are supposed as the particles in potential field, in which deployment of the sensors is adjusted by the virtual force. A deployment algorithm Coverage Efficient Virtual Force Algorithm （CE-VFA） is presented and simulated on Matlab, The results show that CE-VFA can improve coverage degree and coverage efficiency with less energy consumption, and the coverage degree can be improved more than 90%.
出处
《信息与控制》
CSCD
北大核心
2006年第2期147-153,共7页
Information and Control
基金
国家自然科学基金重点资助项目(60434030)
关键词
无线传感器网络
能量有效
节点部署
虚拟力
wireless sensor network（WSN）
energy efficiency
deployment
virtual force
