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 B
Yayın türüOnay
Başvuru numarasıCN 201310057842
Yayın tarihi5 Ağu 2015
Dosya kabul tarihi25 Şub 2013
Rüçhan tarihi25 Şub 2013
Şu şekilde de yayınlandı:CN103200670A
Yayınlanma numarası201310057842.6, CN 103200670 B, CN 103200670B, CN 201310057842, CN-B-103200670, CN103200670 B, CN103200670B, CN201310057842, CN201310057842.6
Buluş Sahipleri杜利平, 雷雨, 康璐璐, 姜少坤
Başvuru sahibi北京科技大学
Alıntıyı Dışa AktarBiBTeX, EndNote, RefMan
Dış Bağlantılar:  SIPO, Espacenet
基于回溯检查凸集投影的认知无线电主用户定位方法 Check convex sets based on back-projection method for cognitive radio host user location şu dilden çevrildi: Çince
CN 103200670 B
Özet  şu dilden çevrildi: Çince
本发明提出一种基于回溯检查凸集投影的认知无线电主用户定位方法,以L个感知用户的坐标为圆心,利用凸集投影算法对主用户进行Mc步正交投影迭代;进行mc步回溯比较检查,计算出相邻迭代点之间的距离,并与门限值λ进行比较;若相邻迭代点之间的距离存在部分为零或大于λ的情况,则进行凸集圆域边界上Mb步投影迭代,和mb步回溯比较检查,计算相邻两个迭代点间的距离值,再次与门限值λ进行比较,若均小于λ,则将Mb步的迭代结果bMb确定为主用户位置信息的定位结果。 The present invention provides a primary user based on cognitive radio positioning method to check POCS back to the user's perception of L coordinates of a circle, use POCS algorithm main user Mc-step iterative orthogonal projection; conduct mc step back comparison check, calculate the distance between adjacent points of iterations, and λ is compared with a threshold value; if the adjacent portion of the case is zero or greater than the distance λ iterations between points exist, be on the domain boundary circle convex sets Mb projection iterative step, and step back in comparison check mb calculated from the values of two adjacent iterations between points, again with threshold λ comparison, if less than λ, the results will Mb iteration step is determined based user bMb position location information results. 本发明中的回溯检查凸集投影定位算法弥补了现有凸集投影定位算法的不足,定位算法好,而且受测距误差的影响较小,适应用于认知无线电网络中感知用户对主用户位置信息的获取环节。 Check back in the present invention POCS location algorithm to make up for deficiencies of the prior POCS positioning algorithm localization algorithm is good, but less affected by distance error, adapted for sensing cognitive radio network user to the main user Being part of the location information.
Hak Talepleri(4)  şu dilden çevrildi: Çince
1. 一种认知无线电网络中对主用户定位的方法,其特征在于,该方法包括以下步骤: 步骤一、以L个感知用户的坐标为圆心,利用凸集投影算法对主用户进行Mc步正交投影迭代,得到Mc个迭代点xk,其中k= 1,2, 3,…,Mc; 步骤二.对步骤一中获取的Mc个迭代点,进行me步回溯比较检查,计算出相邻迭代点之间的距离I|xm+1-xm|I,其中,m=Mc-1, •••,Mc-mc,并与门限值X进行比较; 步骤三.如果步骤二中的回溯比较检查中,相邻迭代点之间的距离均小于A且不为零,则将步骤一中最后L个迭代均值作为主用户位置信息的定位结果;如果步骤二中的回溯比较检查中,相邻迭代点之间的距离存在部分为零或大于A的情况,继续执行步骤四; 步骤四.以Mc步迭代结果xM。 A cognitive radio network for the primary user positioning method, wherein the method comprises the following steps: Step 1, to the user's perception of L coordinates of a circle, use POCS algorithm main user Mc step orthogonal projection iteration, get Mc iteration point xk, where k = 1,2, 3, ..., Mc; Step two points Mc iteration step acquired a pair carried me to step back in comparison check, the calculated adjacent. I iteration distance between points | xm + 1-xm | I, where, m = Mc-1, •••, Mc-mc, and X is compared with a threshold value; Step three, if step two back comparison check, the distance between adjacent points iterations are less than A non-zero, then the last step of a L iterations as positioning results mean primary user location information; if the step two retrospective comparative examination phase A case of partial zero or greater than the distance between adjacent points of presence iterations, proceed to step four; Step four to Mc iteration results xM. 为初始点b^,进行凸集圆域边界上正交投影迭代,迭代检查步数为Mb,得到Mb个迭代点bh,其中h= 1,2, 3,…,Mb; 步骤五.对步骤四中获取的Mb个迭代点,进行mb步回溯比较检查,计算相邻两个迭代点间的距离值I|bn+1_bn|I,其中,n=Mb-1, .",Mb-Iiib,并与门限值X进行比较; 步骤六.如果步骤五中的回溯比较检查中,相邻迭代点间的距离值均小于A,则将步骤四中最后L个迭代均值作为主用户位置信息的定位结果;如果步骤五中的回溯比较检查中,相邻迭代点间的距离值存在大于A的情况,跳转到步骤四以Mb步迭代结果为初始点k,并变换投影迭代顺序,直到相邻迭代点间的距离值均小于入; 所述步骤一包括: 1. 1)初始化步骤:设置初始点X(l,其中^为任意位置上的一点; 1. 2)利用以下公式进行投影迭代: The initial point b ^, orthogonal projection on convex sets iteration domain boundary circle, the iterative steps of checking Mb, get Mb iteration point bh, where h = 1,2, 3, ..., Mb; step for step five. 2.4 Mb iteration acquired, were to step back in comparison check mb calculated from the value of adjacent two iterators point between I | bn + 1_bn | I, where, n = Mb-1, ", Mb-Iiib,. and X is compared with a threshold value; Step Six If you step back in comparison check Fifth, the adjacent value iteration distance between points is less than A, then step four in the last iteration mean L as the primary user location information. positioning results; step back in comparison check if the Fifth, the distance value exists adjacent iteration point is greater than A's case, skip to step four to Mb iteration results for the initial point k, and transform projection iteration order until phase Iterative point between adjacent distance value is less than the average; the step a includes: 1.1) initialization step: Set the initial point X (l, where ^ is an arbitrary position on the point; 1.2) using the following formula Projection Iteration :
Figure CN103200670BC00021
,k= 0, 1,2. • •Mc-I 其中,PdJxA:)表示正交凸集投影点,d/[cos(^〇,sin(9?)]r表示Pi到P1+1的向量;Pi 为第i个感知用户的位置坐标,ie[i,l] ;Di为以第i个感知用户为圆心,以第i个感知用户测得的与主用户之间的距离测量值为半径的凸集圆域。 , K = 0, 1,2. • • Mc-I which, PdJxA :) represents an orthogonal projection onto convex sets point, d / [cos (^ billion, sin (9?)] R represents the vector of Pi to P1 + 1 ; Pi is the i-th user's perception of the position coordinates, ie [i, l]; Di is the i-th sensing users in a circle, to the distance measuring the i-th user perception and the measured value of the radius between the primary user The convex set round field.
2. 如权利要求1所述的认知无线电网络中对主用户定位的方法,其特征在于,A的取值大小取决于感知用户对主用户测距结果的平均值,且A相对于该平均距离是一个很小值。 2. A method as claimed in cognitive radio networks in the main user locate claim, characterized in that the value of A depends on the size of the average user of the primary user perception ranging results, and A with respect to the average distance is a small value.
3. 如权利要求1所述的认知无线电网络中对主用户定位的方法,其特征在于,mb与me 取值相同,为L的整数倍。 Cognitive radio network as claimed in claim 1 master user localization method, wherein the same value mb and me, is an integer multiple of L.
4. 如权利要求1所述的认知无线电网络中对主用户定位的方法,其特征在于,所述步骤四包括: 4. 1)初始化步骤:1)设置初始点b。 4. 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 b. ,b。 , B. =XMc 4. 2)利用以下公式进行投影迭代: bh+i= Phm〇dL(bh),h=〇,1,2,3.•.Mb-I = XMc 4. 2) using the following formula Projection Iteration: bh + i = Phm〇dL (bh), h = square, 1,2,3 • .Mb-I.
Figure CN103200670BC00022
其中,Pi为第i个感知用户的位置坐标,ie[1,L]是第i个感知用户测得的与主用户之间的距离测量值;Ci={yGR2:IIy-PiII=CU是第i个感知用户所确定的半径为(Ii的圆边界。 Wherein, Pi is the i-th user's perception of the position coordinates, ie [1, L] is the i-th distance measurement value measured by sensing the user between the primary user; Ci = {yGR2: IIy-PiII = CU are the radius of the i-th sensing users identified as (Ii round of boundary.
Açıklama  şu dilden çevrildi: Çince
基于回溯检查凸集投影的认知无线电主用户定位方法 Check convex sets based on back-projection method for cognitive radio host user location

技术领域 TECHNICAL FIELD

[0001] 本发明设及一种认知无线电网络中对主用户定位的方法,特别设及一种基于回溯检查的凸集投影定位方法。 [0001] The present invention is provided and a cognitive radio network for the primary user positioning method, specially designed and based on retrospective examination of POCS positioning method.

背景技术 Background technique

[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 in the broad spectrum of needs of these applications and a higher download speed. 认知无线电的概念迎合了频谱重复利用的需要,可W通过对无线环境的感知实现与主用户的冲突避免,利用最优化的决策有效的动态利用频谱空洞。 The concept of cognitive radio spectrum to meet the need for re-use can be perceived by W 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 location information of the primary user, then the spectrum sensing performance will be greatly improved, and will also play a very helpful role in the management and allocation of resources in the subsequent spectrum.

[0003] 在认知网络中对主用户进行定位,获取主用户的位置信息的主要作用有W下几个方面: [0003] In the cognitive network of primary user to locate, acquire a major role in the primary user's location information has W following aspects:

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

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

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

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

[000引目前常用的凸集投影方法包括Cir州larPOCS,HyperbolicPOCS,BoundaryPOCS 和HybridPOCS等,其中HybridPOCS是前两种POCS方法的合并,根据研究结果表明,HybridP0CS方法的定位精度要优于前几种方法,然而,当主用户远离感知用户时,由于HybridPOCS算法中双曲线投影定位对于主用户在感知用户多边形之外的情况下收敛点受噪声波动较大,因此误差随着测距增大而增大。 [000 lead currently used POCS method comprising Cir State larPOCS, HyperbolicPOCS, BoundaryPOCS and HybridPOCS, of which the first two HybridPOCS merger POCS method, according to the study results show that the positioning accuracy HybridP0CS method is superior to the former in several ways However, when the user is away from the main perception of the user, since HybridPOCS hyperbolic projection algorithm locate the main users perceive the convergence point by noise volatile than the case where the user polygons, so the error as the distance increases.

发明内容 SUMMARY OF THE INVENTION

[0009] 本发明旨在解决上述技术缺陷,提出一种应用于认知网络中对主用户进行定位的回溯凸集投影算法炬ack化eckPOCS)。 [0009] The present invention aims to solve the above technical defects, proposes a cognitive networks applied to the primary user to locate backtracking POCS algorithm torch ack of eckPOCS).

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

[0011] 步骤一、WL个感知用户的坐标为圆屯、,利用凸集投影算法对主用户进行Me步正交投影迭代,得到Me个迭代点Xk,其中k= 1,2,3,…,Me; A, WL user coordinate a perception [0011] Step Tun round ,, use POCS algorithm main user Me orthogonal projection iteration step to give Me iteration points Xk, where k = 1,2,3, ... , Me;

[0012] 步骤二.对步骤一中获取的Me个迭代点,进行me步回溯比较检查,计算出相邻迭代点之间的距离IIXm+i-XmI I,其中,m=Mc-l,. . .,Mc-mc [0012] Step two. Me iteration points obtained in Step 1 to carry out me to step back in comparison check, calculate the distance between adjacent iterates IIXm + i-XmI I, where, m = Mc-l ,. .., Mc-mc

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

[0014] 步骤四.WMe步迭代结果%。 [0014] Step Four .WMe iteration result%. 为初始点b。 The initial point b. ,进行凸集圆域边界上正交投影迭代,迭代检查步数为Mb,得到Mb个迭代点bh,其中h=l,2, 3,…Mb; , Orthogonal projection on convex sets iteration circle domain boundaries, the iterative steps of checking Mb, get Mb iteration point bh, where h = l, 2, 3, ... Mb;

[00巧]步骤五.对步骤四中获取的Mb个迭代点,进行mb步回溯比较检查,计算相邻两个迭代点间的距离值I|6。 [00 clever] Step five Mb iteration step four points to get carried mb step back in comparison check, calculate the distance between adjacent values I between two iterators point | 6. +1斗。 +1 Bucket. ||,其中,n=Mb-l,. . .,Mb-mb,并与口限值A进行比较; .. ||, Where, n = Mb-l ,., Mb-mb, and the limit value A is compared with the port;

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

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

[001引1. 1)初始化步骤;设置初始点X。 [001 cited 1.1) initialization step; set the initial point X. ,其中X。 Wherein X. 为任意位置上的一点; To a point anywhere on;

[0019] 1. 2)利用W下公式进行投影迭代: [0019] 1.2) use the following formula W projection iteration:

[0020] [0020]

Figure CN103200670BD00051

[00巧其中,巧):知C)表示正交凸集投影点,馬[COS0) ,S化(取)]T表示P剧PW的向量;Pi为第i个感知用户的位置坐标,iG[1,L]。 [00 Qiao which, coincidentally):-known C) represents an orthogonal projection onto convex sets points, MA [COS0), S of (take)] T represents the vector P PW's drama; Pi is the i-th sensing the user's location coordinates, iG [1, L]. Di为W第i个感知用户为圆屯、,W第i个感知用户测得的与主用户之间的距离测量值为半径的凸集圆域。 Round convex sets the distance measurement value of the radius of domain Di is W i th user perception circular village ,, W i th user perception as measured with the main users.

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

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

