Research On Beaconless Localization Algorithm In Wireless Sensor Networks

Node location is one of the most important supporting technologies in actual application of the wireless sensor network, and also one of the hotspot which related researchers focused on.Most of the localization algorithm is depend on a small number of beacon nodes to determine the location of most other general nodes, and the coordinate information of beacon nodes, is essentially provided by the global satellite positioning system. The localization way which supported with beacon nodes exist the following problems at least:First, the number of beacon nodes can’t be too large, supporting a larger number of nodes deployed in case of positioning is more difficult; second, beacon nodes due to human or environmental factors, often occurrence of drift, causing the other node is difficult to pinpoint; Third, when the environment in the room or have some kind of interference, the operation of the beacon nodes will be bumped, of course, other nodes will be difficult to locate.This paper presents a beaconless node localization algorithm for wireless sensor networks: CDAP Algorithm. In non-beacon nodes exist, using of the improved clustering algorithm based on node density algorithm:ICAND algorithm to clustering, through the way of distributed to locating, combined the angle measurement and distance measurement, reference to the similar concept of time synchronization, gradually adjust the node position, in order to calculate all the coordinates of nodes in the regional coordinate system.Experiments show that the algorithm, in the case of randomly distributed nodes, CDAP algorithm in network coverage, positioning error and communication overhead rate have good performance, compared to clustering SPA algorithm which industry-recognized, the network coverage increase at least51.3%; In addition, when the node density is larger than0.9, the positioning error rate reduced by22.3%on the average.