A review on heuristic approaches for mobile sensors in sensor networks

The sensing field may contain obstacles of any shape and size. As the number of wireless sensor network applications continues to grow, the need for specialized task scheduling mechanisms, aware of the sensor devices capabilities and real time resource availability, is becoming more and more apparent. How to efficiently dispatch the mobile sensor to find an obstacle-avoiding shortest path is a big confront. WSN consists of two important categories of sensors. Static sensors monitor the environment and report where events appear in the sensing field. Whereas, mobile sensors are dispatched to these event locations to perform in-depth analysis. A proficient scheduling technique of the mobile sensors, which aims to prolong the lifetime of the hybrid WSN in presence of obstruction as long as possible must be implemented. Current approaches to energy conservation reduce the energy consumption of the wireless interface either for a given communication task or during idling while considering the complexity of the system, we only consider the one-to-one shortest path problem. That is why a single mobile sensor is sent out to a single event location. Path efficiency of sensors is our goal as well as energy optimization is our another goal therefore they must be scheduled to reduce and balance the moving distances. Therefore various heuristic approaches or schemes are considered for better optimal solutions.