
技术领域technical field
本发明涉及无线传感器网络通信技术领域,尤其涉及一种基于扰动与环境、距离和能量约束的传感器选择方法。The invention relates to the technical field of wireless sensor network communication, in particular to a sensor selection method based on disturbance and environment, distance and energy constraints.
背景技术Background technique
目前,随着传感器小型化、智能化及计算能力提高,无线传感器网络(WSN)应用场景日益多元,使传感器选择逐渐成为无线传感器网络的研究热点。若利用无线传感器网络中的所有传感器节点对一个目标进行测量,可以获得与目标相关的最全面的信息,但这会增加无线传感器网络的能耗和处理负担。因此,根据无线传感器网络的精度要求,选择部分传感器节点对目标进行测量,可以节省能量,减少无线传感器网络的响应延迟,有利于延长无线传感器网络的使用寿命。At present, with the miniaturization, intelligence and improvement of computing power of sensors, the application scenarios of wireless sensor networks (WSN) are increasingly diversified, making sensor selection gradually become a research hotspot of wireless sensor networks. If all sensor nodes in the wireless sensor network are used to measure a target, the most comprehensive information about the target can be obtained, but this will increase the energy consumption and processing burden of the wireless sensor network. Therefore, according to the accuracy requirements of the wireless sensor network, selecting some sensor nodes to measure the target can save energy, reduce the response delay of the wireless sensor network, and prolong the service life of the wireless sensor network.
传感器对目标的估计性能和剩余能量是传感器选择中需要考虑的两个关键因素;Cristian Rusu等人提出了一种具有时间、能量和通信约束的传感器调度方法,在将问题建模为0-1问题,即不选择传感器节点或选择传感器节点问题的基础上,提出了一种基于凸松弛技术以及目标函数中嵌入惩罚项的迭代方法,直接优化均方误差,在保证估计精度的前提下,平衡无线传感器网络的能量和通信需求。但是,该方法仍然具有一些局限性。首先,此方法不涉及监测环境变化时对估计精度的影响;其次,未考虑传感器的量测信息和位置由于信号延迟等受到扰动时对传感器调度的影响。以上因素都会影响网络中的传感器节点调度,进而影响整个网络的估计精度和生命周期。The estimated performance of the sensor to the target and the remaining energy are two key factors to be considered in sensor selection; Cristian Rusu et al. proposed a sensor scheduling method with time, energy and communication constraints, in modeling the problem as 0-1 On the basis of the problem of not selecting sensor nodes or selecting sensor nodes, an iterative method based on convex relaxation technology and embedding penalty terms in the objective function is proposed to directly optimize the mean square error, and on the premise of ensuring the estimation accuracy, balance Energy and communication requirements for wireless sensor networks. However, this method still has some limitations. First, this method does not involve the impact of monitoring environmental changes on the estimation accuracy; secondly, it does not consider the impact on sensor scheduling when the sensor's measurement information and location are disturbed due to signal delays. The above factors will affect the scheduling of sensor nodes in the network, and then affect the estimation accuracy and life cycle of the entire network.
发明内容SUMMARY OF THE INVENTION
本发明的目的是提供一种基于扰动与环境、距离和能量约束的传感器选择方法,能够在传感器量测及位置存在有界扰动情况下,基于能量和估计精度约束,利用松弛技术,迭代求解最小数目传感器集,平衡能量和精度,实现最优选择。The purpose of the present invention is to provide a sensor selection method based on disturbance and environment, distance and energy constraints, which can iteratively solve the smallest Numerous sensor sets, balancing energy and precision for optimal selection.
本发明采用的技术方案为:The technical scheme adopted in the present invention is:
一种基于扰动与环境、距离和能量约束的传感器选择方法,依次包括以下步骤:A sensor selection method based on disturbance and environment, distance and energy constraints, including the following steps in sequence:
步骤一:在无线传感器监测区域内随机部署M个传感器构成集合Ω,测量目标x的N维参数,N∈N+,N+表示正整数;传感器节点i的量测为i=1,...,M;量测矩阵[·]T表示转置运算,设定传感器观测时刻T,T∈N+;Step 1: Randomly deploy M sensors in the wireless sensor monitoring area to form a set Ω, measure the N-dimensional parameters of the target x, N∈N+ , N+ represents a positive integer; the measurement of sensor node i is i=1,...,M; measurement matrix [·]T represents the transposition operation, set the sensor observation time T, T∈N+ ;
步骤二:根据监测区域环境的温度、能见度和相对湿度,构造环境因子C;根据传感器节点i和目标x的位置,确定距离参数di,距离参数矩阵dM=[d1,...,di,...,dM]T;由监测区域面积S和环境因子C以及传感器节点个数M确定相对区域面积SM;Step 2: According to the temperature, visibility and relative humidity of the environment in the monitoring area, construct the environmental factor C; according to the position of the sensor node i and the target x, determine the distance parameter di , the distance parameter matrix dM =[d1 ,..., di ,...,dM ]T ; the relative area area SM is determined by the monitoring area area S, the environmental factor C and the number M of sensor nodes;
由于距离目标较近的传感器节点具有较高的估计精度以及较少的能量消耗,因此由传感器节点i距离参数di和相对区域面积SM,确定传感器节点i的选择距离权重Hi,所有传感器节点的距离权重矩阵H∈RM;设定传感器节点i的量测扰动(ΔΦ)i,ΔΦ∈RM×N,量测扰动和传感器节点i与目标x的距离扰动(ΔPL)i,ΔPL∈RM的界分别为δΦ和δPL,传感器节点i的感测和处理成本si,Since the sensor nodes closer to the target have higher estimation accuracy and less energy consumption, the selected distance weight Hi of sensor node i is determined by the sensor node i distance parameter di and the relative area SM , and all sensors Node distance weight matrix H∈RM ; set the measurement disturbance of sensor node i (ΔΦ )i , ΔΦ ∈ RM×N , the measurement disturbance and the distance disturbance between sensor node i and target x (ΔPL )i , ΔPL ∈RM are bounded by δΦ and δPL , respectively, the sensing and processing cost si of sensor node i,
步骤三:根据传感器量测矩阵Φ以及量测扰动矩阵ΔΦ通过均方误差MSE公式确定传感器网络最低MSE,γ0;Step 3: According to the sensor measurement matrix Φ and the measurement disturbance matrixΔΦ , determine the lowest MSE of the sensor network, γ0 by the mean square error MSE formula;
步骤四:构造目标函数为最小化时刻T内带有权重(αt)i=((ωt)i+∈)-1,i=1,...,M的传感器节点选择个数,即选择矩阵Θ中的非零个数,Θ=[ω1,ω2,…,ωT],M维选择矢量ωt∈{0,1}M描述t时刻传感器集合Ω中传感器状态,传感器节点i被选中时,其序号对应的(ωt)i坐标为1,否则为0,其中(·)-1表示逆运算,∈是防止迭代过程中权重矢量(αt)i分母为零无意义的参数;使用传感器节点i进行处理和感测的成本不高于可用参考能量Step 4: Construct the objective function to minimize the number of sensor nodes with weight (αt )i =((ωt )i +∈)-1 ,i=1,...,M in time T, that is Select the non-zero number in the matrix Θ, Θ=[ω1 ,ω2 ,...,ωT ], the M-dimensional selection vector ωt ∈{0,1}M describes the sensor state in the sensor set Ω at time t, the sensor node When i is selected, the (ωt )i coordinate corresponding to its serial number is 1, otherwise it is 0, where ( )-1 represents the inverse operation, ∈ is to prevent the weight vector (αt )i denominator from being zero in the iteration process is meaningless parameters; the cost of processing and sensing using sensor node i is no higher than the available reference energy
对额外使用能量Ei加以惩罚,E∈RM;约束每个传感器节点i在观测时间T内最少选择一次;Penalize the extra use of energy Ei , E∈RM ; constrain each sensor node i to be selected at least once within the observation time T;
步骤五:将步骤四中求解的时刻T内的非凸传感器选择矩阵Θ∈{0,1}M×T采用0-1松弛技术,松弛为多面体约束Θ∈[0,1]M×T,Θ中元素由只能为0或1,松弛为0和1之间的实数,从而将步骤四中问题转化为凸问题,利用凸优化工具包进行求解;Step 5: Use the 0-1 relaxation technique to relax the non-convex sensor selection matrix Θ∈{0,1}M×T in the moment T solved in step 4 to the polyhedron constraint Θ∈[0,1]M×T , The elements in Θ can only be 0 or 1, and the relaxation is a real number between 0 and 1, so that the problem in step 4 is transformed into a convex problem, and the convex optimization toolkit is used to solve it;
步骤六:设定初始传感器选择权重αt=1,初始全零解选择矩阵Θ0=0M×T,未选择传感器节点集合和选择传感器节点集合是空集;Step 6: Set the initial sensor selection weight αt =1, the initial all-zero solution selection matrix Θ0 =0M×T , no sensor node set is selected and select sensor node set is the empty set;
步骤七:根据步骤五转化后的凸问题中的目标函数与约束条件公式,求解出传感器节点选择矩阵Θ;Step 7: Solve the sensor node selection matrix Θ according to the objective function and constraint formula in the transformed convex problem in step 5;
步骤八:采用舍入方法更新集合:由N={n|Θ(n)≤∈}更新未选择传感器节点集合N,K={k|Θ(k)≥1-∈}更新选择传感器节点集合K,∈=10e-5;Step 8: Use the rounding method to update the set: update the unselected sensor node set N by N={n|Θ(n)≤∈}, and update the selected sensor node set with K={k|Θ(k)≥1-∈} K, ∈ = 10e-5;
步骤九:如果迭代过程已经收敛,即则更新集合||·||F表示F-范数;Step 9: If the iterative process has converged, i.e. then update the collection ||·||F represents the F-norm;
步骤十:当时刻T内M个传感器节点全部分配到集合N和K中,即|N|+|K|=M×T时结束,否则令Θ0=Θ,由(αt)i=((ωt)i+∈)-1更新权重,重复步骤七至步骤十。Step 10: When all M sensor nodes are allocated to sets N and K at time T, that is, |N|+|K|=M×T, the process ends; otherwise, let Θ0 =Θ, by (αt )i = ( (ωt )i +∈)-1 to update the weights, and repeat steps seven to ten.
在步骤二中,所述由监测区域环境的温度、能见度和相对湿度确定的环境因子C、距离参数矩阵dM和相对区域面积SM、距离权重矩阵H,其表达式如下:In step 2, the environmental factor C, the distance parameter matrix dM , the relative area area SM , and the distance weight matrix H determined by the temperature, visibility and relative humidity of the monitoring area environment are expressed as follows:
C=V/(pht0),C=V/(pht0 ),
(dM)i=1/||mi-b||2,i=1,...,M,SM=SC/M,Hi=(SM(ωt)i)⊙(dM)i,(dM )i =1/||mi -b||2 , i=1,...,M,SM =SC/M,Hi =(SM (ωt )i )⊙(dM )i ,
其中V为能见度,p为环境调节参数,h为相对湿度,t0为温度,(dM)i表示传感器节点i与目标x间距离的倒数,b=[bx,by]为目标x的坐标位置,mi=[mix,miy]为传感器节点i的坐标位置,S为监测区域面积,ωt∈RM为t时刻的传感器节点选择向量,||·||2表示2-范数,⊙表示Hadamard积。where V is the visibility, p is the environmental adjustment parameter, h is the relative humidity, t0 is the temperature, (dM )i is the reciprocal of the distance between the sensor node i and the target x, b= [bx ,by ] is the target x The coordinate position of , mi =[mix ,miy ] is the coordinate position of the sensor node i, S is the monitoring area area, ωt ∈RM is the sensor node selection vector at time t, ||·||2 means 2 - norm, ⊙ denotes the Hadamard product.
在步骤三中,所述最低MSE如下:In step three, the minimum MSE is as follows:
γ0=tr((ΦTΦ)-1),其中tr(·)表示求迹运算。γ0 =tr((ΦT Φ)-1 ), where tr(·) represents a trace operation.
在步骤四中,所述目标函数和约束条件为:In step 4, the objective function and constraints are:
s.t.tr(((Φ+ΔΦ)Tdiag(H)(Φ+ΔΦ))-1)≤τγ0-C (a)sttr(((Φ+ΔΦ )T diag(H)(Φ+ΔΦ ))-1 )≤τγ0 -C (a)
C-γ0(τ-1)≤0 (b)C-γ0 (τ-1)≤0 (b)
(diag(s)Θ1)⊙(PL+ΔPL)≤e0+E (c)(diag(s)Θ1)⊙(PL +ΔPL )≤e0 +E (c)
其中αt∈RM,(αt)i=((ωt)i+∈)-1,i=1,...,M为权重矢量,Θ=[ω1,ω2,…,ωT]为选择矩阵;ΔΦ∈RM×N为传感器节点量测扰动,diag(H)表示以距离权重矩阵H为对角线的对角矩阵;ΔPL∈RM×1为传感器节点与目标之间的距离扰动,δΦ、δPL分别为其扰动的界;为处理和感测成本,diag(s)表示以成本矩阵s为对角线的对角矩阵;1T×1为全1矩阵;PL=[(PL)1,...(PL)i,...(PL)M]T,表示传感器节点i与目标x距离相关的Rayleigh信道衰减,η为信道衰减因子;为可用参考能量,E∈RM为额外使用能量,惩罚函数λ为正则化参数;||·||∞表示∞-范数;where αt ∈RM , (αt )i =((ωt )i +∈)-1 , i=1,...,M is the weight vector, Θ=[ω1 ,ω2 ,...,ωT ] is the selection matrix; ΔΦ ∈ RM×N is the sensor node measurement disturbance, diag(H) represents the diagonal matrix with the distance weight matrix H as the diagonal; ΔPL ∈ RM×1 is the sensor node and the The distance disturbance between targets, δΦ and δPL are the bounds of the disturbance respectively; For processing and sensing costs, diag(s) represents a diagonal matrix with cost matrix s as the diagonal; 1T×1 is an all-one matrix; PL =[(PL )1 ,...(PL )i ,...(PL )M ]T , represents the Rayleigh channel attenuation related to the distance between sensor node i and target x, and η is the channel attenuation factor; is the available reference energy, E∈RM is the additional energy used, and the penalty function λ is the regularization parameter; ||·||∞ represents the ∞-norm;
1)通过矩阵变换,将约束条件||ΔΦ||2<δΦ与(a)转化为线性矩阵不等式形式:1) Through matrix transformation, the constraints ||ΔΦ ||2 <δΦ and (a) are transformed into linear matrix inequality form:
tr(U-1)≤τγ0-C,tr(U-1 )≤τγ0 -C,
β≥0β≥0
U∈RN×N是一个对称正定矩阵,且U≤(Φ+ΔΦ)Tdiag(H)(Φ+ΔΦ),I为N×N的单位阵,β≥0是转化过程中的辅助参数;U∈RN×N is a symmetric positive definite matrix, and U≤(Φ+ΔΦ )T diag(H)(Φ+ΔΦ ), I is an N×N identity matrix, β≥0 is the transformation process auxiliary parameters;
2)将约束条件(c)与||ΔPL||∞<δPL,转化为矢量约束:2) Convert constraint (c) and ||ΔPL ||∞ <δPL into vector constraints:
其中,in,
因此问题可表示为:So the problem can be expressed as:
在步骤五中,所述问题转化为凸问题表示为:In step five, the problem is transformed into a convex problem expressed as:
本发明针对现有传感器选择方法中未考虑环境因素以及节点量测扰动和节点与目标间距离扰动因素对目标监测精度的影响,提出一种基于环境、能量和估计精度约束的传感器选择方法,利用松弛技术以及目标函数中嵌入惩罚项的迭代方法,在保证估计精度的前提下,迭代求解最小传感器选择数目集,平衡无线传感器网络的能量。Aiming at the influence of environmental factors and node measurement disturbance and distance disturbance factors between nodes and targets on the target monitoring accuracy that are not considered in the existing sensor selection methods, the present invention proposes a sensor selection method based on the constraints of environment, energy and estimation accuracy. The relaxation technique and the iterative method of embedding the penalty term in the objective function, under the premise of ensuring the estimation accuracy, iteratively solve the minimum sensor selection number set to balance the energy of the wireless sensor network.
附图说明Description of drawings
为了更清楚地说明本发明实施例或现有技术中的技术方案,下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍,显而易见地,下面描述中的附图仅仅是本发明的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动的前提下,还可以根据这些附图获得其他的附图。In order to illustrate the embodiments of the present invention or the technical solutions in the prior art more clearly, the following briefly introduces the accompanying drawings that are used in the description of the embodiments or the prior art. Obviously, the drawings in the following description are only These are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can also be obtained according to these drawings without creative efforts.
图1为本发明的流程图。FIG. 1 is a flow chart of the present invention.
具体实施方式Detailed ways
下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完整地描述,显然,所描述的实施例仅仅是本发明一部分实施例,而不是全部的实施例。基于本发明中的实施例,本领域普通技术人员在没有付出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.
如图1所示,本发明包括以下步骤:As shown in Figure 1, the present invention comprises the following steps:
(1):在无线传感器监测区域内随机部署M个传感器构成集合Ω,测量目标x的N维参数,N∈N+,N+表示正整数。传感器节点i的量测为量测矩阵[·]T表示转置运算,设定传感器观测时刻T,T∈N+。(1): Randomly deploy M sensors in the wireless sensor monitoring area to form a set Ω, measure the N-dimensional parameters of the target x, N∈N+ , N+ represents a positive integer. The measurement of sensor node i is Measurement matrix [·]T represents the transposition operation, and sets the sensor observation time T, T∈N+ .
(2):根据监测区域环境的温度、能见度和相对湿度,构造环境因子C=V/(pht0),其中V为能见度,p为环境调节参数,h为相对湿度,t0为温度;根据传感器节点i和目标x的位置,确定距离参数di=1/||mi-b||2,i=1,...,M,b=[bx,by]为目标x的坐标位置,mi=[mix,miy]为传感器节点i坐标位置,距离参数矩阵dM=[d1,...,di,...,dM]T,||·||2表示2-范数;由监测区域面积S和环境因子C以及传感器节点个数M确定相对区域面积SM=SC/M;显然距离目标较近的传感器节点具有较高的估计精度以及较少的能量消耗,因此由传感器节点i距离参数di和相对区域面积SM确定传感器节点i的距离权重Hi=(SM(ωt)i)⊙(dM)i,所有节点的距离权重矩阵H∈RM,ωt∈RM为t时刻的节点选择向量,⊙表示Hadamard积;设定传感器节点i的量测扰动(ΔΦ)i,ΔΦ∈RM×N和传感器节点i与目标x的距离扰动(ΔPL)i,ΔPL∈RM的界分别为δΦ和δPL,传感器节点i的感测和处理成本si,(2): According to the temperature, visibility and relative humidity of the environment in the monitoring area, construct the environmental factor C=V/(pht0 ), where V is the visibility, p is the environmental adjustment parameter, h is the relative humidity, and t0 is the temperature; according to For the position of sensor node i and target x, determine the distance parameter di =1/||mi -b||2 , i=1,...,M, b= [bx ,by ] as the target x Coordinate position, mi =[mix ,miy ] is the coordinate position of sensor node i, distance parameter matrix dM =[d1 ,...,di ,...,dM ]T , || ·| |2 represents the 2-norm; the relative area area SM = SC/M is determined by the monitoring area area S, the environmental factor C and the number of sensor nodes M; it is obvious that the sensor nodes closer to the target have higher estimation accuracy and higher estimation accuracy. Therefore, the distance weight Hi =(SM (ωt )i )⊙(dM )i of the sensor node i is determined by the distance parameter di of the sensor node i and the relative areaSM Weight matrix H∈RM , ωt ∈ RM is the node selection vector at time t, ⊙ represents Hadamard product; set the measurement disturbance of sensor node i (ΔΦ )i , ΔΦ ∈ RM×N and sensor node The distance perturbation between i and target x (ΔPL )i , ΔPL ∈RM is bounded by δΦ and δPL , respectively, the sensing and processing cost si of sensor nodei ,
(3):根据传感器量测矩阵Φ以及量测扰动矩阵ΔΦ和均方误差MSE公式确定传感器网络最低MSE,γ0=tr((ΦTΦ)-1),即选择所有的传感器节点,得到最好的估计精度。其中tr(·)表示求迹运算,(·)-1表示逆运算。由于对传感器节点进行部分选择,估计精度下降,网络MSE增大,精度等级τ增加。设定估计精度等级τ≥1。均方误差MSE公式为现有的技术,在此不再赘述。(3): Determine the lowest MSE of the sensor network according to the sensor measurement matrix Φ, the measurement disturbance matrix ΔΦ and the mean square error MSE formula, γ0 =tr((ΦT Φ)-1 ), that is, select all sensor nodes, Get the best estimation accuracy. Where tr( ) represents the trace operation, and ( )-1 represents the inverse operation. Due to the partial selection of sensor nodes, the estimation accuracy decreases, the network MSE increases, and the accuracy level τ increases. Set the estimation accuracy level τ≥1. The mean square error MSE formula is an existing technology and will not be repeated here.
(4)构造目标函数为最小化时刻T内带有权重矢量(αt)i=((ωt)i+∈)-1,i=1,...,M的传感器节点选择个数,即选择矩阵Θ中的非零个数,Θ=[ω1,ω2,…,ωT],M维选择矢量ωt∈{0,1}M描述t时刻传感器集合Ω中传感器状态,传感器节点i被选中时,其序号对应的(ωt)i坐标为1,否则为0;∈是防止迭代过程中权重矢量(αt)i分母为零无意义的参数;在监测环境因子C的条件下,若要提高传感器选择节点的估计精度,则需要更多节点满足环境要求,且距离目标较近的传感器节点具有较高的估计精度,因此约束在环境因子C和距离权重H影响下,由(3)中MSE公式,使选择节点的估计精度高于一定精度误差水平且低于最高误差水平;约束在Rayleigh信道衰减下,使用传感器节点i进行处理和感测的成本不高于可用参考能量为了避免消耗传感器节点i的额外能量消耗,因此对额外使用能量Ei加以惩罚,E∈RM;为平衡网络能量,避免多次使用同一个传感器节点,约束每个传感器节点i在观测时间T内最少选择一次。目标函数如下:(4) Construct the objective function to minimize the number of sensor nodes with weight vector (αt )i =((ωt )i +∈)-1 ,i=1,...,M in time T, That is, select the non-zero number in the matrix Θ, Θ=[ω1 ,ω2 ,...,ωT ], the M-dimensional selection vector ωt ∈{0,1}M describes the sensor state in the sensor set Ω at time t, the sensor When node i is selected, the (ωt )i coordinate corresponding to its serial number is 1, otherwise it is 0; ∈ is a parameter that prevents the denominator of the weight vector (αt )i from being zero in the iterative process; Under the conditions, to improve the estimation accuracy of sensor selection nodes, more nodes are required to meet the environmental requirements, and the sensor nodes closer to the target have higher estimation accuracy. Therefore, under the influence of the environmental factor C and the distance weight H, According to the MSE formula in (3), the estimation accuracy of the selected node is higher than a certain accuracy error level and lower than the highest error level; under the constraint of Rayleigh channel attenuation, the cost of processing and sensing using sensor node i is not higher than the available reference energy In order to avoid consuming the extra energy consumption of sensor node i, the extra energy Ei is penalized, E∈RM ; in order to balance the network energy, avoid using the same sensor node multiple times, and constrain each sensor node i in the observation time T Select at least once. The objective function is as follows:
s.t.tr(((Φ+ΔΦ)Tdiag(H)(Φ+ΔΦ))-1)≤τγ0-C (a)sttr(((Φ+ΔΦ )T diag(H)(Φ+ΔΦ ))-1 )≤τγ0 -C (a)
C-γ0(τ-1)≤0 (b)C-γ0 (τ-1)≤0 (b)
(diag(s)Θ1)⊙(PL+ΔPL)≤e0+E (c)(diag(s)Θ1)⊙(PL +ΔPL )≤e0 +E (c)
其中αt∈RM,(αt)i=((ωt)i+∈)-1,i=1,...,M为权重矢量,Θ=[ω1,ω2,…,ωT]为选择矩阵;表示传感器节点i与目标x距离相关的Rayleigh信道衰减,η为信道衰减因子;ΔΦ∈RM×N为节点量测扰动,ΔPL∈RM×1为节点与目标之间的距离扰动,δΦ、δPL分别为其扰动的界;为处理和感测成本;为可用参考能量,E∈RM为额外使用能量,惩罚函数λ为正则化参数;||·||∞表示∞-范数。where αt ∈RM , (αt )i =((ωt )i +∈)-1 , i=1,...,M is the weight vector, Θ=[ω1 ,ω2 ,...,ωT ] is the selection matrix; represents the Rayleigh channel attenuation related to the distance between sensor node i and target x, η is the channel attenuation factor; ΔΦ ∈ RM×N is the node measurement disturbance, ΔPL ∈ RM×1 is the distance disturbance between the node and the target, δΦ and δPL are the perturbation bounds respectively; for processing and sensing costs; is the available reference energy, E∈RM is the additional energy used, and the penalty function λ is the regularization parameter; ||·||∞ represents the ∞-norm.
1)通过矩阵变换,将约束条件||ΔΦ||2<δΦ与(a)转化为线性矩阵不等式形式:1) Through matrix transformation, the constraints ||ΔΦ ||2 <δΦ and (a) are transformed into linear matrix inequality form:
tr(U-1)≤τγ0-C,tr(U-1 )≤τγ0 -C,
β≥0β≥0
U∈RN×N是一个对称正定矩阵,且U≤(Φ+ΔΦ)Tdiag(H)(Φ+ΔΦ),I为N×N的单位阵,β≥0是转化过程中的辅助参数;U∈RN×N is a symmetric positive definite matrix, and U≤(Φ+ΔΦ )T diag(H)(Φ+ΔΦ ), I is an N×N identity matrix, β≥0 is the transformation process auxiliary parameters;
2)将约束条件(c)与||ΔPL||∞<δPL,转化为矢量约束:2) Convert constraint (c) and ||ΔPL ||∞ <δPL into vector constraints:
其中,in,
因此问题可表示为:So the problem can be expressed as:
(5)将(4)中求解的时刻T内的非凸节点选择矩阵Θ∈{0,1}M×T松弛为多面体约束Θ∈[0,1]M×T,从而将(4)中问题转化为如下凸问题,利用凸优化工具包进行求解:(5) Relax the non-convex node selection matrix Θ∈{0,1}M×T in the time T solved in (4) into a polyhedral constraint Θ∈[0,1]M×T , so that in (4) The problem is transformed into the following convex problem, which is solved using the convex optimization toolkit:
(diag(s)Θ1)⊙(PL+Π)≤e0+E(diag(s)Θ1)⊙(PL +Π)≤e0 +E
tr(U-1)≤τγ0-Ctr(U-1 )≤τγ0 -C
β≥0β≥0
C-γ0(τ-1)≤0C-γ0 (τ-1)≤0
(6):设定初始节点选择权重αt=1,初始全零解选择矩阵Θ0=0M×T,未选择节点集合和选择节点集合(6): Set the initial node selection weight αt =1, the initial all-zero solution selection matrix Θ0 =0M×T , no node set is selected and select node collection
(7):根据(5)确定的目标函数与约束条件公式,求解出节点选择矩阵Θ。(7): According to the objective function and constraint formula determined in (5), the node selection matrix Θ is solved.
(8):由N={n|Θ(n)≤∈}更新未选择节点集合N,K={k|Θ(k)≥1-∈}更新选择节点集合K,∈=10e-5。(8): Update the unselected node set N by N={n|Θ(n)≤∈}, and update the selected node set K with K={k|Θ(k)≥1-∈}, ∈=10e-5.
(9):如果迭代过程已经收敛,即则更新集合||·||F表示F-范数。(9): If the iterative process has converged, i.e. then update the collection ||·||F represents the F-norm.
(10):当时刻T内M个传感器节点全部分配到集合N和K中,即|N|+|K|=M×T时结束,否则令Θ0=Θ,由(αt)i=((ωt)i+∈)-1更新选择权重,重复(7)至(10)。(10): When all M sensor nodes are allocated to sets N and K at time T, that is, |N|+|K|=M×T, it ends, otherwise let Θ0 =Θ, by (αt )i = ((ωt )i +∈)-1 to update the selection weight, repeat (7) to (10).
以上结合附图详细说明了本发明的技术方案,本发明的技术方案提出了一种新的基于不确定性扰动的在环境、距离和能量约束下的传感器选择方法。The technical solution of the present invention is described in detail above with reference to the accompanying drawings, and the technical solution of the present invention proposes a new sensor selection method under the constraints of environment, distance and energy based on uncertainty disturbance.
注意,上述仅为本发明的较佳实施例及运用技术原理。本领域技术人员会理解,本发明不限于这里所述的特定实施例,对本领域技术人员来说能够进行各种明显的变化、重新调整和替代而不会脱离本发明的保护范围。因此,虽然通过以上实施例对本发明进行较详细的说明,但本发明不限于这里所述的特定实施例,在不脱离本发明构思的情况下,还可以包括更多其他等有效实施例,而本发明的范围由所附的权利要求范围决定。Note that the above is only the preferred embodiment of the present invention and the technical principle of its application. Those skilled in the art will understand that the present invention is not limited to the specific embodiments described herein, and various obvious changes, readjustments and substitutions can be made by those skilled in the art without departing from the protection scope of the present invention. Therefore, although the present invention is described in detail through the above embodiments, the present invention is not limited to the specific embodiments described herein, and can also include more other effective embodiments without departing from the concept of the present invention. The scope of the invention is determined by the scope of the appended claims.
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011549597.7ACN112637807B (en) | 2020-12-24 | 2020-12-24 | Sensor selection method based on disturbance and environment, distance and energy constraints |
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011549597.7ACN112637807B (en) | 2020-12-24 | 2020-12-24 | Sensor selection method based on disturbance and environment, distance and energy constraints |
| Publication Number | Publication Date |
|---|---|
| CN112637807Atrue CN112637807A (en) | 2021-04-09 |
| CN112637807B CN112637807B (en) | 2022-05-27 |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011549597.7AActiveCN112637807B (en) | 2020-12-24 | 2020-12-24 | Sensor selection method based on disturbance and environment, distance and energy constraints |
| Country | Link |
|---|---|
| CN (1) | CN112637807B (en) |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116523155A (en)* | 2023-04-04 | 2023-08-01 | 南京大学 | Convex relaxation-based full-coverage path planning method |
| CN117452806A (en)* | 2023-12-18 | 2024-01-26 | 广东海洋大学 | Course control method of underwater bionic fish robot |
| CN119622968A (en)* | 2024-11-26 | 2025-03-14 | 中国农业大学 | A multi-objective sensor layout optimization method for poultry houses based on conditional constraints |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104038993A (en)* | 2014-05-28 | 2014-09-10 | 南京邮电大学 | Wireless sensor network node selection method based on blind source separation |
| CN108566663A (en)* | 2018-01-10 | 2018-09-21 | 重庆邮电大学 | SDWSN energy consumption balance routing algorithms based on disturbance particle group optimizing |
| AU2018101753A4 (en)* | 2018-11-17 | 2019-01-03 | Feng Chen | Distributed diffusion Least Mean-Square Estimation With Neighbor-partial and Data-selective |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104038993A (en)* | 2014-05-28 | 2014-09-10 | 南京邮电大学 | Wireless sensor network node selection method based on blind source separation |
| CN108566663A (en)* | 2018-01-10 | 2018-09-21 | 重庆邮电大学 | SDWSN energy consumption balance routing algorithms based on disturbance particle group optimizing |
| AU2018101753A4 (en)* | 2018-11-17 | 2019-01-03 | Feng Chen | Distributed diffusion Least Mean-Square Estimation With Neighbor-partial and Data-selective |
| Title |
|---|
| DANIEL C. FERNÁNDEZ: "Model Predictive Control for Underwater Robots in Ocean Waves", 《IEEE ROBOTICS AND AUTOMATION LETTERS》* |
| JUNWEI LI: "Weighted Conflict Evidence Combination Method Based on Hellinger Distance and the Belief Entropy", 《IEEE ACCESS》* |
| 刘浩: "无线自组织网络一致算法安全与隐私研究=", 《信息科技辑》* |
| 周林: "贝叶斯框架下基于凸优化的系统偏差估计方法", 《探测与控制学报》* |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116523155A (en)* | 2023-04-04 | 2023-08-01 | 南京大学 | Convex relaxation-based full-coverage path planning method |
| CN117452806A (en)* | 2023-12-18 | 2024-01-26 | 广东海洋大学 | Course control method of underwater bionic fish robot |
| CN117452806B (en)* | 2023-12-18 | 2024-03-19 | 广东海洋大学 | Course control method of underwater bionic fish robot |
| CN119622968A (en)* | 2024-11-26 | 2025-03-14 | 中国农业大学 | A multi-objective sensor layout optimization method for poultry houses based on conditional constraints |
| CN119622968B (en)* | 2024-11-26 | 2025-10-03 | 中国农业大学 | A multi-target sensor layout optimization method for poultry houses based on conditional constraints |
| Publication number | Publication date |
|---|---|
| CN112637807B (en) | 2022-05-27 |
| Publication | Publication Date | Title |
|---|---|---|
| CN112637807B (en) | Sensor selection method based on disturbance and environment, distance and energy constraints | |
| Lin et al. | Model-based adversarial meta-reinforcement learning | |
| Lu et al. | Edge QoE: Computation offloading with deep reinforcement learning for Internet of Things | |
| CN110163429B (en) | A Short-Term Load Forecasting Method Based on Optimal Screening of Similar Days | |
| Wu et al. | Mobility-aware deep reinforcement learning with glimpse mobility prediction in edge computing | |
| Wan et al. | Deep reinforcement learning enabled multi-UAV scheduling for disaster data collection with time-varying value | |
| Li et al. | UAV trajectory optimization for spectrum cartography: A PPO approach | |
| Wu et al. | RNN-K: A reinforced Newton method for consensus-based distributed optimization and control over multiagent systems | |
| Hu et al. | Distributed multiagent reinforcement learning with action networks for dynamic economic dispatch | |
| CN108764577A (en) | Online time series prediction technique based on dynamic fuzzy Cognitive Map | |
| CN111258743B (en) | Cloud task scheduling method, device, equipment and storage medium based on discrete coding | |
| Yang et al. | Profile-free and real-time task recommendation in mobile crowdsensing | |
| CN105976018B (en) | Discrete dove group's method for monitoring structural health conditions sensors location | |
| Chang et al. | Attention-based deep reinforcement learning for edge user allocation | |
| Mekala et al. | Computational intelligent sensor-rank consolidation approach for industrial internet of things (iiot) | |
| Han et al. | Data-Driven robust multimodal multiobjective particle swarm optimization | |
| Wu et al. | Energy efficient UAV-Aassisted IoT data collection: A graph-based deep reinforcement learning approach | |
| Zhang et al. | Offloading demand prediction-driven latency-aware resource reservation in edge networks | |
| CN120075056A (en) | Data stream optimization method and system based on artificial intelligence | |
| Xu et al. | 3D network-on-chip data acquisition system mapping based on reinforcement learning and improved attention mechanism | |
| CN111093216A (en) | A Node Scheduling Method for Wireless Sensor Networks Based on Improved Binary Particle Swarm Optimization | |
| Chen et al. | A distributed algorithm with dynamic event-triggered mechanism for resource allocation problems | |
| CN111353530A (en) | Frequency spectrum channel clustering method based on ultralimit learning machine | |
| Tong et al. | Global optimization of wireless seismic sensor network based on the Kriging model and improved particle swarm optimization algorithm | |
| Chen et al. | Open Multimode Process Monitoring: A Dual Memory-Based Continual Dictionary Learning Method |
| 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |