Upper bounds on network lifetime for clustered wireless sensor networks

Abstract

This paper focuses on the theoretical aspects of clustering in wireless sensor networks, as a mean to improve network lifetime. We investigate whether clustering itself (with no data aggregation) can improve network lifetime in particular application when compared to non-clustered networks. We use integer linear programming to analyse 1D and 2D networks, taking into account capabilities of real-life nodes. Our results show that clustering itself cannot improve network lifetime so additional techniques and means are required to be used in synergy with clustering.