Arama Görseller Haritalar Play YouTube Haberler Gmail Drive Daha fazlası »
Oturum açın
Ekran okuyucu kullanıcıları: Erişilebilirlik modu için bu bağlantıyı tıklayın. Erişilebilirlik modu aynı temel özelliklere sahiptir, ancak okuyucunuzla daha iyi çalışır.

Patentler

  1. Gelişmiş Patent Arama
Yayınlanma numarasıCN103200670 A
Yayın türüBaşvuru
Başvuru numarasıCN 201310057842
Yayın tarihi10 Tem 2013
Dosya kabul tarihi25 Şub 2013
Rüçhan tarihi25 Şub 2013
Şu şekilde de yayınlandı:CN103200670B
Yayınlanma numarası201310057842.6, CN 103200670 A, CN 103200670A, CN 201310057842, CN-A-103200670, CN103200670 A, CN103200670A, CN201310057842, CN201310057842.6
Buluş Sahipleri杜利平, 雷雨, 康璐璐, 姜少坤
Başvuru sahibi北京科技大学
Alıntıyı Dışa AktarBiBTeX, EndNote, RefMan
Dış Bağlantılar:  SIPO, Espacenet
Cognitive radio master user location method based on backtracking check convex set projection
CN 103200670 A
Özet
The invention provides a cognitive radio master user location method based on backtracking check convex set projection. L coordinates for sensing a user are regarded as a circle center, a convex set projection algorithm is used for carrying out Mc step rectangular projection iteration on the a master user; mc step backtracking comparing checking is carried out, the distances between adjacent iteration points are computed and are compared with a threshold value lambada; if parts of the distances between the adjacent iteration points are zero or larger than lambada, Mb step projection iteration and mb step backtracking comparing checking on the border of a convex set circular region are carried out, distance values between two adjacent iteration points are computed and are compared with the threshold value lambada again, and if the distance values are all smaller than lambada, the Mb step iteration result bMb is determined as a locating result of position information of the master user. According to the backtracking check convex set projection location algorithm, shortcomings of an existing convex set projection location algorithm are overcome, the location algorithm is good, influence from distance-measuring errors is small, and the method is suitable for a link in which a sensing user acquires the location information of the master user in a cognitive radio network.
Hak Talepleri(5)  şu dilden çevrildi: Çince
1.一种认知无线电网络中对主用户定位的方法,其特征在于,该方法包括以下步骤: 步骤一、以L个感知用户的坐标为圆心,利用凸集投影算法对主用户进行Mc步正交投影迭代,得到Mc个迭代点χ k,其中k = 1,2,3,...,Mc ; 步骤二.对步骤一中获取的Mc个迭代点,进行me步回溯比较检查,计算出相邻迭代点之间的距离I |xm+「xml I,其中,m=Mc-l,...,Mc-mc,并与门限值λ进行比较;步骤三.如果步骤二中的回溯比较检查中,相邻迭代点之间的距离均小于λ且不为零,则将步骤一中最后L个迭代均值作为主用户位置信息的定位结果;如果步骤二中的回溯比较检查中,相邻迭代点之间的距离存在部分为零或大于λ的情况,继续执行步骤四;步骤四.以Mc步迭代结果χΜ。为初始点Iv进行凸集圆域边界上正交投影迭代,迭代检查步数为Mb,得至IJ Mb个迭代点bh,其中h=l, 2,3,...,Mb ; 步骤五.对步骤四中获取的Mb个迭代点,进行mb步回溯比较检查,计算相邻两个迭代点间的距离值I |bn+1-bn| I,其中,n=Mb-l,...,Mb-mb,并与门限值λ进行比较; 步骤六.如果步骤五中的回溯比较检查中,相邻迭代点间的距离值均小于λ,则将步骤四中最后L个迭代均值作为主用户位置信息的定位结果;如果步骤五中的回溯比较检查中,相邻迭代点间的距离值存在大于λ的情况,跳转到步骤四以Mb步迭代结果b-为初始点Iv并变换投影迭代顺序,直到相邻迭代点间的距离值均小于λ。 A cognitive radio network for the primary user positioning method, wherein the method comprises the following steps: Step 1, with the L-aware user coordinates of the center, use POCS algorithm main user Mc step orthogonal projection iteration, get Mc iteration point χ k, where k = 1,2,3, ..., Mc; step two Mc iteration point in step one to get carried me to step back in comparison check and calculate. Step Three If the second step back; xm + "xml I, where, m = Mc-l, ..., Mc-mc, and is compared with a threshold value λ | the adjacent distance between points I Iterative comparison check, the distance between adjacent iterates are less than λ and not zero, the last step of a L iterations mean as a result of the primary user location positioning information; if the step two retrospective comparative examination phase Part zero or greater than the case of a distance λ between adjacent iterates exist, continue to step four;. Step Four to Mc iteration as the initial point Iv result χΜ orthogonal projection on convex sets iterative circle domain boundaries, iterative inspection number of steps Mb, have to IJ Mb iteration point bh, where h = l, 2,3, ..., Mb; Step five Mb iteration step four points to get carried mb step back in comparison check. I calculate the value of the two adjacent distance between iterates | bn + 1-bn | I, where, n = Mb-l, ..., Mb-mb, and λ is compared with a threshold value; Step six if. Fifth step back in comparison check, the distance between the point values of the neighboring iterations are less than λ, then the last step four L iterations mean as a positioning result primary user location information; backtracking comparison check if in step 5, situation exists adjacent distance value is greater than λ iteration point, the jump to step four to Mb iteration as the initial point Iv result b- and transform projection iteration order, until the distance between adjacent value iteration point less than λ.
2.如权利要求1所述的认知无线电网络中对主用户定位的方法,其特征在于,所述步骤一包括: 1.1)初始化步骤:设置初始点Χο,其中X。 2. A method as claimed in cognitive radio networks in the main user locate claim, wherein said step a comprises: 1.1) initialization steps of: providing an initial point Χο, where X. 为任意位置上的一点; 1.2)利用以下公式进行投影迭代: To a point anywhere on; 1.2) using the following formula Projection Iteration:
Figure CN103200670AC00021
其中,PjDi(Xfc)表示正交凸集投影点,dJcosOjo),sin (φ)]τ表示Pi到Pi+1的向量! Wherein, PjDi (Xfc) represents an orthogonal projection onto convex sets points, dJcosOjo), sin (φ)] τ represents vector of Pi to Pi + 1! Pi为第i个感知用户的位置坐标,ie [i,l]。 Pi is the i-th user's perceived position coordinate, ie [i, l]. Di为以第i个感知用户为圆心,以第i个感知用户测得的与主用户之间的距离测量值为半径的凸集圆域。 Di is the i-th sensing users in a circle, circle domain convex set distance to the i-th user perception as measured by the primary user of the measured value between radius.
3.如权利要求1所述的认知无线电网络中对主用户定位的方法,其特征在于,λ的取值大小取决于感知用户对主用户测距结果的平均值,且λ相对于该平均距离是一个很小值。 3. A method as claimed in cognitive radio networks in the main user locate claim, characterized in that the value of λ depends on the size of the average user of the primary user perception ranging results, and λ with respect to the average is a very small distance value.
4.如权利要求1所述的认知无线电网络中对主用户定位的方法,其特征在于,mb与me取值相同,为L的整数倍。 4. A method as claimed in cognitive radio networks in the main user locate claim, characterized in that the same argument mb and me, is an integer multiple of L.
5.如权利要求1所述的认知无线电网络中对主用户定位的方法,其特征在于,所述步骤四包括: .4.1)初始化步骤:1)设置初始点bQ, bQ = xMc .4.2)利用以下公式进行投影迭代: bh+1 = PhmodL (bh),h = 0,1,2,3...Mb-1 其中, 5. A method as claimed in cognitive radio networks in the main user locate claim, wherein said step four include: .4.1) initialization steps: 1) Set the initial point bQ, bQ = xMc .4.2) Iterative projection using the following formula: bh + 1 = PhmodL (bh), h = 0,1,2,3 ... Mb-1 wherein,
Figure CN103200670AC00022
其中,Pi为第i个感知用户的位置坐标,i ∈ [1,L]。 Wherein, Pi is the i-th user's perceived position coordinates, i ∈ [1, L]. di是第i个感知用户测得的与主用户之间的距离测量值; di is the i-th distance measurement sensing users measured between the main users;
Figure CN103200670AC00031
是第i个感知用户所确定的半径为Cli的圆边界。 Is the i-th user perception radius is determined by the circular boundary Cli.
Açıklama  şu dilden çevrildi: Çince

