2017
DOI: 10.1007/s11276-017-1505-2
|View full text |Cite
|
Sign up to set email alerts
|

CRWSNP: cooperative range-free wireless sensor network positioning algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 41 publications
0
5
0
Order By: Relevance
“…The so-called sensor device refers to a device that integrates wireless communication capabilities, embedded computing capabilities, perception capabilities, and storage capabilities. These devices can perform simple monitoring tasks and information processing tasks, and a large number of sensor nodes are combined to form a wireless sensor network [18]. At present, wireless Mesh networks have been widely used in the formation of Internet networks such as home networks and community networks, such as common WIFI mesh networks and campus wireless networks.…”
Section: Wireless Sensor Networkmentioning
confidence: 99%
“…The so-called sensor device refers to a device that integrates wireless communication capabilities, embedded computing capabilities, perception capabilities, and storage capabilities. These devices can perform simple monitoring tasks and information processing tasks, and a large number of sensor nodes are combined to form a wireless sensor network [18]. At present, wireless Mesh networks have been widely used in the formation of Internet networks such as home networks and community networks, such as common WIFI mesh networks and campus wireless networks.…”
Section: Wireless Sensor Networkmentioning
confidence: 99%
“…This method needs extra hardware and therefore increases the cost and power consumption. Moreover, Darakeh et al [13] introduced the DCRL-WSN localization method which defines a ball-shaped extended bound for each node and takes advantage of the certainty rule for reducing this area.…”
Section: Related Workmentioning
confidence: 99%
“…Then, a bounding box zone is estimated for every node (the unknown node) based on the radio radius of the anchor and extended bounds of the nodes by evaluating two constrained convex optimization problems. Additionally, Darakeh et al [13] attempted to calculate the initial node position using convex optimization and then enhance the position of the nodes by two novel heuristic techniques for location correction. These two methods need plenty of anchor nodes to estimate the position and thus increase the cost and power consumption increment.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…This algorithm used DV-Hop to re-estimate beacon node position to obtain error, and then used the optimal algorithm to find the optimal value of hop distance to improve the positioning accuracy. Reference [11] proposed to use convex programming to find the location estimation of the nodes to be located, and then cooperated with the nodes in several iterations to improve the location estimation of all the nodes to be measured. Compared with the APIT algorithm, it had more accurate location results.…”
Section: Introductionmentioning
confidence: 99%