Small-error positioning method for wireless sensor network
A wireless sensor and positioning method technology, applied in positioning, wireless communication, radio wave measurement system, etc., can solve the problems of less distribution of nodes, discrete, iterative errors, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0055] Such as Figure 1 to Figure 6 shown.
[0056] The parameter design of the network is shown in Table 1.
[0057] Table 1 Simulation parameter settings
[0058]
[0059] Such as figure 2 As shown in the initial node distribution diagram, where * mark points are the distribution of known nodes (beacon nodes), ● is the distribution of unknown nodes, in this figure, there are 20 beacon nodes, 80 unknown nodes, and there are 100 nodes.
[0060] Therefore, the coordinates of beacon nodes 1, 2, 3, 4, ..., 20 in the wireless sensor network are (x 1 ,y 1 ),(x 2 ,y 2 ),(x 3 ,y 3 ),...,(x 20 ,y 20 ), the coordinates of the unknown node C are (x, y); including the following steps:
[0061] Step A: Through a typical distance vector exchange protocol, each beacon node in the network broadcasts its own location information packet to neighboring nodes, so that all nodes in the network obtain the minimum hop information from the beacon node, so that all nodes record The ...
Embodiment 2
[0076] Such as Figure 1 to Figure 6 shown.
[0077] The parameter design of the network is shown in Table 1.
[0078] Table 1 parameter setting
[0079]
[0080]
[0081] Such as figure 2 As shown in the initial node distribution diagram, where * mark points are the distribution of known nodes (beacon nodes), ● is the distribution of unknown nodes, in this figure, there are 20 beacon nodes, 80 unknown nodes, and there are 100 nodes.
[0082] Therefore, the coordinates of beacon nodes 1, 2, 3, 4, ..., 20 in the wireless sensor network are (x 1 ,y 1 ),(x 2 ,y 2 ),(x 3 ,y 3 ),...,(x 20 ,y 20 ), the coordinates of the unknown node C are (x, y); including the following steps:
[0083] Step A: Through a typical distance vector exchange protocol, each beacon node in the network propagates its own location information packet to neighboring nodes, so that all nodes in the network obtain the minimum hop information from the beacon node, so that all nodes record The ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 
PatSnap Eureka turns technology decisions into work you can execute. Powered by our Innovation Knowledge Graph, it runs expert workflows across engineering, life sciences, materials and intellectual property. Get your review-ready output in minutes.