基于回溯检查凸集投影的认知无线电主用户定位方法 Check back projection on convex sets of cognitive radio master user localization

技术领域 Technical Field

[0001] 本发明涉及一种认知无线电网络中对主用户定位的方法,特别涉及一种基于回溯检查的凸集投影定位方法。 [0001] The present invention relates to a method for cognitive radio networks for the primary user positioning, particularly to a method based on POCS positioned back to check.

背景技术 Background

[0002] 随着无线移动通信与计算机网络的结合应用发展越来越成熟,移动互联网已经称为当今世界发展速度最快、市场潜力最大,商业价值最高的发展业务之一。 [0002] With the combined application development of wireless mobile communications and computer networks more and more mature, the mobile Internet has been called the world's fastest growing and one of the highest growth business market with the greatest potential commercial value. 丰富的应用主要依托于文字、图像、视频等信息承载方式,而且随着人们对应用质量的不断追求,要求信息的传递越来越高效、便捷。 Rich applications mainly relying on text, images, video and other information bearer, and as people continue to pursue the application of the quality required to transmit information more efficient and convenient. 这些应用的创新与发展需要较宽频谱和较高下载速率。 Innovation and development of these applications require a wide spectrum and a higher download speed. 认知无线电的概念迎合了频谱重复利用的需要,可以通过对无线环境的感知实现与主用户的冲突避免,利用最优化的决策有效的动态利用频谱空洞。 The concept of cognitive radio spectrum to meet the need for re-use can be perceived by the wireless environment to achieve the primary user of collision avoidance, making optimal use of efficient dynamic use of spectrum holes. 如果能够获取主用户的位置信息,那么对频谱感知的性能将会得到很大提升,并且在后续的频谱资源的管理与分配中也将起到很大的帮助作用。 If you can get the positions of the primary users, then the spectrum sensing performance will be greatly improved, and will also play a very helpful role in the management and distribution of resources in the subsequent spectrum.