[00巧]优选地,所述步骤四包括: [00 clever] Preferably, the Step Four includes:

[0026] 4. 1)初始化步骤;1)设置初始点b。 [0026] 4.1) initialization step; 1) to set the initial point b. ,b〇=XMe , B〇 = XMe

[0027] 4. 2)利用W下公式进行投影迭代: [0027] 4.2) use the following formula W projection iteration:

[002引bw=P血。 [002 blood lead bw = P. 化(bh),h= 0,1,2, 3…Mb-1 Of (bh), h = 0,1,2, 3 ... Mb-1

[0029] 其中, [0029] wherein,

Figure CN103200670BD00052

[0030] 其中,Pi为第i个感知用户的位置坐标,iG[1,L]。 [0030] wherein, Pi is the i-th user's perception of the position coordinates, iG [1, L]. di是第i个感知用户测得的与主用户之间的距离测量值;Ci={yGR2: ||y-Pill=dj是第i个感知用户所确定的半径为di的圆边界。 di is the i-th distance measurement sensing users measured between the main users; Ci = {yGR2: || y-Pill = dj is the radius of the i-th user perception determined by the circular boundary di.

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

附图说明 Brief Description

[0032] 图1为本发明中基于Back化eckPOCS定位方法的流程图。 [0032] FIG. 1 is a schematic flow diagram of the invention eckPOCS Back-based positioning method.

[0033] 图2为本发明基于Back化eckPOCS定位方法的迭代示意图。 [0033] FIG. 2 is a schematic view of the invention iteration of eckPOCS Back-based positioning method.

[0034] 图3为BackCheckPOCS和HybridPOCS的定位误差对比示意图。 [0034] FIG. 3 is BackCheckPOCS and positioning error HybridPOCS schematic comparison.

[0035] 图4为不同测距误差对Back化eckPOCS及HybridPOCS定位误差影响的对比示意图。 [0035] FIG. 4 is a different range error of positioning errors on Back eckPOCS and HybridPOCS 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] Suppose 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:

[00%] [00%]

Figure CN103200670BD00061

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

[0040] [0040]

Figure CN103200670BD00062

[0041] W每个感知用户为圆屯、,W距离测量值中为半径的凸集圆域表示为: [0041] W each user perception circular village ,, W distance measurement for the radius of a circle convex sets domain is expressed as:

[0042] [0042]

Figure CN103200670BD00063

[0043] 第i个感知用户所确定的半径为中的圆边界表示如下: [0043] radius of the i-th sensing user identified as the circle boundary follows:

[0044] Ci={yGR2:||y-Pj|=dJ [0044] Ci = {yGR2: || y-Pj | = dJ

[0045] 本发明定位方法所用的POCS算法可W是CircularPOCS,HyperbolicPOCS和BoundaryPOCS。 [0045] POCS algorithm positioning method of the present invention can be used in W is CircularPOCS, HyperbolicPOCS and BoundaryPOCS. 现WCir州larPOCS算法为例,给出基于BackQieckPOCS算法的具体步骤: Now WCir state larPOCS algorithm as an example, based on the specific steps BackQieckPOCS algorithm is given by:

[0046] 步骤一.WL个感知用户的坐标为圆屯、,利用CircularPOCS对主用户进行Me步正交投影迭代,得到Me个迭代点Xi、X2、. . .Xiie。 A user coordinate .WL a perception [0046] Step Tun ,, round main users use CircularPOCS Me orthogonal projection iteration step to give Me iteration point Xi, X2 ,.. .Xiie.

[0047] 在此设定Cir州larPOCS的迭代检查步数为Me,由于Cir州larPOCS的收敛速度很快,Me的取值可W适当取一个较小值。 [0047] In this setting, the iterative steps Cir state larPOCS check for Me, since the state larPOCS Cir fast convergence, Me W values may be appropriate to take a small value.

[0048] 根据CircularPOCS的投影迭代规则,对主用户进行Me步正交投影迭代的步骤为: Step [0048] According to CircularPOCS projection iteration rule, the main user Me orthogonal projection iteration step is:

[0049] 1)初始化:设置初始点X。 [0049] 1) Initialization: Set the initial point X. ,其中X。 Wherein X. 为平面内任意一点,如图2中方块所示; At any point within the plane, shown in Figure 2 in the box;

[0化日]2)进行简化的circularPOCS的正交投影迭代: [0 of Day] 2) simplification of circularPOCS orthogonal projection iteration:

