The Research Of Clustering Algorithm With Well-distributed Cluster Head In Wireless Sensor Network

As a popular research, wireless sensor network is in great concern. It is acombination of many kinds of branch of learnings, such as wireless network, micro-electronic and so on. As the highly integrated knowledge of the wireless sensor network,it’s always been split into different research areas. Three of the important areas are thetopology control, location algorithm and router protocol. They are not independent ofeach other, the key point of their algorithms always have an indispensable link. Afterdeep research of some algorithms, this atricle proposes a new clustering algorithm whichcontaion the advantage of different algorithms and a new locating algotirhm which canhelp with other algorithms.First of all, this article focus on the topology control and locating algorithm. Thereare lots of clustering algorithms in the field, there are also different ways to divide theclustering algorithms. Different algorithms have different characters and one algorithmmay have more than one type characteristics. After comprehensive study about theLEACH algorithm, GAF algorithm and the power control theory, the article puts forwarda new clustering algorithm, name as deep search algorithm. The new algorithm’s keytheory is that by control the power of wireless communication, the node broadcast twicein differenet transmit power to make sure the area of next cluster head and choose thenext cluster head. The operation precess of the algorithm is like a deep se arch in thenetwork area. With the control of twice transmit power, the distribution of the clusterhead can been regulated. In the runtime of the deep search algorithm, the nodes don’tneed any locating support. The simulation results show that the algorithm can keep thegeographical uniformly of the cluster heads.After that, this article further analysis the deep search algorithm, find that in thegeneration of the first two cluster heads, these are some special nodes and network areas.Meanwhile, in the rearch of the wireless sensor network node locating alrogirhtm, afterdeep analysis about the RSSI location algorithm, include the realization principle andthe implementation complexity, which could been combined with the special nodes andareas, so the virtual node mapping algorithm is been proposed. By using the twicebroadcasting to gengrate a virtual triangle, which can be used as a basis of trianglelocation to location the other sensor nodes, in the end a vistual map can been generated.The simulation results show that the result of the vitual node mapping algorithm is not an accurate location mape, but the algotirhm does not need any external location support,which can be used in some other ways, such as the network boundary location and soon.