[0003] 在认知网络中对主用户进行定位,获取主用户的位置信息的主要作用有以下几个方面: The main role of [0003] the main cognitive network users to locate, acquire positions of the primary user of the following areas:

[0004] 1.为频谱资源管理提供支持。 [0004] 1. spectrum resource management support. 在主用户位置信息已知的情况下,根据其位置信息可以更好地提高频谱利用率,更好地指导感知用户不干扰主用户的频谱使用。 In the primary user location information is known, according to their location information to better spectrum efficiency, better perceived user guide does not interfere with the primary user of spectrum use.

[0005] 2.减小认知网络中用户的功耗。 Power [0005] 2. Reduce the cognitive network users. 在主用户位置信息已知的情况下,认知网络中的感知用户可以根据主用户的位置信息来确定频谱感知的方向,在最小功率的运行状态下,便可以准确判断主用户的频谱使用情况。 In the primary user location information is known, the cognitive network-aware user can determine the direction of the spectrum sensing based on the position information of the main users, at minimum power operating state, we can accurately determine the spectrum using the primary user's situation .

[0006] 3.避免对主用户的干扰。 [0006] 3. To avoid interference to the primary user. 在主用户位置信息已知的情况下,可以结合多天线技术,针对主用户的方向位置进行频谱感知,避免了频谱间相互干扰的可能性。 In the primary user location information is known, it can be combined with multi-antenna technology, spectrum sensing direction of the position for the primary user, to avoid the possibility of mutual interference between spectrum.

[0007] 4.有利于感知用户的位置优化。 [0007] The beneficial location-aware optimization of the user. 在主用户位置信息已知的情况下,根据主用户的位置信息,可以合理的分布感知用户的位置,提高频谱和空间的利用率,更好地避免对主用户干扰。 In the primary user location information is known, the position information of the primary user, can a reasonable distribution of location-aware users, improve the utilization of the spectrum and space, better avoid interference to the primary user.

[0008]目前常用的凸集投影方法包括 Circular POCS,Hyperbolic POCS,Boundary POCS和Hybrid POCS等,其中Hybrid POCS是前两种POCS方法的合并,根据研究结果表明,Hybrid POCS方法的定位精度要优于前几种方法,然而,当主用户远离感知用户时,由于Hybrid POCS算法中双曲线投影定位对于主用户在感知用户多边形之外的情况下收敛点受噪声波动较大,因此误差随着测距增大而增大。 [0008] The most commonly used POCS method includes Circular POCS, Hyperbolic POCS, Boundary POCS and Hybrid POCS, among Hybrid POCS Two POCS method before the merger, according to the research results show that the positioning accuracy Hybrid POCS method is superior Several former method, however, when the main user perception away from the user, because the Hybrid POCS algorithm hyperbolic projection positioned outside the polygon when the user to the main users perceive the convergence point by noise fluctuations, so the error increases as the distance Large increases.

发明内容 DISCLOSURE

[0009] 本发明旨在解决上述技术缺陷,提出一种应用于认知网络中对主用户进行定位的回溯凸集投影算法(BackCheck P0CS)。 [0009] The present invention aims to solve the above technical defects, cognitive network is proposed to apply to the primary user to locate the back POCS algorithm (BackCheck P0CS).

[0010] 该方法包括以下步骤: [0010] The method comprises the steps of:

[0011] 步骤一、以L个感知用户的坐标为圆心,利用凸集投影算法对主用户进行Mc步正交投影迭代,得到Mc个迭代点X k ,其中k = 1,2,3,..., Mc ; [0011] Step one, in order to coordinate the user's perception of L as the center, take advantage of POCS algorithm main user Mc-step iterative orthogonal projection to give Mc iteration point X k, where k = 1,2,3 ,. .., Mc;

[0012] 步骤二.对步骤一中获取的Mc个迭代点,进行me步回溯比较检查,计算出相邻迭代点之间的距离II xm+1-xm II,其中,m=Mc-l,..., Mc-mc [0012] Step Two. Mc iteration point in step one to get carried me to step back in comparison check, calculate the distance between adjacent iterates II xm + 1-xm II, where, m = Mc-l, ..., Mc-mc

[0013] 步骤三.如果步骤二中的回溯比较检查中,相邻迭代点之间的距离均小于λ且不为零,则将步骤一中最后L个迭代均值作为主用户位置信息的定位结果;如果步骤二中的回溯比较检查中,相邻迭代点之间的距离存在部分为零或大于λ的情况,继续执行步骤四; [0013] Step Three positioning if the step two retrospective comparison check, the distance between adjacent points iterations are less than λ and not zero, then the last step a mean of L iterations as the primary user location information results ; if step two retrospective comparative examination of the case part zero or greater than the distance λ between adjacent iterates exist, proceed to step four;

