An Optimization-based mTSP Clustering Algorithm for Wireless Sensor Networks

In this paper, we investigates the problem of computing the optimal trajectories of multiple mobile elements (e.g. robots, vehicles, aircrafts, etc.) to minimize energy consumption in the Wireless Sensor Networks (WSNs). We present a clustering algorithm, EmCA (An Effective mTSP based Clustering Algorithm), based on the multiple Traveling Salesman Problem (mTSP). It is designed to solve mTSP as the first step, which can transform mTSP to multiple standard TSP. Numerical simulation indicates that the algorithm can obtain a serial of uniform cluster. For each cluster, the density of sensor nodes has been minimized, and then the total travel distance has been further minimized.