距离交会算法在无线传感网络节点定位中应用.pdfVIP

Vol. 32, No. 6 ACTA AUTOMATICA SINICA November, 2006 Using Linear Intersection for Node Location Computation in Wireless Sensor Networks1) SHI Qin-Qin1 HUO Hong1 FANG Tao1 LI De-Ren1,2 1(Institute of Image Processing and Pattern Recognition, Shanghai Jiaotong University, Shanghai 200240) 2(State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, Hubei 430072) (E-mail: shiqq@, honghuo@, tfang@) Abstract Knowing the locations of nodes in wireless sensor networks (WSN) is essential for many applications. Nodes in a WSN can have multiple capabilities and exploiting one or more of the capabilities can help to solve the localization problem. In this paper, we assume that each node in a WSN has the capability of distance measurement and present a location computation technique called linear intersection for node localization. We also propose an applied localization model using linear intersection and do some concerned experiments to estimate the location computation algorithm. Key words wirelell sensor network, localization, linear intersection, error 1 Introduction Generally, a WSN is composed of a large number of sensor nodes that are deployed outdoor at random (e.g., by dropping them from an aircraft) in a field[1]. It is essential to know the node location in many applications of WSN such as target tracking, event location reporting, geographic routing and directional querying. Determining the physical locations of sensor nodes after they have been deployed is known as the problem of localization[2]. GPS is the most popular locali