[0014] 步骤四.以Mc步迭代结果χΜ。 [0014] Step Four. In Mc iteration result χΜ. 为初始点Iv进行凸集圆域边界上正交投影迭代,迭代检查步数为Mb,得至IJ Mb个迭代点bh,其中h=l, 2,3,...Mb ; Iv initial point iterative orthogonal projection on convex sets circle domain boundaries, the iterative steps of checking Mb, have to IJ Mb iteration point bh, where h = l, 2,3, ... Mb;

[0015] 步骤五.对步骤四中获取的Mb个迭代点,进行mb步回溯比较检查,计算相邻两个迭代点间的距离值I |bn+1-bn| I,其中,n=Mb-l,...,Mb-mb,并与门限值λ进行比较; . [0015] Step five Mb iteration step four points to get carried mb step back in comparison check, I calculate the value of the two adjacent distance between iterates | bn + 1-bn | I, where, n = Mb -l, ..., Mb-mb, and λ is compared with a threshold value;

[0016] 步骤六.如果步骤五中的回溯比较检查中,相邻迭代点间的距离值均小于λ,则将步骤四中最后L个迭代均值作为主用户位置信息的定位结果;如果步骤五中的回溯比较检查中,相邻迭代点间的距离值存在大于λ的情况,跳转到步骤四以Mb步迭代结果bi为初始点K,并变换投影迭代顺序,直到相邻迭代点间的距离值均小于λ。 [0016] Step Six If you step back in comparison check Fifth, the distance between the point values of the neighboring iterations are less than λ, then the last step four L iterations mean as a positioning result primary user location information; If step five The retrospective comparison check, the distance value exists between neighboring iteration point is greater than λ, and jumps to step four to bi Mb iteration results for the initial point K, and transform projection iteration order until the adjacent iterations between points distance values are less than λ.

[0017] 优选地,所述步骤一包括: [0017] Preferably, said step a comprises:

[0018] 1.1)初始化步骤:设置初始点X(i,其中XtI为任意位置上的一点; [0018] 1.1) initialization steps of: providing an initial point X (i, which is a little XtI anywhere on;

[0019] 1.2)利用以下公式进行投影迭代: [0019] 1.2) using the following formula Projection Iteration:

[0020] [0020]

Figure CN103200670AD00051

[0022] 其中表示正交凸集投影点,di[cos(φ),sin (φ)]T表示Pi到Pi+1的向量A为第i个感知用户的位置坐标,ie [l,L]。 [0022] which represents an orthogonal projection onto convex sets point, di [cos (φ), sin (φ)] T represents the vector Pi A Pi + 1 of the i-th sensing the user's location coordinates, ie [l, L] . Di为以第i个感知用户为圆心,以第i个感知用户测得的与主用户之间的距离测量值为半径的凸集圆域。 Di is the i-th sensing users in a circle, circle domain convex set distance to the i-th user perception as measured by the primary user of the measured value between radius.

[0023] 优选地,λ的取值大小取决于感知用户对主用户测距结果的平均值,且λ相对于该平均距离是一个很小值。 [0023] Preferably, the value depends on the perception of the average size of λ users ranging results of the primary user, and λ with respect to the average distance is a very small value.

[0024] 优选地,mb与me取值相同,为L的整数倍。 [0024] Preferably, mb with me the same values, is an integer multiple of L.

[0025] 优选地,所述步骤四包括: [0025] Preferably, the four steps comprising:

[0026] 4.1)初始化步骤:I)设置初始点b。 [0026] 4.1) initialization steps: I) to set the initial point b. ,b。 , B. = xMc = XMc

[0027] 4.2)利用以下公式进行投影迭代: [0027] 4.2) using the following formula Projection Iteration:

Figure CN103200670AD00052

[0030] 其中,Pi为第i个感知用户的位置坐标,ie [I, L]。 [0030] wherein, Pi is the i-th user's perceived position coordinate, ie [I, L]. Cli是第i个感知用户测得的与主用户之间的距离测量值;Ci={ye R2: I y-Pj I =ClJ是第i个感知用户所确定的半径为(Ii的圆边界。 Cli is the i-th distance measurement sensing users measured between the main users; Ci = {ye R2: I y-Pj I = ClJ is the radius of the i-th sensing users identified as (Ii round of border.

[0031] 该算法基于凸集投影定位算法的改进,弥补了现有凸集投影定位算法的不足,受测距误差的影响相对较小,适合应用于认知无线电网络中感知用户对主用户位置信息的获取环节,能够更准确的实现对主用户的定位。 [0031] The algorithm is based on improved projection convex sets localization algorithm, to make up for the shortcomings of existing POCS localization algorithm, affected by the distance error is relatively small, suitable for cognitive radio networks in the main user's location-aware users Get aspects of information, it is possible to achieve more accurate positioning of the primary user.

附图说明 Brief Description

[0032] 图1为本发明中基于BackCheck POCS定位方法的流程图。 [0032] FIG. 1 is a flowchart of the invention BackCheck POCS-based positioning method.

[0033] 图2为本发明基于BackCheck POCS定位方法的迭代不意图。 [0033] FIG. 2 is a schematic BackCheck POCS iteration based positioning method is not intended.

