Topology Control Algorithms Based On Computational Geometry Graph

In recent years, wireless sensor networks, a new network technology, has been developed rapidly and paid great attention to. The sensor node in wireless sensor networks is the size of small embedded device, using the limited battery-powered energy. It is impossible to replace the battery because of the environment. So energy saving becomes the primary task of the wireless sensor networks. Reducing node energy consumption is the main design purpose of the topology control algorithm. Hence, the research of topology control algorithms becomes one of the central problems in the study of wireless sensor networks. A well topology structure can improve the efficiency of MAC protocol and router protocol, prolong the lifetime of the network, and reduce the interference of communication.Considering that the energy consumption of the sensor node is mainly in communication module and energy consumption is proportion to the n'th power of the communication distance, this paper presents a plain topology control algorithm. Due to the good properties of the Delaunay graph in computational geometry, we construct a Delaunay graph among the sensor nodes and simplify the graph according to the relationship of the energy consumption and communication distance. By preserving the optimal energy consumption path and combining with the MG model, we obtain the MEDel algorithm. This algorithm has the advantages of symmetry and bounded average node degree.Clustering algorithm is more efficient than the flat topology control algorithm. In view of the deficiency of LEACH clustering algorithm, we propose a clustering algorithm-ECR algorithm. The algorithm aims at improving the distribution of the cluster heads and the structure of the cluster, based on the residual energy. Thus the algorithm can prolong the lifetime of network, balance the distribution of the heads and improve the structure of the members of the cluster.