| Wireless sensor networks (WSN) localization based on received signal strength indication (RSSI) is a new kind of technology, which is popular with people in recent years. Its basic idea is that wireless sensor networks are deployed in object region, and then every sensor node communicates with each other and organizes to form the network. When any event happened in monitored area, it will instantly convey the result depends on data transmission and get a real time positioning about the region where event happen.This essay studies the existing coverage connectivity control and localization algorithm. In other words, it analyses and summarizes the way of coverage connectivity, the range-based localization algorithms and range-free localization algorithms. Based on above algorithms, the essay also proposes a kind of method for random coverage and positioning in view of RSSI. Before accomplishing the goal of positioning, what need to be considered firstly is the way of node deployment, coverage and connectivity of sensor networks. The essay studies that when sensor nodes are mutually independent and distributed equally whit random deployment, they usually conform to Poisson distribution. So the amount of required nodes can be calculated out in certain coverage situation, which is essential for localization in WSN. More, the character of coverage and connectivity are premiere, so this essay also uses the Delaunay triangulation to study the coverage and connectivity of the network, to analyze the possible loopholes and dead zones that may appear. According to above efforts, it gets out the thought of localization algorithm based on RSSI, whit correcting methods for potential problems to satisfy the demands of position accurate. Finally, the essay figures out the specific algorithm process, which has been successful simulated in Matlab. Following the principle that deployment needs to be done first and then positioning, this essay proposes a kind of instructive method for further study. |
PDF Full Text Request