Heuristic Approaches for Scheduling of Mobile Sensors in a Decentralized Manner

Wireless sensor network consists of two types of nodes static nodes and mobile nodes. Static nodes are fixed whereas mobile nodes are movable in nature their position are not fixed. To efficiently schedule the routing process is difficult in case of random distribution of sensor network as at some time there is network failure, packet drop, sometime the nodes are in idle our sleep mode but still there is energy loss. These factors influence the delay, throughput and energy consumption by nodes. Current approaches are complex while considering the performance of the system, but we only consider the simplest but optimal solution. Routing efficiency of sensors as well as reducing energy consumption is our goal as well as energy optimization is our another goal therefore they must be scheduled to reduce and balance the moving distances as well as their speed and displacements must also be observed. Therefore apart from other heuristic approaches or schemes, our approach divided into two phases presented in decentralized version accomplishes the targeted goal