CN110351657A - A kind of method of wireless sensor network interior joint geometry location - Google Patents
A kind of method of wireless sensor network interior joint geometry location Download PDFInfo
- Publication number
- CN110351657A CN110351657A CN201910652558.0A CN201910652558A CN110351657A CN 110351657 A CN110351657 A CN 110351657A CN 201910652558 A CN201910652558 A CN 201910652558A CN 110351657 A CN110351657 A CN 110351657A
- Authority
- CN
- China
- Prior art keywords
- unknown node
- beaconing nodes
- node
- away
- calculated
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/023—Services making use of location information using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
A kind of method that the present invention devises wireless sensor network interior joint geometry center coordination is related to data acquisition and information Perception field in wireless sensor network.This method improves on the basis of traditional DV-Hop location algorithm.Start with first from global network, all beaconing nodes for participating in unknown node positioning is considered, by the way that weighted factor w is arrangedi, calculate the average jump of unknown node away from.It is distributed simultaneously according to the geometric position of unknown node to nearest beaconing nodes, the position coordinates of unknown node is calculated using centroid localization algorithm.The present invention proposes mixed positioning algorithm, effectively increases the positioning accuracy of node in the case where not increasing additional hardware requirement.
Description
Technical field
The present invention relates in wireless sensor network data acquisition and information Perception field, specifically devise a kind of wireless
The method of sensor network interior joint geometry center coordination.
Background technique
Wireless sensor network WSN (Wireless Sensor Net-work) combines sensor technology, micro-electro-mechanical systems
System technology, embedded computer technology, distributed information processing, network technology and the communication technology are information Perception sum numbers
According to a revolution in acquisition field.WSN be using sensor as network node, between node can collaboratively real-time monitoring, perception
With the information for acquiring various monitoring objects and it is handled, then by information Wireless transceiver in a manner of from the network for organizing multi-hop
To user terminal, to realize the connection of physical world, PC World and the human society ternary world.
Node locating technique is one of the key technology in application of higher wireless sensor network, according in position fixing process whether
The distance between measuring node is needed, Wireless Sensor Network Located Algorithm can be divided into ranging localization (Range-based) algorithm
With non-ranging (Rang-free) location algorithm.The former needs the distance or angle information between measuring node, as trilateration,
The calculate nodes such as triangulation position.The latter is not necessarily to distance and angle information, realizes node according only to network connectivty etc.
Positioning, Range-based location algorithm proposes higher requirement to the hardware facility of network, while to produce in position fixing process
Raw a large amount of calculating and communication overhead.Therefore Rang-free location algorithm relies on it in cost, the advantage of power consumption, by more
Come more concern and application.But the type algorithm has that positioning accuracy is low, therefore in recent years, how people are with regard to mention
High node positioning accuracy proposes many optimization algorithms.
Summary of the invention
The method that the present invention devises a kind of geometry center coordination of wireless sensor network interior joint.It is wireless for solving
In sensor network environment, based on the low problem of unknown node positioning accuracy in Rang-free location algorithm, in order to reach the mesh
, this method improves on the basis of traditional DV-Hop location algorithm.Start with first from global network, considers all ginsengs
With the beaconing nodes of unknown node positioning, pass through setting weighted factor wi, calculate the average jump of unknown node away from.Basis simultaneously
Unknown node calculates the position coordinates of unknown node using centroid localization algorithm to the position of nearest beaconing nodes.
It is different from existing processing method, the beneficial effects of the present invention are: estimating in traditional DV-Hop localization method
Calculate the average jump of unknown node away from when, unknown node only receives the average jumps of nearest beaconing nodes away from and by other beacon sections
The data information that point is sent is cast out, thus only considered nearest beaconing nodes to its it is average jump away from influence, have ignored entire
Influence of the network to it, the result obtained in this way is easy to produce mistake and position error is larger.Secondly, tradition DV-Hop positioning is calculated
Method estimates the position of unknown node using multilateration, more demanding to the position distribution of beaconing nodes, therefore for not
The beaconing nodes for meeting distribution occasion can generate very big position error, therefore the present invention is in the feelings for not increasing additional hardware requirement
Under condition, mixed positioning algorithm is proposed, effectively increases the positioning accuracy of node.
Detailed description of the invention
Fig. 1 is geometry center coordination node distribution map；Fig. 2 is a kind of wireless sensor network interior joint of the present invention
The flow chart of the method for geometry center coordination.
Specific embodiment
It please refers to shown in Fig. 2:
1, a kind of method of wireless sensor network interior joint geometry center coordination, which is characterized in that the method includes
Following steps:
Step 1: beaconing nodes broadcast beacon messages in the whole network, location information in message comprising this beaconing nodes and
The parameter for the expression hop count that one initial value is 0.Unknown node is according to the information updating jumping figure value received from beaconing nodes.Into
Step 2；
Step 2: unknown node averagely jump away from calculating, be arranged weighted factor wi, start with from global angle, consider all
Participate in positioning beaconing nodes unknown node is averagely jumped away from influence, calculate the average jump of unknown node away from and unknown node
To the estimated distance of beaconing nodes, three are entered step；
Step 3: unknown node position coordinates calculate, and are distributed according to the geometry of unknown node and nearest beaconing nodes, use
Geometry centroid localization algorithm finally calculates the position coordinates of unknown node；
2, the method for a kind of wireless sensor network interior joint geometry center coordination according to claim 1, it is special
Sign is, unknown node is obtained described in step 1 to beaconing nodes dataset acquisition method the following steps are included:
Step 1: according to flooding agreement, broadcast beacon messages, unknown node receive ginseng to beaconing nodes in a network first
After the beacon message of the beaconing nodes of positioning, routing table is created, and be continuously updated in communication process, entered step
Two；
Step 2: and then after unknown node receives beacon message, it can search whether that in the routing table there are phases first
Answer the record of beaconing nodes hop count information.If record is not present, node will record the beaconing nodes in the routing table
Beacon message.If record exists, the message with minimum hop count value is saved, the message with larger jumping figure value is abandoned, passes through
This mechanism, all nodes all obtain the minimum hop count information of each beaconing nodes in network；
3, the method for a kind of wireless sensor network interior joint geometry center coordination according to claim 1, it is special
Sign is, unknown node described in step 2 averagely jump away from calculating the following steps are included:
Step 1: weighted factor wiShadow of the calculating by range error and neighbor beacon node between nodes
It rings, the minimum hop count between beaconing nodes i and j is hij, the average jump of beaconing nodes i is away from HopSizeiIt is calculated by formula (1)
It arrives, the estimated distance between beaconing nodes i and jIt is calculated by formula (2), then weighted factor wiFor calculation formula (3):
Wherein, erriIt is other beaconing nodes to error caused by beaconing nodes i, is calculated according to formula (4).
According to the weighted factor w calculated in formula (3)i, subsequently into step 2；
Step 2: according to the weighted factor w calculated in step 1iAverage jump with beaconing nodes i is away from HopSizei, use
Formula (5) calculates the average jump of unknown node m in global network away from HopSizem。
4, the method for a kind of wireless sensor network interior joint geometry center coordination according to claim 1, it is special
Sign is, unknown node position coordinates described in step 3 calculate the following steps are included:
Step 1: according to traditional DV-Hop location algorithm, unknown node X is calculated using multilaterationmCoordinate
(xm, ym), it selects apart from unknown node XmThe smallest beaconing nodes A of hop counti(xi, yi)。
Step 2: respectively with beaconing nodes AiWith unknown node XmFor the center of circle, two round S are constructed respectively1And S2, wherein
BiAnd CiFor two round intersection points, then two intersection points Bs are found out according to Fig. 1iAnd CiCoordinate:
Wherein, unknown node XmCoordinate be (xm, ym), unknown node XmWith beaconing nodes AiThe distance between be dmi, not
Know the average jump of node away from for HopSizem, beaconing nodes AiAverage jump away from for HopSizem。
Step 3: two intersection points Bs are calculated according to step 2i(xBi, yBi) and Ci(xCi, yCi).Finally according to formula (7)
Calculate unknown node coordinate:
The above description is only an embodiment of the present invention, is not intended to limit the scope of the invention, all to utilize this hair
The equivalent structure or processes is waited to convert that bright specification and accompanying drawing content are done, are applied directly or indirectly in correlative technology field,
It similarly include in scope of patent protection of the invention.
Claims (4)
1. a kind of method of wireless sensor network interior joint geometry center coordination, which is characterized in that the method includes following
Step:
Step 1: beaconing nodes broadcast beacon messages in the whole network, the location information in message comprising this beaconing nodes and one
The parameter for the expression hop count that initial value is 0.Unknown node is according to the information updating jumping figure value received from beaconing nodes.It enters step
Two；
Step 2: unknown node averagely jump away from calculating, be arranged weighted factor wi, start with from global angle, consider that all participations are fixed
The beaconing nodes of position unknown node is averagely jumped away from influence, calculate the average jump of unknown node away from unknown node to beacon
The estimated distance of node, enters step three；
Step 3: unknown node position coordinates calculate, and are distributed according to the geometry of unknown node and nearest beaconing nodes, using geometry
Centroid localization algorithm finally calculates the position coordinates of unknown node.
2. a kind of method of wireless sensor network interior joint geometry center coordination according to claim 1, feature exist
In, unknown node is obtained described in step 1 to beaconing nodes dataset acquisition method the following steps are included:
Step 1: according to flooding agreement, broadcast beacon messages, unknown node receive participation and determine beaconing nodes in a network first
After the beacon message of the beaconing nodes of position, routing table is created, and be continuously updated in communication process, enter step two；
Step 2: and then after unknown node receives beacon message, it can search whether there is corresponding letter in the routing table first
Mark the record of node hop count information.If record is not present, node will record the beacon of the beaconing nodes in the routing table
Message.If record exists, the message with minimum hop count value is saved, the message with larger jumping figure value is abandoned, passes through this
Mechanism, all nodes all obtain the minimum hop count information of each beaconing nodes in network.
3. a kind of method of wireless sensor network interior joint geometry center coordination according to claim 1, feature exist
In, unknown node described in step 2 averagely jump away from calculating the following steps are included:
Step 1: weighted factor wiCalculating by between nodes range error and neighbor beacon node influenced, beacon
Minimum hop count between node i and j is hij, the average jump of beaconing nodes i is away from HopSizeiIt is calculated by formula (1), beacon
Estimated distance between node i and jIt is calculated by formula (2), then weighted factor wiFor calculation formula (3):
Wherein, erriIt is other beaconing nodes to error caused by beaconing nodes i, is calculated according to formula (4).
According to the weighted factor w calculated in formula (3)i, subsequently into step 2；
Step 2: according to the weighted factor w calculated in step 1iAverage jump with beaconing nodes i is away from HopSizei, use formula
(5) the average jump of unknown node m in global network is calculated away from HopSizem。
。
4. a kind of method of wireless sensor network interior joint geometry center coordination according to claim 1, feature exist
Calculate in, unknown node position coordinates described in step 3 the following steps are included:
Step 1: according to traditional DV-Hop location algorithm, the coordinate (x of unknown node Xm is calculated using multilaterationm,
ym), it selects apart from the smallest beaconing nodes A of unknown node Xm hop counti(xi, yi)。
Step 2: respectively with beaconing nodes AiWith unknown node XmFor the center of circle, two round S are constructed respectively1And S2, wherein BiAnd Ci
For two round intersection points, then two intersection points Bs are found out according to Fig. 1iAnd CiCoordinate:
Wherein, unknown node XmCoordinate be (xm, ym), unknown node XmWith beaconing nodes AiThe distance between be dmi, unknown section
The average jump of point is away from for HopSizem, beaconing nodes AiAverage jump away from for HopSizem。
Step 3: two intersection points Bs are calculated according to step 2i(xBi, yBi) and Ci(xCi, yCi).Afterwards, it is calculated not according to formula (7)
Know node coordinate:
。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910652558.0A CN110351657A (en) | 2019-07-16 | 2019-07-16 | A kind of method of wireless sensor network interior joint geometry location |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910652558.0A CN110351657A (en) | 2019-07-16 | 2019-07-16 | A kind of method of wireless sensor network interior joint geometry location |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110351657A true CN110351657A (en) | 2019-10-18 |
Family
ID=68179156
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910652558.0A Pending CN110351657A (en) | 2019-07-16 | 2019-07-16 | A kind of method of wireless sensor network interior joint geometry location |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110351657A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112055305A (en) * | 2020-08-28 | 2020-12-08 | 太原理工大学 | Two-circle intersection point positioning method for unknown sensor nodes of wireless sensor network |
| CN113971873A (en) * | 2021-08-20 | 2022-01-25 | 广州杰赛科技股份有限公司 | Dangerous chemical substance detection method and device based on wireless sensor network and storage medium |
-
2019
- 2019-07-16 CN CN201910652558.0A patent/CN110351657A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112055305A (en) * | 2020-08-28 | 2020-12-08 | 太原理工大学 | Two-circle intersection point positioning method for unknown sensor nodes of wireless sensor network |
| CN113971873A (en) * | 2021-08-20 | 2022-01-25 | 广州杰赛科技股份有限公司 | Dangerous chemical substance detection method and device based on wireless sensor network and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Peng et al. | Angle of arrival localization for wireless sensor networks | |
| Luo et al. | Reliable and cooperative target tracking based on WSN and WiFi in indoor wireless networks | |
| CN102395193B (en) | Method for locating wireless sensor network (WSN) | |
| CN109375168B (en) | RSSI-based low-speed moving vehicle positioning method | |
| Villas et al. | 3D localization in wireless sensor networks using unmanned aerial vehicle | |
| CN105430745A (en) | Wireless network positioning method based on RSSI (Received Signal Strength Indicator) | |
| Sivakumar et al. | Meta-heuristic approaches for minimizing error in localization of wireless sensor networks | |
| CN103491506A (en) | Method and system for cooperatively locating heterogeneous network based on WLAN and WSN | |
| CN102665277A (en) | Method for locating nodes in wireless sensor network (WSN) | |
| CN103648164A (en) | Time difference of arrival and Gossip algorithm based wireless sensor network distributed positioning method | |
| CN103929717A (en) | Wireless sensor network positioning method based on weight Voronoi diagrams | |
| Tseng et al. | Enhanced Gaussian mixture model of RSSI purification for indoor positioning | |
| Thaeler et al. | iTPS: an improved location discovery scheme for sensor networks with long-range beacons | |
| Hadir et al. | An optimized DV-hop localization algorithm using average hop weighted mean in WSNs | |
| CN110996388A (en) | DV-Hop positioning method based on anchor node selection and random sampling particle swarm | |
| CN110351657A (en) | A kind of method of wireless sensor network interior joint geometry location | |
| KR101597690B1 (en) | Virtual radio map construction method for wireless positioning and apparatus thereof | |
| CN104105197A (en) | Iteration method for processing node overturn ambiguity in wireless sensor network node location | |
| CN108924734B (en) | Three-dimensional sensor node positioning method and system | |
| CN108845308B (en) | Weighted centroid positioning method based on path loss correction | |
| Zhipeng et al. | An improved hop size estimation for DV-hop localization algorithm in wireless sensor networks | |
| Xiang et al. | An improved DV-hop algorithm based on iterative computation for wireless sensor network localization | |
| Wang et al. | A New Type of Weighted DV-Hop Algorithm Based on Correction Factor in WSNs. | |
| TW201624001A (en) | System and method for regional positioning | |
| KR20090131067A (en) | Apparatus and method for node localization in wireless networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20191018 |