Disjoint trajectory in wireless sensor networks with two mobile sinks

This paper proposes data collection schemes with two mobile sinks for wireless sensor networks. The proposed schemes use eigenvectors of an adjacency matrix of the networks. Eigenvectors of adjacency matrix mean the strength of the connection between sensors so that data collection takes into account the wireless links can be achieved by eigenvectors. In this paper, the disjoint rate among routes for two mobile sinks, the number of hops from sensors to the gateway on the route and the total travel time of mobile sinks are evaluated. The total travel time of the proposed scheme is shorter than that of conventional scheme, and it is found that the proposed scheme can achieve effective data collection.