Latency and Lifetime-Aware Clustering and Routing in Wireless Sensor Networks

We investigate the latency and network lifetime-aware clustering problem for data collection in a WSN (Wireless Sensor Network) with one base station and propose a novel approach. Our approach consists of a polynomial-time heuristic for constructing clusters, a polynomial-time heuristic and an ILP (Integer Linear Programming) algorithm for constructing a routing tree for inter-cluster communication. We have performed extensive simulations on the network instances of 200, 400, 600, 800 and 1000 sensor nodes with uniform and random distributions, and compared our approach with two state-of-the-art approaches, namely MR-LEACH and DSBCV. Our simulation results show that the average network lifetime improvements of our approach using the ILP algorithm for constructing a routing tree over MR-LEACH and DSBCV are 35% and 62%, respectively, and the performance of the heuristic for constructing a routing tree is comparable to that of the ILP algorithm.