[0034] 图3为BackCheck POCS和Hybrid POCS的定位误差对比示意图。 [0034] FIG. 3 is BackCheck POCS and Hybrid POCS positioning errors contrast Fig.

[0035] 图4为不同测距误差对BackCheck POCS及Hybrid POCS定位误差影响的对比示意图。 [0035] FIG. 4 is different ranging error BackCheck POCS and POCS Hybrid positioning errors on a schematic comparison.

[0036] 下面通过参考附图描述的实施例是示例性的,仅用于解释本发明,而不能解释为对本发明的限制。 [0036] The following description by way of example with reference to the accompanying drawings are exemplary for explaining the present invention only, and not to be construed as limiting the present invention.

[0037] 假设有L个感知用户参与对主用户的定位,L个感知用户的位置坐标是已知的,表示为: [0037] assumed that there are L-aware users to participate in the positioning of the primary user, the position coordinates of the user's perception of L is known, expressed as:

Figure CN103200670AD00061

[0039] L个感知用户测得的与主用户之间的距离测量值表示为: [0039] a perception of distance measurements L user measured by the primary user is represented as:

Figure CN103200670AD00062

[0041] 以每个感知用户为圆心,以距离测量值Cli为半径的凸集圆域表示为: [0041] In each sensing users as the center for distance measurement Cli radius circle convex sets domain is expressed as:

Figure CN103200670AD00063

[0043] 第i个感知用户所确定的半径为Cli的圆边界表示如下: Radius [0043] i-th sensing users identified in a circular boundary Cli is expressed as follows:

Figure CN103200670AD00064

[0045] 本发明定位方法所用的POCS算法可以是Circular POCS, Hyperbolic POCS和Boundary POCS。 POCS algorithm positioning method used in the invention [0045] This may be a Circular POCS, Hyperbolic POCS and Boundary POCS. 现以Circular POCS算法为例,给出基于BackCheck POCS算法的具体步骤: Circular POCS algorithm as an example is to give specific steps BackCheck POCS algorithm:

[0046] 步骤一.以L个感知用户的坐标为圆心,利用Circular POCS对主用户进行Mc步正交投影迭代,得到Mc个迭代点X1' x2、...xMc_!> xMc。 [0046] Step one. In the L-aware user coordinates of the center, the main advantage of Circular POCS user Mc-step iterative orthogonal projection to give Mc iteration point X1 'x2, ... xMc _!> XMc.

[0047] 在此设定Circular POCS的迭代检查步数为Mc,由于Circular POCS的收敛速度很快,Mc的取值可以适当取一个较小值。 [0047] In this setting, the number of steps Circular POCS iteration check for Mc, due Circular POCS convergence fast, Mc values can be appropriately take a smaller value.

[0048] 根据Circular POCS的投影迭代规则,对主用户进行Mc步正交投影迭代的步骤为: [0048] The projection of Circular POCS iteration rule, the main user step Mc orthogonal projection iteration step is:

[0049] I)初始化:设置初始点Xtl,其中Xtl为平面内任意一点,如图2中方块所示; [0049] I) Initialization: Set the initial point Xtl, which Xtl to any point in the plane, as shown in the box below;

[0050] 2)进行简化的circular POCS的正交投影迭代: [0050] 2) simplification of the orthogonal projection circular POCS iteration:

[0051] [0051]

Figure CN103200670AD00065

[0053] 其中 [0053] where

Figure CN103200670AD00066

表示正交凸集投影点, It represents an orthogonal projection onto convex sets points

Figure CN103200670AD00067

sin (φ)]Γ表示Pi到Pi+1的向量,可以通过i表示出迭代的顺序,此顺序是根据感知用户的顺序确定;当后续迭代进入死循环或者不收敛时,可改变迭代的顺序,继续迭代。 sin (φ)] Γ Pi to Pi + 1 represents a vector i expressed sequence by iterative, this order is determined by the user's perception of the order; when subsequent iterations converge into an infinite loop or not, you can change the order of iteration continue iteration.

[0054] 步骤二.对步骤一中获取的Mc个迭代点,进行me步回溯检查。 [0054] Step Two. Mc iteration point in step one to get carried me to step back to check. 计算相邻迭代点之间的距离I |xm+「xml I,其中,m=Mc-l,...,Mc-mc,并与门限值λ进行比较。其中,λ的取值大小取决于感知用户对主用户测距结果的平均值,且λ相对于该平均距离是一个很小值,例如:λ与该平均距离的比值小于等于0.02,考虑到算法的运算复杂度,可将该比值进一步限定在0.005〜0.02内。 I calculate the distance between adjacent iterations between points | xm + "xml I, where, m = Mc-l, ..., Mc-mc, and λ is compared with a threshold value which depends on the value of the size of λ. perception of the average user of the primary user ranging results, and λ with respect to the average distance is a small value, for example: λ ratio of less than or equal to the average distance of 0.02, taking into account the computational complexity of the algorithm, the ratio can be further defined within 0.005~0.02.

[0055] 回溯检查步数为me,该me的取值为参与定位的感知用户的数目L的整数倍。 [0055] Check the number of steps back to me, me of the value of the number of users involved in the perception of positioning an integer multiple of L.

