文献类型：期刊文献

英文题名：Decomposition of target coverage graph in wireless sensor network

作者：Zhao, Fang[1]

第一作者：赵芳

通讯作者：Zhao, Fang

机构：[1] Computer and Information Engineering College, Xinxiang University, Xinxiang City, 453000, China

第一机构：新乡学院计算机与信息工程学院

年份：2014

卷号：8

起止页码：567-572

外文期刊名：Open Electrical and Electronic Engineering Journal

收录：EI(收录号：20162602534318);Scopus(收录号：2-s2.0-84975246090)

语种：英文

外文关键词：Sensor nodes

摘要：In order to reduce the algorithm complexity of the target coverage problem in Wireless Sensor Network, three kinds of approaches are designed to decrease the network scale, that is, one is deleting the redundant sensor nodes, another is removing the redundant targets, and the third is decomposing the target coverage graph into multiple independent sub graphs. This paper proves that the three approaches are correct, and presents the Construct Independent Sub Graph Algorithm (CISGA) to divide target coverage graph. Experiment results show that CISGA can reduce 30% of network scale and greatly reduce the algorithm complexity of target coverage problem. ? Fang Zhao; Licensee Bentham Open.