Abstract | ||
---|---|---|
In wireless sensor networks, there are two key issues to coverage control technology. One is optimal allocation of node resources to meet users sensing demand. The other is node set connectivity, which determines whether the data can be passed to users through base station at last. At present, the connectivity problem of deterministic deployment to target coverage is not researched. So, in this paper, the connectivity problem is firstly introduced for target coverage. At the same time, one connectivity critical condition ensuring node set connectivity for target coverage is proposed. Secondly, one optimal deterministic deployment scheme to maintain node set connectivity is put forward. In this scheme, the minimum spanning tree connecting node subset is established, and connected candidate set is constructed. Then, candidate set is optimized by genetic algorithm. Simulation results show that the optimized deployment scheme can maintain node set connectivity and make the candidate sets’ elements number as little as possible. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1109/MVHI.2010.186 | MVHI |
Keywords | Field | DocType |
optimized deployment scheme,node set connectivity,maintain connectivity,connectivity critical condition,node subset,node resource,connected candidate set,deterministic deployment,target coverage,coverage control technology,wireless sensor networks,connectivity problem,candidate set,computer vision,computer networks,genetic algorithms,minimum spanning tree,wireless sensor network,base station,genetic algorithm,machine vision,connectivity,space technology | Base station,Software deployment,Machine vision,Space technology,Computer science,Computer network,Coverage control,Wireless sensor network,Genetic algorithm,Minimum spanning tree,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.36 | 7 |
Authors | ||
2 |