[0056] 步骤三.如果步骤二中的回溯比较检查中,相邻迭代点之间的距离均小于λ且不为零,则可以判断主用户位于感知用户所形成的多边形之内,将步骤一中最后L个迭代均值,即感知用户所属各个凸集的最后一次迭代的均值 [0056] Step Three. If the steps in the two retrospective comparison check, the distance between adjacent points iterations are less than λ and not zero, you can determine the primary user is located within the polygon formed by the perception of the user, step one The last L iterations mean that the average perception of each user belongs to the last iteration of convex sets

Figure CN103200670AD00071

作为主用 As the primary

户的位置信息的定位结果;如果步骤二中的回溯比较检查中,相邻迭代点之间的距离存在部分为零或大于λ的情况,继续执行步骤四。 Positioning result position information of users; if step two retrospective comparative examination of the case part zero or greater than the distance λ between adjacent iterates exist, proceed to step four.

[0057] 步骤四.以第Mc步迭代结果χΜ。 [0057] Step Four. In Step Mc iteration result χΜ. 为初始点Iv进行凸集圆域边界上正交投影迭代,迭代检查步数为Mb,得到Mb个迭代点。 Iv initial point iterative orthogonal projection on convex sets circle domain boundaries, the iterative steps of checking Mb, get Mb iteration point.

[0058] 设定边界正交投影迭代的检查步数为Mb,由于取消了被迭代点位置的判断,边界正交投影迭代的收敛速度是不确定的,可能会很快收敛到主用户附近,也可能陷入缓慢循环,因此Mb取较大值,使边界正交投影迭代充分。 [0058] The orthogonal projection of the set boundary checking iteration steps as Mb, due to the cancellation of the position determination is iterative point boundary orthogonal projection iterative convergence is uncertain, may soon converge to the vicinity of the main users, it may fall into the slow cycle, therefore Mb whichever is greater, so that the boundary orthogonal projection iteration sufficient.

[0059] 其中,根据边界正交投影迭代的规则,对主用户进行Mb步的迭代步骤为: [0059] where, according to the boundary orthogonal projection iteration rule, the main users Mb step iterative steps:

[0060] I)设置初始点bQ, b0 = xMc [0060] I) set the initial point bQ, b0 = xMc

[0061] 2) bh+1 = PhmodL(bh), h = 0,1, 2, 3...Mb-1 [0061] 2) bh + 1 = PhmodL (bh), h = 0,1, 2, 3 ... Mb-1

[0062]其中, [0062] where

Figure CN103200670AD00072

[0063] 步骤五.对步骤四中获取的Mb个迭代点,进行回溯mb步检查。 [0063] Step five. Mb iteration step four points acquired for, backtracking mb step examination. 计算相邻两个迭代点间的距离值,并与门限值λ进行比较。 Calculate the distance between two iterators point value between adjacent and λ is compared with a threshold value.

[0064] 回溯检查步数为mb,该mb取值与me相同,即为L的整数倍。 [0064] back to check the number of steps for the mb, mb argument with me the same, that is an integer multiple of L.

[0065] 步骤六.如果步骤五中的回溯比较检查中,相邻迭代点间的距离值均小于入,则将步骤四中最后L个迭代均值,即感知用户所属各个凸集的最后一次迭代的均值 [0065] Step 6. If step back in comparison check Fifth, the distance between adjacent value iteration point less than in, then the last step four L iterations mean that the user belongs perception last iteration of each convex set Mean

Figure CN103200670AD00073

作为主用户的位置信息的定位结果;如果步骤五中的回溯比较 As a result of the primary user's location positioning information; if step 5 backtracking compare

检查中,相邻迭代点间的距离值存在大于λ的情况,说明边界正交投影在经过了Mb步充分迭代之后,依然没有收敛到主用户位置附近,而是陷入了缓慢循环迭代。 Check the distance value exists between neighboring iteration point is greater than λ, indicating the boundary orthogonal projection Mb After a full iteration step, still does not converge to the vicinity of the main user position, but caught in a slow loop iteration. 此时,跳转步骤四继续执行凸集圆域边界上的正交投影迭代,其中,以前次Mb步正交投影迭代中第Mb步迭代结果V为初始点Iv变换原有的投影迭代顺序,直到相邻迭代点间的距离值均小于λ。 In this case, skip Step Four continue the orthogonal projection iteration round convex sets on the boundary of the domain, which formerly times Mb orthogonal projection step iteration step iteration result Mb Iv V as the initial point projection transform the original iteration order, iterates until the distance between adjacent values are smaller than λ.

[0066] 以下结合附图和具体的实例来对本发明做进一步的详细说明。 [0066] accompanying drawings and the following specific examples further illustrate the present invention in detail.

[0067] 步骤一.以L个感知用户的坐标为圆心,利用Circular POCS对主用户进行Mc步正交投影迭代,得到Mc个迭代点xk。 [0067] Step one. In the L-aware user coordinates of the center, the main advantage of Circular POCS user Mc-step iterative orthogonal projection to give Mc iteration point xk.

