Clustering-based Routing Algorithm in Wireless Sensor Networks with Mobile Sink
Most of the existing data gathering strategies are based on the structure of stationary Sink in Wireless Sensor Networks, which will lead to rapidly energy consumption of sensor nodes near the sink for the reason that these nodes burden the data transmission from the whole network. This paper proposes a clustering-based routing algorithm in wireless sensor networks with mobile sink (CRA) to solve this kind of problem. In the CRA, sink node moves in a circle around the regional center and the circular area near this trajectory is set as buffer area, in which nodes are connected as backbone datalink. Data is transmitted to the annular buffer area and then reach the sink through the backbone datalink. This paper figures out the optimal location and size of the buffer area in order to minimize the average load of the nodes in the area. Furthermore, this paper proposes CRA-1, which improves the original algorithm by density controlling, for the purpose of balancing the energy consumption of the whole network