Research On Coverage Problem Of Wireless Sensor Network

One of the most basic functions to sensor nodes of WSN is to determine the location of the location of the incident or the location of node which obtains information and this plays a key role in the effictiveness of the applications. Localization techniques and coverage optimization are two fundamental issues for this research field of WSN. As the basement of coverage problem. we first briefly introduce localization technique and the effectiveness of some localization algorithms.As the sensor nodes' energy,communications,computing and storage capacity are limited, this paper focuses on the relation between coverage optimization and network connectivity. Then the key reasearch field is how to send the data to the center using the least energy and in the shortest time aiming on coverage problems of wireless sensor networks. and gives a result of simulation in the fire using shortest path algorithm.This paper uses floyd algorithm for the shortest path and parallel floyd algorithm aiming on time and energy of wireless sensor network.