[0化1] [0 of 1]

Figure CN103200670BD00064

[005引其中&;(%)表示正交凸集投影点,di[cos(的,Sin(與)]了表示P剧PW的向量, 可W通过i表示出迭代的顺序,此顺序是根据感知用户的顺序确定;当后续迭代进入死循环或者不收敛时,可改变迭代的顺序,继续迭代。 [005 cited wherein &; (%) represents an orthogonal projection convex set point, di [cos (a, Sin (with)] indicating the vector P drama PW can be expressed sequence W i iteration through, this order is based on order to determine the user's perception; when subsequent iterations converge into an infinite loop or not, you can change the order of iterations continue iteration.

[0054] 步骤二.对步骤一中获取的Me个迭代点,进行me步回溯检查。 [0054] Step two. Me iteration points obtained in Step 1 to carry out checks me to step back. 计算相邻迭代点之间的距离Nxm+i-Xmll,其中,m=Mc-l,...,Mc-mc,并与口限值A进行比较。 Iterative calculation of the distance between points of adjacent Nxm + i-Xmll, where, m = Mc-l, ..., Mc-mc, and is compared with the A port limit. 其中,A的取值大小取决于感知用户对主用户测距结果的平均值,且A相对于该平均距离是一个很小值,例如:A与该平均距离的比值小于等于0. 02,考虑到算法的运算复杂度,可将该比值进一步限定在0.005~0.02内。 Among them, the value of A depends on the perception of the average size of the primary users users ranging results, and A with respect to the average distance is a small value, for example: A ratio of the average distance of 0.02 or less, consider the computational complexity of the algorithm, the ratio may be further defined in the 0.005 to 0.02.

[0055] 回溯检查步数为me,该me的取值为参与定位的感知用户的数目L的整数倍。 [0055] back to check the number of steps to me, that me the value of the number of users involved in the positioning of sensing an integer multiple of L. [0化6] 步骤如果步骤二中的回溯比较检查中,相邻迭代点之间的距离均小于A且不为零,则可W判断主用户位于感知用户所形成的多边形之内,将步骤一中最后L个迭代均值,即感知用户所属各个凸集的最后一次迭代的均值 [0 of 6] If step two steps back in comparison check, the distance between adjacent iteration point A and not less than zero, you can determine whether the master user W located within the polygon perception formed by the user, will step A last L iterations mean that the average perception of each user belongs to the last iteration of convex sets

Figure CN103200670BD00071

作为主用户的位置信息的定位结果;如果步骤二中的回溯比较检查中,相邻迭代点之间的距离存在部分为零或大于A的情况,继续执行步骤四。 As a result of the primary user's location positioning information; if step two retrospective comparative examination, the case is zero or greater than A part of the distance between adjacent points of presence iterations, proceed to step four.

[0057] 步骤四.W第Me步迭代结果%。 [0057] Step Four Me .W first iteration result%. 为初始点b。 The initial point b. ,进行凸集圆域边界上正交投影迭代, 迭代检查步数为Mb,得到Mb个迭代点。 , Orthogonal projection on convex sets iteration circle domain boundaries, the iterative steps of checking Mb, get Mb iteration points.

[005引设定边界正交投影迭代的检查步数为Mb,由于取消了被迭代点位置的判断,边界正交投影迭代的收敛速度是不确定的,可能会很快收敛到主用户附近,也可能陷入缓慢循环,因此Mb取较大值,使边界正交投影迭代充分。 [005 primer set border inspection orthogonal projection iteration steps as Mb, due to the cancellation of the position determination is iterative point boundary orthogonal projection iteration convergence rate is uncertain, it 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.

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

[0060] 1)设置初始点b。 [0060] 1) Set the initial point b. ,b〇=XMe , B〇 = XMe

[006U 2)bh+i=P血。 [006U 2) bh + i = P blood. 化化h),h= 0,1,2, 3. . .Mb-1 Of technology h), h = 0,1,2, 3.. .Mb-1

[006引其中, [006 cited wherein

Figure CN103200670BD00072

[0063] 步骤五.对步骤四中获取的Mb个迭代点,进行回溯mb步检查。 [0063] Step five. Mb iteration step four points acquired for, backtracking mb step examination. 计算相邻两个迭代点间的距离值,并与口限值A进行比较。 Calculate the distance values of two iterations between adjacent points, and with the port limits A comparison.

[0064] 回溯检查步数为mb,该mb取值与me相同,即为L的整数倍。 [0064] back to check the number of steps for the mb, mb value the same with me, 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 step four of the last L iterations mean that the last time the user belongs perceive each iteration convex sets Mean

Figure CN103200670BD00073

作为主用户的位置信息的定位结果;如果步骤五中的回溯比较检查中,相邻迭代点间的距离值存在大于A的情况,说明边界正交投影在经过了Mb步充分迭代之后,依然没有收敛到主用户位置附近,而是陷入了缓慢循环迭代。 As a result of the primary user's location positioning information; if retrospective comparative examination step 5, the distance between adjacent iteration point is greater than A situation exists, indicating the boundary orthogonal projection Mb step after a full iteration after, still no convergence to the user's location near the main, but fell into a slow loop iteration. 此时,跳转步骤四继续执行凸集圆域边界上的正交投影迭代,其中,W前次Mb步正交投影迭代中第Mb步迭代结果为初始点b。 In this case, skip Step Four iterations continue orthogonal projection on convex sets circular domain boundaries, where, W Mb previous iteration step orthogonal projection Mb iteration step results as the initial point b. ,变换原有的投影迭代顺序,直到相邻迭代点间的距离值均小于入。 Transform the original projection iteration order, until the distance between adjacent value iteration point less than the average.

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

[0067] 步骤一.WL个感知用户的坐标为圆屯、,利用CircularPOCS对主用户进行Me步正交投影迭代,得到Me个迭代点Xk。 A user coordinate .WL a perception [0067] Step Tun ,, round main users use CircularPOCS Me orthogonal projection iteration step to give Me 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 input white noise as a measurement of the distance between the perception of the user access to the primary user, the variance is 8m. 设定圆凸集投影迭代步数上线Mc=10,W坐标位置xa= (1600m,2100m)为起始位置巧日图2方块所示)进行投影迭代,得到10个迭代点Xk,k=l,2, 3, ... 10。 Setting circle convex sets the number of lines on the projection iteration Mc = 10, W coordinate position xa = (1600m, 2100m) for the starting position shown in box clever Ritu 2) projected iteration, get 10 iterates Xk, k = l , 2, 3, ... 10.

[0069] 步骤二.对步骤一中获取的10个迭代点,进行me步回溯检查,回溯检查步数为mc=化=6。 [0069] Step II. 10 iterations points obtained in Step 1 to carry out checks me step back, go back to check the number of steps for the mc = of = 6. 计算相邻迭代点之间的距离,并与口限值A进行比较。 Iterative point distance calculation between adjacent, and the port limits A comparison. 假设所有参与定位的感知用户所获取的与主用户之间距离的测量值的平均值为R,则检查口限值A设定为相对R 的一个较小量,该里设定A与距离平均值的比值为A/R=〇. 01。 Assuming the average of the measured values among all involved in the perception of the user positioning the acquired distance with a primary user is R, A limit check port R of a set to a relatively small amount, and the average distance in the set A the ratio of the value of A / R = billion. 01.

[0070]IIXm+i-XmII《A,其中,m=Mc-l,...,Mc-mc [0070] IIXm + i-XmII "A, wherein, m = Mc-l, ..., Mc-mc

[0071] 步骤S.由于步骤二中的回溯比较检查中,相邻迭代点之间的距离存在部分为零或大于A的情况,继续执行步骤四。 [0071] Step S. Step two in the back due to the comparative examination, the adjacent part of the case is zero or greater than the distance A between the presence iteration point, proceed to step four.

[007引从图2中可W看出,从初始点X。 [007 lead from Figure 2, W can be seen from the initial point X. 开始经过两步CircularPOCS的迭代,迭代点便停滞于=个凸集圆域的交集区域上,此时根据回溯检查判断的结果,迭代点的变化差值存在一部分为零的情况,因而继续执行步骤四,进行向凸集圆域边界上的正交投影迭代。 After a two-step iterative CircularPOCS start, iterative point they stalled on the intersection of two convex sets circular area = domain, this time based on the results of retrospective examination to determine the changes in the difference between the presence of a part of the iteration point zero, and thus continue to step Fourth, the orthogonal projection iteration round convex sets on the domain boundary.

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

[0074] 首先,设定边界正交投影迭代步数上限Mb=30,由于取消了被迭代点位置的判断, 边界正交投影迭代的收敛速度是不确定的,可能会很快收敛到主用户附近,也可能陷入缓慢循环,因此Mb取较大值,使边界正交投影迭代充分;之后,根据边界正交投影迭代的规贝ij,对主用户进行Mb步定位投影,得到10个迭代点bh,h=l, 2, 3, ... 30。 [0074] First, set the boundary orthogonal projection maximum number of iteration steps Mb = 30, due to the cancellation of the iteration point position is determined, the boundary orthogonal projection iteration convergence rate is uncertain, it may soon converge to the primary user Nearby, also may fall into the slow cycle, therefore Mb whichever is greater, so that the boundary orthogonal projection iterative fully; then, according to the regulation boundary orthogonal projection iteration shellfish ij, the main users Mb positioning projection step, get 10 iterations 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. 计算相邻两个迭代点间的距离值,并与口限值A进行比较。 Calculate the distance values of two iterations between adjacent points, and with the port limits A comparison.

[0076] 步骤六.在迭代了Mb步之后,回溯检查mb=6步的迭代点变化值,发现相邻迭代点间的距离值存在大于A的情况,投影迭代陷入了缓慢循环投影迭代,因此,需要跳转到步骤四,并W首次Mb步正交投影迭代中第Mb步的迭代结果为初始点b。 [0076] Step Six After iterating Mb step back to check mb = iteration point change in value of 6 steps, found the distance is greater than A, the projection into a slow loop iteration Projection Iteration Iteration point between adjacent, so , you need to jump to step four, and W Mb first step orthogonal projection iteration iteration result of Step Mb initial point b. ,再次执行凸集圆域边界上的Mb步正交投影迭代,此时变换首次的投影迭代顺序,将原投影迭代的顺序由P1-P2-P3改为P2-P3-P1,当再次经过Mb步迭代,回溯检查mb=6步,发现迭代点的变化值小于口限A,说明迭代收敛主用户位置附近,因此将第二次Mb步正交投影迭代中最后L个迭代均值巧日图2星号所示)确定主用户位置。 , Performed again Mb orthogonal projection iteration step convex sets on the boundary circle domain, then converted the first projection iteration order, the original order of iteration projection by P1-P2-P3 to P2-P3-P1, when again after Mb iteration, backtracking check mb = 6 steps, detect changes in the value of the iteration point limit is less than the port A, described iteration convergence position near the main user, so the second iteration Mb orthogonal projection last step L iterations mean clever Day 2 shown asterisk) to determine the location of the primary user.

[0077] 图3是HybridPOCS定位算法与Back化eckPOCS定位算法的定位仿真结果比较图。 [0077] FIG. 3 is HybridPOCS location algorithm and Back of eckPOCS location algorithm positioning simulation results comparison chart. 图中横坐标为仿真重复次数,纵坐标是估计位置与目标真实位置之间的差值与感知用户到主用户之间真实距离平均值的比值。 The figure for the simulation of repetitions abscissa, the ordinate is the difference between the estimated position and perception of the user and the target's location to the ratio between the true distance between the main user average. 从图3中可W看出,一般情况下两种算法的定位精度比较接近,但是在某些情况下,Back化eckPOCS定位算法的定位精度比较有优势。 W from Figure 3 can be seen, the positioning accuracy of the two algorithms generally relatively close, but in some cases, Back localization precision localization algorithm eckPOCS comparative advantage. 该是因为,当主用户远离感知用户时,双曲线的渐近线性质容易致使双曲线的交点受到测距噪声的波动影响比较明显,因此在该种情况下,可W看出Back化eckPOCS算法的定位效果要比HybridPOCS算法优越。 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 that case, you can see the Back of eckPOCS W algorithm positioning effect than HybridPOCS algorithm is superior.

[007引图4描述了HybridPOCS定位算法与Back化eckPOCS定位算法在不同测距误差影响下,定位精度的比较。 [007 cited Figure 4 depicts the comparison HybridPOCS localization algorithm and Back of eckPOCS localization algorithm at different error influence ranging, positioning accuracy. 从图4中可W看出,Back化eckPOCS定位算法比HybridPOCS定位算法具有一定的优势,该主要是由于HybridPOCS算法中双曲线投影定位对于主用户在感知用户多边形之外的情况下收敛点受噪声波动较大,因此随着测距误差的增大。 W Figure 4 can be seen, Back of eckPOCS location algorithm than HybridPOCS localization algorithm has certain advantages, which is mainly due to HybridPOCS hyperbolic projection algorithm without the user locate the polygon outside the main users perceive the convergence point by noise fluctuations, so as the ranging error increases.

[0079] 尽管已经示出和描述了本发明的实施例,对于本领域的普通技术人员而言,可W 理解在不脱离本发明的原理和精神的情况下可w对该些实施例进行多种变化、修改、替换和变型,本发明的范围由所附权利要求及其等同限定。 [0079] Although there have been shown and described embodiments of the present invention, those of ordinary skill in the art, it can be understood W without departing from the principles and spirit of the present invention the situation may some embodiments w more variations, 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
Sınıflandırma
Uluslararası SınıflandırmaH04W64/00
Yasal Etkinlikler
TarihKodEtkinlikAçıklama
10 Tem 2013C06Publication
7 Ağu 2013C10Request of examination as to substance
5 Ağu 2015C14Granted