Abstract | ||
---|---|---|
AbstractThis paper presents the clustering-based and distributed anchor-free positioning CDAP, a beacon-free node localisation algorithm for wireless sensor networks. When there is no beacon node, the improved clustering algorithm based on node density ICAND algorithm is used for clustering. The proposed algorithm combines the angle measurement and the distance measurement to calculate the coordinates of all nodes in the regional coordinate system. Experiments show that the CDAP algorithm performs well in network coverage, positioning error and communication overhead rate, compared with the industry-recognised clustering SPA algorithm. The network coverage is increased by at least 51.3%. In addition, when the node density is larger than 0.9, the positioning error rate is reduced to 22.3% on average. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1504/IJSN.2017.081066 | Periodicals |
Field | DocType | Volume |
Coordinate system,Distance measurement,Key distribution in wireless sensor networks,Computer science,Word error rate,Computer network,Brooks–Iyengar algorithm,Algorithm,Pre-determined overhead rate,Cluster analysis,Wireless sensor network | Journal | 12 |
Issue | ISSN | Citations |
1 | 1747-8405 | 0 |
PageRank | References | Authors |
0.34 | 5 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Li Jian Chen | 1 | 0 | 0.68 |
Wei Yuan Zhou | 2 | 0 | 0.68 |
Keji Mao | 3 | 7 | 6.09 |
Ming Xia | 4 | 1 | 1.02 |
Ruohong Huan | 5 | 18 | 6.30 |