Name
Abstract | ||
|---|---|---|
In this paper, we introduce a set of sensor networks, called the cascading quadrilateral network, and study how to compute the positions of its nodes in a cooperative way. We investigate the condition for determining whether all the sensor nodes are localizable. If not, we provide a method to detect the un-localizable nodes for the whole network. The necessary and sufficient conditions for the network localizability and node localizability are given from the view of algebraic property, respectively. Specifically, we provide algorithms to show how to detect un-localizable nodes from a partially localizable network. Numerical simulation is provided to show the effectiveness of the developed method of computing positions. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ICCA.2014.6870888 | ICCA |
Keywords | Field | DocType |
cooperative localization,sensor nodes,sensor network,node localizability,algebraic property,partially localizable network,unlocalizable nodes,cascading quadrilateral network,algebra,sensor placement,network theory (graphs),network localizability,estimation,vectors,convergence | Convergence (routing),Distance measurement,Topology,Algebraic number,Computer simulation,Control theory,Quadrilateral,Wireless sensor network,Mathematics,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.37 | 20 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yingfei Diao | 1 | 38 | 2.86 |
| Guoqiang Hu | 2 | 485 | 29.31 |
| Damián Marelli | 3 | 164 | 19.58 |
| Zhiyun Lin | 4 | 1499 | 177.73 |
| Minyue Fu | 5 | 1878 | 221.17 |