摘要
针对已有的无线传感器网络节点随机调度算法存在的问题,即由于节点是利用产生随机数的方法加入到不同的工作子集,从而导致初始子集中节点分布不均,在概率感知模型下提出了一种基于节点平均度的随机调度算法。该算法利用邻居节点之间的信息传输,使得每个节点的邻居节点尽量均匀分散在不同的子集中。通过随机概率理论分析了概率感知模型下网络覆盖度与节点数之间的关系,解决了新算法的节点配置问题。仿真实验证明了新算法的有效性及分析的正确性。
To make the nodes equally distributing in every subset composed o{ some sensor nodes in the existing random scheduling algorithm of wireless sensor networks （WSN）, a random scheduling algorithm based on the average degree of nodes is presented, which is on the basis of a probability sensing model. Taking advantage of information transmission between the neighbor nodes makes the neighbor nodes of every node distribute in different subsets averagely. The relationship between coverage intensity and the number of nodes is analyzed based on the probability sensing model, which resolves the problem of deploying nodes. Simulation verifies the effectiveness and correctness of the proposed algorithm.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2009年第9期2260-2265,共6页
Systems Engineering and Electronics
基金
国家自然科学基金(60674108
60874085)资助课题
关键词
通信技术
无线传感器网络
随机调度算法
网络覆盖度
节点数
communication technique
witless sensor network
random scheduling algorithm
coverage intensity of network
number of nodes
