Energy-Efficiency Routing algorithms in Wireless Sensor Networks: a Survey <s> 5) Sink mobility <s> Recent works on WSNs show that use of mobile sink can prolong network lifetime. This paper demonstrates the advantages of the mobile sink in WSNs for increasing their lifetime than static sink. A novel sink mobility with coverage algorithm has been proposed here. During the movement of the sinks in the network, they sojourn at different points in the network and collect data over there. The direction of the movement of the sinks is determined by the algorithm and sinks are mobile inside the network. This algorithm can also be used for multiple sinks partitioned network. Simulations has been carried out for both mobile and static sinks to determine the average energy consumption of the network. At the same time, it also determines the network lifetime in terms of number of rounds neighbor nodes of sink is alive and first node die of the network. Our experiments show that mobile sinks outperform static sink in all scenarios. Furthermore, the proposed algorithm results in a good balancing of energy depletion among the sensor nodes. <s> BIB001 </s> Energy-Efficiency Routing algorithms in Wireless Sensor Networks: a Survey <s> 5) Sink mobility <s> Wireless sensor networks (WSNs) are characterized by many to one traffic pattern, where a large number of nodes communicate their sensed data to the sink node. Due to heavy data traffic near the sink node, the nodes closer to sink node tends to exhaust their energy faster compared to those nodes which are situated away from the sink. This may lead to the fragment of a network due to the early demise of sensor nodes situated closer to the sink. To pacify this problem, mobile sinks are proposed for WSNs. Mobile sinks are capable to provide uniform energy consumption, load distribution, low reporting delay and quick data delivery paths. However, the position of the mobile sink needs to be updated regularly as such position update messages may reduce the network lifetime. In this paper, we propose a novel Location Aware Routing for Controlled Mobile Sinks (LARCMS), which will help in minimizing reporting delay, enhancing network lifetime, handling sink position updates and providing uniform energy consumption. The proposed technique uses two mobile sinks in predefined trajectory for data collection and provides better results compared to existing techniques. The performance of LARCMS is evaluated by comparing with similar mobile sink routing protocols through extensive simulations in MATLAB. <s> BIB002
A new sink mobility algorithm has been provided in BIB001 article which includes network coverage for routing data packets to mobile sinks in a partition of various sink wireless sensor networks. The authors showed that network lifetime could be improved through the deployment of a sink moving in line with the designs specified in the algorithm. Due to the shortening of source range, energy consumption while communicating with information is decreased. Location-Aware Routing for Controlled Mobile Sinks (LARCMS) BIB002 is proposed by authors to assist minimising reporting delay, improve network life, handle sink position updates and provide a consistent power consumption. The technology suggested utilises two portable sinks for the collection of information for a predefined trajectory and offers better outcomes than current technology. e. Load Balancing: Performing clusters equal in size is important for improved network life as precocious energy consumption of cluster heads is avoided and we should balance the load between CHs in order to achieve the required performance, where they are selected from available sensors  [20]  . When clusters have the same number of nodes, data from individual CHs are ready for further work in the base d. Latency Reduction: The WSNs are divided into clusters, each cluster has own cluster head, and only the CHs transmit the information to the sink, Since the information transfer method is removed from the cluster, therefore the collision and latency are reduced. In addition, hop-by-hop information transmission is often performed using flooding as a flat routing system, while the clustering routing system is used by only CHs, that can decrease hops to the base station from the information source; therefore, latency is reduced  .