[0068] 设定感知用户数目为L=3,感知用户的位置坐标为[(700ml500m),(500ml000m),(1000m,1000m)]。 [0068] set the number of users perception L = 3, sensing the user's location coordinates [(700ml500m), (500ml000m), (1000m, 1000m)]. 其中,输入白噪声作为感知用户获取的与主用户之间距离的测量值屯,方差为8m。 Wherein the distance between the measured values Tuen input white noise as perceived user access to the main user, variance 8m. 设定圆凸集投影迭代步数上线Mc=10,以坐标位置Xq= (1600m,2100m)为起始位置(如图2方块所示)进行投影迭代,得到10个迭代点xk, k=l, 2,3,...10。 Setting the projector round convex sets the iteration number line Mc = 10, in order to coordinate the position of Xq = (1600m, 2100m) to the starting position (shown in Figure 2 squares) projection iteration, get 10 iterates xk, k = l 2, 3, ... 10.

[0069] 步骤二.对步骤一中获取的10个迭代点,进行me步回溯检查,回溯检查步数为mc=2L=6。 [0069] Step II. 10 iterates obtained in step one to carry out checks me step back, step back to check the number of mc = 2L = 6. 计算相邻迭代点之间的距离,并与门限值λ进行比较。 Iterative calculation of the distance between adjacent points, and λ is compared with a threshold value. 假设所有参与定位的感知用户所获取的与主用户之间距离的测量值的平均值为R,则检查门限值λ设定为相对R的一个较小量,这里设定λ与距离平均值的比值为λ/R=0.01。 Suppose the average of the measured values among all users participating positioning sensing acquired from the primary user is R, the threshold is checked λ R is set to a relatively small amount, the average value of the distance to where the set λ The ratio λ / R = 0.01.

