Wireless sensor networks, as an up-to-date technology, are one of the fastest growing technologies in the world today. Since these networks are used in military and agricultural environments as well as for observation of inaccessible environments, these networks need to
More
Wireless sensor networks, as an up-to-date technology, are one of the fastest growing technologies in the world today. Since these networks are used in military and agricultural environments as well as for observation of inaccessible environments, these networks need to be organized to achieve goals such as successful and timely sending of data to the main station. Clustering of wireless sensor networks is one of the most widely used methods for organizing these networks. Various ways to cluster these networks are provided, most of which are aimed at preventing energy loss and increasing the lifetime of sensor nodes. The thesis attempts to present a new geometric method for clustering the nodes of wireless sensor networks. In this geometric method, Apollonius circle is used to draw the abstract shape of the clusters and to assemble the nodes around the cluster head. Due to the high accuracy that it has in determining the fit of node distances, this circle can accurately assign nodes to cluster heads and prevent large single-node clusters or faraway nodes. In this algorithm, a main station, a number of nodes are used as a cluster header and a number of nodes as routers. The goal is to find the most accurate cluster heads and create clusters of high coverage in the network. The proposed method is implemented in MATLAB software and comparison of the results obtained from the view of successful data transmission, clustering accuracy, network lifetime and number of coverage areas, is showing accuracy of this method compared to optimal Leach algorithms and K-means presented in this field.
Manuscript profile