Research On Data Collection Optimization Algorithm Of Rechargeable Sensor Network Based On Mobile Sink

Energy renewable wireless sensor network technology is becoming the key technology in many application fields,such as environmental sensing,agricultural production,and area surveillance.Data collection is one of the most important issues in wireless sensor networks.The data collection scheme based on mobile sink has become a research hotspot due to its advantages.Data collection algorithm has a great impact on network performance.The data collection algorithm affects the network performance to a great extent.It is of great significance to improve and optimize the data collection algorithm to promote the development of wireless sensor network technology.Firstly,in this paper we study data collection with the sink move in fixed path mobility.In energy renewable wireless sensor network,the sink is programmed to follow a fixed path in a round-robin fashion,and collect the data sent by the nearby sensor nodes meanwhile.Sensors are deployed along the predefined path randomly.And they are powered by renewable energy sources.In order to maximize the data utility of mobile sink,we design a fixed path data collection algorithm.The duration per tour is slotted into equal time slots.Which node the mobile sink communicates to in each time slice is determined by time-Slot scheduling.Each time slot should be allocated to the node with the largest data utility as much as possible.Secondly,we study the path planning algorithm of mobile sink in this paper.In energy renewable sensor networks,the mobile sink travels along a close trajectory for data collection subject to a giving tolerant delay.The trajectory is composed of a number of sojourn locations,and the mobile sink collects the sensing data sent by the nearby one-hop node at the sojourn location.In order to maximize the total amount of data collected by the mobile sink at all sojourn locations,we designs a mobile sink path planning algorithm in this paper.The algorithm first calculates the expected revenue of all nodes through the network routing tree,selects the node with the largest gain as the sojourn location.After it,calculate the shortest path through all the sojourn locations to ensure that the mobile sink can return to the starting point within the specified delay constrain.Finally,we conduct simulation experiments to evaluate the performance of the proposed algorithms under two schemes.Experimental results demonstrate that the proposed algorithms under two schemes are efficient.