Efficient Data Gathering and Improving Network Lifetime in Wireless Sensor Networks

Abstract

In large-scale wireless sensor networks the data- gathering mechanism to introducing mobility into the network. . We consider the location service in a WSN, where each sensor needs to maintain its location information by 1) frequently updating its location information within its neighboring set of polling points in the network. In the previous work a mobile data collector, for convenience called an M-collector for gathering information from the sensor and send to sink node. M- collector could be a mobile robot or a vehicle equipped with a powerful transceiver and battery, working like a mobile base station and gathering data while moving through the field. An M-collector starts the data-gathering tour periodically from the static data sink, polls each sensor while traversing its transmission range, then directly collects data from the sensor in single-hop communications, and finally transports the data to the static sink. Since data packets are directly gathered without relays and collisions, the lifetime of sensors is expected to be prolonged. In this paper, we mainly focus on the problem of minimizing the length of each data-gathering tour and remove the redundancy for data gathering. We develop a stochastic sequential decision framework to analyze this problem. Under a Markovian mobility model, the location update decision problem is modeled as a Markov Decision Process (MDP). For the work with strict distance/ time and energy constraints, we consider utilizing single and multiple M-collectors and propose a data- gathering algorithm where multiple M-collectors traverse through several shorter subtours concurrently to satisfy the distance/time and energy constraints. To identify the redundancy of data from the sensor using Pearson auto correlated technique. Our proposed system for mobile data gathering scheme can improve the scalability and balance the energy consumption among sensors.