Compact clustering based geometric tour planning for mobile data gathering mechanism in wireless sensor network

In this paper we propose a new clustering based data gathering mechanism for large scale wireless sensor networks. Our proposed mechanism first stores the locations of the sensors by GPS information and then sends a mobile data-collector (which can be an autonomous robot or a vehicle equipped with a transceiver and battery) which can move into the whole sensing field like a movable base station and collect data from the static sensors. Here at first our algorithm divides the region into a number of compact regions according to the range of the mobile collector and then determines a geometrical routing path along which the mobile collector can move and collect data from the sensors all in single hop data transmission technique and in minimal time. In wireless sensor networks, the data packets are directly gathered without relays and collisions. As a result, the lifetime of the sensors are prolonged. In our algorithm we have focused mainly on the facts like maximizing the network coverage, minimizing the overlapping of the regions, maximizing the number of nodes getting attended in one poll by the mobile collector and minimizing the path length so that the collector can cover the whole region in minimum time. The simulation results show a significant improved performance of proposed model.