Download now Free registration required
The early results from connectivity-based sensor network localization suffer from disappointing accuracy. The reason is partly due to the limited information of the problem and also the deficiencies of the algorithms. This paper proposes a two-level range/indication of connectivity between each pair of nodes, which would indicate three levels of connectivity: strong, weak or nil. Theoretically, the two-level connectivity localization problem can be modeled as a non-convex optimization problem in mathematics, which contains the convex constraints and nonconvex constraints. Besides using two-level range to enrich the given information, a two-objective evolutionary algorithm is also used for searching a solution.
- Format: PDF
- Size: 699.92 KB