摘要
在无线传感器网络中,为降低目标覆盖问题的复杂度,给出3种减小网络规模的方法,即删除冗余节点、删除冗余目标、将目标覆盖图分解成多个独立子图。分别证明这3种方法的正确性,并提出构造独立子图算法。仿真结果表明,该算法可以减少30%的网络规模,并降低目标覆盖问题的算法复杂度。
In order to reduce the algorithm complexity of the target coverage problem in Wireless Sensor Network（WSN）,three approaches are designed to decrease the network scale.Of the three approaches,one is deleting the redundant sensor nodes,another is removing the redundant targets,and the third is decomposing the target-coverage graph into independent sub-graphs.It proves that the three approaches are correct,and presents the Construct Independent Sub Graph Algorithm（CISGA） to divide target-coverage graph.Measurement results show that CISGA can reduce 30% of network scale and greatly reduce the algorithm complexity of target coverage problem.
出处
《计算机工程》
CAS
CSCD
2013年第1期111-115,共5页
Computer Engineering
基金
湖北省自然科学基金资助项目"流控制传输协议的拥塞控制新型计算模型研究"(09ABA007
2009chb008)
湖北省教育厅科研基金资助项目"视频传输自适应可用带宽算法的研究与应用"(D20101703)
关键词
分解
冗余节点
冗余目标
独立子图
网络规模
decomposition
redundant node
redundant target
independent sub-graph
network scale
