GRID BLOCK ENERGY BASED DATA GATHERING ALGORITHM FOR LOWER ENERGY*DELAY AND LONGER LIFETIME IN WIRELESS SENSOR NETWORKS

摘要

We propose a Grid Block Energy based Data Gathering (GBE-DG) algorithm for wireless sensor networks. We divide the whole sensor network into grid blocks of equal size, with the sensor nodes uniform randomly distributed in the network field. For every round of data communication, the algorithm works as follows: The energy level of a grid block is the sum of the energy levels of the sensor nodes located in it. The leader grid block (LGB) is the grid block with the maximum energy level and the global cluster leader (GCL) is the sensor node with the maximum energy level in the LGB. The local cluster leader (LCL) of a grid block is the sensor node with the highest energy level within the grid block. The GBE-DG tree is rooted at the GCL node. The leaf nodes of the GBE-DG tree are the non-LCL nodes in each grid block and they forward data to the LCL node within their grid block. An LCL node i forwards data to the closest LCL node j (could be the GCL node) that is also relatively closer to the GCL node. Simulation comparison studies with the well-known PEGASIS and LEACH algorithms illustrate that GBE-DG yields a longer lifetime, lower delay and lower energy*delay per round for both TDMA and CDMA systems.