CN107995588A - Co-positioned node selecting method based on EFI - Google Patents
Co-positioned node selecting method based on EFI Download PDFInfo
- Publication number
- CN107995588A CN107995588A CN201711099624.3A CN201711099624A CN107995588A CN 107995588 A CN107995588 A CN 107995588A CN 201711099624 A CN201711099624 A CN 201711099624A CN 107995588 A CN107995588 A CN 107995588A
- Authority
- CN
- China
- Prior art keywords
- node
- efi
- fei sheer
- speb
- neighbor
- 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
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
- G01S5/0252—Radio frequency fingerprinting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
- H04W64/006—Locating users or terminals or network equipment for network management purposes, e.g. mobility management with additional information processing, e.g. for direction or speed determination
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Position Fixing By Use Of Radio Waves (AREA)
Abstract
The present invention relates to a kind of co-positioned node selecting method based on EFI, including:The precision thresholding g of alignment system is set according to application demand, and destination node obtains neighbor node set.Destination node updates the edge Fei Sheer information matrixs of itself according to the edge Fei Sheer information matrixs of own edges Fei Sheer information matrixs and the neighbor node received and calculates SPEB respectivelyi,j.Selection makes SPEBi,jThe node j of minimum is simultaneously added to ΓiIn, by i-node from ΔiMiddle removal.After renewalRepeat second and third, four steps, until the positioning accuracy of node is less than or equal to g.Use the position of the node calculate node in Γ.
Description
Technical field
The present invention relates to a kind of co-positioned node selecting method based on EFI.
Background technology
With bringing for mobile Internet epoch, location Based service to positioning propose very high requirement, at any time with
The positional information of ground acquisition Gao Ding becomes the premise of many applications.But the tradition positioning such as now widely used GPS system
Mode is difficult to meet the location requirement under some scenes, co-positioned technology then occurs.Co-positioned technology refers to target
Positioning is realized by cooperating between node, including communication link is established between cooperative node and is used to share location information, pass through
Range-measurement system carrys out the distance between measuring node.There are co-positioned other alignment systems not possess a little, such as reference mode
Density requirements are low, orientation range is wider, positioning accuracy is more high.But the cooperation between node also brings some problems, such as
It is excessive to position the average connection number of network, so as to cause channel congestion and positioning to be delayed.The average connection number of usual co-located
It is more than 10 times of non-co-located, if destination node carries out location estimation using whole nodes in actual location, will expends
Substantial amounts of to calculate the time, real-time is difficult to be guaranteed, and the larger node of error can influence positioning accuracy in auxiliary node.Cause
In position fixing process of cooperating, suitable cooperative node selection algorithm can shorten positioning time and improve positioning accurate for this
Degree.
Currently used neighbors selection algorithm includes being made choice according to signal strength or distance.Also there is base
Neighbor node subset is selected in the method for Cramér-Rao lower bound, this method is that all various combinations are searched in the total space to seek
A certain combination is looked for so that the Cramér-Rao lower bound of node to be positioned is minimum.The side of neighbors is selected according further to channel loss index
Method is to improve positioning accuracy by reducing error that ranging brings as far as possible.In general the factor of co-positioned precision is influenced
Have a range error between the site error of auxiliary node and auxiliary node and the topology distribution of auxiliary node three influence because
Element.
The content of the invention
The object of the present invention is to provide a kind of consumption that can reduce energy and channel resource that location algorithm is brought and
Reduce the positioning node selection algorithm of the time delay of positioning.Technical solution is as follows:
A kind of co-positioned node selecting method based on EFI, comprises the following steps:
The first step:The precision thresholding g of alignment system is set according to application demand, and destination node obtains neighbor node set
Δ。
Second step:Destination node takes house according to the edge of own edges Fei Sheer information matrixs and the neighbor node received
Your information matrix updates the edge Fei Sheer information matrixs of itself and isAnd SPEB is calculated respectivelyi,j。
3rd step:Selection makes SPEBi,jThe node j of minimum is simultaneously added to ΓiIn, by i-node from ΔiMiddle removal.
4th step:After renewalRepeat second and third, four steps, until node positioning accuracy be less than etc.
In g.
5th step:Use the position of the node calculate node in Γ.
The node selection algorithm based on edge Fei Sheer information matrixs (EFI) of the present invention.The algorithm and existing algorithm
Maximum difference is the algorithm not for the purpose of improving maximum positioning accuracy, but on the premise of reaching using needs to the greatest extent
The minimal number of node of possible selection participates in cooperation, with reduce the consumption of energy and channel resource that location algorithm is brought and
Reduce the time delay of positioning.
Brief description of the drawings
Fig. 1 is the geometric interpretation figure of EFI
Fig. 2 is the renewal schematic diagram of EFI, P1Represent destination node, P2Expression cooperative node, the EFI of ellipse representation node,
That is the geometric representation of Fei Sheer information content, it can be found that P1The EFIJ of nodee(p1) significantly increase by cooperative information amount.
Fig. 3 is the locating effect comparison diagram of several method.
Embodiment
The present invention changes the method for traditional assessment information of neighbor nodes amount, but uses EFI (edge Fei Sheer information)
As the information content of characterization neighbor node, and can be on the premise of specified positioning accuracy is reached as far as possible using this method
The quantity of cooperative node is reduced, so as to achieve the purpose that to save positioning system resource consumption.The present invention is with neighbor node to target
Node EFI's influences to weigh the information content contained of neighbor node, and information content is bigger to represent that neighbor node is more conducive to target
The raising of node locating precision.
Position in network, the positional representation of destination node k is pk=[xk,yk]T, neighbor node j is expressed as pj=[xj,yj
]T。φkjRepresent the angle of destination node k and neighbor node j, haveThen ranging direction matrix (RDM) represents
For:Ranging information can be determined by the effective bandwidth and first path signal-to-noise ratio of signal
Intensity (RII) v, computational methods refer to document:
Fundamental Limits of Wideband Localization-Part I:A General
Framework, By:Shen,Yuan;Win,Moe Z.IEEE TRANSACTIONS ON INFORMATION THEORY
Volume:56Issue:10Pages:4956-4980Published:OCT 2010。
The EFI of destination node isWherein μ and η is Je(pk) characteristic value
(μ > η), UαIt is that angle is α spin matrixs, i.e.,
The rotation angle of α, that is, information matrix, is stated to simplify, and the EFI of node is represented with F (μ, η, α).
EFI from new neighbor node is expressed as F (v, 0, φ)=vJr(φ), destination node receives information
Angle is φ, i.e., the relative position of destination node and node to be positioned is φ.When destination node is received from neighbor node
After information F (ν, 0, φ), the EFI of destination node is updated to:
Wherein
And withWeigh the destination node position error after change.
Shown in more new change attached drawings 2 of the EFI of destination node after the information of neighbor node is received.
To achieve the above object, the present invention takes following technical scheme:
The first step:The precision thresholding g of alignment system is set according to application demand, and destination node obtains neighbor node set
Δ。
Second step:Destination node i updates certainly according to the F (ν, 0, φ) of itself EFIF (μ, η, α) and the neighbours j received
The EFI of body isAnd SPEB is calculated respectivelyi,j。
3rd step:Selection makes SPEBi,jThe node j of minimum is simultaneously added to ΓiIn, by i-node from ΔiMiddle removal.
4th step:After renewalRepeat second and third, four steps, until node positioning accuracy be less than etc.
In g.
5th step:Use the position of the node calculate node in Γ.
Referring to Fig. 3:To prove the validity of this method, most common two methods, arest neighbors method compared for:This method
The node nearest from destination node is selected to participate in co-positioned, the foundation of consideration is that distance is to influence signal transmission institute consumed energy
Key factor.Neighbor node LMSE method:This method is by selecting in surrounding neighbours node position mean square error most
Small node participates in cooperation.Result of the comparison proves that the method used in the present invention can select the node of minimum number to participate in
Cooperation.
Claims (1)
1. a kind of co-positioned node selecting method based on EFI, comprises the following steps:
The first step:The precision thresholding g of alignment system is set according to application demand, and destination node obtains neighbor node set Δ;
Second step:Destination node is believed according to the edge Fei Sheer of own edges Fei Sheer information matrixs and the neighbor node received
Breath matrix update itself edge Fei Sheer information matrixs beAnd SPEB is calculated respectivelyi,j;
3rd step:Selection makes SPEBi,jThe node j of minimum is simultaneously added to ΓiIn, by i-node from ΔiMiddle removal;
4th step:After renewalRepeat second and third, four steps, until the positioning accuracy of node is less than or equal to g;
5th step:Use the position of the node calculate node in Γ.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711099624.3A CN107995588A (en) | 2017-11-09 | 2017-11-09 | Co-positioned node selecting method based on EFI |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711099624.3A CN107995588A (en) | 2017-11-09 | 2017-11-09 | Co-positioned node selecting method based on EFI |
Publications (1)
Publication Number | Publication Date |
---|---|
CN107995588A true CN107995588A (en) | 2018-05-04 |
Family
ID=62031447
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201711099624.3A Pending CN107995588A (en) | 2017-11-09 | 2017-11-09 | Co-positioned node selecting method based on EFI |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN107995588A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113269084A (en) * | 2021-05-19 | 2021-08-17 | 上海外国语大学 | Movie and television play market prediction method and system based on audience group emotional nerve similarity |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102185919A (en) * | 2011-05-04 | 2011-09-14 | 江苏大学 | Distributed clustering method of P2P (peer-to-peer) network based on believable radius of nodes |
CN105988971A (en) * | 2015-12-31 | 2016-10-05 | 中国人民解放军后勤工程学院 | State sensing-based sensor space-time sampling method |
CN106714301A (en) * | 2016-12-23 | 2017-05-24 | 深圳信息职业技术学院 | Carrier optimization method in wireless positioning network |
-
2017
- 2017-11-09 CN CN201711099624.3A patent/CN107995588A/en active Pending
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102185919A (en) * | 2011-05-04 | 2011-09-14 | 江苏大学 | Distributed clustering method of P2P (peer-to-peer) network based on believable radius of nodes |
CN105988971A (en) * | 2015-12-31 | 2016-10-05 | 中国人民解放军后勤工程学院 | State sensing-based sensor space-time sampling method |
CN106714301A (en) * | 2016-12-23 | 2017-05-24 | 深圳信息职业技术学院 | Carrier optimization method in wireless positioning network |
Non-Patent Citations (2)
Title |
---|
YUAN SHEN: "Effect of Path-Overlap on Localization Accuracy in Dense Multipath Environments", 《IEEE COMMUNICATIONS SOCIETY SUBJECT MATTER EXPERTS FOR PUBLICATION IN THE ICC 2008 PROCEEDINGS》 * |
ZHOU FEI: "Node selection algorithm based on Fisher information", 《EURASIP JOURNAL ON WIRELESS COMMUNICATIONS & NETWORKING》 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113269084A (en) * | 2021-05-19 | 2021-08-17 | 上海外国语大学 | Movie and television play market prediction method and system based on audience group emotional nerve similarity |
CN113269084B (en) * | 2021-05-19 | 2022-11-01 | 上海外国语大学 | Movie and television play market prediction method and system based on audience group emotional nerve similarity |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105629263B (en) | A kind of troposphere atmosphere delay estimation error correcting method and correction system | |
CN108990129A (en) | A kind of wireless sensor network cluster-dividing method and system | |
CN111556454B (en) | Weighted DV _ Hop node positioning method based on minimum mean square error criterion | |
CN108459298A (en) | A kind of outdoor positioning method based on LoRa technologies | |
CN106125038B (en) | Indoor wireless positioning method based on edge calculations and Bayes posterior probability model | |
CN112469117B (en) | Improved DV-hop positioning method for irregular wireless sensor network | |
CN109429249A (en) | A kind of antenna azimuth optimization method and equipment based on MR location data | |
Yan et al. | Improved hop‐based localisation algorithm for irregular networks | |
CN110336751A (en) | Low-track satellite network routing policy based on membership function | |
CN109039720A (en) | A kind of method for parameter estimation for binary sensor network | |
CN112469115A (en) | FC-MDS (fiber channel-minimum-signal-density-measurement-system) improved wireless sensor network positioning algorithm | |
CN110267279A (en) | Three-dimensional ECDV-Hop localization method based on differential evolution | |
CN109116385A (en) | A kind of long-range network RTK tropospheric delay estimation method based on BP neural network | |
CN109522385A (en) | A kind of determination method of multi-Scale Road Networks M-N match pattern | |
CN101404664A (en) | Network positioning and optimizing algorithm based on node clustering | |
CN107995588A (en) | Co-positioned node selecting method based on EFI | |
CN104965189A (en) | Indoor personnel positioning method based on maximum likelihood estimation | |
WO2020244049A1 (en) | Transition matrix-based ubiquitous power internet of things distributed economic dispatch method | |
Qiu et al. | A localization strategy based on n‐times trilateral centroid with weight | |
CN104994568B (en) | Power distribution method based on Game with Coalitions in network positions | |
Qi et al. | A combined localization algorithm for wireless sensor networks | |
CN112613530B (en) | Method and system for identifying residential area households based on self-adaptive density clustering algorithm | |
CN108966169A (en) | For the Analysis on heavy metal pollution early warning system of agricultural land soil | |
Lin et al. | RSSI measurement with channel model estimating for IoT wide range localization using LoRa communication | |
Deng et al. | Energy management of WSN-based charge measurement system of ultra high-voltage direct-current transmission line |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180504 |
|
RJ01 | Rejection of invention patent application after publication |