The Research And Analysis Of Node Localization On Ant Colony Algorithm In Wireless Sensor Network

It is important for the inspection to confirm the node or event position.And the node exact self-localization is not only the precondition of providing the information of inspection or target position but also the basis for the network function,which can provide network topology self-configuration and improve the route efficiency,at the same time,it can report the quality of network coverage to the manager and name the network space.Applying the Global Position System(GPS) to the sensor node localization is a natural idea.In view of the volume and energy of every node in sensor network,the limit of the total network expense,it is unpractical to fix a GPS in every node.And the GPS can not work in the indoor environment.Therefore,making use of the relative distance in every sensor to realize the sensor localization is our better choice.GPS nodes realize the localization of unknown node by moving in the signal sending position of the beacon.The route choice of GPS nodes is the key of realizing the node localization in wireless sensor network. This paper gives out the calculational method of the amount and coordinate of beacon sending positions by the equal distance 3-improved-coverage in rectangular ROI(region of interest).Ant colony algorithm is a kind of late-model simulative evolution ones and emphasizes on solving the combination optimization problem.In this paper a new algorithm touring the beacon sending point on the ant colony algorithm is brought forward.With trilateration this algorithm can realize the sensor node localization. Experimental results demonstrate that the localization method on the ant colony algorithm for sensor node in this paper make obvious progress than the existent ones both on the precise and on the efficiency.