Data Collection Scheme for Wireless Sensor Network with Mobile Collector

Abstract

In this paper, we investigate the problem of designing the minimum number of required mobile elements tours such that each sensor node is either on the tour or one hop away from the tour, and the length of the tour to be bounded by pre-determined value L. To address this problem, we propose heuristic-based solution.This solution works by directing the mobile element tour towards the highly dense area in the network.The experiment results show that our scheme outperform the benchmark scheme by 10% in most scenarios.