关键词: 节点布置, 区域覆盖, 节点聚类, 虚拟力, [k]-中心

Abstract: Node placement becomes more important with the increasing of data. It not only determines the coverage of the networks, but also influences the energy consumption, efficiency and other factors. Therefore, it is necessary to do researches about node placement to improve the networks performance. The node placement problem contains two subproblems, area coverage problem and center selection problem. For area coverage problem, it uses the virtual force method that makes each node moves according to its forces, extending the coverage. For center selection problem, it proposes two different[k]-center algorithms to cluster these nodes, decreasing the communication cost between nodes. In the end, it implements many simulations to detect the algorithms. They can deal with the node placement problem perfectly and improve the networks performance.

Key words: node placement, area coverage, node clustering, virtual force, [k]-center