convx 定位 凸规划.pptxVIP

Convex Position Estimation in Wireless Sensor Networks杭小杰AbstractA method for estimating unknown node positions in a sensor network based exclusively on connectivity-induced constraints is described.Additionally, a method for placing rectangular bounds around the possible positions for all unknown nodes in the network is given.Specific models are suggested and simulated for isotropic and directional communication, representative of broadcast-based and optical transmission respectivelyI. INTRODUCTIONIn a network of thousands of nodes, it is unlikely that the designer will determine the position of each node.GPS is too expensive.Positional information can be inferred from connection-imposed proximity constraints. In this model, only a few nodes have known positions and the remainder of the node positions are computed from knowledge about communication links.II. MATHEMATICAL FORMULATIONA linear program (LP) is a problem of the form: Minimize Subject to: Ax bA generalization of the LP is the semidefinite program (SDP) of the form: Minimize Subject to: Ax b In two dimensions, each node has a position (x,y). For position estimation, a single vector with all the positions is formed: x =[x1 y1 ... xm ym... xm+1 ym+1 ... xn yn]T m:known position nodes n:all nodes III. CONVEX CONSTRAINT MODELSA. Connections as convex constraints Given the position of node A, what is the set of possible positions for node BB.Radial constraint – RF communication The RF transmitter of a wireless sensor node can be modeled as having a rotationally symmetric range as illustrated in Figure (a). In this symmetric model, a connection between nodes can be represented by a 2-norm constraint on the node positions.Specifically, for a maximum range R and node positions a and b, the equivalent LMI is given by:A variant of this problem is to use the exact distance between nodes as the outer distance bound in the above LMI:Note that neither of the following are convex constraints:The latter would