A mobile service algorithm based on separabitity in wireless sensor networks

In this paper, we propose a novel mobile service algorithm based on separability in dynamic wireless sensor networks, for achieving the collection of the sensed information in an energy-efficient way and with real-time guarantees. Our algorithm is intrinsically parallel. The main idea is to dissect a service procedure into subproblems, solve the subproblems and then patch the subtours together to form a global tour. Simulation results show that our algorithm is more effective and suitable for dynamic wireless sensor networks. It can reduce the time and energy cost needed for data collection efficiently, although the loss ratio of sensor data increased slightly.