Research On Topology Control Algorithm For Wireless Sensor Networks

Wireless sensor network is an important technology to acquire information because of itslow cost, low power, self-organization and other characteristics. But the limitation in sensors’resource makes the study of wireless sensor network facing the big challenges. One of themain research directions of wireless sensor network is how to reduce consumption of sensors’energy and prolong the network lifetime. Topology control is not only the foundation of othertechnologies, such as routing and location, but also one of the important technologies toreduce sensors’ energy and prolong the network lifetime. And it has become a hot researcharea.Topology control algorithms are divided into node power control and hierarchicalclustering two mainstream research directions. How to reduce energy consumption is animportant aspect of designing algorithm. This paper deeply researches the typical topologycontrol algorithm and focuses on hierarchical clustering. The main works of this paper can besummarized as follows:Firstly, by researching the LEACH algorithm and EBAPC algorithm, considering theunbalanced energy consumption and the premature death of the nodes in wireless sensornetwork, this paper presents ELBC algorithm. By defining the concept of the energy-level andconsidering the location of the sink, the algorithm dynamically adjusts the proportion offactors to ensure the reasonable distribution of the clusters and balance the energyconsumption. By optimizing the preference parameter based on the nodes’ residual energy,the algorithm improves the high energy nodes’ competitiveness to delay the appearance of thefirst dead node. Experimental results show that the ELBC algorithm can put off theappearance of the dead nodes, balance the energy consumption and prolong the networklifetime.Secondly, by analyzing disadvantages of the single-hop algorithms, this paper presentsM-ELBC algorithm. The purpose of the M-ELBC algorithm is to save the whole energyconsumption of the network. Because the M-ELBC algorithm can choose the appropriate nexthop node and construct the multi-hop transporting manner, the algorithm could prolong thenetwork lifetime and reduce the energy consumption of the clusters, especially the clusterswhich are far away from the sink. Experimental results show that the M-ELBC is superior toELBC algorithm in aspects of network energy consumption, the situation of survival nodesand nodes’ average energy consumption.Finally, by analyzing the M-ELBC algorithm, BM-ELBC algorithm is presented to solvethe existing problems in M-ELBC algorithm. The algorithm could consume the least energyto transport the data by searching a best multi-hop way for each cluster head, so the algorithmcould save the energy and prolong the network lifetime. In M-ELBC algorithm, some clusterheads might die prematurely because the cluster heads transport too much data. TheBM-ELBC algorithm defines the concept of the energy cost by considering the node’sresidual energy and the energy consumption to transport data, so the algorithm could reducethe possibility of the lower energy heads becoming the next hop node. The result ofsimulation confirms that the algorithm is valid.