Lifetime maximized data gathering in wireless sensor networks using limited-order distributed source coding

This paper addresses the problem of efficient data gathering in wireless sensor networks with a complexity constrained data gathering node. Due to the complexity constraint, the data gathering node employs an asymmetric DSC that (de)compresses the data of a given node exploiting its dependency with a limited number of other nodes. This is characterized in a DSC rate allocation structure that is referred to as limited-order DSC. Within this structure, we investigate the problem of rate allocation for the nodes to maximize the network lifetime. To this end, an algorithm is proposed that is proven optimal with polynomial complexity in terms of number of network nodes. Numerical results demonstrate that the algorithm, even with limited complexity, allows for exploiting most of the achievable compression gain.

► We address the problem of efficient data gathering in wireless sensor networks.
► A complexity constrained data gathering node is assumed.
► A rate allocation structure for limited-order distributed source coding is proposed.
► The objective is rate allocation to the nodes to maximize the network lifetime.
► An optimal algorithm with polynomial complexity is proposed.