[0070] II Xm+1-Xm Il ( λ,其中,m=Mc-l,..., Mc-mc [0070] II Xm + 1-Xm Il (λ, where, m = Mc-l, ..., Mc-mc

[0071] 步骤三.由于步骤二中的回溯比较检查中,相邻迭代点之间的距离存在部分为零或大于λ的情况,继续执行步骤四。 [0071] Step three. Step two in the back due to the comparison check, the distance between adjacent case portions iterates zero or greater than λ exists, proceed to step four.

[0072] 从图2中可以看出,从初始点X。 [0072] As can be seen from Figure 2, X. from the initial point 开始经过两步Circular POCS的迭代,迭代点便停滞于三个凸集圆域的交集区域上,此时根据回溯检查判断的结果,迭代点的变化差值存在一部分为零的情况,因而继续执行步骤四,进行向凸集圆域边界上的正交投影迭代。 Circular POCS beginning two-step iteration, iteration point they were arrested in the area of intersection of the three circles domain of convex sets, then go back to check the results of the judgment, the difference between the change in the presence of a part of the iteration point zero, and thus continue to perform Step four, orthogonal projection iteration round convex set on the domain boundary.

[0073] 步骤四.以第Mc步迭代结果xM。 [0073] Step Four. In Step Mc iteration result xM. 为初始点,进行凸集圆域边界上的正交投影迭代对主用户进行Mb步正交投影迭代,得到Mb个迭代点bh,h=l, 2,3,...Mb。 As the initial point of orthogonal projection iteration domain boundary circle convex sets of main users Mb orthogonal projection iteration step, get Mb iteration point bh, h = l, 2,3, ... Mb.

[0074] 首先,设定边界正交投影迭代步数上限Mb=30,由于取消了被迭代点位置的判断,边界正交投影迭代的收敛速度是不确定的,可能会很快收敛到主用户附近,也可能陷入缓慢循环,因此Mb取较大值,使边界正交投影迭代充分;之后,根据边界正交投影迭代的规则,对主用户进行Mb步定位投影,得到10个迭代点bh,h=l, 2, 3,...30。 [0074] First, set the boundary orthogonal projection maximum number of iterations Mb = 30, due to the cancellation of the iteration point position is determined, the boundary orthogonal projection iterative convergence is uncertain, it may soon converge to the primary user nearby, it may fall into a slow circle, therefore Mb whichever is greater, so that the boundary orthogonal projection iterative fully; then, according to the boundary orthogonal projection iteration rule, the main users Mb step positioning projection, iterative get 10 points bh, h = l, 2, 3, ... 30.

[0075] 步骤五.对步骤四中获取的Mb个迭代点,进行回溯mb步检查。 [0075] Step five. Mb iteration step four points acquired for, backtracking mb step examination. 回溯检查的步数mb=2L=6。 Steps back to check mb = 2L = 6. 计算相邻两个迭代点间的距离值,并与门限值λ进行比较。 Calculate the distance between two iterators point value between adjacent and λ is compared with a threshold value.

[0076] 步骤六.在迭代了Mb步之后,回溯检查mb=6步的迭代点变化值,发现相邻迭代点间的距离值存在大于λ的情况,投影迭代陷入了缓慢循环投影迭代,因此,需要跳转到步骤四,并以首次Mb步正交投影迭代中第Mb步的迭代结果为初始点Iv再次执行凸集圆域边界上的Mb步正交投影迭代,此时变换首次的投影迭代顺序,将原投影迭代的顺序由Ρ1-Ρ2-Ρ3改为Ρ2-Ρ3-Ρ1,当再次经过Mb步迭代,回溯检查mb=6步,发现迭代点的变化值小于门限λ,说明迭代收敛主用户位置附近,因此将第二次Mb步正交投影迭代中最后L个迭代均值(如图2星号所示)确定主用户位置。 [0076] Step Six After iterating Mb step back to check mb = 6-step iterative point change values found from the value exists between neighboring iterates case greater than λ, the projection into a slow loop iterations iterative projection, so , need to jump to step four, and the results of the first iteration step Mb orthogonal projection of the first iteration step as the initial point Iv Mb Mb orthogonal projection iteration step convex set on the domain boundary circle performed again, this time converting the first projection iteration order, the original order of iteration projection by Ρ1-Ρ2-Ρ3 changed Ρ2-Ρ3-Ρ1, when again after Mb iteration, back check mb = 6 steps, detect changes in the value of the iteration point less than the threshold λ, described iteration convergence near the main user location, so the second iteration Mb orthogonal projection last step L iterations mean (asterisk shown in Figure 2) to determine the primary user location.

[0077] 图3是Hybrid POCS定位算法与BackCheck POCS定位算法的定位仿真结果比较图。 [0077] FIG. 3 is a Hybrid POCS location algorithm with BackCheck POCS location positioning algorithm simulation results comparison chart. 图中横坐标为仿真重复次数,纵坐标是估计位置与目标真实位置之间的差值与感知用户到主用户之间真实距离平均值的比值。 Abscissa for the simulation repetitions ordinate is the difference between the estimated and target users perceive the true location of the ratio between the true distance between the main user average. 从图3中可以看出,一般情况下两种算法的定位精度比较接近,但是在某些情况下,BackCheck POCS定位算法的定位精度比较有优势。 As can be seen from Figure 3, the positioning accuracy of the two algorithms in general are fairly close, but in some cases, the positioning accuracy BackCheck POCS positioning algorithm has an advantage. 这是因为,当主用户远离感知用户时,双曲线的渐近线性质容易致使双曲线的交点受到测距噪声的波动影响比较明显,因此在这种情况下,可以看出BackCheck POCS算法的定位效果要比Hybrid POCS算法优越。 This is because, when the main user perception away from the user, the asymptotic properties of hyperbolic hyperbolic intersection easily cause fluctuations ranging affected by noise more obvious, so in this case, we can see the effect of positioning BackCheck POCS algorithm Hybrid POCS algorithm than superior.

[0078] 图4描述了Hybrid POCS定位算法与BackCheck POCS定位算法在不同测距误差影响下,定位精度的比较。 [0078] Figure 4 depicts a comparison Hybrid POCS location algorithm with BackCheck POCS localization algorithms in different error influence ranging, positioning accuracy. 从图4中可以看出,BackCheck POCS定位算法比Hybrid POCS定位算法具有一定的优势,这主要是由于Hybrid POCS算法中双曲线投影定位对于主用户在感知用户多边形之外的情况下收敛点受噪声波动较大,因此随着测距误差的增大。 As can be seen from Figure 4, BackCheck POCS location algorithm than Hybrid POCS positioning algorithm has some advantages, mainly due to the Hybrid POCS algorithm hyperbolic projection positioned for the main user in the case of user perception outside the polygon convergence point by noise fluctuations, so as the ranging error increases.

[0079] 尽管已经示出和描述了本发明的实施例,对于本领域的普通技术人员而言,可以理解在不脱离本发明的原理和精神的情况下可以对这些实施例进行多种变化、修改、替换和变型,本发明的范围由所附权利要求及其等同限定。 [0079] Although there have been shown and described embodiments of the present invention, those of ordinary skill in the art, it can be understood without departing from the principles and spirit of the present invention may be made in these embodiments, various changes, modifications, substitutions and modifications, the scope of the invention being indicated by the appended claims and their equivalents defined.

Patent Atıfları
Alıntı Yapılan Patent Dosya kabul tarihi Yayın tarihi Başvuru sahibi Başlık
CN102752849A *29 Şub 201224 Eki 2012中国人民解放军理工大学Single receiving machine location method based on signal detection probability and wave angle estimation
US8155673 *14 Mar 201110 Nis 2012Skyhook Wireless, Inc.Estimation of position using WLAN access point radio propagation characteristics in a WLAN positioning system
Patent Harici Atıflar
Referans
1 *于浩等: "加权凸集投影法在分布式目标定位中的应用", <<计算机工程>>, 30 June 2011 (2011-06-30)
Referans veren:
Alıntı Yapan Patent Dosya kabul tarihi Yayın tarihi Başvuru sahibi Başlık
CN104320845A *4 Tem 201428 Oca 2015南京邮电大学A main user positioning method based on sensor and quantum intelligent computing
Sınıflandırma
Uluslararası SınıflandırmaH04W64/00
Yasal Etkinlikler
TarihKodEtkinlikAçıklama
10 Tem 2013C06Publication
7 Ağu 2013C10Entry into substantive examination
5 Ağu 2015C14Grant of patent or utility model